diff --git a/c-support/templates/cpp.idioms.template b/c-support/templates/cpp.idioms.template index fa09ba8..0f5149a 100644 --- a/c-support/templates/cpp.idioms.template +++ b/c-support/templates/cpp.idioms.template @@ -1,24 +1,23 @@ $%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% == idioms.function == -void -|?FUNCTION_NAME| ( <+argument list+> ) -{ +void |?FUNCTION_NAME| ( <+argument list+> ) { + return <+return value+>; + } // ----- end of function |FUNCTION_NAME| ----- $%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% == idioms.function-static == -static void -|?FUNCTION_NAME| ( <+argument list+> ) -{ +static void |?FUNCTION_NAME| ( <+argument list+> ){ + return <+return value+>; + } // ----- end of static function |FUNCTION_NAME| ----- $%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% == idioms.main == #include -int -main ( int argc, char *argv[] ) -{ +int main ( int argc, char *argv[] ) { + return EXIT_SUCCESS; } // ---------- end of function main ---------- $%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% @@ -27,8 +26,9 @@ enum |?ENUM_NAME| { }; // ---------- end of enum |ENUM_NAME| ---------- $%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% == idioms.struct == -struct |?STRUCT_NAME| { -}; // ---------- end of struct |STRUCT_NAME| ---------- +typedef struct _|?STRUCT_NAME| { + +} |STRUCT_NAME|; // ---------- end of struct |STRUCT_NAME| ---------- $%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% == idioms.union == union |?UNION_NAME| { diff --git a/cpp b/cpp new file mode 100644 index 0000000..391ec95 --- /dev/null +++ b/cpp @@ -0,0 +1,11802 @@ +!_TAG_FILE_FORMAT 2 /extended format; --format=1 will not append ;" to lines/ +!_TAG_FILE_SORTED 1 /0=unsorted, 1=sorted, 2=foldcase/ +!_TAG_PROGRAM_AUTHOR Darren Hiebert /dhiebert@users.sourceforge.net/ +!_TAG_PROGRAM_NAME Exuberant Ctags // +!_TAG_PROGRAM_URL http://ctags.sourceforge.net /official site/ +!_TAG_PROGRAM_VERSION 5.8 // +EXIT_FAILURE cpp_src/cstdlib 60;" d file: +EXIT_SUCCESS cpp_src/cstdlib 59;" d file: +Init cpp_src/ios_base.h /^ Init();$/;" p class:std::ios_base::Init access:public signature:() +Init cpp_src/ios_base.h /^ class Init$/;" c class:std::ios_base access:public +_ALGOBASE_H cpp_src/stl_algobase.h 63;" d +_ALGO_H cpp_src/stl_algo.h 63;" d +_ALLOCATOR_H cpp_src/allocator.h 50;" d +_Alloc_hider cpp_src/basic_string.h /^ _Alloc_hider(_CharT* __dat, const _Alloc& __a)$/;" f struct:std::basic_string::_Alloc_hider access:public signature:(_CharT* __dat, const _Alloc& __a) +_Alloc_hider cpp_src/basic_string.h /^ struct _Alloc_hider : _Alloc$/;" s class:std::basic_string inherits:_Alloc access:private +_Alloc_value_type cpp_src/stl_deque.h /^ typedef typename _Alloc::value_type _Alloc_value_type;$/;" t class:std::deque access:private +_Alloc_value_type cpp_src/stl_list.h /^ typedef typename _Alloc::value_type _Alloc_value_type;$/;" t class:std::list access:private +_Alloc_value_type cpp_src/stl_map.h /^ typedef typename _Alloc::value_type _Alloc_value_type;$/;" t class:std::map access:private +_Alloc_value_type cpp_src/stl_multimap.h /^ typedef typename _Alloc::value_type _Alloc_value_type;$/;" t class:std::multimap access:private +_Alloc_value_type cpp_src/stl_multiset.h /^ typedef typename _Alloc::value_type _Alloc_value_type;$/;" t class:std::multiset access:private +_Alloc_value_type cpp_src/stl_set.h /^ typedef typename _Alloc::value_type _Alloc_value_type;$/;" t class:std::set access:private +_Alloc_value_type cpp_src/stl_vector.h /^ typedef typename _Alloc::value_type _Alloc_value_type;$/;" t class:std::vector access:private +_Arg cpp_src/valarray_before.h /^ typedef _Dom _Arg;$/;" t struct:std::_UnClos access:public +_Arg cpp_src/valarray_before.h /^ typedef valarray<_Tp> _Arg;$/;" t struct:std::_UnClos access:public +_Array cpp_src/valarray_array.h /^ _Array(const _Tp* __restrict__, size_t);$/;" p struct:std::_Array access:public signature:(const _Tp* __restrict__, size_t) +_Array cpp_src/valarray_array.h /^ explicit _Array(_Tp* const __restrict__);$/;" p struct:std::_Array access:public signature:(_Tp* const __restrict__) +_Array cpp_src/valarray_array.h /^ explicit _Array(const valarray<_Tp>&);$/;" p struct:std::_Array access:public signature:(const valarray<_Tp>&) +_Array cpp_src/valarray_array.h /^ explicit _Array(size_t);$/;" p struct:std::_Array access:public signature:(size_t) +_Array cpp_src/valarray_array.h /^ _Array<_Tp>::_Array(_Tp* const __restrict__ __p)$/;" f class:std::_Array signature:(_Tp* const __restrict__ __p) +_Array cpp_src/valarray_array.h /^ _Array<_Tp>::_Array(const _Tp* __restrict__ __b, size_t __s)$/;" f class:std::_Array signature:(const _Tp* __restrict__ __b, size_t __s) +_Array cpp_src/valarray_array.h /^ _Array<_Tp>::_Array(const valarray<_Tp>& __v)$/;" f class:std::_Array signature:(const valarray<_Tp>& __v) +_Array cpp_src/valarray_array.h /^ _Array<_Tp>::_Array(size_t __n)$/;" f class:std::_Array signature:(size_t __n) +_Array cpp_src/valarray_array.h /^ struct _Array$/;" s namespace:std +_Array_copier cpp_src/valarray_array.h /^ struct _Array_copier$/;" s namespace:std +_Array_copier cpp_src/valarray_array.h /^ struct _Array_copier<_Tp, true>$/;" s namespace:std +_Array_copy_ctor cpp_src/valarray_array.h /^ struct _Array_copy_ctor$/;" s namespace:std +_Array_copy_ctor cpp_src/valarray_array.h /^ struct _Array_copy_ctor<_Tp, true>$/;" s namespace:std +_Array_default_ctor cpp_src/valarray_array.h /^ struct _Array_default_ctor$/;" s namespace:std +_Array_default_ctor cpp_src/valarray_array.h /^ struct _Array_default_ctor<_Tp, true>$/;" s namespace:std +_Array_init_ctor cpp_src/valarray_array.h /^ struct _Array_init_ctor$/;" s namespace:std +_Array_init_ctor cpp_src/valarray_array.h /^ struct _Array_init_ctor<_Tp, true>$/;" s namespace:std +_AssignableConcept cpp_src/boost_concept_check.h /^ struct _AssignableConcept$/;" s +_AssignableConcept::__a cpp_src/boost_concept_check.h /^ _Tp __a;$/;" m struct:_AssignableConcept access:public +_AssignableConcept::__const_constraints cpp_src/boost_concept_check.h /^ void __const_constraints(const _Tp& __b) {$/;" f struct:_AssignableConcept access:public signature:(const _Tp& __b) +_AssignableConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_AssignableConcept access:public signature:() +_AssociativeContainerConcept cpp_src/boost_concept_check.h /^ struct _AssociativeContainerConcept$/;" s +_AssociativeContainerConcept::_Const_iterator cpp_src/boost_concept_check.h /^ typedef typename _AssociativeContainer::const_iterator _Const_iterator;$/;" t struct:_AssociativeContainerConcept access:public +_AssociativeContainerConcept::_Iterator cpp_src/boost_concept_check.h /^ typedef typename _AssociativeContainer::iterator _Iterator;$/;" t struct:_AssociativeContainerConcept access:public +_AssociativeContainerConcept::__c cpp_src/boost_concept_check.h /^ _AssociativeContainer __c;$/;" m struct:_AssociativeContainerConcept access:public +_AssociativeContainerConcept::__ci cpp_src/boost_concept_check.h /^ _Const_iterator __ci;$/;" m struct:_AssociativeContainerConcept access:public +_AssociativeContainerConcept::__const_constraints cpp_src/boost_concept_check.h /^ void __const_constraints(const _AssociativeContainer& __c) {$/;" f struct:_AssociativeContainerConcept access:public signature:(const _AssociativeContainer& __c) +_AssociativeContainerConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_AssociativeContainerConcept access:public signature:() +_AssociativeContainerConcept::__cr cpp_src/boost_concept_check.h /^ std::pair<_Const_iterator,_Const_iterator> __cr;$/;" m struct:_AssociativeContainerConcept access:public +_AssociativeContainerConcept::__i cpp_src/boost_concept_check.h /^ _Iterator __i;$/;" m struct:_AssociativeContainerConcept access:public +_AssociativeContainerConcept::__k cpp_src/boost_concept_check.h /^ typename _AssociativeContainer::key_type __k;$/;" m struct:_AssociativeContainerConcept access:public +_AssociativeContainerConcept::__n cpp_src/boost_concept_check.h /^ typename _AssociativeContainer::size_type __n;$/;" m struct:_AssociativeContainerConcept access:public +_AssociativeContainerConcept::__r cpp_src/boost_concept_check.h /^ std::pair<_Iterator,_Iterator> __r;$/;" m struct:_AssociativeContainerConcept access:public +_Aux_require_same cpp_src/boost_concept_check.h /^struct _Aux_require_same { };$/;" s +_Aux_require_same cpp_src/boost_concept_check.h /^struct _Aux_require_same<_Tp,_Tp> { typedef _Tp _Type; };$/;" s +_Aux_require_same::_Type cpp_src/boost_concept_check.h /^struct _Aux_require_same<_Tp,_Tp> { typedef _Tp _Type; };$/;" t struct:_Aux_require_same access:public +_BASIC_IOS_H cpp_src/basic_ios.h 37;" d +_BASIC_IOS_TCC cpp_src/basic_ios.tcc 37;" d file: +_BASIC_STRING_H cpp_src/basic_string.h 42;" d +_BASIC_STRING_TCC cpp_src/basic_string.tcc 45;" d file: +_BOOST_CONCEPT_CHECK_H cpp_src/boost_concept_check.h 45;" d +_BVECTOR_H cpp_src/stl_bvector.h 63;" d +_BackInsertionSequenceConcept cpp_src/boost_concept_check.h /^ struct _BackInsertionSequenceConcept$/;" s +_BackInsertionSequenceConcept::_Const_reference cpp_src/boost_concept_check.h /^ typedef typename _BackInsertionSequence::const_reference _Const_reference;$/;" t struct:_BackInsertionSequenceConcept access:public +_BackInsertionSequenceConcept::_Reference cpp_src/boost_concept_check.h /^ typedef typename _BackInsertionSequence::reference _Reference;$/;" t struct:_BackInsertionSequenceConcept access:public +_BackInsertionSequenceConcept::__c cpp_src/boost_concept_check.h /^ _BackInsertionSequence __c;$/;" m struct:_BackInsertionSequenceConcept access:public +_BackInsertionSequenceConcept::__const_constraints cpp_src/boost_concept_check.h /^ void __const_constraints(const _BackInsertionSequence& __c) {$/;" f struct:_BackInsertionSequenceConcept access:public signature:(const _BackInsertionSequence& __c) +_BackInsertionSequenceConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_BackInsertionSequenceConcept access:public signature:() +_BackInsertionSequenceConcept::__t cpp_src/boost_concept_check.h /^ typename _BackInsertionSequence::value_type __t;$/;" m struct:_BackInsertionSequenceConcept access:public +_Base cpp_src/bitset /^ typedef _Base_bitset<_GLIBCXX_BITSET_WORDS(_Nb)> _Base;$/;" t class:std::bitset file: access:private +_Base cpp_src/stl_bvector.h /^ typedef _Bvector_base<_Alloc> _Base;$/;" t class:std::vector access:private +_Base cpp_src/stl_deque.h /^ typedef _Deque_base<_Tp, _Alloc> _Base;$/;" t class:std::deque access:private +_Base cpp_src/stl_list.h /^ typedef _List_base<_Tp, _Alloc> _Base;$/;" t class:std::list access:private +_Base cpp_src/stl_vector.h /^ typedef _Vector_base<_Tp, _Alloc> _Base;$/;" t class:std::vector access:private +_Base cpp_src/valarray_after.h /^ typedef _GBase<_Array<_Tp> > _Base;$/;" t struct:std::_GClos access:public +_Base cpp_src/valarray_after.h /^ typedef _GBase<_Dom> _Base;$/;" t struct:std::_GClos access:public +_Base cpp_src/valarray_after.h /^ typedef _IBase<_Dom> _Base;$/;" t struct:std::_IClos access:public +_Base cpp_src/valarray_after.h /^ typedef _IBase > _Base;$/;" t struct:std::_IClos access:public +_Base cpp_src/valarray_before.h /^ typedef _SBase<_Array<_Tp> > _Base;$/;" t struct:std::_SClos access:public +_Base cpp_src/valarray_before.h /^ typedef _BinBase1<_Oper, _Dom> _Base;$/;" t struct:std::_BinClos access:public +_Base cpp_src/valarray_before.h /^ typedef _BinBase1<_Oper, valarray<_Tp> > _Base;$/;" t struct:std::_BinClos access:public +_Base cpp_src/valarray_before.h /^ typedef _BinBase2<_Oper,_Dom> _Base;$/;" t struct:std::_BinClos access:public +_Base cpp_src/valarray_before.h /^ typedef _BinBase2<_Oper,valarray<_Tp> > _Base;$/;" t struct:std::_BinClos access:public +_Base cpp_src/valarray_before.h /^ typedef _BinBase<_Oper, _Dom1, _Dom2> _Base;$/;" t struct:std::_BinClos access:public +_Base cpp_src/valarray_before.h /^ typedef _BinBase<_Oper, valarray<_Tp>, _Dom> _Base;$/;" t struct:std::_BinClos access:public +_Base cpp_src/valarray_before.h /^ typedef _BinBase<_Oper, valarray<_Tp>, valarray<_Tp> > _Base;$/;" t struct:std::_BinClos access:public +_Base cpp_src/valarray_before.h /^ typedef _BinBase<_Oper,_Dom,valarray<_Tp> > _Base;$/;" t struct:std::_BinClos access:public +_Base cpp_src/valarray_before.h /^ typedef _FunBase<_Dom, const typename _Dom::value_type&> _Base;$/;" t struct:std::_RefFunClos access:public +_Base cpp_src/valarray_before.h /^ typedef _FunBase<_Dom, typename _Dom::value_type> _Base;$/;" t struct:std::_ValFunClos access:public +_Base cpp_src/valarray_before.h /^ typedef _FunBase, _Tp> _Base;$/;" t struct:std::_ValFunClos access:public +_Base cpp_src/valarray_before.h /^ typedef _FunBase, const _Tp&> _Base;$/;" t struct:std::_RefFunClos access:public +_Base cpp_src/valarray_before.h /^ typedef _SBase<_Dom> _Base;$/;" t struct:std::_SClos access:public +_Base cpp_src/valarray_before.h /^ typedef _UnBase<_Oper, _Dom> _Base;$/;" t struct:std::_UnClos access:public +_Base cpp_src/valarray_before.h /^ typedef _UnBase<_Oper, valarray<_Tp> > _Base;$/;" t struct:std::_UnClos access:public +_Base_bitset cpp_src/bitset /^ _Base_bitset()$/;" f struct:std::_Base_bitset access:public signature:() +_Base_bitset cpp_src/bitset /^ _Base_bitset(unsigned long __val)$/;" f struct:std::_Base_bitset access:public signature:(unsigned long __val) +_Base_bitset cpp_src/bitset /^ _Base_bitset(unsigned long)$/;" f struct:std::_Base_bitset access:public signature:(unsigned long) +_Base_bitset cpp_src/bitset /^ _Base_bitset(void)$/;" f struct:std::_Base_bitset access:public signature:(void) +_Base_bitset cpp_src/bitset /^ struct _Base_bitset$/;" s namespace:std file: +_Base_bitset cpp_src/bitset /^ struct _Base_bitset<0>$/;" s namespace:std file: +_Base_bitset cpp_src/bitset /^ struct _Base_bitset<1>$/;" s namespace:std file: +_Base_ptr cpp_src/stl_tree.h /^ typedef _Rb_tree_node_base* _Base_ptr;$/;" t class:std::_Rb_tree access:protected +_Base_ptr cpp_src/stl_tree.h /^ typedef _Rb_tree_node_base::_Base_ptr _Base_ptr;$/;" t struct:std::_Rb_tree_iterator access:public +_Base_ptr cpp_src/stl_tree.h /^ typedef _Rb_tree_node_base::_Const_Base_ptr _Base_ptr;$/;" t struct:std::_Rb_tree_const_iterator access:public +_Base_ptr cpp_src/stl_tree.h /^ typedef _Rb_tree_node_base* _Base_ptr;$/;" t struct:std::_Rb_tree_node_base access:public +_BidirectionalIteratorConcept cpp_src/boost_concept_check.h /^ struct _BidirectionalIteratorConcept$/;" s +_BidirectionalIteratorConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_BidirectionalIteratorConcept access:public signature:() +_BidirectionalIteratorConcept::__i cpp_src/boost_concept_check.h /^ _Tp __i;$/;" m struct:_BidirectionalIteratorConcept access:public +_BinBase cpp_src/valarray_before.h /^ _BinBase(const _FirstArg& __e1, const _SecondArg& __e2)$/;" f class:std::_BinBase access:public signature:(const _FirstArg& __e1, const _SecondArg& __e2) +_BinBase cpp_src/valarray_before.h /^ class _BinBase$/;" c namespace:std +_BinBase1 cpp_src/valarray_before.h /^ _BinBase1(const _Vt& __t, const _Clos& __e)$/;" f class:std::_BinBase1 access:public signature:(const _Vt& __t, const _Clos& __e) +_BinBase1 cpp_src/valarray_before.h /^ class _BinBase1$/;" c namespace:std +_BinBase2 cpp_src/valarray_before.h /^ _BinBase2(const _Clos& __e, const _Vt& __t)$/;" f class:std::_BinBase2 access:public signature:(const _Clos& __e, const _Vt& __t) +_BinBase2 cpp_src/valarray_before.h /^ class _BinBase2$/;" c namespace:std +_BinClos cpp_src/valarray_before.h /^ _BinClos(const _Dom& __e1, const _Tp& __e2) : _Base(__e1, __e2) {}$/;" f struct:std::_BinClos access:public signature:(const _Dom& __e1, const _Tp& __e2) +_BinClos cpp_src/valarray_before.h /^ _BinClos(const _Dom& __e1, const valarray<_Tp>& __e2)$/;" f struct:std::_BinClos access:public signature:(const _Dom& __e1, const valarray<_Tp>& __e2) +_BinClos cpp_src/valarray_before.h /^ _BinClos(const _Dom1& __e1, const _Dom2& __e2) : _Base(__e1, __e2) {}$/;" f struct:std::_BinClos access:public signature:(const _Dom1& __e1, const _Dom2& __e2) +_BinClos cpp_src/valarray_before.h /^ _BinClos(const _Tp& __e1, const _Dom& __e2) : _Base(__e1, __e2) {}$/;" f struct:std::_BinClos access:public signature:(const _Tp& __e1, const _Dom& __e2) +_BinClos cpp_src/valarray_before.h /^ _BinClos(const _Tp& __t, const valarray<_Tp>& __v) : _Base(__t, __v) {}$/;" f struct:std::_BinClos access:public signature:(const _Tp& __t, const valarray<_Tp>& __v) +_BinClos cpp_src/valarray_before.h /^ _BinClos(const valarray<_Tp>& __e1, const _Dom& __e2)$/;" f struct:std::_BinClos access:public signature:(const valarray<_Tp>& __e1, const _Dom& __e2) +_BinClos cpp_src/valarray_before.h /^ _BinClos(const valarray<_Tp>& __v, const _Tp& __t) : _Base(__v, __t) {}$/;" f struct:std::_BinClos access:public signature:(const valarray<_Tp>& __v, const _Tp& __t) +_BinClos cpp_src/valarray_before.h /^ _BinClos(const valarray<_Tp>& __v, const valarray<_Tp>& __w)$/;" f struct:std::_BinClos access:public signature:(const valarray<_Tp>& __v, const valarray<_Tp>& __w) +_BinClos cpp_src/valarray_before.h /^ struct _BinClos<_Oper, _Constant, _Expr, typename _Dom::value_type, _Dom>$/;" s namespace:std inherits:_BinBase1 +_BinClos cpp_src/valarray_before.h /^ struct _BinClos<_Oper, _Constant, _ValArray, _Tp, _Tp>$/;" s namespace:std inherits:_BinBase1 +_BinClos cpp_src/valarray_before.h /^ struct _BinClos<_Oper, _Expr, _Constant, _Dom, typename _Dom::value_type>$/;" s namespace:std inherits:_BinBase2 +_BinClos cpp_src/valarray_before.h /^ struct _BinClos<_Oper, _Expr, _Expr, _Dom1, _Dom2>$/;" s namespace:std inherits:_BinBase +_BinClos cpp_src/valarray_before.h /^ struct _BinClos<_Oper, _Expr, _ValArray, _Dom, typename _Dom::value_type>$/;" s namespace:std inherits:_BinBase +_BinClos cpp_src/valarray_before.h /^ struct _BinClos<_Oper, _ValArray, _Constant, _Tp, _Tp>$/;" s namespace:std inherits:_BinBase2 +_BinClos cpp_src/valarray_before.h /^ struct _BinClos<_Oper, _ValArray, _Expr, typename _Dom::value_type, _Dom>$/;" s namespace:std inherits:_BinBase +_BinClos cpp_src/valarray_before.h /^ struct _BinClos<_Oper,_ValArray, _ValArray, _Tp, _Tp>$/;" s namespace:std inherits:_BinBase +_BinaryFunctionConcept cpp_src/boost_concept_check.h /^ struct _BinaryFunctionConcept$/;" s +_BinaryFunctionConcept cpp_src/boost_concept_check.h /^ struct _BinaryFunctionConcept<_Func, void, _First, _Second>$/;" s +_BinaryFunctionConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_BinaryFunctionConcept access:public signature:() +_BinaryFunctionConcept::__f cpp_src/boost_concept_check.h /^ _Func __f;$/;" m struct:_BinaryFunctionConcept access:public +_BinaryFunctionConcept::__first cpp_src/boost_concept_check.h /^ _First __first;$/;" m struct:_BinaryFunctionConcept access:public +_BinaryFunctionConcept::__r cpp_src/boost_concept_check.h /^ _Return __r;$/;" m struct:_BinaryFunctionConcept access:public +_BinaryFunctionConcept::__second cpp_src/boost_concept_check.h /^ _Second __second;$/;" m struct:_BinaryFunctionConcept access:public +_BinaryPredicateConcept cpp_src/boost_concept_check.h /^ struct _BinaryPredicateConcept$/;" s +_BinaryPredicateConcept::__a cpp_src/boost_concept_check.h /^ _First __a;$/;" m struct:_BinaryPredicateConcept access:public +_BinaryPredicateConcept::__b cpp_src/boost_concept_check.h /^ _Second __b;$/;" m struct:_BinaryPredicateConcept access:public +_BinaryPredicateConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_BinaryPredicateConcept access:public signature:() +_BinaryPredicateConcept::__f cpp_src/boost_concept_check.h /^ _Func __f;$/;" m struct:_BinaryPredicateConcept access:public +_Bit_alloc_type cpp_src/stl_bvector.h /^ _Bit_alloc_type;$/;" t struct:std::_Bvector_base access:public +_Bit_const_iterator cpp_src/stl_bvector.h /^ _Bit_const_iterator() : _Bit_iterator_base(0, 0) { }$/;" f struct:std::_Bit_const_iterator access:public signature:() +_Bit_const_iterator cpp_src/stl_bvector.h /^ _Bit_const_iterator(_Bit_type * __x, unsigned int __y)$/;" f struct:std::_Bit_const_iterator access:public signature:(_Bit_type * __x, unsigned int __y) +_Bit_const_iterator cpp_src/stl_bvector.h /^ _Bit_const_iterator(const _Bit_iterator& __x)$/;" f struct:std::_Bit_const_iterator access:public signature:(const _Bit_iterator& __x) +_Bit_const_iterator cpp_src/stl_bvector.h /^ struct _Bit_const_iterator : public _Bit_iterator_base$/;" s namespace:std inherits:_Bit_iterator_base +_Bit_iterator cpp_src/stl_bvector.h /^ _Bit_iterator() : _Bit_iterator_base(0, 0) { }$/;" f struct:std::_Bit_iterator access:public signature:() +_Bit_iterator cpp_src/stl_bvector.h /^ _Bit_iterator(_Bit_type * __x, unsigned int __y)$/;" f struct:std::_Bit_iterator access:public signature:(_Bit_type * __x, unsigned int __y) +_Bit_iterator cpp_src/stl_bvector.h /^ struct _Bit_iterator : public _Bit_iterator_base$/;" s namespace:std inherits:_Bit_iterator_base +_Bit_iterator_base cpp_src/stl_bvector.h /^ _Bit_iterator_base(_Bit_type * __x, unsigned int __y)$/;" f struct:std::_Bit_iterator_base access:public signature:(_Bit_type * __x, unsigned int __y) +_Bit_iterator_base cpp_src/stl_bvector.h /^ struct _Bit_iterator_base$/;" s namespace:std inherits:std::iterator +_Bit_reference cpp_src/stl_bvector.h /^ _Bit_reference() : _M_p(0), _M_mask(0) { }$/;" f struct:std::_Bit_reference access:public signature:() +_Bit_reference cpp_src/stl_bvector.h /^ _Bit_reference(_Bit_type * __x, _Bit_type __y)$/;" f struct:std::_Bit_reference access:public signature:(_Bit_type * __x, _Bit_type __y) +_Bit_reference cpp_src/stl_bvector.h /^ struct _Bit_reference$/;" s namespace:std +_Bit_type cpp_src/stl_bvector.h /^ typedef unsigned long _Bit_type;$/;" t namespace:std +_Bvector_base cpp_src/stl_bvector.h /^ _Bvector_base(const allocator_type& __a) : _M_impl(__a) { }$/;" f struct:std::_Bvector_base access:public signature:(const allocator_type& __a) +_Bvector_base cpp_src/stl_bvector.h /^ struct _Bvector_base$/;" s namespace:std +_Bvector_impl cpp_src/stl_bvector.h /^ _Bvector_impl(const _Bit_alloc_type& __a)$/;" f struct:std::_Bvector_base::_Bvector_impl access:public signature:(const _Bit_alloc_type& __a) +_Bvector_impl cpp_src/stl_bvector.h /^ struct _Bvector_impl$/;" s struct:std::_Bvector_base inherits:_Bit_alloc_type access:public +_CHAR_TRAITS_H cpp_src/char_traits.h 41;" d +_CODECVT_H cpp_src/codecvt.h 43;" d +_CONCEPT_CHECK_H cpp_src/concept_check.h 36;" d +_CPP_TYPE_TRAITS_H cpp_src/cpp_type_traits.h 39;" d +_Callback_list cpp_src/ios_base.h /^ _Callback_list(ios_base::event_callback __fn, int __index,$/;" f struct:std::ios_base::_Callback_list access:public signature:(ios_base::event_callback __fn, int __index, _Callback_list* __cb) +_Callback_list cpp_src/ios_base.h /^ struct _Callback_list$/;" s class:std::ios_base access:protected +_CharT_alloc_type cpp_src/basic_string.h /^ typedef typename _Alloc::template rebind<_CharT>::other _CharT_alloc_type;$/;" t class:std::basic_string access:private +_Char_types cpp_src/char_traits.h /^ struct _Char_types$/;" s +_Char_types::int_type cpp_src/char_traits.h /^ typedef unsigned long int_type;$/;" t struct:_Char_types access:public +_Char_types::off_type cpp_src/char_traits.h /^ typedef std::streamoff off_type;$/;" t struct:_Char_types access:public +_Char_types::pos_type cpp_src/char_traits.h /^ typedef std::streampos pos_type;$/;" t struct:_Char_types access:public +_Char_types::state_type cpp_src/char_traits.h /^ typedef std::mbstate_t state_type;$/;" t struct:_Char_types access:public +_ComparableConcept cpp_src/boost_concept_check.h /^ struct _ComparableConcept$/;" s +_ComparableConcept::__a cpp_src/boost_concept_check.h /^ _Tp __a, __b;$/;" m struct:_ComparableConcept access:public +_ComparableConcept::__b cpp_src/boost_concept_check.h /^ _Tp __a, __b;$/;" m struct:_ComparableConcept access:public +_ComparableConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_ComparableConcept access:public signature:() +_ComplexT cpp_src/complex /^ typedef __complex__ double _ComplexT;$/;" t struct:std::complex file: access:public +_ComplexT cpp_src/complex /^ typedef __complex__ float _ComplexT;$/;" t struct:std::complex file: access:public +_ComplexT cpp_src/complex /^ typedef __complex__ long double _ComplexT;$/;" t struct:std::complex file: access:public +_Const_Base_ptr cpp_src/stl_tree.h /^ typedef const _Rb_tree_node_base* _Const_Base_ptr;$/;" t class:std::_Rb_tree access:protected +_Const_Base_ptr cpp_src/stl_tree.h /^ typedef const _Rb_tree_node_base* _Const_Base_ptr;$/;" t struct:std::_Rb_tree_node_base access:public +_Const_BinaryPredicateConcept cpp_src/boost_concept_check.h /^ struct _Const_BinaryPredicateConcept {$/;" s +_Const_BinaryPredicateConcept::__a cpp_src/boost_concept_check.h /^ _First __a;$/;" m struct:_Const_BinaryPredicateConcept access:public +_Const_BinaryPredicateConcept::__b cpp_src/boost_concept_check.h /^ _Second __b;$/;" m struct:_Const_BinaryPredicateConcept access:public +_Const_BinaryPredicateConcept::__const_constraints cpp_src/boost_concept_check.h /^ void __const_constraints(const _Func& __fun) {$/;" f struct:_Const_BinaryPredicateConcept access:public signature:(const _Func& __fun) +_Const_BinaryPredicateConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_Const_BinaryPredicateConcept access:public signature:() +_Const_BinaryPredicateConcept::__f cpp_src/boost_concept_check.h /^ _Func __f;$/;" m struct:_Const_BinaryPredicateConcept access:public +_Const_Link_type cpp_src/stl_tree.h /^ typedef const _Rb_tree_node* _Const_Link_type;$/;" t class:std::_Rb_tree access:public +_Const_iterator cpp_src/boost_concept_check.h /^ _Const_iterator;$/;" t struct:_SortedAssociativeContainerConcept access:public +_Const_iterator cpp_src/boost_concept_check.h /^ typedef typename _AssociativeContainer::const_iterator _Const_iterator;$/;" t struct:_AssociativeContainerConcept access:public +_Const_iterator cpp_src/boost_concept_check.h /^ typedef typename _Container::const_iterator _Const_iterator;$/;" t struct:_ContainerConcept access:public +_Const_iterator cpp_src/boost_concept_check.h /^ typedef typename _RandomAccessContainer::const_iterator _Const_iterator;$/;" t struct:_RandomAccessContainerConcept access:public +_Const_iterator cpp_src/boost_concept_check.h /^ typedef typename _ReversibleContainer::const_iterator _Const_iterator;$/;" t struct:_ReversibleContainerConcept access:public +_Const_pointer cpp_src/boost_concept_check.h /^ typedef typename _Container::const_pointer _Const_pointer;$/;" t struct:_ContainerConcept access:public +_Const_reference cpp_src/boost_concept_check.h /^ typedef typename _BackInsertionSequence::const_reference _Const_reference;$/;" t struct:_BackInsertionSequenceConcept access:public +_Const_reference cpp_src/boost_concept_check.h /^ typedef typename _Container::const_reference _Const_reference;$/;" t struct:_ContainerConcept access:public +_Const_reference cpp_src/boost_concept_check.h /^ typedef typename _RandomAccessContainer::const_reference _Const_reference;$/;" t struct:_RandomAccessContainerConcept access:public +_Const_reference cpp_src/boost_concept_check.h /^ typedef typename _Sequence::const_reference _Const_reference;$/;" t struct:_SequenceConcept access:public +_Const_reverse_iterator cpp_src/boost_concept_check.h /^ _Const_reverse_iterator;$/;" t struct:_RandomAccessContainerConcept access:public +_Const_reverse_iterator cpp_src/boost_concept_check.h /^ _Const_reverse_iterator;$/;" t struct:_ReversibleContainerConcept access:public +_Construct cpp_src/stl_construct.h /^ _Construct(_T1* __p)$/;" f namespace:std signature:(_T1* __p) +_Construct cpp_src/stl_construct.h /^ _Construct(_T1* __p, const _T2& __value)$/;" f namespace:std signature:(_T1* __p, const _T2& __value) +_ContainerConcept cpp_src/boost_concept_check.h /^ struct _ContainerConcept$/;" s +_ContainerConcept::_Const_iterator cpp_src/boost_concept_check.h /^ typedef typename _Container::const_iterator _Const_iterator;$/;" t struct:_ContainerConcept access:public +_ContainerConcept::_Const_pointer cpp_src/boost_concept_check.h /^ typedef typename _Container::const_pointer _Const_pointer;$/;" t struct:_ContainerConcept access:public +_ContainerConcept::_Const_reference cpp_src/boost_concept_check.h /^ typedef typename _Container::const_reference _Const_reference;$/;" t struct:_ContainerConcept access:public +_ContainerConcept::_Difference_type cpp_src/boost_concept_check.h /^ typedef typename _Container::difference_type _Difference_type;$/;" t struct:_ContainerConcept access:public +_ContainerConcept::_Size_type cpp_src/boost_concept_check.h /^ typedef typename _Container::size_type _Size_type;$/;" t struct:_ContainerConcept access:public +_ContainerConcept::_Value_type cpp_src/boost_concept_check.h /^ typedef typename _Container::value_type _Value_type;$/;" t struct:_ContainerConcept access:public +_ContainerConcept::__b cpp_src/boost_concept_check.h /^ bool __b;$/;" m struct:_ContainerConcept access:public +_ContainerConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_ContainerConcept access:public signature:() +_ContainerConcept::__i cpp_src/boost_concept_check.h /^ _Const_iterator __i;$/;" m struct:_ContainerConcept access:public +_ContainerConcept::__n cpp_src/boost_concept_check.h /^ _Size_type __n;$/;" m struct:_ContainerConcept access:public +_ConvertibleConcept cpp_src/boost_concept_check.h /^ struct _ConvertibleConcept$/;" s +_ConvertibleConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_ConvertibleConcept access:public signature:() +_ConvertibleConcept::__x cpp_src/boost_concept_check.h /^ _From __x;$/;" m struct:_ConvertibleConcept access:public +_CopyConstructibleConcept cpp_src/boost_concept_check.h /^ struct _CopyConstructibleConcept$/;" s +_CopyConstructibleConcept::__b cpp_src/boost_concept_check.h /^ _Tp __b;$/;" m struct:_CopyConstructibleConcept access:public +_CopyConstructibleConcept::__const_constraints cpp_src/boost_concept_check.h /^ void __const_constraints(const _Tp& __a) {$/;" f struct:_CopyConstructibleConcept access:public signature:(const _Tp& __a) +_CopyConstructibleConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_CopyConstructibleConcept access:public signature:() +_DEFINE_ARRAY_FUNCTION cpp_src/valarray_array.h 537;" d +_DEFINE_ARRAY_FUNCTION cpp_src/valarray_array.h 696;" d +_DEFINE_BINARY_OPERATOR cpp_src/valarray 1035;" d file: +_DEFINE_BINARY_OPERATOR cpp_src/valarray 984;" d file: +_DEFINE_EXPR_BINARY_FUNCTION cpp_src/valarray_after.h 463;" d +_DEFINE_EXPR_BINARY_FUNCTION cpp_src/valarray_after.h 550;" d +_DEFINE_EXPR_BINARY_OPERATOR cpp_src/valarray_after.h 341;" d +_DEFINE_EXPR_BINARY_OPERATOR cpp_src/valarray_after.h 425;" d +_DEFINE_EXPR_UNARY_FUNCTION cpp_src/valarray_after.h 427;" d +_DEFINE_EXPR_UNARY_FUNCTION cpp_src/valarray_after.h 461;" d +_DEFINE_EXPR_UNARY_OPERATOR cpp_src/valarray_after.h 326;" d +_DEFINE_EXPR_UNARY_OPERATOR cpp_src/valarray_after.h 339;" d +_DEFINE_VALARRAY_AUGMENTED_ASSIGNMENT cpp_src/valarray 929;" d file: +_DEFINE_VALARRAY_AUGMENTED_ASSIGNMENT cpp_src/valarray 959;" d file: +_DEFINE_VALARRAY_EXPR_AUGMENTED_ASSIGNMENT cpp_src/valarray 961;" d file: +_DEFINE_VALARRAY_EXPR_AUGMENTED_ASSIGNMENT cpp_src/valarray 981;" d file: +_DEFINE_VALARRAY_OPERATOR cpp_src/gslice_array.h 180;" d +_DEFINE_VALARRAY_OPERATOR cpp_src/gslice_array.h 181;" d +_DEFINE_VALARRAY_OPERATOR cpp_src/gslice_array.h 210;" d +_DEFINE_VALARRAY_OPERATOR cpp_src/indirect_array.h 176;" d +_DEFINE_VALARRAY_OPERATOR cpp_src/indirect_array.h 177;" d +_DEFINE_VALARRAY_OPERATOR cpp_src/indirect_array.h 204;" d +_DEFINE_VALARRAY_OPERATOR cpp_src/mask_array.h 171;" d +_DEFINE_VALARRAY_OPERATOR cpp_src/mask_array.h 172;" d +_DEFINE_VALARRAY_OPERATOR cpp_src/mask_array.h 200;" d +_DEFINE_VALARRAY_OPERATOR cpp_src/slice_array.h 236;" d +_DEFINE_VALARRAY_OPERATOR cpp_src/slice_array.h 237;" d +_DEFINE_VALARRAY_OPERATOR cpp_src/slice_array.h 265;" d +_DEFINE_VALARRAY_UNARY_OPERATOR cpp_src/valarray 912;" d file: +_DEFINE_VALARRAY_UNARY_OPERATOR cpp_src/valarray 927;" d file: +_DEQUE_H cpp_src/stl_deque.h 63;" d +_DEQUE_TCC cpp_src/deque.tcc 63;" d file: +_DefaultConstructibleConcept cpp_src/boost_concept_check.h /^ struct _DefaultConstructibleConcept$/;" s +_DefaultConstructibleConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_DefaultConstructibleConcept access:public signature:() +_Deque_base cpp_src/stl_deque.h /^ _Deque_base(const allocator_type& __a)$/;" f class:std::_Deque_base access:public signature:(const allocator_type& __a) +_Deque_base cpp_src/stl_deque.h /^ _Deque_base(const allocator_type& __a, size_t __num_elements)$/;" f class:std::_Deque_base access:public signature:(const allocator_type& __a, size_t __num_elements) +_Deque_base cpp_src/stl_deque.h /^ class _Deque_base$/;" c namespace:std +_Deque_impl cpp_src/stl_deque.h /^ _Deque_impl(const _Tp_alloc_type& __a)$/;" f struct:std::_Deque_base::_Deque_impl access:public signature:(const _Tp_alloc_type& __a) +_Deque_impl cpp_src/stl_deque.h /^ struct _Deque_impl$/;" s class:std::_Deque_base inherits:_Tp_alloc_type access:protected +_Deque_iterator cpp_src/stl_deque.h /^ _Deque_iterator() : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) {}$/;" f struct:std::_Deque_iterator access:public signature:() +_Deque_iterator cpp_src/stl_deque.h /^ _Deque_iterator(_Tp* __x, _Map_pointer __y)$/;" f struct:std::_Deque_iterator access:public signature:(_Tp* __x, _Map_pointer __y) +_Deque_iterator cpp_src/stl_deque.h /^ _Deque_iterator(const iterator& __x)$/;" f struct:std::_Deque_iterator access:public signature:(const iterator& __x) +_Deque_iterator cpp_src/stl_deque.h /^ struct _Deque_iterator$/;" s namespace:std +_Destroy cpp_src/stl_construct.h /^ _Destroy(_ForwardIterator __first, _ForwardIterator __last)$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last) +_Destroy cpp_src/stl_construct.h /^ _Destroy(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _Allocator __alloc) +_Destroy cpp_src/stl_construct.h /^ _Destroy(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, allocator<_Tp>) +_Destroy cpp_src/stl_construct.h /^ _Destroy(_Tp* __pointer)$/;" f namespace:std signature:(_Tp* __pointer) +_Difference_type cpp_src/boost_concept_check.h /^ typedef typename _Container::difference_type _Difference_type;$/;" t struct:_ContainerConcept access:public +_EXCEPTION_DEFINES_H cpp_src/exception_defines.h 39;" d +_EqualityComparableConcept cpp_src/boost_concept_check.h /^ struct _EqualityComparableConcept$/;" s +_EqualityComparableConcept::__a cpp_src/boost_concept_check.h /^ _Tp __a, __b;$/;" m struct:_EqualityComparableConcept access:public +_EqualityComparableConcept::__b cpp_src/boost_concept_check.h /^ _Tp __a, __b;$/;" m struct:_EqualityComparableConcept access:public +_EqualityComparableConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_EqualityComparableConcept access:public signature:() +_Expr cpp_src/valarray_after.h /^ _Expr(const _Clos&);$/;" p class:std::_Expr access:public signature:(const _Clos&) +_Expr cpp_src/valarray_after.h /^ _Expr<_Clos, _Tp>::_Expr(const _Clos& __c) : _M_closure(__c) {}$/;" f class:std::_Expr signature:(const _Clos& __c) +_Expr cpp_src/valarray_after.h /^ class _Expr$/;" c namespace:std +_FSTREAM_TCC cpp_src/fstream.tcc 41;" d file: +_FUNCTEXCEPT_H cpp_src/functexcept.h 39;" d +_FUNCTION_H cpp_src/stl_function.h 62;" d +_Find_first cpp_src/bitset /^ _Find_first() const$/;" f class:std::bitset access:public signature:() const +_Find_next cpp_src/bitset /^ _Find_next(size_t __prev ) const$/;" f class:std::bitset access:public signature:(size_t __prev ) const +_ForwardContainerConcept cpp_src/boost_concept_check.h /^ struct _ForwardContainerConcept$/;" s +_ForwardContainerConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_ForwardContainerConcept access:public signature:() +_ForwardIteratorConcept cpp_src/boost_concept_check.h /^ struct _ForwardIteratorConcept$/;" s +_ForwardIteratorConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_ForwardIteratorConcept access:public signature:() +_ForwardIteratorConcept::__i cpp_src/boost_concept_check.h /^ _Tp __i;$/;" m struct:_ForwardIteratorConcept access:public +_FrontInsertionSequenceConcept cpp_src/boost_concept_check.h /^ struct _FrontInsertionSequenceConcept$/;" s +_FrontInsertionSequenceConcept::__c cpp_src/boost_concept_check.h /^ _FrontInsertionSequence __c;$/;" m struct:_FrontInsertionSequenceConcept access:public +_FrontInsertionSequenceConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_FrontInsertionSequenceConcept access:public signature:() +_FrontInsertionSequenceConcept::__t cpp_src/boost_concept_check.h /^ typename _FrontInsertionSequence::value_type __t;$/;" m struct:_FrontInsertionSequenceConcept access:public +_FunBase cpp_src/valarray_before.h /^ _FunBase(const _Dom& __e, value_type __f(_Arg))$/;" f class:std::_FunBase access:public signature:(const _Dom& __e, value_type __f(_Arg)) +_FunBase cpp_src/valarray_before.h /^ class _FunBase$/;" c namespace:std +_GBase cpp_src/valarray_after.h /^ _GBase (_Array<_Tp> __a, const valarray& __i)$/;" f class:std::_GBase access:public signature:(_Array<_Tp> __a, const valarray& __i) +_GBase cpp_src/valarray_after.h /^ _GBase (const _Dom& __e, const valarray& __i)$/;" f class:std::_GBase access:public signature:(const _Dom& __e, const valarray& __i) +_GBase cpp_src/valarray_after.h /^ class _GBase$/;" c namespace:std +_GBase cpp_src/valarray_after.h /^ class _GBase<_Array<_Tp> >$/;" c namespace:std +_GClos cpp_src/valarray_after.h /^ _GClos (_Array<_Tp> __a, const valarray& __i)$/;" f struct:std::_GClos access:public signature:(_Array<_Tp> __a, const valarray& __i) +_GClos cpp_src/valarray_after.h /^ _GClos (const _Dom& __e, const valarray& __i)$/;" f struct:std::_GClos access:public signature:(const _Dom& __e, const valarray& __i) +_GClos cpp_src/valarray_after.h /^ struct _GClos<_Expr, _Dom>$/;" s namespace:std inherits:_GBase +_GClos cpp_src/valarray_after.h /^ struct _GClos<_ValArray, _Tp>$/;" s namespace:std inherits:_GBase +_GLIBCXX_ALGORITHM cpp_src/algorithm 61;" d file: +_GLIBCXX_BITSET cpp_src/bitset 49;" d file: +_GLIBCXX_BITSET_BITS_PER_WORD cpp_src/bitset 1338;" d file: +_GLIBCXX_BITSET_BITS_PER_WORD cpp_src/bitset 62;" d file: +_GLIBCXX_BITSET_WORDS cpp_src/bitset 1337;" d file: +_GLIBCXX_BITSET_WORDS cpp_src/bitset 63;" d file: +_GLIBCXX_CCTYPE cpp_src/cctype 46;" d file: +_GLIBCXX_CERRNO cpp_src/cerrno 46;" d file: +_GLIBCXX_CFLOAT cpp_src/cfloat 46;" d file: +_GLIBCXX_CLASS_REQUIRES cpp_src/boost_concept_check.h 74;" d +_GLIBCXX_CLASS_REQUIRES2 cpp_src/boost_concept_check.h 82;" d +_GLIBCXX_CLASS_REQUIRES3 cpp_src/boost_concept_check.h 90;" d +_GLIBCXX_CLASS_REQUIRES4 cpp_src/boost_concept_check.h 98;" d +_GLIBCXX_CLIMITS cpp_src/climits 46;" d file: +_GLIBCXX_CLOCALE cpp_src/clocale 46;" d file: +_GLIBCXX_CMATH cpp_src/cmath 46;" d file: +_GLIBCXX_CMATH_TCC cpp_src/cmath.tcc 37;" d file: +_GLIBCXX_COMPLEX cpp_src/complex 43;" d file: +_GLIBCXX_CSETJMP cpp_src/csetjmp 46;" d file: +_GLIBCXX_CSIGNAL cpp_src/csignal 46;" d file: +_GLIBCXX_CSTDARG cpp_src/cstdarg 46;" d file: +_GLIBCXX_CSTDDEF cpp_src/cstddef 46;" d file: +_GLIBCXX_CSTDIO cpp_src/cstdio 46;" d file: +_GLIBCXX_CSTDLIB cpp_src/cstdlib 46;" d file: +_GLIBCXX_CSTRING cpp_src/cstring 46;" d file: +_GLIBCXX_CTIME cpp_src/ctime 46;" d file: +_GLIBCXX_CWCHAR cpp_src/cwchar 46;" d file: +_GLIBCXX_CWCTYPE cpp_src/cwctype 46;" d file: +_GLIBCXX_DEFINE_BINARY_OPERATOR_CONSTRAINT cpp_src/boost_concept_check.h 286;" d +_GLIBCXX_DEFINE_BINARY_OPERATOR_CONSTRAINT cpp_src/boost_concept_check.h 311;" d +_GLIBCXX_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT cpp_src/boost_concept_check.h 275;" d +_GLIBCXX_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT cpp_src/boost_concept_check.h 310;" d +_GLIBCXX_DEQUE cpp_src/deque 61;" d file: +_GLIBCXX_FSTREAM cpp_src/fstream 41;" d file: +_GLIBCXX_FUNCTIONAL cpp_src/functional 49;" d file: +_GLIBCXX_IOMANIP cpp_src/iomanip 40;" d file: +_GLIBCXX_IOS cpp_src/ios 39;" d file: +_GLIBCXX_IOSFWD cpp_src/iosfwd 40;" d file: +_GLIBCXX_IOSTREAM cpp_src/iostream 40;" d file: +_GLIBCXX_ISTREAM cpp_src/istream 40;" d file: +_GLIBCXX_ITERATOR cpp_src/iterator 61;" d file: +_GLIBCXX_LIST cpp_src/list 61;" d file: +_GLIBCXX_LOCALE cpp_src/locale 39;" d file: +_GLIBCXX_MAP cpp_src/map 61;" d file: +_GLIBCXX_MEMORY cpp_src/memory 49;" d file: +_GLIBCXX_NUMERIC cpp_src/numeric 61;" d file: +_GLIBCXX_NUMERIC_LIMITS cpp_src/limits 44;" d file: +_GLIBCXX_NUM_FACETS cpp_src/locale_facets.h 57;" d +_GLIBCXX_OSTREAM cpp_src/ostream 41;" d file: +_GLIBCXX_POSTYPES_H cpp_src/postypes.h 42;" d +_GLIBCXX_QUEUE cpp_src/queue 61;" d file: +_GLIBCXX_SET cpp_src/set 61;" d file: +_GLIBCXX_SSTREAM cpp_src/sstream 40;" d file: +_GLIBCXX_STACK cpp_src/stack 61;" d file: +_GLIBCXX_STDEXCEPT cpp_src/stdexcept 39;" d file: +_GLIBCXX_STRING cpp_src/string 41;" d file: +_GLIBCXX_UTILITY cpp_src/utility 61;" d file: +_GLIBCXX_VALARRAY cpp_src/valarray 38;" d file: +_GLIBCXX_VECTOR cpp_src/vector 61;" d file: +_GLIBXX_STREAMBUF cpp_src/streambuf 40;" d file: +_GSLICE_ARRAY_H cpp_src/gslice_array.h 39;" d +_GSLICE_H cpp_src/gslice.h 39;" d +_GeneratorConcept cpp_src/boost_concept_check.h /^ struct _GeneratorConcept$/;" s +_GeneratorConcept cpp_src/boost_concept_check.h /^ struct _GeneratorConcept<_Func,void>$/;" s +_GeneratorConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_GeneratorConcept access:public signature:() +_GeneratorConcept::__f cpp_src/boost_concept_check.h /^ _Func __f;$/;" m struct:_GeneratorConcept access:public +_IBase cpp_src/valarray_after.h /^ _IBase (const _Dom& __e, const valarray& __i)$/;" f class:std::_IBase access:public signature:(const _Dom& __e, const valarray& __i) +_IBase cpp_src/valarray_after.h /^ class _IBase$/;" c namespace:std +_IClos cpp_src/valarray_after.h /^ _IClos (const _Dom& __e, const valarray& __i)$/;" f struct:std::_IClos access:public signature:(const _Dom& __e, const valarray& __i) +_IClos cpp_src/valarray_after.h /^ _IClos (const valarray<_Tp>& __a, const valarray& __i)$/;" f struct:std::_IClos access:public signature:(const valarray<_Tp>& __a, const valarray& __i) +_IClos cpp_src/valarray_after.h /^ struct _IClos<_Expr, _Dom>$/;" s namespace:std inherits:_IBase +_IClos cpp_src/valarray_after.h /^ struct _IClos<_ValArray, _Tp>$/;" s namespace:std inherits:_IBase +_INDIRECT_ARRAY_H cpp_src/indirect_array.h 39;" d +_IOS_BASE_H cpp_src/ios_base.h 41;" d +_ISTREAM_TCC cpp_src/istream.tcc 42;" d file: +_ITERATOR_BASE_FUNCS_H cpp_src/stl_iterator_base_funcs.h 66;" d +_ITERATOR_BASE_TYPES_H cpp_src/stl_iterator_base_types.h 65;" d +_ITERATOR_H cpp_src/stl_iterator.h 67;" d +_Identity cpp_src/stl_function.h /^ struct _Identity : public unary_function<_Tp,_Tp>$/;" s namespace:std inherits:unary_function +_Impl cpp_src/locale_classes.h /^ _Impl(const _Impl&); \/\/ Not defined.$/;" p class:std::locale::_Impl access:private signature:(const _Impl&) +_Impl cpp_src/locale_classes.h /^ _Impl(const _Impl&, size_t);$/;" p class:std::locale::_Impl access:private signature:(const _Impl&, size_t) +_Impl cpp_src/locale_classes.h /^ _Impl(const char*, size_t);$/;" p class:std::locale::_Impl access:private signature:(const char*, size_t) +_Impl cpp_src/locale_classes.h /^ _Impl(size_t) throw();$/;" p class:std::locale::_Impl access:private signature:(size_t) +_Impl cpp_src/locale_classes.h /^ class locale::_Impl$/;" c class:std::locale +_Indexer cpp_src/gslice.h /^ _Indexer(size_t, const valarray&,$/;" p struct:std::gslice::_Indexer access:public signature:(size_t, const valarray&, const valarray&) +_Indexer cpp_src/gslice.h /^ struct _Indexer$/;" s class:std::gslice access:private +_InputIteratorConcept cpp_src/boost_concept_check.h /^ struct _InputIteratorConcept$/;" s +_InputIteratorConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_InputIteratorConcept access:public signature:() +_InputIteratorConcept::__i cpp_src/boost_concept_check.h /^ _Tp __i;$/;" m struct:_InputIteratorConcept access:public +_IntegerConcept cpp_src/boost_concept_check.h /^ struct _IntegerConcept {$/;" s +_IntegerConcept cpp_src/boost_concept_check.h /^ template <> struct _IntegerConcept { void __constraints() {} };$/;" s +_IntegerConcept cpp_src/boost_concept_check.h /^ template <> struct _IntegerConcept { void __constraints() {} };$/;" s +_IntegerConcept cpp_src/boost_concept_check.h /^ template <> struct _IntegerConcept { void __constraints() {} };$/;" s +_IntegerConcept cpp_src/boost_concept_check.h /^ template <> struct _IntegerConcept { void __constraints() {} };$/;" s +_IntegerConcept cpp_src/boost_concept_check.h /^ template <> struct _IntegerConcept { void __constraints() {} };$/;" s +_IntegerConcept cpp_src/boost_concept_check.h /^ template <> struct _IntegerConcept$/;" s +_IntegerConcept cpp_src/boost_concept_check.h /^ template <> struct _IntegerConcept { void __constraints() {} };$/;" s +_IntegerConcept cpp_src/boost_concept_check.h /^ template <> struct _IntegerConcept { void __constraints(){} };$/;" s +_IntegerConcept::__constraints cpp_src/boost_concept_check.h /^ { void __constraints() {} };$/;" f struct:_IntegerConcept access:public signature:() +_IntegerConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_IntegerConcept access:public signature:() +_IntegerConcept::__constraints cpp_src/boost_concept_check.h /^ template <> struct _IntegerConcept { void __constraints() {} };$/;" f struct:_IntegerConcept access:public signature:() +_IntegerConcept::__constraints cpp_src/boost_concept_check.h /^ template <> struct _IntegerConcept { void __constraints() {} };$/;" f struct:_IntegerConcept access:public signature:() +_IntegerConcept::__constraints cpp_src/boost_concept_check.h /^ template <> struct _IntegerConcept { void __constraints() {} };$/;" f struct:_IntegerConcept access:public signature:() +_IntegerConcept::__constraints cpp_src/boost_concept_check.h /^ template <> struct _IntegerConcept { void __constraints() {} };$/;" f struct:_IntegerConcept access:public signature:() +_IntegerConcept::__constraints cpp_src/boost_concept_check.h /^ template <> struct _IntegerConcept { void __constraints() {} };$/;" f struct:_IntegerConcept access:public signature:() +_IntegerConcept::__constraints cpp_src/boost_concept_check.h /^ template <> struct _IntegerConcept { void __constraints() {} };$/;" f struct:_IntegerConcept access:public signature:() +_IntegerConcept::__constraints cpp_src/boost_concept_check.h /^ template <> struct _IntegerConcept { void __constraints(){} };$/;" f struct:_IntegerConcept access:public signature:() +_Ios_Fmtflags cpp_src/ios_base.h /^ enum _Ios_Fmtflags $/;" g namespace:std +_Ios_Iostate cpp_src/ios_base.h /^ enum _Ios_Iostate$/;" g namespace:std +_Ios_Openmode cpp_src/ios_base.h /^ enum _Ios_Openmode $/;" g namespace:std +_Ios_Seekdir cpp_src/ios_base.h /^ enum _Ios_Seekdir $/;" g namespace:std +_IsUnused cpp_src/boost_concept_check.h 55;" d +_Iterator cpp_src/boost_concept_check.h /^ typedef typename _AssociativeContainer::iterator _Iterator;$/;" t struct:_AssociativeContainerConcept access:public +_Iterator cpp_src/boost_concept_check.h /^ typedef typename _Container::iterator _Iterator;$/;" t struct:_Mutable_ContainerConcept access:public +_Iterator cpp_src/boost_concept_check.h /^ typedef typename _RandomAccessContainer::iterator _Iterator;$/;" t struct:_Mutable_RandomAccessContainerConcept access:public +_Iterator cpp_src/boost_concept_check.h /^ typedef typename _ReversibleContainer::iterator _Iterator;$/;" t struct:_Mutable_ReversibleContainerConcept access:public +_Iterator cpp_src/boost_concept_check.h /^ typedef typename _SortedAssociativeContainer::iterator _Iterator;$/;" t struct:_SortedAssociativeContainerConcept access:public +_Key_alloc_type cpp_src/stl_multiset.h /^ typedef typename _Alloc::template rebind<_Key>::other _Key_alloc_type;$/;" t class:std::multiset access:private +_Key_alloc_type cpp_src/stl_set.h /^ typedef typename _Alloc::template rebind<_Key>::other _Key_alloc_type;$/;" t class:std::set access:private +_LIST_H cpp_src/stl_list.h 63;" d +_LIST_TCC cpp_src/list.tcc 63;" d file: +_LOCALE_CLASSES_H cpp_src/locale_classes.h 41;" d +_LOCALE_FACETS_H cpp_src/locale_facets.h 41;" d +_LOCALE_FACETS_TCC cpp_src/locale_facets.tcc 38;" d file: +_LOCALE_FWD_H cpp_src/localefwd.h 41;" d +_LessThanComparableConcept cpp_src/boost_concept_check.h /^ struct _LessThanComparableConcept$/;" s +_LessThanComparableConcept::__a cpp_src/boost_concept_check.h /^ _Tp __a, __b;$/;" m struct:_LessThanComparableConcept access:public +_LessThanComparableConcept::__b cpp_src/boost_concept_check.h /^ _Tp __a, __b;$/;" m struct:_LessThanComparableConcept access:public +_LessThanComparableConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_LessThanComparableConcept access:public signature:() +_Link_type cpp_src/stl_tree.h /^ typedef _Rb_tree_node* _Link_type;$/;" t class:std::_Rb_tree access:public +_Link_type cpp_src/stl_tree.h /^ typedef _Rb_tree_node<_Tp>* _Link_type;$/;" t struct:std::_Rb_tree_iterator access:public +_Link_type cpp_src/stl_tree.h /^ typedef _Rb_tree_node<_Val>* _Link_type;$/;" t struct:std::_Rb_tree_node access:public +_Link_type cpp_src/stl_tree.h /^ typedef const _Rb_tree_node<_Tp>* _Link_type;$/;" t struct:std::_Rb_tree_const_iterator access:public +_List_base cpp_src/stl_list.h /^ _List_base(const allocator_type& __a)$/;" f class:std::_List_base access:public signature:(const allocator_type& __a) +_List_base cpp_src/stl_list.h /^ class _List_base$/;" c namespace:std +_List_const_iterator cpp_src/stl_list.h /^ _List_const_iterator()$/;" f struct:std::_List_const_iterator access:public signature:() +_List_const_iterator cpp_src/stl_list.h /^ _List_const_iterator(const _List_node_base* __x)$/;" f struct:std::_List_const_iterator access:public signature:(const _List_node_base* __x) +_List_const_iterator cpp_src/stl_list.h /^ _List_const_iterator(const iterator& __x)$/;" f struct:std::_List_const_iterator access:public signature:(const iterator& __x) +_List_const_iterator cpp_src/stl_list.h /^ struct _List_const_iterator$/;" s namespace:std +_List_impl cpp_src/stl_list.h /^ _List_impl(const _Node_alloc_type& __a)$/;" f struct:std::_List_base::_List_impl access:public signature:(const _Node_alloc_type& __a) +_List_impl cpp_src/stl_list.h /^ struct _List_impl $/;" s class:std::_List_base inherits:_Node_alloc_type access:protected +_List_iterator cpp_src/stl_list.h /^ _List_iterator()$/;" f struct:std::_List_iterator access:public signature:() +_List_iterator cpp_src/stl_list.h /^ _List_iterator(_List_node_base* __x)$/;" f struct:std::_List_iterator access:public signature:(_List_node_base* __x) +_List_iterator cpp_src/stl_list.h /^ struct _List_iterator$/;" s namespace:std +_List_node cpp_src/stl_list.h /^ struct _List_node : public _List_node_base$/;" s namespace:std inherits:_List_node_base +_List_node_base cpp_src/stl_list.h /^ struct _List_node_base$/;" s namespace:std +_MAP_H cpp_src/stl_map.h 63;" d +_MASK_ARRAY_H cpp_src/mask_array.h 39;" d +_MULTIMAP_H cpp_src/stl_multimap.h 62;" d +_MULTISET_H cpp_src/stl_multiset.h 62;" d +_M_aday1 cpp_src/locale_facets.h /^ const _CharT* _M_aday1;$/;" m struct:std::__timepunct_cache access:public +_M_aday2 cpp_src/locale_facets.h /^ const _CharT* _M_aday2;$/;" m struct:std::__timepunct_cache access:public +_M_aday3 cpp_src/locale_facets.h /^ const _CharT* _M_aday3;$/;" m struct:std::__timepunct_cache access:public +_M_aday4 cpp_src/locale_facets.h /^ const _CharT* _M_aday4;$/;" m struct:std::__timepunct_cache access:public +_M_aday5 cpp_src/locale_facets.h /^ const _CharT* _M_aday5;$/;" m struct:std::__timepunct_cache access:public +_M_aday6 cpp_src/locale_facets.h /^ const _CharT* _M_aday6;$/;" m struct:std::__timepunct_cache access:public +_M_aday7 cpp_src/locale_facets.h /^ const _CharT* _M_aday7;$/;" m struct:std::__timepunct_cache access:public +_M_add_reference cpp_src/ios_base.h /^ _M_add_reference() { __gnu_cxx::__atomic_add_dispatch(&_M_refcount, 1); }$/;" f struct:std::ios_base::_Callback_list access:public signature:() +_M_add_reference cpp_src/locale_classes.h /^ _M_add_reference() const throw()$/;" f class:std::locale::facet access:private signature:() const +_M_add_reference cpp_src/locale_classes.h /^ _M_add_reference() throw()$/;" f class:std::locale::_Impl access:private signature:() +_M_allocate cpp_src/stl_bvector.h /^ _M_allocate(size_t __n)$/;" f struct:std::_Bvector_base access:protected signature:(size_t __n) +_M_allocate cpp_src/stl_vector.h /^ _M_allocate(size_t __n)$/;" f struct:std::_Vector_base access:public signature:(size_t __n) +_M_allocate_and_copy cpp_src/stl_vector.h /^ _M_allocate_and_copy(size_type __n,$/;" f class:std::vector access:protected signature:(size_type __n, _ForwardIterator __first, _ForwardIterator __last) +_M_allocate_internal_buffer cpp_src/fstream /^ _M_allocate_internal_buffer();$/;" p class:std::basic_filebuf file: access:protected signature:() +_M_allocate_internal_buffer cpp_src/fstream.tcc /^ _M_allocate_internal_buffer()$/;" f class:std::basic_filebuf signature:() +_M_allocate_map cpp_src/stl_deque.h /^ _M_allocate_map(size_t __n)$/;" f class:std::_Deque_base access:protected signature:(size_t __n) +_M_allocate_node cpp_src/stl_deque.h /^ _M_allocate_node()$/;" f class:std::_Deque_base access:protected signature:() +_M_allocated cpp_src/locale_facets.h /^ bool _M_allocated;$/;" m struct:std::__moneypunct_cache access:public +_M_allocated cpp_src/locale_facets.h /^ bool _M_allocated;$/;" m struct:std::__numpunct_cache access:public +_M_allocated cpp_src/locale_facets.h /^ bool _M_allocated;$/;" m struct:std::__timepunct_cache access:public +_M_am cpp_src/locale_facets.h /^ const _CharT* _M_am;$/;" m struct:std::__timepunct_cache access:public +_M_am_pm cpp_src/locale_facets.h /^ _M_am_pm(const _CharT** __ampm) const$/;" f class:std::__timepunct access:public signature:(const _CharT** __ampm) const +_M_am_pm_format cpp_src/locale_facets.h /^ _M_am_pm_format(const _CharT* __ampm) const$/;" f class:std::__timepunct access:public signature:(const _CharT* __ampm) const +_M_am_pm_format cpp_src/locale_facets.h /^ const _CharT* _M_am_pm_format;$/;" m struct:std::__timepunct_cache access:public +_M_amonth01 cpp_src/locale_facets.h /^ const _CharT* _M_amonth01;$/;" m struct:std::__timepunct_cache access:public +_M_amonth02 cpp_src/locale_facets.h /^ const _CharT* _M_amonth02;$/;" m struct:std::__timepunct_cache access:public +_M_amonth03 cpp_src/locale_facets.h /^ const _CharT* _M_amonth03;$/;" m struct:std::__timepunct_cache access:public +_M_amonth04 cpp_src/locale_facets.h /^ const _CharT* _M_amonth04;$/;" m struct:std::__timepunct_cache access:public +_M_amonth05 cpp_src/locale_facets.h /^ const _CharT* _M_amonth05;$/;" m struct:std::__timepunct_cache access:public +_M_amonth06 cpp_src/locale_facets.h /^ const _CharT* _M_amonth06;$/;" m struct:std::__timepunct_cache access:public +_M_amonth07 cpp_src/locale_facets.h /^ const _CharT* _M_amonth07;$/;" m struct:std::__timepunct_cache access:public +_M_amonth08 cpp_src/locale_facets.h /^ const _CharT* _M_amonth08;$/;" m struct:std::__timepunct_cache access:public +_M_amonth09 cpp_src/locale_facets.h /^ const _CharT* _M_amonth09;$/;" m struct:std::__timepunct_cache access:public +_M_amonth10 cpp_src/locale_facets.h /^ const _CharT* _M_amonth10;$/;" m struct:std::__timepunct_cache access:public +_M_amonth11 cpp_src/locale_facets.h /^ const _CharT* _M_amonth11;$/;" m struct:std::__timepunct_cache access:public +_M_amonth12 cpp_src/locale_facets.h /^ const _CharT* _M_amonth12;$/;" m struct:std::__timepunct_cache access:public +_M_array cpp_src/gslice_array.h /^ _Array<_Tp> _M_array;$/;" m class:std::gslice_array access:private +_M_array cpp_src/indirect_array.h /^ const _Array<_Tp> _M_array;$/;" m class:std::indirect_array access:private +_M_array cpp_src/mask_array.h /^ const _Array<_Tp> _M_array;$/;" m class:std::mask_array access:private +_M_array cpp_src/slice_array.h /^ const _Array<_Tp> _M_array;$/;" m class:std::slice_array access:private +_M_array cpp_src/valarray_after.h /^ const _Array<_Tp> _M_array;$/;" m class:std::_GBase access:private +_M_array cpp_src/valarray_before.h /^ const _Array<_Tp> _M_array;$/;" m class:std::_SBase access:private +_M_assign cpp_src/basic_string.h /^ _M_assign(_CharT* __d, size_type __n, _CharT __c)$/;" f class:std::basic_string access:private signature:(_CharT* __d, size_type __n, _CharT __c) +_M_assign_aux cpp_src/deque.tcc /^ _M_assign_aux(_InputIterator __first, _InputIterator __last,$/;" f class:std::deque signature:(_InputIterator __first, _InputIterator __last, std::input_iterator_tag) +_M_assign_aux cpp_src/stl_bvector.h /^ _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,$/;" f class:std::vector access:protected signature:(_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) +_M_assign_aux cpp_src/stl_bvector.h /^ _M_assign_aux(_InputIterator __first, _InputIterator __last,$/;" f class:std::vector access:protected signature:(_InputIterator __first, _InputIterator __last, std::input_iterator_tag) +_M_assign_aux cpp_src/stl_deque.h /^ _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,$/;" f class:std::deque access:protected signature:(_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) +_M_assign_aux cpp_src/stl_deque.h /^ _M_assign_aux(_InputIterator __first, _InputIterator __last,$/;" p class:std::deque access:protected signature:(_InputIterator __first, _InputIterator __last, std::input_iterator_tag) +_M_assign_aux cpp_src/stl_vector.h /^ _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,$/;" p class:std::vector access:protected signature:(_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) +_M_assign_aux cpp_src/stl_vector.h /^ _M_assign_aux(_InputIterator __first, _InputIterator __last,$/;" p class:std::vector access:protected signature:(_InputIterator __first, _InputIterator __last, std::input_iterator_tag) +_M_assign_aux cpp_src/vector.tcc /^ _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,$/;" f class:std::vector signature:(_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) +_M_assign_aux cpp_src/vector.tcc /^ _M_assign_aux(_InputIterator __first, _InputIterator __last,$/;" f class:std::vector signature:(_InputIterator __first, _InputIterator __last, std::input_iterator_tag) +_M_assign_dispatch cpp_src/list.tcc /^ _M_assign_dispatch(_InputIterator __first2, _InputIterator __last2,$/;" f class:std::list signature:(_InputIterator __first2, _InputIterator __last2, __false_type) +_M_assign_dispatch cpp_src/stl_bvector.h /^ _M_assign_dispatch(_InputIterator __first, _InputIterator __last,$/;" f class:std::vector access:protected signature:(_InputIterator __first, _InputIterator __last, __false_type) +_M_assign_dispatch cpp_src/stl_bvector.h /^ _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)$/;" f class:std::vector access:protected signature:(_Integer __n, _Integer __val, __true_type) +_M_assign_dispatch cpp_src/stl_deque.h /^ _M_assign_dispatch(_InputIterator __first, _InputIterator __last,$/;" f class:std::deque access:protected signature:(_InputIterator __first, _InputIterator __last, __false_type) +_M_assign_dispatch cpp_src/stl_deque.h /^ _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)$/;" f class:std::deque access:protected signature:(_Integer __n, _Integer __val, __true_type) +_M_assign_dispatch cpp_src/stl_list.h /^ _M_assign_dispatch(_InputIterator __first, _InputIterator __last,$/;" p class:std::list access:protected signature:(_InputIterator __first, _InputIterator __last, __false_type) +_M_assign_dispatch cpp_src/stl_list.h /^ _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)$/;" f class:std::list access:protected signature:(_Integer __n, _Integer __val, __true_type) +_M_assign_dispatch cpp_src/stl_vector.h /^ _M_assign_dispatch(_InputIterator __first, _InputIterator __last,$/;" f class:std::vector access:protected signature:(_InputIterator __first, _InputIterator __last, __false_type) +_M_assign_dispatch cpp_src/stl_vector.h /^ _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)$/;" f class:std::vector access:protected signature:(_Integer __n, _Integer __val, __true_type) +_M_at_eof cpp_src/streambuf_iterator.h /^ _M_at_eof() const$/;" f class:std::istreambuf_iterator access:private signature:() const +_M_atoms cpp_src/locale_facets.h /^ _CharT _M_atoms[money_base::_S_end];$/;" m struct:std::__moneypunct_cache access:public +_M_atoms_in cpp_src/locale_facets.h /^ _CharT _M_atoms_in[__num_base::_S_iend];$/;" m struct:std::__numpunct_cache access:public +_M_atoms_out cpp_src/locale_facets.h /^ _CharT _M_atoms_out[__num_base::_S_oend];$/;" m struct:std::__numpunct_cache access:public +_M_base cpp_src/iomanip /^ struct _Setbase { int _M_base; };$/;" m struct:std::_Setbase file: access:public +_M_begin cpp_src/stl_tree.h /^ _M_begin() const$/;" f class:std::_Rb_tree access:protected signature:() const +_M_begin cpp_src/stl_tree.h /^ _M_begin()$/;" f class:std::_Rb_tree access:protected signature:() +_M_bit cpp_src/locale_facets.h /^ mask _M_bit[16];$/;" m class:std::ctype access:protected +_M_bpos cpp_src/bitset /^ size_t _M_bpos;$/;" m class:std::bitset::reference file: access:private +_M_buf cpp_src/fstream /^ char_type* _M_buf; $/;" m class:std::basic_filebuf file: access:protected +_M_buf_allocated cpp_src/fstream /^ bool _M_buf_allocated;$/;" m class:std::basic_filebuf file: access:protected +_M_buf_locale cpp_src/streambuf /^ locale _M_buf_locale; $/;" m class:std::basic_streambuf file: access:protected +_M_buf_size cpp_src/fstream /^ size_t _M_buf_size;$/;" m class:std::basic_filebuf file: access:protected +_M_buffer cpp_src/stl_tempbuf.h /^ pointer _M_buffer;$/;" m class:std::_Temporary_buffer access:protected +_M_bump_down cpp_src/stl_bvector.h /^ _M_bump_down()$/;" f struct:std::_Bit_iterator_base access:public signature:() +_M_bump_up cpp_src/stl_bvector.h /^ _M_bump_up()$/;" f struct:std::_Bit_iterator_base access:public signature:() +_M_c cpp_src/iomanip /^ struct _Setfill { _CharT _M_c; };$/;" m struct:std::_Setfill file: access:public +_M_c cpp_src/streambuf_iterator.h /^ mutable int_type _M_c;$/;" m class:std::istreambuf_iterator access:private +_M_c_locale_codecvt cpp_src/codecvt.h /^ __c_locale _M_c_locale_codecvt;$/;" m class:std::codecvt access:protected +_M_c_locale_collate cpp_src/locale_facets.h /^ __c_locale _M_c_locale_collate;$/;" m class:std::collate access:protected +_M_c_locale_ctype cpp_src/locale_facets.h /^ __c_locale _M_c_locale_ctype;$/;" m class:std::ctype access:protected +_M_c_locale_messages cpp_src/locale_facets.h /^ __c_locale _M_c_locale_messages;$/;" m class:std::messages access:protected +_M_c_locale_timepunct cpp_src/locale_facets.h /^ __c_locale _M_c_locale_timepunct;$/;" m class:std::__timepunct access:protected +_M_cache cpp_src/locale_facets.h /^ _M_cache(const locale& __loc);$/;" p struct:std::__moneypunct_cache access:public signature:(const locale& __loc) +_M_cache cpp_src/locale_facets.h /^ _M_cache(const locale& __loc);$/;" p struct:std::__numpunct_cache access:public signature:(const locale& __loc) +_M_cache cpp_src/locale_facets.h /^ _M_cache(const locale& __loc);$/;" p struct:std::__timepunct_cache access:public signature:(const locale& __loc) +_M_cache cpp_src/locale_facets.tcc /^ __moneypunct_cache<_CharT, _Intl>::_M_cache(const locale& __loc)$/;" f class:std::__moneypunct_cache signature:(const locale& __loc) +_M_cache cpp_src/locale_facets.tcc /^ __numpunct_cache<_CharT>::_M_cache(const locale& __loc)$/;" f class:std::__numpunct_cache signature:(const locale& __loc) +_M_cache_locale cpp_src/basic_ios.h /^ _M_cache_locale(const locale& __loc);$/;" p class:std::basic_ios access:protected signature:(const locale& __loc) +_M_cache_locale cpp_src/basic_ios.tcc /^ basic_ios<_CharT, _Traits>::_M_cache_locale(const locale& __loc)$/;" f class:std::basic_ios signature:(const locale& __loc) +_M_caches cpp_src/locale_classes.h /^ const facet** _M_caches;$/;" m class:std::locale::_Impl access:private +_M_call_callbacks cpp_src/ios_base.h /^ _M_call_callbacks(event __ev) throw();$/;" p class:std::ios_base access:protected signature:(event __ev) +_M_callbacks cpp_src/ios_base.h /^ _Callback_list* _M_callbacks;$/;" m class:std::ios_base access:protected +_M_capacity cpp_src/basic_string.h /^ size_type _M_capacity;$/;" m struct:std::basic_string::_Rep_base access:public +_M_check cpp_src/basic_string.h /^ _M_check(size_type __pos, const char* __s) const$/;" f class:std::basic_string access:private signature:(size_type __pos, const char* __s) const +_M_check_equal_allocators cpp_src/stl_list.h /^ _M_check_equal_allocators(list& __x)$/;" f class:std::list access:protected signature:(list& __x) +_M_check_length cpp_src/basic_string.h /^ _M_check_length(size_type __n1, size_type __n2, const char* __s) const$/;" f class:std::basic_string access:private signature:(size_type __n1, size_type __n2, const char* __s) const +_M_check_same_name cpp_src/locale_classes.h /^ _M_check_same_name()$/;" f class:std::locale::_Impl access:private signature:() +_M_clear cpp_src/list.tcc /^ _M_clear()$/;" f class:std::_List_base signature:() +_M_clear cpp_src/stl_list.h /^ _M_clear();$/;" p class:std::_List_base access:public signature:() +_M_clone cpp_src/basic_string.h /^ _M_clone(const _Alloc&, size_type __res = 0);$/;" p struct:std::basic_string::_Rep access:public signature:(const _Alloc&, size_type __res = 0) +_M_clone cpp_src/basic_string.tcc /^ _M_clone(const _Alloc& __alloc, size_type __res)$/;" f class:std::basic_string::_Rep signature:(const _Alloc& __alloc, size_type __res) +_M_clone_node cpp_src/stl_tree.h /^ _M_clone_node(_Const_Link_type __x)$/;" f class:std::_Rb_tree access:protected signature:(_Const_Link_type __x) +_M_closure cpp_src/valarray_after.h /^ const _Clos _M_closure;$/;" m class:std::_Expr access:private +_M_coalesce cpp_src/locale_classes.h /^ _M_coalesce(const locale& __base, const locale& __add, category __cat);$/;" p class:std::locale access:private signature:(const locale& __base, const locale& __add, category __cat) +_M_codecvt cpp_src/fstream /^ const __codecvt_type* _M_codecvt;$/;" m class:std::basic_filebuf file: access:protected +_M_color cpp_src/stl_tree.h /^ _Rb_tree_color _M_color;$/;" m struct:std::_Rb_tree_node_base access:public +_M_compare cpp_src/locale_facets.h /^ _M_compare(const _CharT*, const _CharT*) const;$/;" p class:std::collate access:public signature:(const _CharT*, const _CharT*) const +_M_compare cpp_src/locale_facets.h /^ collate::_M_compare(const char*, const char*) const;$/;" p class:std::collate signature:(const char*, const char*) const +_M_compare cpp_src/locale_facets.h /^ collate::_M_compare(const wchar_t*, const wchar_t*) const;$/;" p class:std::collate signature:(const wchar_t*, const wchar_t*) const +_M_compare cpp_src/locale_facets.tcc /^ collate<_CharT>::_M_compare(const _CharT*, const _CharT*) const$/;" f class:std::collate signature:(const _CharT*, const _CharT*) const +_M_convert_from_char cpp_src/locale_facets.h /^ _M_convert_from_char(char*) const$/;" f class:std::messages access:protected signature:(char*) const +_M_convert_to_char cpp_src/locale_facets.h /^ _M_convert_to_char(const string_type& __msg) const$/;" f class:std::messages access:protected signature:(const string_type& __msg) const +_M_convert_to_external cpp_src/fstream /^ _M_convert_to_external(char_type*, streamsize);$/;" p class:std::basic_filebuf file: access:protected signature:(char_type*, streamsize) +_M_convert_to_external cpp_src/fstream.tcc /^ _M_convert_to_external(_CharT* __ibuf, streamsize __ilen)$/;" f class:std::basic_filebuf signature:(_CharT* __ibuf, streamsize __ilen) +_M_convert_to_wmask cpp_src/locale_facets.h /^ _M_convert_to_wmask(const mask __m) const;$/;" p class:std::ctype access:protected signature:(const mask __m) const +_M_copy cpp_src/basic_string.h /^ _M_copy(_CharT* __d, const _CharT* __s, size_type __n)$/;" f class:std::basic_string access:private signature:(_CharT* __d, const _CharT* __s, size_type __n) +_M_copy cpp_src/stl_tree.h /^ _M_copy(_Const_Link_type __x, _Link_type __p);$/;" p class:std::_Rb_tree access:private signature:(_Const_Link_type __x, _Link_type __p) +_M_copy cpp_src/stl_tree.h /^ _M_copy(_Const_Link_type __x, _Link_type __p)$/;" f class:std::_Rb_tree signature:(_Const_Link_type __x, _Link_type __p) +_M_copy_aligned cpp_src/stl_bvector.h /^ _M_copy_aligned(const_iterator __first, const_iterator __last,$/;" f class:std::vector access:protected signature:(const_iterator __first, const_iterator __last, iterator __result) +_M_copy_from_string cpp_src/bitset /^ _M_copy_from_string(const std::basic_string<_CharT,$/;" p class:std::bitset file: access:public signature:(const std::basic_string<_CharT, _Traits, _Alloc>& __s, size_t, size_t) +_M_copy_from_string cpp_src/bitset /^ _M_copy_from_string(const std::basic_string<_CharT, _Traits,$/;" f class:std::bitset signature:(const std::basic_string<_CharT, _Traits, _Alloc>& __s, size_t __pos, size_t __n) +_M_copy_to_string cpp_src/bitset /^ _M_copy_to_string(std::basic_string<_CharT, _Traits, _Alloc>&) const;$/;" p class:std::bitset file: access:public signature:(std::basic_string<_CharT, _Traits, _Alloc>&) const +_M_copy_to_string cpp_src/bitset /^ _M_copy_to_string(std::basic_string<_CharT, _Traits, _Alloc>& __s) const$/;" f class:std::bitset signature:(std::basic_string<_CharT, _Traits, _Alloc>& __s) const +_M_count cpp_src/gslice.h /^ size_t _M_count;$/;" m struct:std::gslice::_Indexer access:public +_M_create_node cpp_src/stl_list.h /^ _M_create_node(const value_type& __x)$/;" f class:std::list access:protected signature:(const value_type& __x) +_M_create_node cpp_src/stl_tree.h /^ _M_create_node(const value_type& __x)$/;" f class:std::_Rb_tree access:protected signature:(const value_type& __x) +_M_create_nodes cpp_src/stl_deque.h /^ void _M_create_nodes(_Tp** __nstart, _Tp** __nfinish);$/;" p class:std::_Deque_base access:protected signature:(_Tp** __nstart, _Tp** __nfinish) +_M_create_nodes cpp_src/stl_deque.h /^ _M_create_nodes(_Tp** __nstart, _Tp** __nfinish)$/;" f class:std::_Deque_base signature:(_Tp** __nstart, _Tp** __nfinish) +_M_create_pback cpp_src/fstream /^ _M_create_pback()$/;" f class:std::basic_filebuf access:protected signature:() +_M_ctype cpp_src/basic_ios.h /^ const __ctype_type* _M_ctype;$/;" m class:std::basic_ios access:protected +_M_cur cpp_src/stl_deque.h /^ _Tp* _M_cur;$/;" m struct:std::_Deque_iterator access:public +_M_curr_symbol cpp_src/locale_facets.h /^ const _CharT* _M_curr_symbol;$/;" m struct:std::__moneypunct_cache access:public +_M_curr_symbol_size cpp_src/locale_facets.h /^ size_t _M_curr_symbol_size;$/;" m struct:std::__moneypunct_cache access:public +_M_current cpp_src/stl_iterator.h /^ _Iterator _M_current;$/;" m class:__normal_iterator access:protected +_M_data cpp_src/basic_string.h /^ _M_data() const$/;" f class:std::basic_string access:private signature:() const +_M_data cpp_src/basic_string.h /^ _M_data(_CharT* __p)$/;" f class:std::basic_string access:private signature:(_CharT* __p) +_M_data cpp_src/locale_facets.h /^ __cache_type* _M_data;$/;" m class:std::__timepunct access:protected +_M_data cpp_src/locale_facets.h /^ __cache_type* _M_data;$/;" m class:std::moneypunct access:private +_M_data cpp_src/locale_facets.h /^ __cache_type* _M_data;$/;" m class:std::numpunct access:protected +_M_data cpp_src/stl_list.h /^ _Tp _M_data; \/\/\/< User's data.$/;" m struct:std::_List_node access:public +_M_data cpp_src/valarray /^ _Tp* __restrict__ _M_data;$/;" m class:std::valarray file: access:private +_M_data cpp_src/valarray_array.h /^ _Tp* const __restrict__ _M_data;$/;" m struct:std::_Array access:public +_M_dataplus cpp_src/basic_string.h /^ mutable _Alloc_hider _M_dataplus;$/;" m class:std::basic_string access:private +_M_date_era_format cpp_src/locale_facets.h /^ const _CharT* _M_date_era_format;$/;" m struct:std::__timepunct_cache access:public +_M_date_format cpp_src/locale_facets.h /^ const _CharT* _M_date_format;$/;" m struct:std::__timepunct_cache access:public +_M_date_formats cpp_src/locale_facets.h /^ _M_date_formats(const _CharT** __date) const$/;" f class:std::__timepunct access:public signature:(const _CharT** __date) const +_M_date_time_era_format cpp_src/locale_facets.h /^ const _CharT* _M_date_time_era_format;$/;" m struct:std::__timepunct_cache access:public +_M_date_time_format cpp_src/locale_facets.h /^ const _CharT* _M_date_time_format;$/;" m struct:std::__timepunct_cache access:public +_M_date_time_formats cpp_src/locale_facets.h /^ _M_date_time_formats(const _CharT** __dt) const$/;" f class:std::__timepunct access:public signature:(const _CharT** __dt) const +_M_day1 cpp_src/locale_facets.h /^ const _CharT* _M_day1;$/;" m struct:std::__timepunct_cache access:public +_M_day2 cpp_src/locale_facets.h /^ const _CharT* _M_day2;$/;" m struct:std::__timepunct_cache access:public +_M_day3 cpp_src/locale_facets.h /^ const _CharT* _M_day3;$/;" m struct:std::__timepunct_cache access:public +_M_day4 cpp_src/locale_facets.h /^ const _CharT* _M_day4;$/;" m struct:std::__timepunct_cache access:public +_M_day5 cpp_src/locale_facets.h /^ const _CharT* _M_day5;$/;" m struct:std::__timepunct_cache access:public +_M_day6 cpp_src/locale_facets.h /^ const _CharT* _M_day6;$/;" m struct:std::__timepunct_cache access:public +_M_day7 cpp_src/locale_facets.h /^ const _CharT* _M_day7;$/;" m struct:std::__timepunct_cache access:public +_M_days cpp_src/locale_facets.h /^ _M_days(const _CharT** __days) const$/;" f class:std::__timepunct access:public signature:(const _CharT** __days) const +_M_days_abbreviated cpp_src/locale_facets.h /^ _M_days_abbreviated(const _CharT** __days) const$/;" f class:std::__timepunct access:public signature:(const _CharT** __days) const +_M_deallocate cpp_src/stl_bvector.h /^ _M_deallocate()$/;" f struct:std::_Bvector_base access:protected signature:() +_M_deallocate cpp_src/stl_vector.h /^ _M_deallocate(_Tp* __p, size_t __n)$/;" f struct:std::_Vector_base access:public signature:(_Tp* __p, size_t __n) +_M_deallocate_map cpp_src/stl_deque.h /^ _M_deallocate_map(_Tp** __p, size_t __n)$/;" f class:std::_Deque_base access:protected signature:(_Tp** __p, size_t __n) +_M_deallocate_node cpp_src/stl_deque.h /^ _M_deallocate_node(_Tp* __p)$/;" f class:std::_Deque_base access:protected signature:(_Tp* __p) +_M_decimal_point cpp_src/locale_facets.h /^ _CharT _M_decimal_point;$/;" m struct:std::__moneypunct_cache access:public +_M_decimal_point cpp_src/locale_facets.h /^ _CharT _M_decimal_point;$/;" m struct:std::__numpunct_cache access:public +_M_decrement_use cpp_src/gslice.h /^ _M_decrement_use()$/;" f struct:std::gslice::_Indexer access:public signature:() +_M_del cpp_src/locale_facets.h /^ bool _M_del;$/;" m class:std::ctype access:protected +_M_destroy cpp_src/basic_string.h /^ _M_destroy(const _Alloc&) throw();$/;" p struct:std::basic_string::_Rep access:public signature:(const _Alloc&) +_M_destroy cpp_src/basic_string.tcc /^ _M_destroy(const _Alloc& __a) throw ()$/;" f class:std::basic_string::_Rep signature:(const _Alloc& __a) +_M_destroy_data cpp_src/stl_deque.h /^ _M_destroy_data(iterator __first, iterator __last, const _Alloc1&)$/;" f class:std::deque access:protected signature:(iterator __first, iterator __last, const _Alloc1&) +_M_destroy_data cpp_src/stl_deque.h /^ _M_destroy_data(iterator __first, iterator __last,$/;" f class:std::deque access:protected signature:(iterator __first, iterator __last, const std::allocator<_Tp>&) +_M_destroy_data_aux cpp_src/deque.tcc /^ _M_destroy_data_aux(iterator __first, iterator __last)$/;" f class:std::deque signature:(iterator __first, iterator __last) +_M_destroy_data_aux cpp_src/stl_deque.h /^ _M_destroy_data_aux(iterator __first, iterator __last);$/;" p class:std::deque access:protected signature:(iterator __first, iterator __last) +_M_destroy_data_dispatch cpp_src/stl_deque.h /^ _M_destroy_data_dispatch(iterator __first, iterator __last, __false_type)$/;" f class:std::deque access:protected signature:(iterator __first, iterator __last, __false_type) +_M_destroy_data_dispatch cpp_src/stl_deque.h /^ _M_destroy_data_dispatch(iterator, iterator, __true_type) { }$/;" f class:std::deque access:protected signature:(iterator, iterator, __true_type) +_M_destroy_internal_buffer cpp_src/fstream /^ _M_destroy_internal_buffer() throw();$/;" p class:std::basic_filebuf file: access:protected signature:() +_M_destroy_internal_buffer cpp_src/fstream.tcc /^ _M_destroy_internal_buffer() throw()$/;" f class:std::basic_filebuf signature:() +_M_destroy_node cpp_src/stl_tree.h /^ _M_destroy_node(_Link_type __p)$/;" f class:std::_Rb_tree access:protected signature:(_Link_type __p) +_M_destroy_nodes cpp_src/stl_deque.h /^ void _M_destroy_nodes(_Tp** __nstart, _Tp** __nfinish);$/;" p class:std::_Deque_base access:protected signature:(_Tp** __nstart, _Tp** __nfinish) +_M_destroy_nodes cpp_src/stl_deque.h /^ _M_destroy_nodes(_Tp** __nstart, _Tp** __nfinish)$/;" f class:std::_Deque_base signature:(_Tp** __nstart, _Tp** __nfinish) +_M_destroy_pback cpp_src/fstream /^ _M_destroy_pback() throw()$/;" f class:std::basic_filebuf access:protected signature:() +_M_disjunct cpp_src/basic_string.h /^ _M_disjunct(const _CharT* __s) const$/;" f class:std::basic_string access:private signature:(const _CharT* __s) const +_M_dispose cpp_src/basic_string.h /^ _M_dispose(const _Alloc& __a)$/;" f struct:std::basic_string::_Rep access:public signature:(const _Alloc& __a) +_M_dispose_callbacks cpp_src/ios_base.h /^ _M_dispose_callbacks(void);$/;" p class:std::ios_base access:protected signature:(void) +_M_do_and cpp_src/bitset /^ _M_do_and(const _Base_bitset<0>&)$/;" f struct:std::_Base_bitset access:public signature:(const _Base_bitset<0>&) +_M_do_and cpp_src/bitset /^ _M_do_and(const _Base_bitset<1>& __x)$/;" f struct:std::_Base_bitset access:public signature:(const _Base_bitset<1>& __x) +_M_do_and cpp_src/bitset /^ _M_do_and(const _Base_bitset<_Nw>& __x)$/;" f struct:std::_Base_bitset access:public signature:(const _Base_bitset<_Nw>& __x) +_M_do_count cpp_src/bitset /^ _M_do_count() const$/;" f struct:std::_Base_bitset access:public signature:() const +_M_do_find_first cpp_src/bitset /^ _M_do_find_first(size_t __not_found) const$/;" f struct:std::_Base_bitset access:public signature:(size_t __not_found) const +_M_do_find_first cpp_src/bitset /^ _M_do_find_first(size_t __not_found) const;$/;" p struct:std::_Base_bitset file: access:public signature:(size_t __not_found) const +_M_do_find_first cpp_src/bitset /^ _M_do_find_first(size_t) const$/;" f struct:std::_Base_bitset access:public signature:(size_t) const +_M_do_find_first cpp_src/bitset /^ _Base_bitset<_Nw>::_M_do_find_first(size_t __not_found) const$/;" f class:std::_Base_bitset signature:(size_t __not_found) const +_M_do_find_next cpp_src/bitset /^ _M_do_find_next(size_t __prev, size_t __not_found) const$/;" f struct:std::_Base_bitset access:public signature:(size_t __prev, size_t __not_found) const +_M_do_find_next cpp_src/bitset /^ _M_do_find_next(size_t __prev, size_t __not_found) const;$/;" p struct:std::_Base_bitset file: access:public signature:(size_t __prev, size_t __not_found) const +_M_do_find_next cpp_src/bitset /^ _M_do_find_next(size_t, size_t) const$/;" f struct:std::_Base_bitset access:public signature:(size_t, size_t) const +_M_do_find_next cpp_src/bitset /^ _Base_bitset<_Nw>::_M_do_find_next(size_t __prev, size_t __not_found) const$/;" f class:std::_Base_bitset signature:(size_t __prev, size_t __not_found) const +_M_do_flip cpp_src/bitset /^ _M_do_flip()$/;" f struct:std::_Base_bitset access:public signature:() +_M_do_left_shift cpp_src/bitset /^ _M_do_left_shift(size_t __shift)$/;" f struct:std::_Base_bitset access:public signature:(size_t __shift) +_M_do_left_shift cpp_src/bitset /^ _M_do_left_shift(size_t __shift);$/;" p struct:std::_Base_bitset file: access:public signature:(size_t __shift) +_M_do_left_shift cpp_src/bitset /^ _M_do_left_shift(size_t)$/;" f struct:std::_Base_bitset access:public signature:(size_t) +_M_do_left_shift cpp_src/bitset /^ _Base_bitset<_Nw>::_M_do_left_shift(size_t __shift)$/;" f class:std::_Base_bitset signature:(size_t __shift) +_M_do_or cpp_src/bitset /^ _M_do_or(const _Base_bitset<0>&)$/;" f struct:std::_Base_bitset access:public signature:(const _Base_bitset<0>&) +_M_do_or cpp_src/bitset /^ _M_do_or(const _Base_bitset<1>& __x)$/;" f struct:std::_Base_bitset access:public signature:(const _Base_bitset<1>& __x) +_M_do_or cpp_src/bitset /^ _M_do_or(const _Base_bitset<_Nw>& __x)$/;" f struct:std::_Base_bitset access:public signature:(const _Base_bitset<_Nw>& __x) +_M_do_reset cpp_src/bitset /^ _M_do_reset()$/;" f struct:std::_Base_bitset access:public signature:() +_M_do_right_shift cpp_src/bitset /^ _M_do_right_shift(size_t __shift)$/;" f struct:std::_Base_bitset access:public signature:(size_t __shift) +_M_do_right_shift cpp_src/bitset /^ _M_do_right_shift(size_t __shift);$/;" p struct:std::_Base_bitset file: access:public signature:(size_t __shift) +_M_do_right_shift cpp_src/bitset /^ _M_do_right_shift(size_t)$/;" f struct:std::_Base_bitset access:public signature:(size_t) +_M_do_right_shift cpp_src/bitset /^ _Base_bitset<_Nw>::_M_do_right_shift(size_t __shift)$/;" f class:std::_Base_bitset signature:(size_t __shift) +_M_do_sanitize cpp_src/bitset /^ _M_do_sanitize()$/;" f class:std::bitset file: access:private signature:() +_M_do_set cpp_src/bitset /^ _M_do_set()$/;" f struct:std::_Base_bitset access:public signature:() +_M_do_to_ulong cpp_src/bitset /^ _M_do_to_ulong() const$/;" f struct:std::_Base_bitset access:public signature:() const +_M_do_to_ulong cpp_src/bitset /^ _M_do_to_ulong() const;$/;" p struct:std::_Base_bitset file: access:public signature:() const +_M_do_to_ulong cpp_src/bitset /^ _Base_bitset<_Nw>::_M_do_to_ulong() const$/;" f class:std::_Base_bitset signature:() const +_M_do_xor cpp_src/bitset /^ _M_do_xor(const _Base_bitset<0>&)$/;" f struct:std::_Base_bitset access:public signature:(const _Base_bitset<0>&) +_M_do_xor cpp_src/bitset /^ _M_do_xor(const _Base_bitset<1>& __x)$/;" f struct:std::_Base_bitset access:public signature:(const _Base_bitset<1>& __x) +_M_do_xor cpp_src/bitset /^ _M_do_xor(const _Base_bitset<_Nw>& __x)$/;" f struct:std::_Base_bitset access:public signature:(const _Base_bitset<_Nw>& __x) +_M_end cpp_src/stl_tree.h /^ _M_end() const$/;" f class:std::_Rb_tree access:protected signature:() const +_M_end cpp_src/stl_tree.h /^ _M_end()$/;" f class:std::_Rb_tree access:protected signature:() +_M_end_of_storage cpp_src/stl_bvector.h /^ _Bit_type* _M_end_of_storage;$/;" m struct:std::_Bvector_base::_Bvector_impl access:public +_M_end_of_storage cpp_src/stl_vector.h /^ _Tp* _M_end_of_storage;$/;" m struct:std::_Vector_base::_Vector_impl access:public +_M_equal cpp_src/stream_iterator.h /^ _M_equal(const istream_iterator& __x) const$/;" f class:std::istream_iterator access:public signature:(const istream_iterator& __x) const +_M_erase cpp_src/stl_list.h /^ _M_erase(iterator __position)$/;" f class:std::list access:protected signature:(iterator __position) +_M_erase cpp_src/stl_tree.h /^ _M_erase(_Link_type __x);$/;" p class:std::_Rb_tree access:private signature:(_Link_type __x) +_M_erase cpp_src/stl_tree.h /^ _M_erase(_Link_type __x)$/;" f class:std::_Rb_tree signature:(_Link_type __x) +_M_erase_at_begin cpp_src/stl_deque.h /^ _M_erase_at_begin(iterator __pos)$/;" f class:std::deque access:protected signature:(iterator __pos) +_M_erase_at_end cpp_src/stl_bvector.h /^ _M_erase_at_end(iterator __pos)$/;" f class:std::vector access:protected signature:(iterator __pos) +_M_erase_at_end cpp_src/stl_deque.h /^ _M_erase_at_end(iterator __pos)$/;" f class:std::deque access:protected signature:(iterator __pos) +_M_erase_at_end cpp_src/stl_vector.h /^ _M_erase_at_end(pointer __pos)$/;" f class:std::vector access:protected signature:(pointer __pos) +_M_exception cpp_src/ios_base.h /^ iostate _M_exception;$/;" m class:std::ios_base access:protected +_M_expr cpp_src/valarray_after.h /^ const _Dom& _M_expr;$/;" m class:std::_GBase access:private +_M_expr cpp_src/valarray_after.h /^ const _Dom& _M_expr;$/;" m class:std::_IBase access:private +_M_expr cpp_src/valarray_before.h /^ const _Arg& _M_expr;$/;" m class:std::_UnBase access:private +_M_expr cpp_src/valarray_before.h /^ const _Dom& _M_expr;$/;" m class:std::_FunBase access:private +_M_expr cpp_src/valarray_before.h /^ const _Dom& _M_expr;$/;" m class:std::_SBase access:private +_M_expr1 cpp_src/valarray_before.h /^ const _Clos& _M_expr1;$/;" m class:std::_BinBase2 access:private +_M_expr1 cpp_src/valarray_before.h /^ const _FirstArg& _M_expr1;$/;" m class:std::_BinBase access:private +_M_expr1 cpp_src/valarray_before.h /^ const _Vt& _M_expr1;$/;" m class:std::_BinBase1 access:private +_M_expr2 cpp_src/valarray_before.h /^ const _Clos& _M_expr2;$/;" m class:std::_BinBase1 access:private +_M_expr2 cpp_src/valarray_before.h /^ const _SecondArg& _M_expr2;$/;" m class:std::_BinBase access:private +_M_expr2 cpp_src/valarray_before.h /^ const _Vt& _M_expr2;$/;" m class:std::_BinBase2 access:private +_M_ext_buf cpp_src/fstream /^ char* _M_ext_buf;$/;" m class:std::basic_filebuf file: access:protected +_M_ext_buf_size cpp_src/fstream /^ streamsize _M_ext_buf_size;$/;" m class:std::basic_filebuf file: access:protected +_M_ext_end cpp_src/fstream /^ char* _M_ext_end;$/;" m class:std::basic_filebuf file: access:protected +_M_ext_next cpp_src/fstream /^ const char* _M_ext_next;$/;" m class:std::basic_filebuf file: access:protected +_M_extract cpp_src/istream /^ _M_extract(_ValueT& __v);$/;" p class:std::basic_istream file: access:protected signature:(_ValueT& __v) +_M_extract cpp_src/istream.tcc /^ _M_extract(_ValueT& __v)$/;" f class:std::basic_istream signature:(_ValueT& __v) +_M_extract cpp_src/istream.tcc /^ extern template istream& istream::_M_extract(bool&);$/;" p class:std::istream file: signature:(bool&) +_M_extract cpp_src/istream.tcc /^ extern template istream& istream::_M_extract(double&);$/;" p class:std::istream file: signature:(double&) +_M_extract cpp_src/istream.tcc /^ extern template istream& istream::_M_extract(float&);$/;" p class:std::istream file: signature:(float&) +_M_extract cpp_src/istream.tcc /^ extern template istream& istream::_M_extract(long double&);$/;" p class:std::istream file: signature:(long double&) +_M_extract cpp_src/istream.tcc /^ extern template istream& istream::_M_extract(long long&);$/;" p class:std::istream file: signature:(long long&) +_M_extract cpp_src/istream.tcc /^ extern template istream& istream::_M_extract(long&);$/;" p class:std::istream file: signature:(long&) +_M_extract cpp_src/istream.tcc /^ extern template istream& istream::_M_extract(unsigned int&); $/;" p class:std::istream file: signature:(unsigned int&) +_M_extract cpp_src/istream.tcc /^ extern template istream& istream::_M_extract(unsigned long long&);$/;" p class:std::istream file: signature:(unsigned long long&) +_M_extract cpp_src/istream.tcc /^ extern template istream& istream::_M_extract(unsigned long&);$/;" p class:std::istream file: signature:(unsigned long&) +_M_extract cpp_src/istream.tcc /^ extern template istream& istream::_M_extract(unsigned short&);$/;" p class:std::istream file: signature:(unsigned short&) +_M_extract cpp_src/istream.tcc /^ extern template istream& istream::_M_extract(void*&);$/;" p class:std::istream file: signature:(void*&) +_M_extract cpp_src/istream.tcc /^ extern template wistream& wistream::_M_extract(bool&);$/;" p class:std::wistream file: signature:(bool&) +_M_extract cpp_src/istream.tcc /^ extern template wistream& wistream::_M_extract(double&);$/;" p class:std::wistream file: signature:(double&) +_M_extract cpp_src/istream.tcc /^ extern template wistream& wistream::_M_extract(float&);$/;" p class:std::wistream file: signature:(float&) +_M_extract cpp_src/istream.tcc /^ extern template wistream& wistream::_M_extract(long double&);$/;" p class:std::wistream file: signature:(long double&) +_M_extract cpp_src/istream.tcc /^ extern template wistream& wistream::_M_extract(long long&);$/;" p class:std::wistream file: signature:(long long&) +_M_extract cpp_src/istream.tcc /^ extern template wistream& wistream::_M_extract(long&);$/;" p class:std::wistream file: signature:(long&) +_M_extract cpp_src/istream.tcc /^ extern template wistream& wistream::_M_extract(unsigned int&); $/;" p class:std::wistream file: signature:(unsigned int&) +_M_extract cpp_src/istream.tcc /^ extern template wistream& wistream::_M_extract(unsigned long long&);$/;" p class:std::wistream file: signature:(unsigned long long&) +_M_extract cpp_src/istream.tcc /^ extern template wistream& wistream::_M_extract(unsigned long&);$/;" p class:std::wistream file: signature:(unsigned long&) +_M_extract cpp_src/istream.tcc /^ extern template wistream& wistream::_M_extract(unsigned short&);$/;" p class:std::wistream file: signature:(unsigned short&) +_M_extract cpp_src/istream.tcc /^ extern template wistream& wistream::_M_extract(void*&);$/;" p class:std::wistream file: signature:(void*&) +_M_extract cpp_src/locale_facets.h /^ _M_extract(iter_type __s, iter_type __end, ios_base& __io,$/;" p class:std::money_get access:protected signature:(iter_type __s, iter_type __end, ios_base& __io, ios_base::iostate& __err, string& __digits) const +_M_extract cpp_src/locale_facets.tcc /^ _M_extract(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::money_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, string& __units) const +_M_extract_float cpp_src/locale_facets.h /^ _M_extract_float(iter_type, iter_type, ios_base&, ios_base::iostate&,$/;" p class:std::num_get access:protected signature:(iter_type, iter_type, ios_base&, ios_base::iostate&, string& __xtrc) const +_M_extract_float cpp_src/locale_facets.tcc /^ _M_extract_float(_InIter __beg, _InIter __end, ios_base& __io,$/;" f class:std::num_get signature:(_InIter __beg, _InIter __end, ios_base& __io, ios_base::iostate& __err, string& __xtrc) const +_M_extract_int cpp_src/locale_facets.h /^ _M_extract_int(iter_type, iter_type, ios_base&, ios_base::iostate&,$/;" p class:std::num_get access:protected signature:(iter_type, iter_type, ios_base&, ios_base::iostate&, _ValueT& __v) const +_M_extract_int cpp_src/locale_facets.tcc /^ _M_extract_int(_InIter __beg, _InIter __end, ios_base& __io,$/;" f class:std::num_get signature:(_InIter __beg, _InIter __end, ios_base& __io, ios_base::iostate& __err, _ValueT& __v) const +_M_extract_name cpp_src/locale_facets.h /^ _M_extract_name(iter_type __beg, iter_type __end, int& __member,$/;" p class:std::time_get access:protected signature:(iter_type __beg, iter_type __end, int& __member, const _CharT** __names, size_t __indexlen, ios_base& __io, ios_base::iostate& __err) const +_M_extract_name cpp_src/locale_facets.tcc /^ _M_extract_name(iter_type __beg, iter_type __end, int& __member,$/;" f class:std::time_get signature:(iter_type __beg, iter_type __end, int& __member, const _CharT** __names, size_t __indexlen, ios_base& __io, ios_base::iostate& __err) const +_M_extract_num cpp_src/locale_facets.h /^ _M_extract_num(iter_type __beg, iter_type __end, int& __member,$/;" p class:std::time_get access:protected signature:(iter_type __beg, iter_type __end, int& __member, int __min, int __max, size_t __len, ios_base& __io, ios_base::iostate& __err) const +_M_extract_num cpp_src/locale_facets.tcc /^ _M_extract_num(iter_type __beg, iter_type __end, int& __member,$/;" f class:std::time_get signature:(iter_type __beg, iter_type __end, int& __member, int __min, int __max, size_t __len, ios_base& __io, ios_base::iostate& __err) const +_M_extract_via_format cpp_src/locale_facets.h /^ _M_extract_via_format(iter_type __beg, iter_type __end, ios_base& __io,$/;" p class:std::time_get access:protected signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, tm* __tm, const _CharT* __format) const +_M_extract_via_format cpp_src/locale_facets.tcc /^ _M_extract_via_format(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::time_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, tm* __tm, const _CharT* __format) const +_M_f cpp_src/stl_function.h /^ _Ret (_Tp::*_M_f)() const;$/;" m class:std::const_mem_fun_ref_t access:private +_M_f cpp_src/stl_function.h /^ _Ret (_Tp::*_M_f)() const;$/;" m class:std::const_mem_fun_t access:private +_M_f cpp_src/stl_function.h /^ _Ret (_Tp::*_M_f)();$/;" m class:std::mem_fun_ref_t access:private +_M_f cpp_src/stl_function.h /^ _Ret (_Tp::*_M_f)();$/;" m class:std::mem_fun_t access:private +_M_f cpp_src/stl_function.h /^ _Ret (_Tp::*_M_f)(_Arg) const;$/;" m class:std::const_mem_fun1_ref_t access:private +_M_f cpp_src/stl_function.h /^ _Ret (_Tp::*_M_f)(_Arg) const;$/;" m class:std::const_mem_fun1_t access:private +_M_f cpp_src/stl_function.h /^ _Ret (_Tp::*_M_f)(_Arg);$/;" m class:std::mem_fun1_ref_t access:private +_M_f cpp_src/stl_function.h /^ _Ret (_Tp::*_M_f)(_Arg);$/;" m class:std::mem_fun1_t access:private +_M_facets cpp_src/locale_classes.h /^ const facet** _M_facets;$/;" m class:std::locale::_Impl access:private +_M_facets_size cpp_src/locale_classes.h /^ size_t _M_facets_size;$/;" m class:std::locale::_Impl access:private +_M_failed cpp_src/streambuf_iterator.h /^ bool _M_failed;$/;" m class:std::ostreambuf_iterator access:private +_M_falsename cpp_src/locale_facets.h /^ const _CharT* _M_falsename;$/;" m struct:std::__numpunct_cache access:public +_M_falsename_size cpp_src/locale_facets.h /^ size_t _M_falsename_size;$/;" m struct:std::__numpunct_cache access:public +_M_file cpp_src/fstream /^ __file_type _M_file;$/;" m class:std::basic_filebuf file: access:protected +_M_filebuf cpp_src/fstream /^ __filebuf_type _M_filebuf;$/;" m class:std::basic_fstream file: access:private +_M_filebuf cpp_src/fstream /^ __filebuf_type _M_filebuf;$/;" m class:std::basic_ifstream file: access:private +_M_filebuf cpp_src/fstream /^ __filebuf_type _M_filebuf;$/;" m class:std::basic_ofstream file: access:private +_M_fill cpp_src/basic_ios.h /^ mutable char_type _M_fill;$/;" m class:std::basic_ios access:protected +_M_fill_assign cpp_src/list.tcc /^ _M_fill_assign(size_type __n, const value_type& __val)$/;" f class:std::list signature:(size_type __n, const value_type& __val) +_M_fill_assign cpp_src/stl_bvector.h /^ _M_fill_assign(size_t __n, bool __x)$/;" f class:std::vector access:protected signature:(size_t __n, bool __x) +_M_fill_assign cpp_src/stl_deque.h /^ _M_fill_assign(size_type __n, const value_type& __val)$/;" f class:std::deque access:protected signature:(size_type __n, const value_type& __val) +_M_fill_assign cpp_src/stl_list.h /^ _M_fill_assign(size_type __n, const value_type& __val);$/;" p class:std::list access:protected signature:(size_type __n, const value_type& __val) +_M_fill_assign cpp_src/stl_vector.h /^ _M_fill_assign(size_type __n, const value_type& __val);$/;" p class:std::vector access:protected signature:(size_type __n, const value_type& __val) +_M_fill_assign cpp_src/vector.tcc /^ _M_fill_assign(size_t __n, const value_type& __val)$/;" f class:std::vector signature:(size_t __n, const value_type& __val) +_M_fill_init cpp_src/basic_ios.h /^ mutable bool _M_fill_init;$/;" m class:std::basic_ios access:protected +_M_fill_initialize cpp_src/deque.tcc /^ _M_fill_initialize(const value_type& __value)$/;" f class:std::deque signature:(const value_type& __value) +_M_fill_initialize cpp_src/stl_deque.h /^ _M_fill_initialize(const value_type& __value);$/;" p class:std::deque access:protected signature:(const value_type& __value) +_M_fill_initialize cpp_src/stl_list.h /^ _M_fill_initialize(size_type __n, const value_type& __x)$/;" f class:std::list access:protected signature:(size_type __n, const value_type& __x) +_M_fill_insert cpp_src/deque.tcc /^ _M_fill_insert(iterator __pos, size_type __n, const value_type& __x)$/;" f class:std::deque signature:(iterator __pos, size_type __n, const value_type& __x) +_M_fill_insert cpp_src/stl_bvector.h /^ _M_fill_insert(iterator __position, size_type __n, bool __x)$/;" f class:std::vector access:protected signature:(iterator __position, size_type __n, bool __x) +_M_fill_insert cpp_src/stl_deque.h /^ _M_fill_insert(iterator __pos, size_type __n, const value_type& __x);$/;" p class:std::deque access:protected signature:(iterator __pos, size_type __n, const value_type& __x) +_M_fill_insert cpp_src/stl_vector.h /^ _M_fill_insert(iterator __pos, size_type __n, const value_type& __x);$/;" p class:std::vector access:protected signature:(iterator __pos, size_type __n, const value_type& __x) +_M_fill_insert cpp_src/vector.tcc /^ _M_fill_insert(iterator __position, size_type __n, const value_type& __x)$/;" f class:std::vector signature:(iterator __position, size_type __n, const value_type& __x) +_M_find cpp_src/locale_facets.h /^ _M_find(const _CharT2* __zero, size_t __len, _CharT2 __c) const$/;" f class:std::num_get access:protected signature:(const _CharT2* __zero, size_t __len, _CharT2 __c) const +_M_find cpp_src/locale_facets.h /^ _M_find(const _CharT2*, size_t __len, _CharT2 __c) const$/;" f class:std::num_get access:protected signature:(const _CharT2*, size_t __len, _CharT2 __c) const +_M_finish cpp_src/stl_bvector.h /^ _Bit_iterator _M_finish;$/;" m struct:std::_Bvector_base::_Bvector_impl access:public +_M_finish cpp_src/stl_deque.h /^ iterator _M_finish;$/;" m struct:std::_Deque_base::_Deque_impl access:public +_M_finish cpp_src/stl_vector.h /^ _Tp* _M_finish;$/;" m struct:std::_Vector_base::_Vector_impl access:public +_M_first cpp_src/stl_deque.h /^ _Tp* _M_first;$/;" m struct:std::_Deque_iterator access:public +_M_flags cpp_src/ios_base.h /^ fmtflags _M_flags;$/;" m class:std::ios_base access:protected +_M_fn cpp_src/ios_base.h /^ ios_base::event_callback _M_fn;$/;" m struct:std::ios_base::_Callback_list access:public +_M_frac_digits cpp_src/locale_facets.h /^ int _M_frac_digits;$/;" m struct:std::__moneypunct_cache access:public +_M_func cpp_src/valarray_before.h /^ value_type (*_M_func)(_Arg);$/;" m class:std::_FunBase access:private +_M_gcount cpp_src/istream /^ streamsize _M_gcount;$/;" m class:std::basic_istream file: access:protected +_M_get cpp_src/streambuf_iterator.h /^ _M_get() const$/;" f class:std::istreambuf_iterator access:private signature:() const +_M_get_Bit_allocator cpp_src/stl_bvector.h /^ _M_get_Bit_allocator() const$/;" f struct:std::_Bvector_base access:public signature:() const +_M_get_Bit_allocator cpp_src/stl_bvector.h /^ _M_get_Bit_allocator()$/;" f struct:std::_Bvector_base access:public signature:() +_M_get_Node_allocator cpp_src/stl_list.h /^ _M_get_Node_allocator() const$/;" f class:std::_List_base access:public signature:() const +_M_get_Node_allocator cpp_src/stl_list.h /^ _M_get_Node_allocator()$/;" f class:std::_List_base access:public signature:() +_M_get_Node_allocator cpp_src/stl_tree.h /^ _M_get_Node_allocator() const$/;" f class:std::_Rb_tree access:public signature:() const +_M_get_Node_allocator cpp_src/stl_tree.h /^ _M_get_Node_allocator()$/;" f class:std::_Rb_tree access:public signature:() +_M_get_Tp_allocator cpp_src/stl_deque.h /^ _M_get_Tp_allocator() const$/;" f class:std::_Deque_base access:protected signature:() const +_M_get_Tp_allocator cpp_src/stl_deque.h /^ _M_get_Tp_allocator()$/;" f class:std::_Deque_base access:protected signature:() +_M_get_Tp_allocator cpp_src/stl_list.h /^ _M_get_Tp_allocator() const$/;" f class:std::_List_base access:public signature:() const +_M_get_Tp_allocator cpp_src/stl_vector.h /^ _M_get_Tp_allocator() const$/;" f struct:std::_Vector_base access:public signature:() const +_M_get_Tp_allocator cpp_src/stl_vector.h /^ _M_get_Tp_allocator()$/;" f struct:std::_Vector_base access:public signature:() +_M_get_map_allocator cpp_src/stl_deque.h /^ _M_get_map_allocator() const$/;" f class:std::_Deque_base access:protected signature:() const +_M_get_node cpp_src/stl_list.h /^ _M_get_node()$/;" f class:std::_List_base access:protected signature:() +_M_get_node cpp_src/stl_tree.h /^ _M_get_node()$/;" f class:std::_Rb_tree access:protected signature:() +_M_getloc cpp_src/ios_base.h /^ _M_getloc() const { return _M_ios_locale; }$/;" f class:std::ios_base access:public signature:() const +_M_getword cpp_src/bitset /^ _M_getword(size_t __pos) const$/;" f struct:std::_Base_bitset access:public signature:(size_t __pos) const +_M_getword cpp_src/bitset /^ _M_getword(size_t __pos)$/;" f struct:std::_Base_bitset access:public signature:(size_t __pos) +_M_getword cpp_src/bitset /^ _M_getword(size_t) const$/;" f struct:std::_Base_bitset access:public signature:(size_t) const +_M_getword cpp_src/bitset /^ _M_getword(size_t)$/;" f struct:std::_Base_bitset access:public signature:(size_t) +_M_grab cpp_src/basic_string.h /^ _M_grab(const _Alloc& __alloc1, const _Alloc& __alloc2)$/;" f struct:std::basic_string::_Rep access:public signature:(const _Alloc& __alloc1, const _Alloc& __alloc2) +_M_group_float cpp_src/locale_facets.h /^ _M_group_float(const char* __grouping, size_t __grouping_size,$/;" p class:std::num_put access:protected signature:(const char* __grouping, size_t __grouping_size, char_type __sep, const char_type* __p, char_type* __new, char_type* __cs, int& __len) const +_M_group_float cpp_src/locale_facets.tcc /^ _M_group_float(const char* __grouping, size_t __grouping_size,$/;" f class:std::num_put signature:(const char* __grouping, size_t __grouping_size, _CharT __sep, const _CharT* __p, _CharT* __new, _CharT* __cs, int& __len) const +_M_group_int cpp_src/locale_facets.h /^ _M_group_int(const char* __grouping, size_t __grouping_size,$/;" p class:std::num_put access:protected signature:(const char* __grouping, size_t __grouping_size, char_type __sep, ios_base& __io, char_type* __new, char_type* __cs, int& __len) const +_M_group_int cpp_src/locale_facets.tcc /^ _M_group_int(const char* __grouping, size_t __grouping_size, _CharT __sep,$/;" f class:std::num_put signature:(const char* __grouping, size_t __grouping_size, _CharT __sep, ios_base&, _CharT* __new, _CharT* __cs, int& __len) const +_M_grouping cpp_src/locale_facets.h /^ const char* _M_grouping;$/;" m struct:std::__moneypunct_cache access:public +_M_grouping cpp_src/locale_facets.h /^ const char* _M_grouping;$/;" m struct:std::__numpunct_cache access:public +_M_grouping_size cpp_src/locale_facets.h /^ size_t _M_grouping_size;$/;" m struct:std::__moneypunct_cache access:public +_M_grouping_size cpp_src/locale_facets.h /^ size_t _M_grouping_size;$/;" m struct:std::__numpunct_cache access:public +_M_grow_words cpp_src/ios_base.h /^ _M_grow_words(int __index, bool __iword);$/;" p class:std::ios_base access:protected signature:(int __index, bool __iword) +_M_header cpp_src/stl_tree.h /^ _Rb_tree_node_base _M_header;$/;" m struct:std::_Rb_tree::_Rb_tree_impl access:public +_M_hiword cpp_src/bitset /^ _M_hiword() const$/;" f struct:std::_Base_bitset access:public signature:() const +_M_hiword cpp_src/bitset /^ _M_hiword()$/;" f struct:std::_Base_bitset access:public signature:() +_M_ibegin cpp_src/basic_string.h /^ _M_ibegin() const$/;" f class:std::basic_string access:private signature:() const +_M_id cpp_src/locale_classes.h /^ _M_id() const;$/;" p class:std::locale::id access:public signature:() const +_M_iend cpp_src/basic_string.h /^ _M_iend() const$/;" f class:std::basic_string access:private signature:() const +_M_imag cpp_src/complex /^ _Tp _M_imag;$/;" m struct:std::complex file: access:private +_M_impl cpp_src/locale_classes.h /^ _Impl* _M_impl;$/;" m class:std::locale access:private +_M_impl cpp_src/stl_bvector.h /^ _Bvector_impl _M_impl;$/;" m struct:std::_Bvector_base access:protected +_M_impl cpp_src/stl_deque.h /^ _Deque_impl _M_impl;$/;" m class:std::_Deque_base access:protected +_M_impl cpp_src/stl_list.h /^ _List_impl _M_impl;$/;" m class:std::_List_base access:protected +_M_impl cpp_src/stl_tree.h /^ _Rb_tree_impl<_Compare> _M_impl;$/;" m class:std::_Rb_tree access:protected +_M_impl cpp_src/stl_vector.h /^ _Vector_impl _M_impl;$/;" m struct:std::_Vector_base access:public +_M_in_beg cpp_src/streambuf /^ char_type* _M_in_beg; \/\/ Start of get area. $/;" m class:std::basic_streambuf file: access:protected +_M_in_cur cpp_src/streambuf /^ char_type* _M_in_cur; \/\/ Current read area. $/;" m class:std::basic_streambuf file: access:protected +_M_in_end cpp_src/streambuf /^ char_type* _M_in_end; \/\/ End of get area. $/;" m class:std::basic_streambuf file: access:protected +_M_incr cpp_src/stl_bvector.h /^ _M_incr(ptrdiff_t __i)$/;" f struct:std::_Bit_iterator_base access:public signature:(ptrdiff_t __i) +_M_increment_use cpp_src/gslice.h /^ _M_increment_use()$/;" f struct:std::gslice::_Indexer access:public signature:() +_M_index cpp_src/gslice.h /^ valarray _M_index; \/\/ Linear array of referenced indices$/;" m struct:std::gslice::_Indexer access:public +_M_index cpp_src/gslice.h /^ _Indexer* _M_index;$/;" m class:std::gslice access:private +_M_index cpp_src/gslice_array.h /^ const valarray& _M_index;$/;" m class:std::gslice_array access:private +_M_index cpp_src/indirect_array.h /^ const _Array _M_index;$/;" m class:std::indirect_array access:private +_M_index cpp_src/ios_base.h /^ int _M_index;$/;" m struct:std::ios_base::_Callback_list access:public +_M_index cpp_src/locale_classes.h /^ mutable size_t _M_index;$/;" m class:std::locale::id access:private +_M_index cpp_src/valarray_after.h /^ const valarray& _M_index;$/;" m class:std::_GBase access:private +_M_index cpp_src/valarray_after.h /^ const valarray& _M_index;$/;" m class:std::_IBase access:private +_M_init cpp_src/ios_base.h /^ _M_init();$/;" p class:std::ios_base access:protected signature:() +_M_init cpp_src/stl_list.h /^ _M_init()$/;" f class:std::_List_base access:public signature:() +_M_init_facet cpp_src/locale_classes.h /^ _M_init_facet(_Facet* __facet)$/;" f class:std::locale::_Impl access:private signature:(_Facet* __facet) +_M_initialize cpp_src/stl_bvector.h /^ _M_initialize(size_type __n)$/;" f class:std::vector access:protected signature:(size_type __n) +_M_initialize_buffer cpp_src/stl_tempbuf.h /^ _M_initialize_buffer(const _Tp& __val, __false_type)$/;" f class:std::_Temporary_buffer access:protected signature:(const _Tp& __val, __false_type) +_M_initialize_buffer cpp_src/stl_tempbuf.h /^ _M_initialize_buffer(const _Tp&, __true_type) { }$/;" f class:std::_Temporary_buffer access:protected signature:(const _Tp&, __true_type) +_M_initialize_ctype cpp_src/locale_facets.h /^ _M_initialize_ctype();$/;" p class:std::ctype access:protected signature:() +_M_initialize_dispatch cpp_src/stl_bvector.h /^ _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,$/;" f class:std::vector access:protected signature:(_InputIterator __first, _InputIterator __last, __false_type) +_M_initialize_dispatch cpp_src/stl_bvector.h /^ _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type)$/;" f class:std::vector access:protected signature:(_Integer __n, _Integer __x, __true_type) +_M_initialize_dispatch cpp_src/stl_deque.h /^ _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,$/;" f class:std::deque access:protected signature:(_InputIterator __first, _InputIterator __last, __false_type) +_M_initialize_dispatch cpp_src/stl_deque.h /^ _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type)$/;" f class:std::deque access:protected signature:(_Integer __n, _Integer __x, __true_type) +_M_initialize_dispatch cpp_src/stl_list.h /^ _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,$/;" f class:std::list access:protected signature:(_InputIterator __first, _InputIterator __last, __false_type) +_M_initialize_dispatch cpp_src/stl_list.h /^ _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type)$/;" f class:std::list access:protected signature:(_Integer __n, _Integer __x, __true_type) +_M_initialize_dispatch cpp_src/stl_vector.h /^ _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,$/;" f class:std::vector access:protected signature:(_InputIterator __first, _InputIterator __last, __false_type) +_M_initialize_dispatch cpp_src/stl_vector.h /^ _M_initialize_dispatch(_Integer __n, _Integer __value, __true_type)$/;" f class:std::vector access:protected signature:(_Integer __n, _Integer __value, __true_type) +_M_initialize_map cpp_src/stl_deque.h /^ void _M_initialize_map(size_t);$/;" p class:std::_Deque_base access:protected signature:(size_t) +_M_initialize_map cpp_src/stl_deque.h /^ _M_initialize_map(size_t __num_elements)$/;" f class:std::_Deque_base signature:(size_t __num_elements) +_M_initialize_moneypunct cpp_src/locale_facets.h /^ _M_initialize_moneypunct(__c_locale __cloc = NULL,$/;" p class:std::moneypunct access:protected signature:(__c_locale __cloc = NULL, const char* __name = NULL) +_M_initialize_moneypunct cpp_src/locale_facets.h /^ moneypunct::_M_initialize_moneypunct(__c_locale, const char*);$/;" p class:std::moneypunct signature:(__c_locale, const char*) +_M_initialize_moneypunct cpp_src/locale_facets.h /^ moneypunct::_M_initialize_moneypunct(__c_locale, const char*);$/;" p class:std::moneypunct signature:(__c_locale, const char*) +_M_initialize_moneypunct cpp_src/locale_facets.h /^ moneypunct::_M_initialize_moneypunct(__c_locale,$/;" p class:std::moneypunct signature:(__c_locale, const char*) +_M_initialize_moneypunct cpp_src/locale_facets.h /^ moneypunct::_M_initialize_moneypunct(__c_locale,$/;" p class:std::moneypunct signature:(__c_locale, const char*) +_M_initialize_numpunct cpp_src/locale_facets.h /^ _M_initialize_numpunct(__c_locale __cloc = NULL);$/;" p class:std::numpunct access:protected signature:(__c_locale __cloc = NULL) +_M_initialize_numpunct cpp_src/locale_facets.h /^ numpunct::_M_initialize_numpunct(__c_locale __cloc);$/;" p class:std::numpunct signature:(__c_locale __cloc) +_M_initialize_numpunct cpp_src/locale_facets.h /^ numpunct::_M_initialize_numpunct(__c_locale __cloc);$/;" p class:std::numpunct signature:(__c_locale __cloc) +_M_initialize_range cpp_src/stl_bvector.h /^ _M_initialize_range(_ForwardIterator __first, _ForwardIterator __last,$/;" f class:std::vector access:protected signature:(_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) +_M_initialize_range cpp_src/stl_bvector.h /^ _M_initialize_range(_InputIterator __first, _InputIterator __last,$/;" f class:std::vector access:protected signature:(_InputIterator __first, _InputIterator __last, std::input_iterator_tag) +_M_initialize_timepunct cpp_src/locale_facets.h /^ _M_initialize_timepunct(__c_locale __cloc = NULL);$/;" p class:std::__timepunct access:protected signature:(__c_locale __cloc = NULL) +_M_initialize_timepunct cpp_src/locale_facets.h /^ __timepunct::_M_initialize_timepunct(__c_locale __cloc);$/;" p class:std::__timepunct signature:(__c_locale __cloc) +_M_initialize_timepunct cpp_src/locale_facets.h /^ __timepunct::_M_initialize_timepunct(__c_locale __cloc);$/;" p class:std::__timepunct signature:(__c_locale __cloc) +_M_insert cpp_src/locale_facets.h /^ _M_insert(iter_type __s, ios_base& __io, char_type __fill,$/;" p class:std::money_put access:protected signature:(iter_type __s, ios_base& __io, char_type __fill, const string_type& __digits) const +_M_insert cpp_src/locale_facets.tcc /^ _M_insert(iter_type __s, ios_base& __io, char_type __fill,$/;" f class:std::money_put signature:(iter_type __s, ios_base& __io, char_type __fill, const string_type& __digits) const +_M_insert cpp_src/ostream /^ _M_insert(_ValueT __v);$/;" p class:std::basic_ostream file: access:protected signature:(_ValueT __v) +_M_insert cpp_src/ostream.tcc /^ _M_insert(_ValueT __v)$/;" f class:std::basic_ostream signature:(_ValueT __v) +_M_insert cpp_src/ostream.tcc /^ extern template ostream& ostream::_M_insert(bool);$/;" p class:std::ostream file: signature:(bool) +_M_insert cpp_src/ostream.tcc /^ extern template ostream& ostream::_M_insert(const void*);$/;" p class:std::ostream file: signature:(const void*) +_M_insert cpp_src/ostream.tcc /^ extern template ostream& ostream::_M_insert(double);$/;" p class:std::ostream file: signature:(double) +_M_insert cpp_src/ostream.tcc /^ extern template ostream& ostream::_M_insert(long double);$/;" p class:std::ostream file: signature:(long double) +_M_insert cpp_src/ostream.tcc /^ extern template ostream& ostream::_M_insert(long long);$/;" p class:std::ostream file: signature:(long long) +_M_insert cpp_src/ostream.tcc /^ extern template ostream& ostream::_M_insert(long);$/;" p class:std::ostream file: signature:(long) +_M_insert cpp_src/ostream.tcc /^ extern template ostream& ostream::_M_insert(unsigned long long);$/;" p class:std::ostream file: signature:(unsigned long long) +_M_insert cpp_src/ostream.tcc /^ extern template ostream& ostream::_M_insert(unsigned long);$/;" p class:std::ostream file: signature:(unsigned long) +_M_insert cpp_src/ostream.tcc /^ extern template wostream& wostream::_M_insert(bool);$/;" p class:std::wostream file: signature:(bool) +_M_insert cpp_src/ostream.tcc /^ extern template wostream& wostream::_M_insert(const void*);$/;" p class:std::wostream file: signature:(const void*) +_M_insert cpp_src/ostream.tcc /^ extern template wostream& wostream::_M_insert(double);$/;" p class:std::wostream file: signature:(double) +_M_insert cpp_src/ostream.tcc /^ extern template wostream& wostream::_M_insert(long double);$/;" p class:std::wostream file: signature:(long double) +_M_insert cpp_src/ostream.tcc /^ extern template wostream& wostream::_M_insert(long long);$/;" p class:std::wostream file: signature:(long long) +_M_insert cpp_src/ostream.tcc /^ extern template wostream& wostream::_M_insert(long);$/;" p class:std::wostream file: signature:(long) +_M_insert cpp_src/ostream.tcc /^ extern template wostream& wostream::_M_insert(unsigned long long);$/;" p class:std::wostream file: signature:(unsigned long long) +_M_insert cpp_src/ostream.tcc /^ extern template wostream& wostream::_M_insert(unsigned long);$/;" p class:std::wostream file: signature:(unsigned long) +_M_insert cpp_src/stl_list.h /^ _M_insert(iterator __position, const value_type& __x)$/;" f class:std::list access:protected signature:(iterator __position, const value_type& __x) +_M_insert cpp_src/stl_tree.h /^ _M_insert(_Base_ptr __x, _Base_ptr __y, const value_type& __v);$/;" p class:std::_Rb_tree access:private signature:(_Base_ptr __x, _Base_ptr __y, const value_type& __v) +_M_insert cpp_src/stl_tree.h /^ _M_insert(_Const_Base_ptr __x, _Const_Base_ptr __y,$/;" p class:std::_Rb_tree access:private signature:(_Const_Base_ptr __x, _Const_Base_ptr __y, const value_type& __v) +_M_insert cpp_src/stl_tree.h /^ _M_insert(_Base_ptr __x, _Base_ptr __p, const _Val& __v)$/;" f class:std::_Rb_tree signature:(_Base_ptr __x, _Base_ptr __p, const _Val& __v) +_M_insert cpp_src/stl_tree.h /^ _M_insert(_Const_Base_ptr __x, _Const_Base_ptr __p, const _Val& __v)$/;" f class:std::_Rb_tree signature:(_Const_Base_ptr __x, _Const_Base_ptr __p, const _Val& __v) +_M_insert_aux cpp_src/deque.tcc /^ _M_insert_aux(iterator __pos,$/;" f class:std::deque signature:(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, size_type __n) +_M_insert_aux cpp_src/deque.tcc /^ _M_insert_aux(iterator __pos, const value_type& __x)$/;" f class:std::deque signature:(iterator __pos, const value_type& __x) +_M_insert_aux cpp_src/deque.tcc /^ _M_insert_aux(iterator __pos, size_type __n, const value_type& __x)$/;" f class:std::deque signature:(iterator __pos, size_type __n, const value_type& __x) +_M_insert_aux cpp_src/stl_bvector.h /^ _M_insert_aux(iterator __position, bool __x)$/;" f class:std::vector access:protected signature:(iterator __position, bool __x) +_M_insert_aux cpp_src/stl_deque.h /^ _M_insert_aux(iterator __pos,$/;" p class:std::deque access:protected signature:(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, size_type __n) +_M_insert_aux cpp_src/stl_deque.h /^ _M_insert_aux(iterator __pos, const value_type& __x);$/;" p class:std::deque access:protected signature:(iterator __pos, const value_type& __x) +_M_insert_aux cpp_src/stl_deque.h /^ _M_insert_aux(iterator __pos, size_type __n, const value_type& __x);$/;" p class:std::deque access:protected signature:(iterator __pos, size_type __n, const value_type& __x) +_M_insert_aux cpp_src/stl_vector.h /^ _M_insert_aux(iterator __position, const value_type& __x);$/;" p class:std::vector access:protected signature:(iterator __position, const value_type& __x) +_M_insert_aux cpp_src/vector.tcc /^ _M_insert_aux(iterator __position, const _Tp& __x)$/;" f class:std::vector signature:(iterator __position, const _Tp& __x) +_M_insert_dispatch cpp_src/stl_bvector.h /^ _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x,$/;" f class:std::vector access:protected signature:(iterator __pos, _Integer __n, _Integer __x, __true_type) +_M_insert_dispatch cpp_src/stl_bvector.h /^ _M_insert_dispatch(iterator __pos,$/;" f class:std::vector access:protected signature:(iterator __pos, _InputIterator __first, _InputIterator __last, __false_type) +_M_insert_dispatch cpp_src/stl_deque.h /^ _M_insert_dispatch(iterator __pos,$/;" f class:std::deque access:protected signature:(iterator __pos, _InputIterator __first, _InputIterator __last, __false_type) +_M_insert_dispatch cpp_src/stl_deque.h /^ _M_insert_dispatch(iterator __pos,$/;" f class:std::deque access:protected signature:(iterator __pos, _Integer __n, _Integer __x, __true_type) +_M_insert_dispatch cpp_src/stl_vector.h /^ _M_insert_dispatch(iterator __pos, _InputIterator __first,$/;" f class:std::vector access:protected signature:(iterator __pos, _InputIterator __first, _InputIterator __last, __false_type) +_M_insert_dispatch cpp_src/stl_vector.h /^ _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val,$/;" f class:std::vector access:protected signature:(iterator __pos, _Integer __n, _Integer __val, __true_type) +_M_insert_equal cpp_src/stl_tree.h /^ _M_insert_equal(_InputIterator __first, _InputIterator __last);$/;" p class:std::_Rb_tree access:public signature:(_InputIterator __first, _InputIterator __last) +_M_insert_equal cpp_src/stl_tree.h /^ _M_insert_equal(_II __first, _II __last)$/;" f class:std::_Rb_tree signature:(_II __first, _II __last) +_M_insert_equal cpp_src/stl_tree.h /^ _M_insert_equal(const value_type& __x);$/;" p class:std::_Rb_tree access:public signature:(const value_type& __x) +_M_insert_equal cpp_src/stl_tree.h /^ _M_insert_equal(const_iterator __position, const value_type& __x);$/;" p class:std::_Rb_tree access:public signature:(const_iterator __position, const value_type& __x) +_M_insert_equal cpp_src/stl_tree.h /^ _M_insert_equal(iterator __position, const value_type& __x);$/;" p class:std::_Rb_tree access:public signature:(iterator __position, const value_type& __x) +_M_insert_equal cpp_src/stl_tree.h /^ _M_insert_equal(const _Val& __v)$/;" f class:std::_Rb_tree signature:(const _Val& __v) +_M_insert_equal cpp_src/stl_tree.h /^ _M_insert_equal(const_iterator __position, const _Val& __v)$/;" f class:std::_Rb_tree signature:(const_iterator __position, const _Val& __v) +_M_insert_equal cpp_src/stl_tree.h /^ _M_insert_equal(iterator __position, const _Val& __v)$/;" f class:std::_Rb_tree signature:(iterator __position, const _Val& __v) +_M_insert_equal_lower cpp_src/stl_tree.h /^ _M_insert_equal_lower(const value_type& __x);$/;" p class:std::_Rb_tree access:public signature:(const value_type& __x) +_M_insert_equal_lower cpp_src/stl_tree.h /^ _M_insert_equal_lower(const _Val& __v)$/;" f class:std::_Rb_tree signature:(const _Val& __v) +_M_insert_float cpp_src/locale_facets.h /^ _M_insert_float(iter_type, ios_base& __io, char_type __fill,$/;" p class:std::num_put access:protected signature:(iter_type, ios_base& __io, char_type __fill, char __mod, _ValueT __v) const +_M_insert_float cpp_src/locale_facets.tcc /^ _M_insert_float(_OutIter __s, ios_base& __io, _CharT __fill, char __mod,$/;" f class:std::num_put signature:(_OutIter __s, ios_base& __io, _CharT __fill, char __mod, _ValueT __v) const +_M_insert_int cpp_src/locale_facets.h /^ _M_insert_int(iter_type, ios_base& __io, char_type __fill,$/;" p class:std::num_put access:protected signature:(iter_type, ios_base& __io, char_type __fill, _ValueT __v) const +_M_insert_int cpp_src/locale_facets.tcc /^ _M_insert_int(_OutIter __s, ios_base& __io, _CharT __fill,$/;" f class:std::num_put signature:(_OutIter __s, ios_base& __io, _CharT __fill, _ValueT __v) const +_M_insert_lower cpp_src/stl_tree.h /^ _M_insert_lower(_Base_ptr __x, _Base_ptr __y, const value_type& __v);$/;" p class:std::_Rb_tree access:private signature:(_Base_ptr __x, _Base_ptr __y, const value_type& __v) +_M_insert_lower cpp_src/stl_tree.h /^ _M_insert_lower(_Base_ptr __x, _Base_ptr __p, const _Val& __v)$/;" f class:std::_Rb_tree signature:(_Base_ptr __x, _Base_ptr __p, const _Val& __v) +_M_insert_range cpp_src/stl_bvector.h /^ _M_insert_range(iterator __pos, _InputIterator __first, $/;" f class:std::vector access:protected signature:(iterator __pos, _InputIterator __first, _InputIterator __last, std::input_iterator_tag) +_M_insert_range cpp_src/stl_bvector.h /^ _M_insert_range(iterator __position, _ForwardIterator __first, $/;" f class:std::vector access:protected signature:(iterator __position, _ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) +_M_insert_unique cpp_src/stl_tree.h /^ _M_insert_unique(_InputIterator __first, _InputIterator __last);$/;" p class:std::_Rb_tree access:public signature:(_InputIterator __first, _InputIterator __last) +_M_insert_unique cpp_src/stl_tree.h /^ _M_insert_unique(_II __first, _II __last)$/;" f class:std::_Rb_tree signature:(_II __first, _II __last) +_M_insert_unique cpp_src/stl_tree.h /^ _M_insert_unique(const value_type& __x);$/;" p class:std::_Rb_tree access:public signature:(const value_type& __x) +_M_insert_unique cpp_src/stl_tree.h /^ _M_insert_unique(const_iterator __position, const value_type& __x);$/;" p class:std::_Rb_tree access:public signature:(const_iterator __position, const value_type& __x) +_M_insert_unique cpp_src/stl_tree.h /^ _M_insert_unique(iterator __position, const value_type& __x);$/;" p class:std::_Rb_tree access:public signature:(iterator __position, const value_type& __x) +_M_insert_unique cpp_src/stl_tree.h /^ _M_insert_unique(const _Val& __v)$/;" f class:std::_Rb_tree signature:(const _Val& __v) +_M_insert_unique cpp_src/stl_tree.h /^ _M_insert_unique(const_iterator __position, const _Val& __v)$/;" f class:std::_Rb_tree signature:(const_iterator __position, const _Val& __v) +_M_insert_unique cpp_src/stl_tree.h /^ _M_insert_unique(iterator __position, const _Val& __v)$/;" f class:std::_Rb_tree signature:(iterator __position, const _Val& __v) +_M_install_cache cpp_src/locale_classes.h /^ _M_install_cache(const facet*, size_t);$/;" p class:std::locale::_Impl access:private signature:(const facet*, size_t) +_M_install_facet cpp_src/locale_classes.h /^ _M_install_facet(const locale::id*, const facet*);$/;" p class:std::locale::_Impl access:private signature:(const locale::id*, const facet*) +_M_ios_locale cpp_src/ios_base.h /^ locale _M_ios_locale;$/;" m class:std::ios_base access:protected +_M_is_any cpp_src/bitset /^ _M_is_any() const$/;" f struct:std::_Base_bitset access:public signature:() const +_M_is_equal cpp_src/bitset /^ _M_is_equal(const _Base_bitset<0>&) const$/;" f struct:std::_Base_bitset access:public signature:(const _Base_bitset<0>&) const +_M_is_equal cpp_src/bitset /^ _M_is_equal(const _Base_bitset<1>& __x) const$/;" f struct:std::_Base_bitset access:public signature:(const _Base_bitset<1>& __x) const +_M_is_equal cpp_src/bitset /^ _M_is_equal(const _Base_bitset<_Nw>& __x) const$/;" f struct:std::_Base_bitset access:public signature:(const _Base_bitset<_Nw>& __x) const +_M_is_leaked cpp_src/basic_string.h /^ _M_is_leaked() const$/;" f struct:std::basic_string::_Rep access:public signature:() const +_M_is_shared cpp_src/basic_string.h /^ _M_is_shared() const$/;" f struct:std::basic_string::_Rep access:public signature:() const +_M_iter cpp_src/stl_raw_storage_iter.h /^ _ForwardIterator _M_iter;$/;" m class:std::raw_storage_iterator access:protected +_M_iword cpp_src/ios_base.h /^ long _M_iword;$/;" m struct:std::ios_base::_Words access:public +_M_key_compare cpp_src/stl_tree.h /^ _Key_compare _M_key_compare;$/;" m struct:std::_Rb_tree::_Rb_tree_impl access:public +_M_key_compare cpp_src/stl_tree.h /^ _Key_compare _M_key_compare;$/;" m struct:std::_Rb_tree::_Rb_tree_impl access:public +_M_last cpp_src/stl_deque.h /^ _Tp* _M_last;$/;" m struct:std::_Deque_iterator access:public +_M_leak cpp_src/basic_string.h /^ _M_leak() \/\/ for use in begin() & non-const op[]$/;" f class:std::basic_string access:private signature:() +_M_leak_hard cpp_src/basic_string.h /^ _M_leak_hard();$/;" p class:std::basic_string access:private signature:() +_M_leak_hard cpp_src/basic_string.tcc /^ _M_leak_hard()$/;" f class:std::basic_string signature:() +_M_left cpp_src/stl_tree.h /^ _Base_ptr _M_left;$/;" m struct:std::_Rb_tree_node_base access:public +_M_leftmost cpp_src/stl_tree.h /^ _M_leftmost() const$/;" f class:std::_Rb_tree access:protected signature:() const +_M_leftmost cpp_src/stl_tree.h /^ _M_leftmost()$/;" f class:std::_Rb_tree access:protected signature:() +_M_len cpp_src/stl_tempbuf.h /^ size_type _M_len;$/;" m class:std::_Temporary_buffer access:protected +_M_length cpp_src/basic_string.h /^ size_type _M_length;$/;" m struct:std::basic_string::_Rep_base access:public +_M_limit cpp_src/basic_string.h /^ _M_limit(size_type __pos, size_type __off) const$/;" f class:std::basic_string access:private signature:(size_type __pos, size_type __off) const +_M_local_word cpp_src/ios_base.h /^ _Words _M_local_word[_S_local_word_size];$/;" m class:std::ios_base access:protected +_M_lock cpp_src/fstream /^ __c_lock _M_lock;$/;" m class:std::basic_filebuf file: access:protected +_M_map cpp_src/stl_deque.h /^ _Tp** _M_map;$/;" m struct:std::_Deque_base::_Deque_impl access:public +_M_map_size cpp_src/stl_deque.h /^ size_t _M_map_size;$/;" m struct:std::_Deque_base::_Deque_impl access:public +_M_mask cpp_src/iomanip /^ struct _Resetiosflags { ios_base::fmtflags _M_mask; };$/;" m struct:std::_Resetiosflags file: access:public +_M_mask cpp_src/iomanip /^ struct _Setiosflags { ios_base::fmtflags _M_mask; };$/;" m struct:std::_Setiosflags file: access:public +_M_mask cpp_src/mask_array.h /^ const _Array _M_mask;$/;" m class:std::mask_array access:private +_M_mask cpp_src/stl_bvector.h /^ _Bit_type _M_mask;$/;" m struct:std::_Bit_reference access:public +_M_mode cpp_src/fstream /^ ios_base::openmode _M_mode;$/;" m class:std::basic_filebuf file: access:protected +_M_mode cpp_src/sstream /^ ios_base::openmode _M_mode;$/;" m class:std::basic_stringbuf file: access:protected +_M_month01 cpp_src/locale_facets.h /^ const _CharT* _M_month01;$/;" m struct:std::__timepunct_cache access:public +_M_month02 cpp_src/locale_facets.h /^ const _CharT* _M_month02;$/;" m struct:std::__timepunct_cache access:public +_M_month03 cpp_src/locale_facets.h /^ const _CharT* _M_month03;$/;" m struct:std::__timepunct_cache access:public +_M_month04 cpp_src/locale_facets.h /^ const _CharT* _M_month04;$/;" m struct:std::__timepunct_cache access:public +_M_month05 cpp_src/locale_facets.h /^ const _CharT* _M_month05;$/;" m struct:std::__timepunct_cache access:public +_M_month06 cpp_src/locale_facets.h /^ const _CharT* _M_month06;$/;" m struct:std::__timepunct_cache access:public +_M_month07 cpp_src/locale_facets.h /^ const _CharT* _M_month07;$/;" m struct:std::__timepunct_cache access:public +_M_month08 cpp_src/locale_facets.h /^ const _CharT* _M_month08;$/;" m struct:std::__timepunct_cache access:public +_M_month09 cpp_src/locale_facets.h /^ const _CharT* _M_month09;$/;" m struct:std::__timepunct_cache access:public +_M_month10 cpp_src/locale_facets.h /^ const _CharT* _M_month10;$/;" m struct:std::__timepunct_cache access:public +_M_month11 cpp_src/locale_facets.h /^ const _CharT* _M_month11;$/;" m struct:std::__timepunct_cache access:public +_M_month12 cpp_src/locale_facets.h /^ const _CharT* _M_month12;$/;" m struct:std::__timepunct_cache access:public +_M_months cpp_src/locale_facets.h /^ _M_months(const _CharT** __months) const$/;" f class:std::__timepunct access:public signature:(const _CharT** __months) const +_M_months_abbreviated cpp_src/locale_facets.h /^ _M_months_abbreviated(const _CharT** __months) const$/;" f class:std::__timepunct access:public signature:(const _CharT** __months) const +_M_move cpp_src/basic_string.h /^ _M_move(_CharT* __d, const _CharT* __s, size_type __n)$/;" f class:std::basic_string access:private signature:(_CharT* __d, const _CharT* __s, size_type __n) +_M_msg cpp_src/ios_base.h /^ string _M_msg;$/;" m class:std::ios_base::failure access:private +_M_msg cpp_src/stdexcept /^ string _M_msg;$/;" m class:std::logic_error file: access:private +_M_msg cpp_src/stdexcept /^ string _M_msg;$/;" m class:std::runtime_error file: access:private +_M_mutate cpp_src/basic_string.h /^ _M_mutate(size_type __pos, size_type __len1, size_type __len2);$/;" p class:std::basic_string access:private signature:(size_type __pos, size_type __len1, size_type __len2) +_M_mutate cpp_src/basic_string.tcc /^ _M_mutate(size_type __pos, size_type __len1, size_type __len2)$/;" f class:std::basic_string signature:(size_type __pos, size_type __len1, size_type __len2) +_M_n cpp_src/iomanip /^ struct _Setprecision { int _M_n; };$/;" m struct:std::_Setprecision file: access:public +_M_n cpp_src/iomanip /^ struct _Setw { int _M_n; };$/;" m struct:std::_Setw file: access:public +_M_name_messages cpp_src/locale_facets.h /^ const char* _M_name_messages;$/;" m class:std::messages access:protected +_M_name_timepunct cpp_src/locale_facets.h /^ const char* _M_name_timepunct;$/;" m class:std::__timepunct access:protected +_M_names cpp_src/locale_classes.h /^ char** _M_names;$/;" m class:std::locale::_Impl access:private +_M_narrow cpp_src/locale_facets.h /^ char _M_narrow[128];$/;" m class:std::ctype access:protected +_M_narrow cpp_src/locale_facets.h /^ mutable char _M_narrow[1 + static_cast(-1)];$/;" m class:std::ctype access:protected +_M_narrow_init cpp_src/locale_facets.h /^ void _M_narrow_init() const$/;" f class:std::ctype access:private signature:() const +_M_narrow_ok cpp_src/locale_facets.h /^ bool _M_narrow_ok;$/;" m class:std::ctype access:protected +_M_narrow_ok cpp_src/locale_facets.h /^ mutable char _M_narrow_ok; \/\/ 0 uninitialized, 1 init,$/;" m class:std::ctype access:protected +_M_neg_format cpp_src/locale_facets.h /^ money_base::pattern _M_neg_format;$/;" m struct:std::__moneypunct_cache access:public +_M_negative_sign cpp_src/locale_facets.h /^ const _CharT* _M_negative_sign;$/;" m struct:std::__moneypunct_cache access:public +_M_negative_sign_size cpp_src/locale_facets.h /^ size_t _M_negative_sign_size;$/;" m struct:std::__moneypunct_cache access:public +_M_new_elements_at_back cpp_src/deque.tcc /^ _M_new_elements_at_back(size_type __new_elems)$/;" f class:std::deque signature:(size_type __new_elems) +_M_new_elements_at_back cpp_src/stl_deque.h /^ _M_new_elements_at_back(size_type __new_elements);$/;" p class:std::deque access:protected signature:(size_type __new_elements) +_M_new_elements_at_front cpp_src/deque.tcc /^ _M_new_elements_at_front(size_type __new_elems)$/;" f class:std::deque signature:(size_type __new_elems) +_M_new_elements_at_front cpp_src/stl_deque.h /^ _M_new_elements_at_front(size_type __new_elements);$/;" p class:std::deque access:protected signature:(size_type __new_elements) +_M_next cpp_src/ios_base.h /^ _Callback_list* _M_next;$/;" m struct:std::ios_base::_Callback_list access:public +_M_next cpp_src/stl_list.h /^ _List_node_base* _M_next; \/\/\/< Self-explanatory$/;" m struct:std::_List_node_base access:public +_M_node cpp_src/stl_deque.h /^ _Map_pointer _M_node;$/;" m struct:std::_Deque_iterator access:public +_M_node cpp_src/stl_list.h /^ _List_node_base _M_node;$/;" m struct:std::_List_base::_List_impl access:public +_M_node cpp_src/stl_list.h /^ _List_node_base* _M_node;$/;" m struct:std::_List_iterator access:public +_M_node cpp_src/stl_list.h /^ const _List_node_base* _M_node;$/;" m struct:std::_List_const_iterator access:public +_M_node cpp_src/stl_tree.h /^ _Base_ptr _M_node;$/;" m struct:std::_Rb_tree_const_iterator access:public +_M_node cpp_src/stl_tree.h /^ _Base_ptr _M_node;$/;" m struct:std::_Rb_tree_iterator access:public +_M_node_count cpp_src/stl_tree.h /^ size_type _M_node_count; \/\/ Keeps track of size of tree.$/;" m struct:std::_Rb_tree::_Rb_tree_impl access:public +_M_num_get cpp_src/basic_ios.h /^ const __num_get_type* _M_num_get;$/;" m class:std::basic_ios access:protected +_M_num_put cpp_src/basic_ios.h /^ const __num_put_type* _M_num_put;$/;" m class:std::basic_ios access:protected +_M_off cpp_src/postypes.h /^ streamoff _M_off;$/;" m class:std::fpos access:private +_M_off cpp_src/slice_array.h /^ size_t _M_off; \/\/ offset$/;" m class:std::slice access:private +_M_offset cpp_src/stl_bvector.h /^ unsigned int _M_offset;$/;" m struct:std::_Bit_iterator_base access:public +_M_ok cpp_src/istream /^ bool _M_ok;$/;" m class:std::basic_istream::sentry file: access:private +_M_ok cpp_src/ostream /^ bool _M_ok;$/;" m class:std::basic_ostream::sentry file: access:private +_M_ok cpp_src/stream_iterator.h /^ bool _M_ok;$/;" m class:std::istream_iterator access:private +_M_original_len cpp_src/stl_tempbuf.h /^ size_type _M_original_len;$/;" m class:std::_Temporary_buffer access:protected +_M_os cpp_src/ostream /^ basic_ostream<_CharT, _Traits>& _M_os;$/;" m class:std::basic_ostream::sentry file: access:private +_M_out_beg cpp_src/streambuf /^ char_type* _M_out_beg; \/\/ Start of put area. $/;" m class:std::basic_streambuf file: access:protected +_M_out_cur cpp_src/streambuf /^ char_type* _M_out_cur; \/\/ Current put area. $/;" m class:std::basic_streambuf file: access:protected +_M_out_end cpp_src/streambuf /^ char_type* _M_out_end; \/\/ End of put area.$/;" m class:std::basic_streambuf file: access:protected +_M_p cpp_src/basic_string.h /^ _CharT* _M_p; \/\/ The actual data.$/;" m struct:std::basic_string::_Alloc_hider access:public +_M_p cpp_src/stl_bvector.h /^ _Bit_type * _M_p;$/;" m struct:std::_Bit_iterator_base access:public +_M_p cpp_src/stl_bvector.h /^ _Bit_type * _M_p;$/;" m struct:std::_Bit_reference access:public +_M_pad cpp_src/locale_facets.h /^ _M_pad(char_type __fill, streamsize __w, ios_base& __io,$/;" p class:std::num_put access:protected signature:(char_type __fill, streamsize __w, ios_base& __io, char_type* __new, const char_type* __cs, int& __len) const +_M_pad cpp_src/locale_facets.tcc /^ _M_pad(_CharT __fill, streamsize __w, ios_base& __io,$/;" f class:std::num_put signature:(_CharT __fill, streamsize __w, ios_base& __io, _CharT* __new, const _CharT* __cs, int& __len) const +_M_parent cpp_src/stl_tree.h /^ _Base_ptr _M_parent;$/;" m struct:std::_Rb_tree_node_base access:public +_M_pback cpp_src/fstream /^ char_type _M_pback; $/;" m class:std::basic_filebuf file: access:protected +_M_pback_cur_save cpp_src/fstream /^ char_type* _M_pback_cur_save;$/;" m class:std::basic_filebuf file: access:protected +_M_pback_end_save cpp_src/fstream /^ char_type* _M_pback_end_save;$/;" m class:std::basic_filebuf file: access:protected +_M_pback_init cpp_src/fstream /^ bool _M_pback_init; $/;" m class:std::basic_filebuf file: access:protected +_M_pm cpp_src/locale_facets.h /^ const _CharT* _M_pm;$/;" m struct:std::__timepunct_cache access:public +_M_pop_back_aux cpp_src/deque.tcc /^ _M_pop_back_aux()$/;" f class:std::deque signature:() +_M_pop_back_aux cpp_src/stl_deque.h /^ void _M_pop_back_aux();$/;" p class:std::deque access:protected signature:() +_M_pop_front_aux cpp_src/deque.tcc /^ _M_pop_front_aux()$/;" f class:std::deque signature:() +_M_pop_front_aux cpp_src/stl_deque.h /^ void _M_pop_front_aux();$/;" p class:std::deque access:protected signature:() +_M_pos_format cpp_src/locale_facets.h /^ money_base::pattern _M_pos_format;$/;" m struct:std::__moneypunct_cache access:public +_M_positive_sign cpp_src/locale_facets.h /^ const _CharT* _M_positive_sign;$/;" m struct:std::__moneypunct_cache access:public +_M_positive_sign_size cpp_src/locale_facets.h /^ size_t _M_positive_sign_size;$/;" m struct:std::__moneypunct_cache access:public +_M_precision cpp_src/ios_base.h /^ streamsize _M_precision;$/;" m class:std::ios_base access:protected +_M_pred cpp_src/stl_function.h /^ _Predicate _M_pred;$/;" m class:std::binary_negate access:protected +_M_pred cpp_src/stl_function.h /^ _Predicate _M_pred;$/;" m class:std::unary_negate access:protected +_M_prev cpp_src/stl_list.h /^ _List_node_base* _M_prev; \/\/\/< Self-explanatory$/;" m struct:std::_List_node_base access:public +_M_ptr cpp_src/memory /^ _Tp* _M_ptr;$/;" m class:std::auto_ptr file: access:private +_M_ptr cpp_src/memory /^ _Tp1* _M_ptr;$/;" m struct:std::auto_ptr_ref file: access:public +_M_ptr cpp_src/stl_function.h /^ _Result (*_M_ptr)(_Arg);$/;" m class:std::pointer_to_unary_function access:protected +_M_ptr cpp_src/stl_function.h /^ _Result (*_M_ptr)(_Arg1, _Arg2);$/;" m class:std::pointer_to_binary_function access:protected +_M_push_back_aux cpp_src/deque.tcc /^ _M_push_back_aux(const value_type& __t)$/;" f class:std::deque signature:(const value_type& __t) +_M_push_back_aux cpp_src/stl_deque.h /^ void _M_push_back_aux(const value_type&);$/;" p class:std::deque access:protected signature:(const value_type&) +_M_push_front_aux cpp_src/deque.tcc /^ _M_push_front_aux(const value_type& __t)$/;" f class:std::deque signature:(const value_type& __t) +_M_push_front_aux cpp_src/stl_deque.h /^ void _M_push_front_aux(const value_type&);$/;" p class:std::deque access:protected signature:(const value_type&) +_M_put cpp_src/locale_facets.h /^ _M_put(_CharT* __s, size_t __maxlen, const _CharT* __format,$/;" p class:std::__timepunct access:public signature:(_CharT* __s, size_t __maxlen, const _CharT* __format, const tm* __tm) const +_M_put cpp_src/locale_facets.h /^ __timepunct::_M_put(char*, size_t, const char*, const tm*) const;$/;" p class:std::__timepunct signature:(char*, size_t, const char*, const tm*) const +_M_put cpp_src/locale_facets.h /^ __timepunct::_M_put(wchar_t*, size_t, const wchar_t*,$/;" p class:std::__timepunct signature:(wchar_t*, size_t, const wchar_t*, const tm*) const +_M_put cpp_src/streambuf_iterator.h /^ _M_put(const _CharT* __ws, streamsize __len)$/;" f class:std::ostreambuf_iterator access:public signature:(const _CharT* __ws, streamsize __len) +_M_put_node cpp_src/stl_list.h /^ _M_put_node(_List_node<_Tp>* __p)$/;" f class:std::_List_base access:protected signature:(_List_node<_Tp>* __p) +_M_put_node cpp_src/stl_tree.h /^ _M_put_node(_Rb_tree_node* __p)$/;" f class:std::_Rb_tree access:protected signature:(_Rb_tree_node* __p) +_M_pword cpp_src/ios_base.h /^ void* _M_pword;$/;" m struct:std::ios_base::_Words access:public +_M_range_check cpp_src/stl_bvector.h /^ _M_range_check(size_type __n) const$/;" f class:std::vector access:protected signature:(size_type __n) const +_M_range_check cpp_src/stl_deque.h /^ _M_range_check(size_type __n) const$/;" f class:std::deque access:protected signature:(size_type __n) const +_M_range_check cpp_src/stl_vector.h /^ _M_range_check(size_type __n) const$/;" f class:std::vector access:protected signature:(size_type __n) const +_M_range_initialize cpp_src/deque.tcc /^ _M_range_initialize(_ForwardIterator __first, _ForwardIterator __last,$/;" f class:std::deque signature:(_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) +_M_range_initialize cpp_src/deque.tcc /^ _M_range_initialize(_InputIterator __first, _InputIterator __last,$/;" f class:std::deque signature:(_InputIterator __first, _InputIterator __last, std::input_iterator_tag) +_M_range_initialize cpp_src/stl_deque.h /^ _M_range_initialize(_ForwardIterator __first, _ForwardIterator __last,$/;" p class:std::deque access:protected signature:(_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) +_M_range_initialize cpp_src/stl_deque.h /^ _M_range_initialize(_InputIterator __first, _InputIterator __last,$/;" p class:std::deque access:protected signature:(_InputIterator __first, _InputIterator __last, std::input_iterator_tag) +_M_range_initialize cpp_src/stl_vector.h /^ _M_range_initialize(_ForwardIterator __first,$/;" f class:std::vector access:protected signature:(_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) +_M_range_initialize cpp_src/stl_vector.h /^ _M_range_initialize(_InputIterator __first,$/;" f class:std::vector access:protected signature:(_InputIterator __first, _InputIterator __last, std::input_iterator_tag) +_M_range_insert cpp_src/stl_vector.h /^ _M_range_insert(iterator __pos, _ForwardIterator __first,$/;" p class:std::vector access:protected signature:(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) +_M_range_insert cpp_src/stl_vector.h /^ _M_range_insert(iterator __pos, _InputIterator __first,$/;" p class:std::vector access:protected signature:(iterator __pos, _InputIterator __first, _InputIterator __last, std::input_iterator_tag) +_M_range_insert cpp_src/vector.tcc /^ _M_range_insert(iterator __position, _ForwardIterator __first,$/;" f class:std::vector signature:(iterator __position, _ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) +_M_range_insert cpp_src/vector.tcc /^ _M_range_insert(iterator __pos, _InputIterator __first,$/;" f class:std::vector signature:(iterator __pos, _InputIterator __first, _InputIterator __last, std::input_iterator_tag) +_M_range_insert_aux cpp_src/deque.tcc /^ _M_range_insert_aux(iterator __pos,$/;" f class:std::deque signature:(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) +_M_range_insert_aux cpp_src/deque.tcc /^ _M_range_insert_aux(iterator __pos,$/;" f class:std::deque signature:(iterator __pos, _InputIterator __first, _InputIterator __last, std::input_iterator_tag) +_M_range_insert_aux cpp_src/stl_deque.h /^ _M_range_insert_aux(iterator __pos, _ForwardIterator __first,$/;" p class:std::deque access:protected signature:(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) +_M_range_insert_aux cpp_src/stl_deque.h /^ _M_range_insert_aux(iterator __pos, _InputIterator __first,$/;" p class:std::deque access:protected signature:(iterator __pos, _InputIterator __first, _InputIterator __last, std::input_iterator_tag) +_M_read cpp_src/stream_iterator.h /^ _M_read()$/;" f class:std::istream_iterator access:private signature:() +_M_reading cpp_src/fstream /^ bool _M_reading;$/;" m class:std::basic_filebuf file: access:protected +_M_real cpp_src/complex /^ _Tp _M_real;$/;" m struct:std::complex file: access:private +_M_reallocate_map cpp_src/deque.tcc /^ _M_reallocate_map(size_type __nodes_to_add, bool __add_at_front)$/;" f class:std::deque signature:(size_type __nodes_to_add, bool __add_at_front) +_M_reallocate_map cpp_src/stl_deque.h /^ _M_reallocate_map(size_type __nodes_to_add, bool __add_at_front);$/;" p class:std::deque access:protected signature:(size_type __nodes_to_add, bool __add_at_front) +_M_refcopy cpp_src/basic_string.h /^ _M_refcopy() throw()$/;" f struct:std::basic_string::_Rep access:public signature:() +_M_refcount cpp_src/basic_string.h /^ _Atomic_word _M_refcount;$/;" m struct:std::basic_string::_Rep_base access:public +_M_refcount cpp_src/ios_base.h /^ _Atomic_word _M_refcount; \/\/ 0 means one reference.$/;" m struct:std::ios_base::_Callback_list access:public +_M_refcount cpp_src/locale_classes.h /^ _Atomic_word _M_refcount;$/;" m class:std::locale::_Impl access:private +_M_refcount cpp_src/locale_classes.h /^ mutable _Atomic_word _M_refcount;$/;" m class:std::locale::facet access:private +_M_refdata cpp_src/basic_string.h /^ _M_refdata() throw()$/;" f struct:std::basic_string::_Rep access:public signature:() +_M_remove_reference cpp_src/ios_base.h /^ _M_remove_reference() $/;" f struct:std::ios_base::_Callback_list access:public signature:() +_M_remove_reference cpp_src/locale_classes.h /^ _M_remove_reference() const throw()$/;" f class:std::locale::facet access:private signature:() const +_M_remove_reference cpp_src/locale_classes.h /^ _M_remove_reference() throw()$/;" f class:std::locale::_Impl access:private signature:() +_M_rep cpp_src/basic_string.h /^ _M_rep() const$/;" f class:std::basic_string access:private signature:() const +_M_replace_aux cpp_src/basic_string.h /^ _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2,$/;" p class:std::basic_string access:private signature:(size_type __pos1, size_type __n1, size_type __n2, _CharT __c) +_M_replace_aux cpp_src/basic_string.tcc /^ _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2,$/;" f class:std::basic_string signature:(size_type __pos1, size_type __n1, size_type __n2, _CharT __c) +_M_replace_categories cpp_src/locale_classes.h /^ _M_replace_categories(const _Impl*, category);$/;" p class:std::locale::_Impl access:private signature:(const _Impl*, category) +_M_replace_category cpp_src/locale_classes.h /^ _M_replace_category(const _Impl*, const locale::id* const*);$/;" p class:std::locale::_Impl access:private signature:(const _Impl*, const locale::id* const*) +_M_replace_dispatch cpp_src/basic_string.h /^ _M_replace_dispatch(iterator __i1, iterator __i2, _InputIterator __k1,$/;" p class:std::basic_string access:private signature:(iterator __i1, iterator __i2, _InputIterator __k1, _InputIterator __k2, __false_type) +_M_replace_dispatch cpp_src/basic_string.h /^ _M_replace_dispatch(iterator __i1, iterator __i2, _Integer __n,$/;" f class:std::basic_string access:private signature:(iterator __i1, iterator __i2, _Integer __n, _Integer __val, __true_type) +_M_replace_dispatch cpp_src/basic_string.tcc /^ _M_replace_dispatch(iterator __i1, iterator __i2, _InputIterator __k1,$/;" f class:std::basic_string signature:(iterator __i1, iterator __i2, _InputIterator __k1, _InputIterator __k2, __false_type) +_M_replace_facet cpp_src/locale_classes.h /^ _M_replace_facet(const _Impl*, const locale::id*);$/;" p class:std::locale::_Impl access:private signature:(const _Impl*, const locale::id*) +_M_replace_safe cpp_src/basic_string.h /^ _M_replace_safe(size_type __pos1, size_type __n1, const _CharT* __s,$/;" p class:std::basic_string access:private signature:(size_type __pos1, size_type __n1, const _CharT* __s, size_type __n2) +_M_replace_safe cpp_src/basic_string.tcc /^ _M_replace_safe(size_type __pos1, size_type __n1, const _CharT* __s,$/;" f class:std::basic_string signature:(size_type __pos1, size_type __n1, const _CharT* __s, size_type __n2) +_M_reserve_elements_at_back cpp_src/stl_deque.h /^ _M_reserve_elements_at_back(size_type __n)$/;" f class:std::deque access:protected signature:(size_type __n) +_M_reserve_elements_at_front cpp_src/stl_deque.h /^ _M_reserve_elements_at_front(size_type __n)$/;" f class:std::deque access:protected signature:(size_type __n) +_M_reserve_map_at_back cpp_src/stl_deque.h /^ _M_reserve_map_at_back(size_type __nodes_to_add = 1)$/;" f class:std::deque access:protected signature:(size_type __nodes_to_add = 1) +_M_reserve_map_at_front cpp_src/stl_deque.h /^ _M_reserve_map_at_front(size_type __nodes_to_add = 1)$/;" f class:std::deque access:protected signature:(size_type __nodes_to_add = 1) +_M_right cpp_src/stl_tree.h /^ _Base_ptr _M_right;$/;" m struct:std::_Rb_tree_node_base access:public +_M_rightmost cpp_src/stl_tree.h /^ _M_rightmost() const$/;" f class:std::_Rb_tree access:protected signature:() const +_M_rightmost cpp_src/stl_tree.h /^ _M_rightmost()$/;" f class:std::_Rb_tree access:protected signature:() +_M_root cpp_src/stl_tree.h /^ _M_root() const$/;" f class:std::_Rb_tree access:protected signature:() const +_M_root cpp_src/stl_tree.h /^ _M_root()$/;" f class:std::_Rb_tree access:protected signature:() +_M_sbuf cpp_src/streambuf_iterator.h /^ mutable streambuf_type* _M_sbuf;$/;" m class:std::istreambuf_iterator access:private +_M_sbuf cpp_src/streambuf_iterator.h /^ streambuf_type* _M_sbuf;$/;" m class:std::ostreambuf_iterator access:private +_M_seek cpp_src/fstream /^ _M_seek(off_type __off, ios_base::seekdir __way, __state_type __state);$/;" p class:std::basic_filebuf file: access:protected signature:(off_type __off, ios_base::seekdir __way, __state_type __state) +_M_seek cpp_src/fstream.tcc /^ _M_seek(off_type __off, ios_base::seekdir __way, __state_type __state)$/;" f class:std::basic_filebuf signature:(off_type __off, ios_base::seekdir __way, __state_type __state) +_M_set_buffer cpp_src/fstream /^ _M_set_buffer(streamsize __off)$/;" f class:std::basic_filebuf access:protected signature:(streamsize __off) +_M_set_leaked cpp_src/basic_string.h /^ _M_set_leaked()$/;" f struct:std::basic_string::_Rep access:public signature:() +_M_set_length_and_sharable cpp_src/basic_string.h /^ _M_set_length_and_sharable(size_type __n)$/;" f struct:std::basic_string::_Rep access:public signature:(size_type __n) +_M_set_node cpp_src/stl_deque.h /^ _M_set_node(_Map_pointer __new_node)$/;" f struct:std::_Deque_iterator access:public signature:(_Map_pointer __new_node) +_M_set_sharable cpp_src/basic_string.h /^ _M_set_sharable()$/;" f struct:std::basic_string::_Rep access:public signature:() +_M_setstate cpp_src/basic_ios.h /^ _M_setstate(iostate __state)$/;" f class:std::basic_ios access:public signature:(iostate __state) +_M_size cpp_src/gslice.h /^ valarray _M_size;$/;" m struct:std::gslice::_Indexer access:public +_M_size cpp_src/valarray /^ size_t _M_size;$/;" m class:std::valarray file: access:private +_M_size cpp_src/valarray_before.h /^ const size_t _M_size;$/;" m class:std::_SBase access:private +_M_slice cpp_src/valarray_before.h /^ const slice& _M_slice;$/;" m class:std::_SBase access:private +_M_st cpp_src/slice_array.h /^ size_t _M_st; \/\/ stride unit$/;" m class:std::slice access:private +_M_start cpp_src/gslice.h /^ size_t _M_start;$/;" m struct:std::gslice::_Indexer access:public +_M_start cpp_src/stl_bvector.h /^ _Bit_iterator _M_start;$/;" m struct:std::_Bvector_base::_Bvector_impl access:public +_M_start cpp_src/stl_deque.h /^ iterator _M_start;$/;" m struct:std::_Deque_base::_Deque_impl access:public +_M_start cpp_src/stl_vector.h /^ _Tp* _M_start;$/;" m struct:std::_Vector_base::_Vector_impl access:public +_M_state cpp_src/postypes.h /^ _StateT _M_state;$/;" m class:std::fpos access:private +_M_state_beg cpp_src/fstream /^ __state_type _M_state_beg;$/;" m class:std::basic_filebuf file: access:protected +_M_state_cur cpp_src/fstream /^ __state_type _M_state_cur;$/;" m class:std::basic_filebuf file: access:protected +_M_state_last cpp_src/fstream /^ __state_type _M_state_last;$/;" m class:std::basic_filebuf file: access:protected +_M_stream cpp_src/stream_iterator.h /^ istream_type* _M_stream;$/;" m class:std::istream_iterator access:private +_M_stream cpp_src/stream_iterator.h /^ ostream_type* _M_stream;$/;" m class:std::ostream_iterator access:private +_M_streambuf cpp_src/basic_ios.h /^ basic_streambuf<_CharT, _Traits>* _M_streambuf;$/;" m class:std::basic_ios access:protected +_M_streambuf_state cpp_src/ios_base.h /^ iostate _M_streambuf_state;$/;" m class:std::ios_base access:protected +_M_stride cpp_src/gslice.h /^ valarray _M_stride;$/;" m struct:std::gslice::_Indexer access:public +_M_stride cpp_src/slice_array.h /^ const size_t _M_stride;$/;" m class:std::slice_array access:private +_M_stride cpp_src/valarray_before.h /^ const size_t _M_stride;$/;" m class:std::_SBase access:private +_M_string cpp_src/sstream /^ __string_type _M_string;$/;" m class:std::basic_stringbuf file: access:protected +_M_string cpp_src/stream_iterator.h /^ const _CharT* _M_string;$/;" m class:std::ostream_iterator access:private +_M_stringbuf cpp_src/sstream /^ __stringbuf_type _M_stringbuf;$/;" m class:std::basic_istringstream file: access:private +_M_stringbuf cpp_src/sstream /^ __stringbuf_type _M_stringbuf;$/;" m class:std::basic_ostringstream file: access:private +_M_stringbuf cpp_src/sstream /^ __stringbuf_type _M_stringbuf;$/;" m class:std::basic_stringstream file: access:private +_M_stringbuf_init cpp_src/sstream /^ _M_stringbuf_init(ios_base::openmode __mode)$/;" f class:std::basic_stringbuf access:protected signature:(ios_base::openmode __mode) +_M_sync cpp_src/sstream /^ _M_sync(char_type* __base, __size_type __i, __size_type __o);$/;" p class:std::basic_stringbuf file: access:protected signature:(char_type* __base, __size_type __i, __size_type __o) +_M_sync cpp_src/sstream.tcc /^ _M_sync(char_type* __base, __size_type __i, __size_type __o)$/;" f class:std::basic_stringbuf signature:(char_type* __base, __size_type __i, __size_type __o) +_M_sz cpp_src/indirect_array.h /^ const size_t _M_sz;$/;" m class:std::indirect_array access:private +_M_sz cpp_src/mask_array.h /^ const size_t _M_sz;$/;" m class:std::mask_array access:private +_M_sz cpp_src/slice_array.h /^ const size_t _M_sz;$/;" m class:std::slice_array access:private +_M_sz cpp_src/slice_array.h /^ size_t _M_sz; \/\/ size$/;" m class:std::slice access:private +_M_t cpp_src/stl_map.h /^ _Rep_type _M_t;$/;" m class:std::map access:private +_M_t cpp_src/stl_multimap.h /^ _Rep_type _M_t;$/;" m class:std::multimap access:private +_M_t cpp_src/stl_multiset.h /^ _Rep_type _M_t;$/;" m class:std::multiset access:private +_M_t cpp_src/stl_set.h /^ _Rep_type _M_t; \/\/ red-black tree representing set$/;" m class:std::set access:private +_M_table cpp_src/locale_facets.h /^ const mask* _M_table;$/;" m class:std::ctype access:protected +_M_terminate_output cpp_src/fstream /^ _M_terminate_output();$/;" p class:std::basic_filebuf file: access:protected signature:() +_M_terminate_output cpp_src/fstream.tcc /^ _M_terminate_output()$/;" f class:std::basic_filebuf signature:() +_M_thousands_sep cpp_src/locale_facets.h /^ _CharT _M_thousands_sep;$/;" m struct:std::__moneypunct_cache access:public +_M_thousands_sep cpp_src/locale_facets.h /^ _CharT _M_thousands_sep;$/;" m struct:std::__numpunct_cache access:public +_M_tie cpp_src/basic_ios.h /^ basic_ostream<_CharT, _Traits>* _M_tie;$/;" m class:std::basic_ios access:protected +_M_time_era_format cpp_src/locale_facets.h /^ const _CharT* _M_time_era_format;$/;" m struct:std::__timepunct_cache access:public +_M_time_format cpp_src/locale_facets.h /^ const _CharT* _M_time_format;$/;" m struct:std::__timepunct_cache access:public +_M_time_formats cpp_src/locale_facets.h /^ _M_time_formats(const _CharT** __time) const$/;" f class:std::__timepunct access:public signature:(const _CharT** __time) const +_M_tolower cpp_src/locale_facets.h /^ __to_type _M_tolower;$/;" m class:std::ctype access:protected +_M_toupper cpp_src/locale_facets.h /^ __to_type _M_toupper;$/;" m class:std::ctype access:protected +_M_transfer cpp_src/stl_list.h /^ _M_transfer(iterator __position, iterator __first, iterator __last)$/;" f class:std::list access:protected signature:(iterator __position, iterator __first, iterator __last) +_M_transform cpp_src/locale_facets.h /^ _M_transform(_CharT*, const _CharT*, size_t) const;$/;" p class:std::collate access:public signature:(_CharT*, const _CharT*, size_t) const +_M_transform cpp_src/locale_facets.h /^ collate::_M_transform(char*, const char*, size_t) const;$/;" p class:std::collate signature:(char*, const char*, size_t) const +_M_transform cpp_src/locale_facets.h /^ collate::_M_transform(wchar_t*, const wchar_t*, size_t) const;$/;" p class:std::collate signature:(wchar_t*, const wchar_t*, size_t) const +_M_transform cpp_src/locale_facets.tcc /^ collate<_CharT>::_M_transform(_CharT*, const _CharT*, size_t) const$/;" f class:std::collate signature:(_CharT*, const _CharT*, size_t) const +_M_truename cpp_src/locale_facets.h /^ const _CharT* _M_truename;$/;" m struct:std::__numpunct_cache access:public +_M_truename_size cpp_src/locale_facets.h /^ size_t _M_truename_size;$/;" m struct:std::__numpunct_cache access:public +_M_update_egptr cpp_src/sstream /^ _M_update_egptr()$/;" f class:std::basic_stringbuf access:protected signature:() +_M_use_grouping cpp_src/locale_facets.h /^ bool _M_use_grouping;$/;" m struct:std::__moneypunct_cache access:public +_M_use_grouping cpp_src/locale_facets.h /^ bool _M_use_grouping;$/;" m struct:std::__numpunct_cache access:public +_M_value cpp_src/complex /^ _ComplexT _M_value;$/;" m struct:std::complex file: access:private +_M_value cpp_src/stream_iterator.h /^ _Tp _M_value;$/;" m class:std::istream_iterator access:private +_M_value_field cpp_src/stl_tree.h /^ _Val _M_value_field;$/;" m struct:std::_Rb_tree_node access:public +_M_w cpp_src/bitset /^ _WordT _M_w[_Nw];$/;" m struct:std::_Base_bitset file: access:public +_M_w cpp_src/bitset /^ _WordT _M_w;$/;" m struct:std::_Base_bitset file: access:public +_M_widen cpp_src/locale_facets.h /^ mutable char _M_widen[1 + static_cast(-1)];$/;" m class:std::ctype access:protected +_M_widen cpp_src/locale_facets.h /^ wint_t _M_widen[1 + static_cast(-1)];$/;" m class:std::ctype access:protected +_M_widen_init cpp_src/locale_facets.h /^ void _M_widen_init() const$/;" f class:std::ctype access:private signature:() const +_M_widen_ok cpp_src/locale_facets.h /^ mutable char _M_widen_ok;$/;" m class:std::ctype access:protected +_M_width cpp_src/ios_base.h /^ streamsize _M_width;$/;" m class:std::ios_base access:protected +_M_wmask cpp_src/locale_facets.h /^ __wmask_type _M_wmask[16];$/;" m class:std::ctype access:protected +_M_word cpp_src/ios_base.h /^ _Words* _M_word;$/;" m class:std::ios_base access:protected +_M_word_size cpp_src/ios_base.h /^ int _M_word_size;$/;" m class:std::ios_base access:protected +_M_word_zero cpp_src/ios_base.h /^ _Words _M_word_zero;$/;" m class:std::ios_base access:protected +_M_wp cpp_src/bitset /^ _WordT *_M_wp;$/;" m class:std::bitset::reference file: access:private +_M_write cpp_src/ostream /^ _M_write(const char_type* __s, streamsize __n)$/;" f class:std::basic_ostream access:public signature:(const char_type* __s, streamsize __n) +_M_writing cpp_src/fstream /^ bool _M_writing;$/;" m class:std::basic_filebuf file: access:protected +_Map_alloc_type cpp_src/stl_deque.h /^ typedef typename _Alloc::template rebind<_Tp*>::other _Map_alloc_type;$/;" t class:std::_Deque_base access:protected +_Map_pointer cpp_src/stl_deque.h /^ typedef _Tp** _Map_pointer;$/;" t struct:std::_Deque_iterator access:public +_Map_pointer cpp_src/stl_deque.h /^ typedef pointer* _Map_pointer;$/;" t class:std::deque access:protected +_MultipleAssociativeContainerConcept cpp_src/boost_concept_check.h /^ struct _MultipleAssociativeContainerConcept$/;" s +_MultipleAssociativeContainerConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_MultipleAssociativeContainerConcept access:public signature:() +_MultipleAssociativeContainerConcept::__first cpp_src/boost_concept_check.h /^ typename _MultipleAssociativeContainer::value_type *__first, *__last;$/;" m struct:_MultipleAssociativeContainerConcept access:public +_MultipleAssociativeContainerConcept::__last cpp_src/boost_concept_check.h /^ typename _MultipleAssociativeContainer::value_type *__first, *__last;$/;" m struct:_MultipleAssociativeContainerConcept access:public +_MultipleAssociativeContainerConcept::__pos cpp_src/boost_concept_check.h /^ typename _MultipleAssociativeContainer::iterator __pos;$/;" m struct:_MultipleAssociativeContainerConcept access:public +_MultipleAssociativeContainerConcept::__t cpp_src/boost_concept_check.h /^ typename _MultipleAssociativeContainer::value_type __t;$/;" m struct:_MultipleAssociativeContainerConcept access:public +_Mutable_BidirectionalIteratorConcept cpp_src/boost_concept_check.h /^ struct _Mutable_BidirectionalIteratorConcept$/;" s +_Mutable_BidirectionalIteratorConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_Mutable_BidirectionalIteratorConcept access:public signature:() +_Mutable_BidirectionalIteratorConcept::__i cpp_src/boost_concept_check.h /^ _Tp __i;$/;" m struct:_Mutable_BidirectionalIteratorConcept access:public +_Mutable_ContainerConcept cpp_src/boost_concept_check.h /^ struct _Mutable_ContainerConcept$/;" s +_Mutable_ContainerConcept::_Iterator cpp_src/boost_concept_check.h /^ typedef typename _Container::iterator _Iterator;$/;" t struct:_Mutable_ContainerConcept access:public +_Mutable_ContainerConcept::_Pointer cpp_src/boost_concept_check.h /^ typedef typename _Container::pointer _Pointer;$/;" t struct:_Mutable_ContainerConcept access:public +_Mutable_ContainerConcept::_Reference cpp_src/boost_concept_check.h /^ typedef typename _Container::reference _Reference;$/;" t struct:_Mutable_ContainerConcept access:public +_Mutable_ContainerConcept::_Value_type cpp_src/boost_concept_check.h /^ typedef typename _Container::value_type _Value_type;$/;" t struct:_Mutable_ContainerConcept access:public +_Mutable_ContainerConcept::__c cpp_src/boost_concept_check.h /^ _Container __c, __c2;$/;" m struct:_Mutable_ContainerConcept access:public +_Mutable_ContainerConcept::__c2 cpp_src/boost_concept_check.h /^ _Container __c, __c2;$/;" m struct:_Mutable_ContainerConcept access:public +_Mutable_ContainerConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_Mutable_ContainerConcept access:public signature:() +_Mutable_ContainerConcept::__i cpp_src/boost_concept_check.h /^ _Iterator __i;$/;" m struct:_Mutable_ContainerConcept access:public +_Mutable_ForwardContainerConcept cpp_src/boost_concept_check.h /^ struct _Mutable_ForwardContainerConcept$/;" s +_Mutable_ForwardContainerConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_Mutable_ForwardContainerConcept access:public signature:() +_Mutable_ForwardIteratorConcept cpp_src/boost_concept_check.h /^ struct _Mutable_ForwardIteratorConcept$/;" s +_Mutable_ForwardIteratorConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_Mutable_ForwardIteratorConcept access:public signature:() +_Mutable_ForwardIteratorConcept::__i cpp_src/boost_concept_check.h /^ _Tp __i;$/;" m struct:_Mutable_ForwardIteratorConcept access:public +_Mutable_RandomAccessContainerConcept cpp_src/boost_concept_check.h /^ struct _Mutable_RandomAccessContainerConcept$/;" s +_Mutable_RandomAccessContainerConcept::_Iterator cpp_src/boost_concept_check.h /^ typedef typename _RandomAccessContainer::iterator _Iterator;$/;" t struct:_Mutable_RandomAccessContainerConcept access:public +_Mutable_RandomAccessContainerConcept::_Reference cpp_src/boost_concept_check.h /^ typedef typename _RandomAccessContainer::reference _Reference;$/;" t struct:_Mutable_RandomAccessContainerConcept access:public +_Mutable_RandomAccessContainerConcept::_Reverse_iterator cpp_src/boost_concept_check.h /^ typedef typename _RandomAccessContainer::reverse_iterator _Reverse_iterator;$/;" t struct:_Mutable_RandomAccessContainerConcept access:public +_Mutable_RandomAccessContainerConcept::_Size_type cpp_src/boost_concept_check.h /^ typedef typename _RandomAccessContainer::size_type _Size_type;$/;" t struct:_Mutable_RandomAccessContainerConcept access:public +_Mutable_RandomAccessContainerConcept::__c cpp_src/boost_concept_check.h /^ _RandomAccessContainer __c;$/;" m struct:_Mutable_RandomAccessContainerConcept access:public +_Mutable_RandomAccessContainerConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_Mutable_RandomAccessContainerConcept access:public signature:() +_Mutable_RandomAccessContainerConcept::__i cpp_src/boost_concept_check.h /^ _Size_type __i;$/;" m struct:_Mutable_RandomAccessContainerConcept access:public +_Mutable_RandomAccessIteratorConcept cpp_src/boost_concept_check.h /^ struct _Mutable_RandomAccessIteratorConcept$/;" s +_Mutable_RandomAccessIteratorConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_Mutable_RandomAccessIteratorConcept access:public signature:() +_Mutable_RandomAccessIteratorConcept::__i cpp_src/boost_concept_check.h /^ _Tp __i;$/;" m struct:_Mutable_RandomAccessIteratorConcept access:public +_Mutable_RandomAccessIteratorConcept::__n cpp_src/boost_concept_check.h /^ typename std::iterator_traits<_Tp>::difference_type __n;$/;" m struct:_Mutable_RandomAccessIteratorConcept access:public +_Mutable_ReversibleContainerConcept cpp_src/boost_concept_check.h /^ struct _Mutable_ReversibleContainerConcept$/;" s +_Mutable_ReversibleContainerConcept::_Iterator cpp_src/boost_concept_check.h /^ typedef typename _ReversibleContainer::iterator _Iterator;$/;" t struct:_Mutable_ReversibleContainerConcept access:public +_Mutable_ReversibleContainerConcept::_Reverse_iterator cpp_src/boost_concept_check.h /^ typedef typename _ReversibleContainer::reverse_iterator _Reverse_iterator;$/;" t struct:_Mutable_ReversibleContainerConcept access:public +_Mutable_ReversibleContainerConcept::__c cpp_src/boost_concept_check.h /^ _ReversibleContainer __c;$/;" m struct:_Mutable_ReversibleContainerConcept access:public +_Mutable_ReversibleContainerConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_Mutable_ReversibleContainerConcept access:public signature:() +_Mutable_TrivialIteratorConcept cpp_src/boost_concept_check.h /^ struct _Mutable_TrivialIteratorConcept$/;" s +_Mutable_TrivialIteratorConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_Mutable_TrivialIteratorConcept access:public signature:() +_Mutable_TrivialIteratorConcept::__i cpp_src/boost_concept_check.h /^ _Tp __i, __j;$/;" m struct:_Mutable_TrivialIteratorConcept access:public +_Mutable_TrivialIteratorConcept::__j cpp_src/boost_concept_check.h /^ _Tp __i, __j;$/;" m struct:_Mutable_TrivialIteratorConcept access:public +_NEW cpp_src/new 42;" d file: +_Node cpp_src/stl_list.h /^ typedef _List_node<_Tp> _Node;$/;" t class:std::list access:protected +_Node cpp_src/stl_list.h /^ typedef _List_node<_Tp> _Node;$/;" t struct:std::_List_iterator access:public +_Node cpp_src/stl_list.h /^ typedef const _List_node<_Tp> _Node;$/;" t struct:std::_List_const_iterator access:public +_Node_alloc_type cpp_src/stl_list.h /^ _Node_alloc_type;$/;" t class:std::_List_base access:protected +_Node_allocator cpp_src/stl_tree.h /^ _Node_allocator;$/;" t class:std::_Rb_tree access:private +_Norm_helper cpp_src/complex /^ struct _Norm_helper$/;" s namespace:std file: +_Norm_helper cpp_src/complex /^ struct _Norm_helper$/;" s namespace:std file: +_OSTREAM_INSERT_H cpp_src/ostream_insert.h 36;" d +_OSTREAM_TCC cpp_src/ostream.tcc 42;" d file: +_OutputIteratorConcept cpp_src/boost_concept_check.h /^ struct _OutputIteratorConcept$/;" s +_OutputIteratorConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_OutputIteratorConcept access:public signature:() +_OutputIteratorConcept::__i cpp_src/boost_concept_check.h /^ _Tp __i;$/;" m struct:_OutputIteratorConcept access:public +_OutputIteratorConcept::__t cpp_src/boost_concept_check.h /^ _ValueT __t;$/;" m struct:_OutputIteratorConcept access:public +_PAIR_H cpp_src/stl_pair.h 62;" d +_PairAssociativeContainerConcept cpp_src/boost_concept_check.h /^ struct _PairAssociativeContainerConcept$/;" s +_PairAssociativeContainerConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_PairAssociativeContainerConcept access:public signature:() +_Pair_alloc_type cpp_src/stl_map.h /^ _Pair_alloc_type;$/;" t class:std::map access:private +_Pair_alloc_type cpp_src/stl_multimap.h /^ _Pair_alloc_type;$/;" t class:std::multimap access:private +_Pointer cpp_src/boost_concept_check.h /^ typedef typename _Container::pointer _Pointer;$/;" t struct:_Mutable_ContainerConcept access:public +_QUEUE_H cpp_src/stl_queue.h 63;" d +_RandomAccessContainerConcept cpp_src/boost_concept_check.h /^ struct _RandomAccessContainerConcept$/;" s +_RandomAccessContainerConcept::_Const_iterator cpp_src/boost_concept_check.h /^ typedef typename _RandomAccessContainer::const_iterator _Const_iterator;$/;" t struct:_RandomAccessContainerConcept access:public +_RandomAccessContainerConcept::_Const_reference cpp_src/boost_concept_check.h /^ typedef typename _RandomAccessContainer::const_reference _Const_reference;$/;" t struct:_RandomAccessContainerConcept access:public +_RandomAccessContainerConcept::_Const_reverse_iterator cpp_src/boost_concept_check.h /^ _Const_reverse_iterator;$/;" t struct:_RandomAccessContainerConcept access:public +_RandomAccessContainerConcept::_Size_type cpp_src/boost_concept_check.h /^ typedef typename _RandomAccessContainer::size_type _Size_type;$/;" t struct:_RandomAccessContainerConcept access:public +_RandomAccessContainerConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_RandomAccessContainerConcept access:public signature:() +_RandomAccessContainerConcept::__n cpp_src/boost_concept_check.h /^ _Size_type __n;$/;" m struct:_RandomAccessContainerConcept access:public +_RandomAccessIteratorConcept cpp_src/boost_concept_check.h /^ struct _RandomAccessIteratorConcept$/;" s +_RandomAccessIteratorConcept::__a cpp_src/boost_concept_check.h /^ _Tp __a, __b;$/;" m struct:_RandomAccessIteratorConcept access:public +_RandomAccessIteratorConcept::__b cpp_src/boost_concept_check.h /^ _Tp __a, __b;$/;" m struct:_RandomAccessIteratorConcept access:public +_RandomAccessIteratorConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_RandomAccessIteratorConcept access:public signature:() +_RandomAccessIteratorConcept::__i cpp_src/boost_concept_check.h /^ _Tp __i, __j;$/;" m struct:_RandomAccessIteratorConcept access:public +_RandomAccessIteratorConcept::__j cpp_src/boost_concept_check.h /^ _Tp __i, __j;$/;" m struct:_RandomAccessIteratorConcept access:public +_RandomAccessIteratorConcept::__n cpp_src/boost_concept_check.h /^ typename std::iterator_traits<_Tp>::difference_type __n;$/;" m struct:_RandomAccessIteratorConcept access:public +_Raw_bytes_alloc cpp_src/basic_string.h /^ typedef typename _Alloc::template rebind::other _Raw_bytes_alloc;$/;" t struct:std::basic_string::_Rep access:public +_Rb_tree cpp_src/stl_tree.h /^ _Rb_tree()$/;" f class:std::_Rb_tree access:public signature:() +_Rb_tree cpp_src/stl_tree.h /^ _Rb_tree(const _Compare& __comp)$/;" f class:std::_Rb_tree access:public signature:(const _Compare& __comp) +_Rb_tree cpp_src/stl_tree.h /^ _Rb_tree(const _Compare& __comp, const allocator_type& __a)$/;" f class:std::_Rb_tree access:public signature:(const _Compare& __comp, const allocator_type& __a) +_Rb_tree cpp_src/stl_tree.h /^ _Rb_tree(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x)$/;" f class:std::_Rb_tree access:public signature:(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x) +_Rb_tree cpp_src/stl_tree.h /^ class _Rb_tree$/;" c namespace:std +_Rb_tree_black_count cpp_src/stl_tree.h /^ _Rb_tree_black_count(const _Rb_tree_node_base* __node,$/;" p namespace:std signature:(const _Rb_tree_node_base* __node, const _Rb_tree_node_base* __root) +_Rb_tree_color cpp_src/stl_tree.h /^ enum _Rb_tree_color { _S_red = false, _S_black = true };$/;" g namespace:std +_Rb_tree_const_iterator cpp_src/stl_tree.h /^ _Rb_tree_const_iterator()$/;" f struct:std::_Rb_tree_const_iterator access:public signature:() +_Rb_tree_const_iterator cpp_src/stl_tree.h /^ _Rb_tree_const_iterator(_Link_type __x)$/;" f struct:std::_Rb_tree_const_iterator access:public signature:(_Link_type __x) +_Rb_tree_const_iterator cpp_src/stl_tree.h /^ _Rb_tree_const_iterator(const iterator& __it)$/;" f struct:std::_Rb_tree_const_iterator access:public signature:(const iterator& __it) +_Rb_tree_const_iterator cpp_src/stl_tree.h /^ struct _Rb_tree_const_iterator$/;" s namespace:std +_Rb_tree_decrement cpp_src/stl_tree.h /^ _Rb_tree_decrement(_Rb_tree_node_base* __x);$/;" p namespace:std signature:(_Rb_tree_node_base* __x) +_Rb_tree_decrement cpp_src/stl_tree.h /^ _Rb_tree_decrement(const _Rb_tree_node_base* __x);$/;" p namespace:std signature:(const _Rb_tree_node_base* __x) +_Rb_tree_impl cpp_src/stl_tree.h /^ _Rb_tree_impl(const _Node_allocator& __a = _Node_allocator(),$/;" f struct:std::_Rb_tree::_Rb_tree_impl access:public signature:(const _Node_allocator& __a = _Node_allocator(), const _Key_compare& __comp = _Key_compare()) +_Rb_tree_impl cpp_src/stl_tree.h /^ struct _Rb_tree_impl : public _Node_allocator$/;" s class:std::_Rb_tree inherits:_Node_allocator access:protected +_Rb_tree_impl cpp_src/stl_tree.h /^ struct _Rb_tree_impl<_Key_compare, true> : public _Node_allocator $/;" s class:std::_Rb_tree inherits:_Node_allocator access:protected +_Rb_tree_increment cpp_src/stl_tree.h /^ _Rb_tree_increment(_Rb_tree_node_base* __x);$/;" p namespace:std signature:(_Rb_tree_node_base* __x) +_Rb_tree_increment cpp_src/stl_tree.h /^ _Rb_tree_increment(const _Rb_tree_node_base* __x);$/;" p namespace:std signature:(const _Rb_tree_node_base* __x) +_Rb_tree_insert_and_rebalance cpp_src/stl_tree.h /^ _Rb_tree_insert_and_rebalance(const bool __insert_left,$/;" p namespace:std signature:(const bool __insert_left, _Rb_tree_node_base* __x, _Rb_tree_node_base* __p, _Rb_tree_node_base& __header) +_Rb_tree_iterator cpp_src/stl_tree.h /^ _Rb_tree_iterator()$/;" f struct:std::_Rb_tree_iterator access:public signature:() +_Rb_tree_iterator cpp_src/stl_tree.h /^ _Rb_tree_iterator(_Link_type __x)$/;" f struct:std::_Rb_tree_iterator access:public signature:(_Link_type __x) +_Rb_tree_iterator cpp_src/stl_tree.h /^ struct _Rb_tree_iterator$/;" s namespace:std +_Rb_tree_node cpp_src/stl_tree.h /^ typedef _Rb_tree_node<_Val> _Rb_tree_node;$/;" t class:std::_Rb_tree access:protected +_Rb_tree_node cpp_src/stl_tree.h /^ struct _Rb_tree_node : public _Rb_tree_node_base$/;" s namespace:std inherits:_Rb_tree_node_base +_Rb_tree_node_base cpp_src/stl_tree.h /^ struct _Rb_tree_node_base$/;" s namespace:std +_Rb_tree_rebalance_for_erase cpp_src/stl_tree.h /^ _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* const __z,$/;" p namespace:std signature:(_Rb_tree_node_base* const __z, _Rb_tree_node_base& __header) +_Rb_tree_rotate_left cpp_src/stl_tree.h /^ _Rb_tree_rotate_left(_Rb_tree_node_base* const __x,$/;" p namespace:std signature:(_Rb_tree_node_base* const __x, _Rb_tree_node_base*& __root) +_Rb_tree_rotate_right cpp_src/stl_tree.h /^ _Rb_tree_rotate_right(_Rb_tree_node_base* const __x,$/;" p namespace:std signature:(_Rb_tree_node_base* const __x, _Rb_tree_node_base*& __root) +_RefFunClos cpp_src/valarray_before.h /^ _RefFunClos(const _Dom& __e, _Tp __f(const _Tp&))$/;" f struct:std::_RefFunClos access:public signature:(const _Dom& __e, _Tp __f(const _Tp&)) +_RefFunClos cpp_src/valarray_before.h /^ _RefFunClos(const valarray<_Tp>& __v, _Tp __f(const _Tp&))$/;" f struct:std::_RefFunClos access:public signature:(const valarray<_Tp>& __v, _Tp __f(const _Tp&)) +_RefFunClos cpp_src/valarray_before.h /^ struct _RefFunClos<_Expr, _Dom>$/;" s namespace:std inherits:_FunBase +_RefFunClos cpp_src/valarray_before.h /^ struct _RefFunClos<_ValArray, _Tp>$/;" s namespace:std inherits:_FunBase +_Reference cpp_src/boost_concept_check.h /^ typedef typename _BackInsertionSequence::reference _Reference;$/;" t struct:_BackInsertionSequenceConcept access:public +_Reference cpp_src/boost_concept_check.h /^ typedef typename _Container::reference _Reference;$/;" t struct:_Mutable_ContainerConcept access:public +_Reference cpp_src/boost_concept_check.h /^ typedef typename _RandomAccessContainer::reference _Reference;$/;" t struct:_Mutable_RandomAccessContainerConcept access:public +_Reference cpp_src/boost_concept_check.h /^ typedef typename _Sequence::reference _Reference;$/;" t struct:_SequenceConcept access:public +_Rep cpp_src/basic_string.h /^ struct _Rep : _Rep_base$/;" s class:std::basic_string inherits:_Rep_base access:private +_Rep_base cpp_src/basic_string.h /^ struct _Rep_base$/;" s class:std::basic_string access:private +_Rep_type cpp_src/stl_map.h /^ key_compare, _Pair_alloc_type> _Rep_type;$/;" t class:std::map access:private +_Rep_type cpp_src/stl_multimap.h /^ key_compare, _Pair_alloc_type> _Rep_type;$/;" t class:std::multimap access:private +_Rep_type cpp_src/stl_multiset.h /^ key_compare, _Key_alloc_type> _Rep_type;$/;" t class:std::multiset access:private +_Rep_type cpp_src/stl_set.h /^ key_compare, _Key_alloc_type> _Rep_type;$/;" t class:std::set access:private +_Resetiosflags cpp_src/iomanip /^ struct _Resetiosflags { ios_base::fmtflags _M_mask; };$/;" s namespace:std file: +_Ret cpp_src/stl_function.h /^ const_mem_fun1_ref_t(_Ret (_Tp::*__pf)(_Arg) const)$/;" f class:std::const_mem_fun1_ref_t access:public signature:(_Tp::*__pf) const +_Ret cpp_src/stl_function.h /^ const_mem_fun1_t(_Ret (_Tp::*__pf)(_Arg) const)$/;" f class:std::const_mem_fun1_t access:public signature:(_Tp::*__pf) const +_Ret cpp_src/stl_function.h /^ const_mem_fun_ref_t(_Ret (_Tp::*__pf)() const)$/;" f class:std::const_mem_fun_ref_t access:public signature:(_Tp::*__pf) const +_Ret cpp_src/stl_function.h /^ const_mem_fun_t(_Ret (_Tp::*__pf)() const)$/;" f class:std::const_mem_fun_t access:public signature:(_Tp::*__pf) const +_Ret cpp_src/stl_function.h /^ mem_fun1_ref_t(_Ret (_Tp::*__pf)(_Arg))$/;" f class:std::mem_fun1_ref_t access:public signature:(_Tp::*__pf) +_Ret cpp_src/stl_function.h /^ mem_fun1_t(_Ret (_Tp::*__pf)(_Arg))$/;" f class:std::mem_fun1_t access:public signature:(_Tp::*__pf) +_Ret cpp_src/stl_function.h /^ mem_fun_ref_t(_Ret (_Tp::*__pf)())$/;" f class:std::mem_fun_ref_t access:public signature:(_Tp::*__pf) +_Ret cpp_src/stl_function.h /^ mem_fun_t(_Ret (_Tp::*__pf)())$/;" f class:std::mem_fun_t access:public signature:(_Tp::*__pf) +_Ret cpp_src/stl_function.h /^ mem_fun(_Ret (_Tp::*__f)() const)$/;" f namespace:std signature:(_Tp::*__f) const +_Ret cpp_src/stl_function.h /^ mem_fun(_Ret (_Tp::*__f)())$/;" f namespace:std signature:(_Tp::*__f) +_Ret cpp_src/stl_function.h /^ mem_fun(_Ret (_Tp::*__f)(_Arg) const)$/;" f namespace:std signature:(_Tp::*__f) const +_Ret cpp_src/stl_function.h /^ mem_fun(_Ret (_Tp::*__f)(_Arg))$/;" f namespace:std signature:(_Tp::*__f) +_Ret cpp_src/stl_function.h /^ mem_fun_ref(_Ret (_Tp::*__f)() const)$/;" f namespace:std signature:(_Tp::*__f) const +_Ret cpp_src/stl_function.h /^ mem_fun_ref(_Ret (_Tp::*__f)())$/;" f namespace:std signature:(_Tp::*__f) +_Ret cpp_src/stl_function.h /^ mem_fun_ref(_Ret (_Tp::*__f)(_Arg) const)$/;" f namespace:std signature:(_Tp::*__f) const +_Ret cpp_src/stl_function.h /^ mem_fun_ref(_Ret (_Tp::*__f)(_Arg))$/;" f namespace:std signature:(_Tp::*__f) +_Reverse_iterator cpp_src/boost_concept_check.h /^ typedef typename _RandomAccessContainer::reverse_iterator _Reverse_iterator;$/;" t struct:_Mutable_RandomAccessContainerConcept access:public +_Reverse_iterator cpp_src/boost_concept_check.h /^ typedef typename _ReversibleContainer::reverse_iterator _Reverse_iterator;$/;" t struct:_Mutable_ReversibleContainerConcept access:public +_ReversibleContainerConcept cpp_src/boost_concept_check.h /^ struct _ReversibleContainerConcept$/;" s +_ReversibleContainerConcept::_Const_iterator cpp_src/boost_concept_check.h /^ typedef typename _ReversibleContainer::const_iterator _Const_iterator;$/;" t struct:_ReversibleContainerConcept access:public +_ReversibleContainerConcept::_Const_reverse_iterator cpp_src/boost_concept_check.h /^ _Const_reverse_iterator;$/;" t struct:_ReversibleContainerConcept access:public +_ReversibleContainerConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_ReversibleContainerConcept access:public signature:() +_Rt cpp_src/valarray /^ typedef _Expr<_UnClos<_Op, _ValArray, _Tp>, __rt> _Rt;$/;" t struct:std::valarray::_UnaryOp file: access:public +_SBase cpp_src/valarray_before.h /^ _SBase (_Array<_Tp> __a, const slice& __s)$/;" f class:std::_SBase access:public signature:(_Array<_Tp> __a, const slice& __s) +_SBase cpp_src/valarray_before.h /^ _SBase (const _Dom& __e, const slice& __s)$/;" f class:std::_SBase access:public signature:(const _Dom& __e, const slice& __s) +_SBase cpp_src/valarray_before.h /^ class _SBase$/;" c namespace:std +_SBase cpp_src/valarray_before.h /^ class _SBase<_Array<_Tp> >$/;" c namespace:std +_SClos cpp_src/valarray_before.h /^ _SClos (_Array<_Tp> __a, const slice& __s) : _Base (__a, __s) {}$/;" f struct:std::_SClos access:public signature:(_Array<_Tp> __a, const slice& __s) +_SClos cpp_src/valarray_before.h /^ _SClos (const _Dom& __e, const slice& __s) : _Base (__e, __s) {}$/;" f struct:std::_SClos access:public signature:(const _Dom& __e, const slice& __s) +_SClos cpp_src/valarray_before.h /^ struct _SClos<_Expr, _Dom>$/;" s namespace:std inherits:_SBase +_SClos cpp_src/valarray_before.h /^ struct _SClos<_ValArray, _Tp>$/;" s namespace:std inherits:_SBase +_SET_H cpp_src/stl_set.h 62;" d +_SGIAssignableConcept cpp_src/boost_concept_check.h /^ struct _SGIAssignableConcept$/;" s +_SGIAssignableConcept::__a cpp_src/boost_concept_check.h /^ _Tp __a;$/;" m struct:_SGIAssignableConcept access:public +_SGIAssignableConcept::__const_constraints cpp_src/boost_concept_check.h /^ void __const_constraints(const _Tp& __b) {$/;" f struct:_SGIAssignableConcept access:public signature:(const _Tp& __b) +_SGIAssignableConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_SGIAssignableConcept access:public signature:() +_SLICE_ARRAY_H cpp_src/slice_array.h 39;" d +_SSTREAM_TCC cpp_src/sstream.tcc 41;" d file: +_STACK_H cpp_src/stl_stack.h 63;" d +_STL_CONSTRUCT_H cpp_src/stl_construct.h 62;" d +_STL_HEAP_H cpp_src/stl_heap.h 61;" d +_STL_NUMERIC_H cpp_src/stl_numeric.h 62;" d +_STL_RAW_STORAGE_ITERATOR_H cpp_src/stl_raw_storage_iter.h 62;" d +_STL_RELOPS_H cpp_src/stl_relops.h 72;" d +_STL_UNINITIALIZED_H cpp_src/stl_uninitialized.h 63;" d +_STREAMBUF_ITERATOR_H cpp_src/streambuf_iterator.h 37;" d +_STREAMBUF_TCC cpp_src/streambuf.tcc 41;" d file: +_STREAM_ITERATOR_H cpp_src/stream_iterator.h 36;" d +_STRINGFWD_H cpp_src/stringfwd.h 40;" d +_S_adjustfield cpp_src/ios_base.h /^ _S_adjustfield = _S_left | _S_right | _S_internal,$/;" e enum:std::_Ios_Fmtflags +_S_app cpp_src/ios_base.h /^ _S_app = 1L << 0,$/;" e enum:std::_Ios_Openmode +_S_ate cpp_src/ios_base.h /^ _S_ate = 1L << 1,$/;" e enum:std::_Ios_Openmode +_S_atoms cpp_src/locale_facets.h /^ static const char* _S_atoms;$/;" m class:std::money_base access:public +_S_atoms_in cpp_src/locale_facets.h /^ static const char* _S_atoms_in;$/;" m class:std::__num_base access:public +_S_atoms_out cpp_src/locale_facets.h /^ static const char* _S_atoms_out;$/;" m class:std::__num_base access:public +_S_badbit cpp_src/ios_base.h /^ _S_badbit = 1L << 0,$/;" e enum:std::_Ios_Iostate +_S_basefield cpp_src/ios_base.h /^ _S_basefield = _S_dec | _S_oct | _S_hex,$/;" e enum:std::_Ios_Fmtflags +_S_beg cpp_src/ios_base.h /^ _S_beg = 0,$/;" e enum:std::_Ios_Seekdir +_S_bin cpp_src/ios_base.h /^ _S_bin = 1L << 2,$/;" e enum:std::_Ios_Openmode +_S_black cpp_src/stl_tree.h /^ enum _Rb_tree_color { _S_red = false, _S_black = true };$/;" e enum:std::_Rb_tree_color +_S_boolalpha cpp_src/ios_base.h /^ _S_boolalpha = 1L << 0,$/;" e enum:std::_Ios_Fmtflags +_S_buffer_size cpp_src/stl_deque.h /^ static size_t _S_buffer_size()$/;" f class:std::deque access:protected signature:() +_S_buffer_size cpp_src/stl_deque.h /^ static size_t _S_buffer_size()$/;" f struct:std::_Deque_iterator access:public signature:() +_S_c_locale cpp_src/locale_classes.h /^ static __c_locale _S_c_locale;$/;" m class:std::locale::facet access:private +_S_c_name cpp_src/locale_classes.h /^ static const char _S_c_name[2];$/;" m class:std::locale::facet access:private +_S_categories cpp_src/locale_classes.h /^ static const char* const* const _S_categories;$/;" m class:std::locale access:private +_S_categories_size cpp_src/locale_classes.h /^ enum { _S_categories_size = 6 + _GLIBCXX_NUM_CATEGORIES };$/;" e enum:std::locale::__anon4 +_S_chunk_size cpp_src/stl_algo.h /^ enum { _S_chunk_size = 7 };$/;" e enum:std::__anon11 +_S_classic cpp_src/locale_classes.h /^ static _Impl* _S_classic;$/;" m class:std::locale access:private +_S_clone_c_locale cpp_src/locale_classes.h /^ _S_clone_c_locale(__c_locale& __cloc);$/;" p class:std::locale::facet access:protected signature:(__c_locale& __cloc) +_S_construct cpp_src/basic_string.h /^ _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a,$/;" p class:std::basic_string access:private signature:(_InIterator __beg, _InIterator __end, const _Alloc& __a, input_iterator_tag) +_S_construct cpp_src/basic_string.h /^ _S_construct(_FwdIterator __beg, _FwdIterator __end, const _Alloc& __a,$/;" p class:std::basic_string access:private signature:(_FwdIterator __beg, _FwdIterator __end, const _Alloc& __a, forward_iterator_tag) +_S_construct cpp_src/basic_string.h /^ _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a)$/;" f class:std::basic_string access:private signature:(_InIterator __beg, _InIterator __end, const _Alloc& __a) +_S_construct cpp_src/basic_string.h /^ _S_construct(size_type __req, _CharT __c, const _Alloc& __a);$/;" p class:std::basic_string access:private signature:(size_type __req, _CharT __c, const _Alloc& __a) +_S_construct cpp_src/basic_string.tcc /^ _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a,$/;" f class:std::basic_string signature:(_InIterator __beg, _InIterator __end, const _Alloc& __a, forward_iterator_tag) +_S_construct cpp_src/basic_string.tcc /^ _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a,$/;" f class:std::basic_string signature:(_InIterator __beg, _InIterator __end, const _Alloc& __a, input_iterator_tag) +_S_construct cpp_src/basic_string.tcc /^ _S_construct(size_type __n, _CharT __c, const _Alloc& __a)$/;" f class:std::basic_string signature:(size_type __n, _CharT __c, const _Alloc& __a) +_S_construct_aux cpp_src/basic_string.h /^ _S_construct_aux(_InIterator __beg, _InIterator __end,$/;" f class:std::basic_string access:private signature:(_InIterator __beg, _InIterator __end, const _Alloc& __a, __false_type) +_S_construct_aux cpp_src/basic_string.h /^ _S_construct_aux(_InIterator __beg, _InIterator __end,$/;" f class:std::basic_string access:private signature:(_InIterator __beg, _InIterator __end, const _Alloc& __a, __true_type) +_S_construct_pattern cpp_src/locale_facets.h /^ _S_construct_pattern(char __precedes, char __space, char __posn);$/;" p class:std::money_base access:public signature:(char __precedes, char __space, char __posn) +_S_copy_chars cpp_src/basic_string.h /^ _S_copy_chars(_CharT* __p, _Iterator __k1, _Iterator __k2)$/;" f class:std::basic_string access:private signature:(_CharT* __p, _Iterator __k1, _Iterator __k2) +_S_copy_chars cpp_src/basic_string.h /^ _S_copy_chars(_CharT* __p, _CharT* __k1, _CharT* __k2)$/;" f class:std::basic_string access:private signature:(_CharT* __p, _CharT* __k1, _CharT* __k2) +_S_copy_chars cpp_src/basic_string.h /^ _S_copy_chars(_CharT* __p, const _CharT* __k1, const _CharT* __k2)$/;" f class:std::basic_string access:private signature:(_CharT* __p, const _CharT* __k1, const _CharT* __k2) +_S_copy_chars cpp_src/basic_string.h /^ _S_copy_chars(_CharT* __p, const_iterator __k1, const_iterator __k2)$/;" f class:std::basic_string access:private signature:(_CharT* __p, const_iterator __k1, const_iterator __k2) +_S_copy_chars cpp_src/basic_string.h /^ _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2)$/;" f class:std::basic_string access:private signature:(_CharT* __p, iterator __k1, iterator __k2) +_S_create cpp_src/basic_string.h /^ _S_create(size_type, size_type, const _Alloc&);$/;" p struct:std::basic_string::_Rep access:public signature:(size_type, size_type, const _Alloc&) +_S_create cpp_src/basic_string.tcc /^ _S_create(size_type __capacity, size_type __old_capacity,$/;" f class:std::basic_string::_Rep signature:(size_type __capacity, size_type __old_capacity, const _Alloc& __alloc) +_S_create_c_locale cpp_src/locale_classes.h /^ _S_create_c_locale(__c_locale& __cloc, const char* __s,$/;" p class:std::locale::facet access:protected signature:(__c_locale& __cloc, const char* __s, __c_locale __old = 0) +_S_cur cpp_src/ios_base.h /^ _S_cur = SEEK_CUR,$/;" e enum:std::_Ios_Seekdir +_S_dec cpp_src/ios_base.h /^ _S_dec = 1L << 1,$/;" e enum:std::_Ios_Fmtflags +_S_default_pattern cpp_src/locale_facets.h /^ static const pattern _S_default_pattern;$/;" m class:std::money_base access:public +_S_destroy_c_locale cpp_src/locale_classes.h /^ _S_destroy_c_locale(__c_locale& __cloc);$/;" p class:std::locale::facet access:protected signature:(__c_locale& __cloc) +_S_do_it cpp_src/allocator.h /^ _S_do_it(_Alloc& __one, _Alloc& __two)$/;" f struct:std::__alloc_swap access:public signature:(_Alloc& __one, _Alloc& __two) +_S_do_it cpp_src/allocator.h /^ { static void _S_do_it(_Alloc&, _Alloc&) { } };$/;" f struct:std::__alloc_swap access:public signature:(_Alloc&, _Alloc&) +_S_do_it cpp_src/complex /^ static inline _Tp _S_do_it(const complex<_Tp>& __z)$/;" f struct:std::_Norm_helper access:public signature:(const complex<_Tp>& __z) +_S_do_it cpp_src/valarray_array.h /^ _S_do_it(_Tp* __restrict__ __b, _Tp* __restrict__ __e)$/;" f struct:std::_Array_default_ctor access:public signature:(_Tp* __restrict__ __b, _Tp* __restrict__ __e) +_S_do_it cpp_src/valarray_array.h /^ _S_do_it(_Tp* __restrict__ __b, _Tp* __restrict__ __e, const _Tp __t)$/;" f struct:std::_Array_init_ctor access:public signature:(_Tp* __restrict__ __b, _Tp* __restrict__ __e, const _Tp __t) +_S_do_it cpp_src/valarray_array.h /^ _S_do_it(_Tp* __restrict__ __b, _Tp* __restrict__ __e, const _Tp __t)$/;" f struct:std::_Array_init_ctor access:public signature:(_Tp* __restrict__ __b, _Tp* __restrict__ __e, const _Tp __t) +_S_do_it cpp_src/valarray_array.h /^ _S_do_it(const _Tp* __restrict__ __a, size_t __n, _Tp* __restrict__ __b)$/;" f struct:std::_Array_copier access:public signature:(const _Tp* __restrict__ __a, size_t __n, _Tp* __restrict__ __b) +_S_do_it cpp_src/valarray_array.h /^ _S_do_it(const _Tp* __restrict__ __b, const _Tp* __restrict__ __e,$/;" f struct:std::_Array_copy_ctor access:public signature:(const _Tp* __restrict__ __b, const _Tp* __restrict__ __e, _Tp* __restrict__ __o) +_S_do_sanitize cpp_src/bitset /^ static void _S_do_sanitize(unsigned long& __val)$/;" f struct:std::_Sanitize access:public signature:(unsigned long& __val) +_S_do_sanitize cpp_src/bitset /^ { static void _S_do_sanitize(unsigned long) {} };$/;" f struct:std::_Sanitize access:public signature:(unsigned long) +_S_empty_rep cpp_src/basic_string.h /^ _S_empty_rep()$/;" f struct:std::basic_string::_Rep access:public signature:() +_S_empty_rep cpp_src/basic_string.h /^ _S_empty_rep()$/;" f class:std::basic_string access:private signature:() +_S_empty_rep_storage cpp_src/basic_string.h /^ static size_type _S_empty_rep_storage[];$/;" m struct:std::basic_string::_Rep access:public +_S_empty_rep_storage cpp_src/basic_string.tcc /^ basic_string<_CharT, _Traits, _Alloc>::_Rep::_S_empty_rep_storage[$/;" m class:std::basic_string::_Rep file: +_S_end cpp_src/ios_base.h /^ _S_end = SEEK_END,$/;" e enum:std::_Ios_Seekdir +_S_end cpp_src/locale_facets.h /^ _S_end = 11$/;" e enum:std::money_base::__anon9 +_S_eofbit cpp_src/ios_base.h /^ _S_eofbit = 1L << 1,$/;" e enum:std::_Ios_Iostate +_S_facet_categories cpp_src/locale_classes.h /^ static const locale::id* const* const _S_facet_categories[];$/;" m class:std::locale::_Impl::locale access:private +_S_failbit cpp_src/ios_base.h /^ _S_failbit = 1L << 2,$/;" e enum:std::_Ios_Iostate +_S_fixed cpp_src/ios_base.h /^ _S_fixed = 1L << 2,$/;" e enum:std::_Ios_Fmtflags +_S_floatfield cpp_src/ios_base.h /^ _S_floatfield = _S_scientific | _S_fixed,$/;" e enum:std::_Ios_Fmtflags +_S_format_float cpp_src/locale_facets.h /^ _S_format_float(const ios_base& __io, char* __fptr, char __mod);$/;" p class:std::__num_base access:public signature:(const ios_base& __io, char* __fptr, char __mod) +_S_get_c_locale cpp_src/locale_classes.h /^ _S_get_c_locale();$/;" p class:std::locale::facet access:protected signature:() +_S_get_c_name cpp_src/locale_classes.h /^ _S_get_c_name();$/;" p class:std::locale::facet access:protected signature:() +_S_global cpp_src/locale_classes.h /^ static _Impl* _S_global;$/;" m class:std::locale access:private +_S_goodbit cpp_src/ios_base.h /^ _S_goodbit = 0,$/;" e enum:std::_Ios_Iostate +_S_hex cpp_src/ios_base.h /^ _S_hex = 1L << 3,$/;" e enum:std::_Ios_Fmtflags +_S_iE cpp_src/locale_facets.h /^ _S_iE = _S_izero + 20,$/;" e enum:std::__num_base::__anon8 +_S_iX cpp_src/locale_facets.h /^ _S_iX,$/;" e enum:std::__num_base::__anon8 +_S_id_collate cpp_src/locale_classes.h /^ static const locale::id* const _S_id_collate[];$/;" m class:std::locale::_Impl::locale access:private +_S_id_ctype cpp_src/locale_classes.h /^ static const locale::id* const _S_id_ctype[];$/;" m class:std::locale::_Impl::locale access:private +_S_id_messages cpp_src/locale_classes.h /^ static const locale::id* const _S_id_messages[];$/;" m class:std::locale::_Impl::locale access:private +_S_id_monetary cpp_src/locale_classes.h /^ static const locale::id* const _S_id_monetary[];$/;" m class:std::locale::_Impl::locale access:private +_S_id_numeric cpp_src/locale_classes.h /^ static const locale::id* const _S_id_numeric[];$/;" m class:std::locale::_Impl::locale access:private +_S_id_time cpp_src/locale_classes.h /^ static const locale::id* const _S_id_time[];$/;" m class:std::locale::_Impl::locale access:private +_S_ie cpp_src/locale_facets.h /^ _S_ie = _S_izero + 14,$/;" e enum:std::__num_base::__anon8 +_S_iend cpp_src/locale_facets.h /^ _S_iend = 26$/;" e enum:std::__num_base::__anon8 +_S_iminus cpp_src/locale_facets.h /^ _S_iminus,$/;" e enum:std::__num_base::__anon8 +_S_in cpp_src/ios_base.h /^ _S_in = 1L << 3,$/;" e enum:std::_Ios_Openmode +_S_initial_map_size cpp_src/stl_deque.h /^ enum { _S_initial_map_size = 8 };$/;" e enum:std::_Deque_base::__anon3 +_S_initialize cpp_src/locale_classes.h /^ _S_initialize();$/;" p class:std::locale access:private signature:() +_S_initialize_once cpp_src/locale_classes.h /^ _S_initialize_once();$/;" p class:std::locale access:private signature:() +_S_initialize_once cpp_src/locale_classes.h /^ _S_initialize_once();$/;" p class:std::locale::facet access:private signature:() +_S_internal cpp_src/ios_base.h /^ _S_internal = 1L << 4,$/;" e enum:std::_Ios_Fmtflags +_S_ios_fmtflags_end cpp_src/ios_base.h /^ _S_ios_fmtflags_end = 1L << 16 $/;" e enum:std::_Ios_Fmtflags +_S_ios_iostate_end cpp_src/ios_base.h /^ _S_ios_iostate_end = 1L << 16 $/;" e enum:std::_Ios_Iostate +_S_ios_openmode_end cpp_src/ios_base.h /^ _S_ios_openmode_end = 1L << 16 $/;" e enum:std::_Ios_Openmode +_S_ios_seekdir_end cpp_src/ios_base.h /^ _S_ios_seekdir_end = 1L << 16 $/;" e enum:std::_Ios_Seekdir +_S_iplus cpp_src/locale_facets.h /^ _S_iplus,$/;" e enum:std::__num_base::__anon8 +_S_ix cpp_src/locale_facets.h /^ _S_ix,$/;" e enum:std::__num_base::__anon8 +_S_izero cpp_src/locale_facets.h /^ _S_izero,$/;" e enum:std::__num_base::__anon8 +_S_key cpp_src/stl_tree.h /^ _S_key(_Const_Base_ptr __x)$/;" f class:std::_Rb_tree access:protected signature:(_Const_Base_ptr __x) +_S_key cpp_src/stl_tree.h /^ _S_key(_Const_Link_type __x)$/;" f class:std::_Rb_tree access:protected signature:(_Const_Link_type __x) +_S_left cpp_src/ios_base.h /^ _S_left = 1L << 5,$/;" e enum:std::_Ios_Fmtflags +_S_left cpp_src/stl_tree.h /^ _S_left(_Base_ptr __x)$/;" f class:std::_Rb_tree access:protected signature:(_Base_ptr __x) +_S_left cpp_src/stl_tree.h /^ _S_left(_Const_Base_ptr __x)$/;" f class:std::_Rb_tree access:protected signature:(_Const_Base_ptr __x) +_S_local_word_size cpp_src/ios_base.h /^ enum { _S_local_word_size = 8 };$/;" e enum:std::ios_base::__anon5 +_S_maskbit cpp_src/bitset /^ _S_maskbit(size_t __pos )$/;" f struct:std::_Base_bitset access:public signature:(size_t __pos ) +_S_max_size cpp_src/basic_string.h /^ static const size_type _S_max_size;$/;" m struct:std::basic_string::_Rep access:public +_S_max_size cpp_src/basic_string.tcc /^ _Rep::_S_max_size = (((npos - sizeof(_Rep_base))\/sizeof(_CharT)) - 1) \/ 4;$/;" m class:std::basic_string::_Rep file: +_S_maximum cpp_src/stl_tree.h /^ _S_maximum(_Base_ptr __x)$/;" f class:std::_Rb_tree access:protected signature:(_Base_ptr __x) +_S_maximum cpp_src/stl_tree.h /^ _S_maximum(_Const_Base_ptr __x)$/;" f class:std::_Rb_tree access:protected signature:(_Const_Base_ptr __x) +_S_maximum cpp_src/stl_tree.h /^ _S_maximum(_Base_ptr __x)$/;" f struct:std::_Rb_tree_node_base access:public signature:(_Base_ptr __x) +_S_maximum cpp_src/stl_tree.h /^ _S_maximum(_Const_Base_ptr __x)$/;" f struct:std::_Rb_tree_node_base access:public signature:(_Const_Base_ptr __x) +_S_minimum cpp_src/stl_tree.h /^ _S_minimum(_Base_ptr __x)$/;" f class:std::_Rb_tree access:protected signature:(_Base_ptr __x) +_S_minimum cpp_src/stl_tree.h /^ _S_minimum(_Const_Base_ptr __x)$/;" f class:std::_Rb_tree access:protected signature:(_Const_Base_ptr __x) +_S_minimum cpp_src/stl_tree.h /^ _S_minimum(_Base_ptr __x)$/;" f struct:std::_Rb_tree_node_base access:public signature:(_Base_ptr __x) +_S_minimum cpp_src/stl_tree.h /^ _S_minimum(_Const_Base_ptr __x)$/;" f struct:std::_Rb_tree_node_base access:public signature:(_Const_Base_ptr __x) +_S_minus cpp_src/locale_facets.h /^ _S_minus,$/;" e enum:std::money_base::__anon9 +_S_normalize_category cpp_src/locale_classes.h /^ _S_normalize_category(category);$/;" p class:std::locale access:private signature:(category) +_S_oE cpp_src/locale_facets.h /^ _S_oE = _S_oudigits + 14, \/\/ For scientific notation, 'E'$/;" e enum:std::__num_base::__anon7 +_S_oX cpp_src/locale_facets.h /^ _S_oX,$/;" e enum:std::__num_base::__anon7 +_S_oct cpp_src/ios_base.h /^ _S_oct = 1L << 6,$/;" e enum:std::_Ios_Fmtflags +_S_odigits cpp_src/locale_facets.h /^ _S_odigits,$/;" e enum:std::__num_base::__anon7 +_S_odigits_end cpp_src/locale_facets.h /^ _S_odigits_end = _S_odigits + 16,$/;" e enum:std::__num_base::__anon7 +_S_oe cpp_src/locale_facets.h /^ _S_oe = _S_odigits + 14, \/\/ For scientific notation, 'e'$/;" e enum:std::__num_base::__anon7 +_S_oend cpp_src/locale_facets.h /^ _S_oend = _S_oudigits_end$/;" e enum:std::__num_base::__anon7 +_S_ominus cpp_src/locale_facets.h /^ _S_ominus,$/;" e enum:std::__num_base::__anon7 +_S_once cpp_src/locale_classes.h /^ static __gthread_once_t _S_once;$/;" m class:std::locale::facet access:private +_S_once cpp_src/locale_classes.h /^ static __gthread_once_t _S_once;$/;" m class:std::locale access:private +_S_oplus cpp_src/locale_facets.h /^ _S_oplus,$/;" e enum:std::__num_base::__anon7 +_S_oudigits cpp_src/locale_facets.h /^ _S_oudigits = _S_odigits_end,$/;" e enum:std::__num_base::__anon7 +_S_oudigits_end cpp_src/locale_facets.h /^ _S_oudigits_end = _S_oudigits + 16,$/;" e enum:std::__num_base::__anon7 +_S_out cpp_src/ios_base.h /^ _S_out = 1L << 4,$/;" e enum:std::_Ios_Openmode +_S_ox cpp_src/locale_facets.h /^ _S_ox,$/;" e enum:std::__num_base::__anon7 +_S_pad cpp_src/locale_facets.h /^ _S_pad(ios_base& __io, _CharT __fill, _CharT* __news,$/;" p struct:std::__pad access:public signature:(ios_base& __io, _CharT __fill, _CharT* __news, const _CharT* __olds, const streamsize __newlen, const streamsize __oldlen, const bool __num) +_S_pad cpp_src/locale_facets.tcc /^ __pad<_CharT, _Traits>::_S_pad(ios_base& __io, _CharT __fill,$/;" f class:std::__pad signature:(ios_base& __io, _CharT __fill, _CharT* __news, const _CharT* __olds, const streamsize __newlen, const streamsize __oldlen, const bool __num) +_S_red cpp_src/stl_tree.h /^ enum _Rb_tree_color { _S_red = false, _S_black = true };$/;" e enum:std::_Rb_tree_color +_S_refcount cpp_src/ios_base.h /^ static _Atomic_word _S_refcount;$/;" m class:std::ios_base::Init access:private +_S_refcount cpp_src/locale_classes.h /^ static _Atomic_word _S_refcount;$/;" m class:std::locale::id access:private +_S_right cpp_src/ios_base.h /^ _S_right = 1L << 7,$/;" e enum:std::_Ios_Fmtflags +_S_right cpp_src/stl_tree.h /^ _S_right(_Base_ptr __x)$/;" f class:std::_Rb_tree access:protected signature:(_Base_ptr __x) +_S_right cpp_src/stl_tree.h /^ _S_right(_Const_Base_ptr __x)$/;" f class:std::_Rb_tree access:protected signature:(_Const_Base_ptr __x) +_S_scientific cpp_src/ios_base.h /^ _S_scientific = 1L << 8,$/;" e enum:std::_Ios_Fmtflags +_S_showbase cpp_src/ios_base.h /^ _S_showbase = 1L << 9,$/;" e enum:std::_Ios_Fmtflags +_S_showpoint cpp_src/ios_base.h /^ _S_showpoint = 1L << 10,$/;" e enum:std::_Ios_Fmtflags +_S_showpos cpp_src/ios_base.h /^ _S_showpos = 1L << 11,$/;" e enum:std::_Ios_Fmtflags +_S_skipws cpp_src/ios_base.h /^ _S_skipws = 1L << 12,$/;" e enum:std::_Ios_Fmtflags +_S_synced_with_stdio cpp_src/ios_base.h /^ static bool _S_synced_with_stdio;$/;" m class:std::ios_base::Init access:private +_S_terminal cpp_src/basic_string.h /^ static const _CharT _S_terminal;$/;" m struct:std::basic_string::_Rep access:public +_S_terminal cpp_src/basic_string.tcc /^ _Rep::_S_terminal = _CharT();$/;" m class:std::basic_string::_Rep file: +_S_threshold cpp_src/stl_algo.h /^ enum { _S_threshold = 16 };$/;" e enum:std::__anon10 +_S_timezones cpp_src/locale_facets.h /^ static const _CharT* _S_timezones[14];$/;" m struct:std::__timepunct_cache access:public +_S_timezones cpp_src/locale_facets.h /^ __timepunct_cache::_S_timezones[14];$/;" m class:std::__timepunct_cache +_S_timezones cpp_src/locale_facets.h /^ __timepunct_cache::_S_timezones[14];$/;" m class:std::__timepunct_cache +_S_timezones cpp_src/locale_facets.h /^ const _CharT* __timepunct_cache<_CharT>::_S_timezones[14];$/;" m class:std::__timepunct_cache +_S_trunc cpp_src/ios_base.h /^ _S_trunc = 1L << 5,$/;" e enum:std::_Ios_Openmode +_S_unitbuf cpp_src/ios_base.h /^ _S_unitbuf = 1L << 13,$/;" e enum:std::_Ios_Fmtflags +_S_uppercase cpp_src/ios_base.h /^ _S_uppercase = 1L << 14,$/;" e enum:std::_Ios_Fmtflags +_S_value cpp_src/stl_tree.h /^ _S_value(_Const_Base_ptr __x)$/;" f class:std::_Rb_tree access:protected signature:(_Const_Base_ptr __x) +_S_value cpp_src/stl_tree.h /^ _S_value(_Const_Link_type __x)$/;" f class:std::_Rb_tree access:protected signature:(_Const_Link_type __x) +_S_whichbit cpp_src/bitset /^ _S_whichbit(size_t __pos )$/;" f struct:std::_Base_bitset access:public signature:(size_t __pos ) +_S_whichbyte cpp_src/bitset /^ _S_whichbyte(size_t __pos )$/;" f struct:std::_Base_bitset access:public signature:(size_t __pos ) +_S_whichword cpp_src/bitset /^ _S_whichword(size_t __pos )$/;" f struct:std::_Base_bitset access:public signature:(size_t __pos ) +_S_word_bit cpp_src/stl_bvector.h /^ enum { _S_word_bit = int(CHAR_BIT * sizeof(_Bit_type)) };$/;" e enum:std::__anon6 +_S_zero cpp_src/locale_facets.h /^ _S_zero,$/;" e enum:std::money_base::__anon9 +_SameTypeConcept cpp_src/boost_concept_check.h /^ struct _SameTypeConcept$/;" s +_SameTypeConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_SameTypeConcept access:public signature:() +_Sanitize cpp_src/bitset /^ struct _Sanitize$/;" s namespace:std file: +_Sanitize cpp_src/bitset /^ struct _Sanitize<0>$/;" s namespace:std file: +_Select1st cpp_src/stl_function.h /^ struct _Select1st : public unary_function<_Pair,$/;" s namespace:std inherits:unary_function +_Select2nd cpp_src/stl_function.h /^ struct _Select2nd : public unary_function<_Pair,$/;" s namespace:std inherits:unary_function +_Self cpp_src/stl_deque.h /^ typedef _Deque_iterator _Self;$/;" t struct:std::_Deque_iterator access:public +_Self cpp_src/stl_list.h /^ typedef _List_const_iterator<_Tp> _Self;$/;" t struct:std::_List_const_iterator access:public +_Self cpp_src/stl_list.h /^ typedef _List_iterator<_Tp> _Self;$/;" t struct:std::_List_iterator access:public +_Self cpp_src/stl_tree.h /^ typedef _Rb_tree_const_iterator<_Tp> _Self;$/;" t struct:std::_Rb_tree_const_iterator access:public +_Self cpp_src/stl_tree.h /^ typedef _Rb_tree_iterator<_Tp> _Self;$/;" t struct:std::_Rb_tree_iterator access:public +_SequenceConcept cpp_src/boost_concept_check.h /^ struct _SequenceConcept$/;" s +_SequenceConcept::_Const_reference cpp_src/boost_concept_check.h /^ typedef typename _Sequence::const_reference _Const_reference;$/;" t struct:_SequenceConcept access:public +_SequenceConcept::_Reference cpp_src/boost_concept_check.h /^ typedef typename _Sequence::reference _Reference;$/;" t struct:_SequenceConcept access:public +_SequenceConcept::__const_constraints cpp_src/boost_concept_check.h /^ void __const_constraints(const _Sequence& __c) {$/;" f struct:_SequenceConcept access:public signature:(const _Sequence& __c) +_SequenceConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_SequenceConcept access:public signature:() +_SequenceConcept::__first cpp_src/boost_concept_check.h /^ typename _Sequence::value_type *__first, *__last;$/;" m struct:_SequenceConcept access:public +_SequenceConcept::__last cpp_src/boost_concept_check.h /^ typename _Sequence::value_type *__first, *__last;$/;" m struct:_SequenceConcept access:public +_SequenceConcept::__n cpp_src/boost_concept_check.h /^ typename _Sequence::size_type __n;$/;" m struct:_SequenceConcept access:public +_SequenceConcept::__p cpp_src/boost_concept_check.h /^ typename _Sequence::iterator __p, __q;$/;" m struct:_SequenceConcept access:public +_SequenceConcept::__q cpp_src/boost_concept_check.h /^ typename _Sequence::iterator __p, __q;$/;" m struct:_SequenceConcept access:public +_SequenceConcept::__t cpp_src/boost_concept_check.h /^ typename _Sequence::value_type __t;$/;" m struct:_SequenceConcept access:public +_Sequence_value_type cpp_src/stl_queue.h /^ typedef typename _Sequence::value_type _Sequence_value_type;$/;" t class:std::priority_queue access:private +_Sequence_value_type cpp_src/stl_queue.h /^ typedef typename _Sequence::value_type _Sequence_value_type;$/;" t class:std::queue access:private +_Sequence_value_type cpp_src/stl_stack.h /^ typedef typename _Sequence::value_type _Sequence_value_type;$/;" t class:std::stack access:private +_Setbase cpp_src/iomanip /^ struct _Setbase { int _M_base; };$/;" s namespace:std file: +_Setfill cpp_src/iomanip /^ struct _Setfill { _CharT _M_c; };$/;" s namespace:std file: +_Setiosflags cpp_src/iomanip /^ struct _Setiosflags { ios_base::fmtflags _M_mask; };$/;" s namespace:std file: +_Setprecision cpp_src/iomanip /^ struct _Setprecision { int _M_n; };$/;" s namespace:std file: +_Setw cpp_src/iomanip /^ struct _Setw { int _M_n; };$/;" s namespace:std file: +_SignedIntegerConcept cpp_src/boost_concept_check.h /^ struct _SignedIntegerConcept {$/;" s +_SignedIntegerConcept cpp_src/boost_concept_check.h /^ template <> struct _SignedIntegerConcept { void __constraints() {} };$/;" s +_SignedIntegerConcept cpp_src/boost_concept_check.h /^ template <> struct _SignedIntegerConcept { void __constraints(){}};$/;" s +_SignedIntegerConcept cpp_src/boost_concept_check.h /^ template <> struct _SignedIntegerConcept { void __constraints() {} };$/;" s +_SignedIntegerConcept cpp_src/boost_concept_check.h /^ template <> struct _SignedIntegerConcept { void __constraints() {} };$/;" s +_SignedIntegerConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_SignedIntegerConcept access:public signature:() +_SignedIntegerConcept::__constraints cpp_src/boost_concept_check.h /^ template <> struct _SignedIntegerConcept { void __constraints() {} };$/;" f struct:_SignedIntegerConcept access:public signature:() +_SignedIntegerConcept::__constraints cpp_src/boost_concept_check.h /^ template <> struct _SignedIntegerConcept { void __constraints(){}};$/;" f struct:_SignedIntegerConcept access:public signature:() +_SignedIntegerConcept::__constraints cpp_src/boost_concept_check.h /^ template <> struct _SignedIntegerConcept { void __constraints() {} };$/;" f struct:_SignedIntegerConcept access:public signature:() +_SignedIntegerConcept::__constraints cpp_src/boost_concept_check.h /^ template <> struct _SignedIntegerConcept { void __constraints() {} };$/;" f struct:_SignedIntegerConcept access:public signature:() +_SimpleAssociativeContainerConcept cpp_src/boost_concept_check.h /^ struct _SimpleAssociativeContainerConcept$/;" s +_SimpleAssociativeContainerConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_SimpleAssociativeContainerConcept access:public signature:() +_Size_type cpp_src/boost_concept_check.h /^ typedef typename _Container::size_type _Size_type;$/;" t struct:_ContainerConcept access:public +_Size_type cpp_src/boost_concept_check.h /^ typedef typename _RandomAccessContainer::size_type _Size_type;$/;" t struct:_Mutable_RandomAccessContainerConcept access:public +_Size_type cpp_src/boost_concept_check.h /^ typedef typename _RandomAccessContainer::size_type _Size_type;$/;" t struct:_RandomAccessContainerConcept access:public +_SortedAssociativeContainerConcept cpp_src/boost_concept_check.h /^ struct _SortedAssociativeContainerConcept$/;" s +_SortedAssociativeContainerConcept::_Const_iterator cpp_src/boost_concept_check.h /^ _Const_iterator;$/;" t struct:_SortedAssociativeContainerConcept access:public +_SortedAssociativeContainerConcept::_Iterator cpp_src/boost_concept_check.h /^ typedef typename _SortedAssociativeContainer::iterator _Iterator;$/;" t struct:_SortedAssociativeContainerConcept access:public +_SortedAssociativeContainerConcept::__const_constraints cpp_src/boost_concept_check.h /^ void __const_constraints(const _SortedAssociativeContainer& __c) {$/;" f struct:_SortedAssociativeContainerConcept access:public signature:(const _SortedAssociativeContainer& __c) +_SortedAssociativeContainerConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_SortedAssociativeContainerConcept access:public signature:() +_SortedAssociativeContainerConcept::__cp cpp_src/boost_concept_check.h /^ _Const_iterator __cp;$/;" m struct:_SortedAssociativeContainerConcept access:public +_SortedAssociativeContainerConcept::__cr cpp_src/boost_concept_check.h /^ std::pair<_Const_iterator,_Const_iterator> __cr;$/;" m struct:_SortedAssociativeContainerConcept access:public +_SortedAssociativeContainerConcept::__first cpp_src/boost_concept_check.h /^ typename _SortedAssociativeContainer::value_type *__first, *__last;$/;" m struct:_SortedAssociativeContainerConcept access:public +_SortedAssociativeContainerConcept::__k cpp_src/boost_concept_check.h /^ typename _SortedAssociativeContainer::key_type __k;$/;" m struct:_SortedAssociativeContainerConcept access:public +_SortedAssociativeContainerConcept::__kc cpp_src/boost_concept_check.h /^ typename _SortedAssociativeContainer::key_compare __kc;$/;" m struct:_SortedAssociativeContainerConcept access:public +_SortedAssociativeContainerConcept::__last cpp_src/boost_concept_check.h /^ typename _SortedAssociativeContainer::value_type *__first, *__last;$/;" m struct:_SortedAssociativeContainerConcept access:public +_SortedAssociativeContainerConcept::__p cpp_src/boost_concept_check.h /^ _Iterator __p;$/;" m struct:_SortedAssociativeContainerConcept access:public +_SortedAssociativeContainerConcept::__r cpp_src/boost_concept_check.h /^ std::pair<_Iterator,_Iterator> __r;$/;" m struct:_SortedAssociativeContainerConcept access:public +_SortedAssociativeContainerConcept::__t cpp_src/boost_concept_check.h /^ typename _SortedAssociativeContainer::value_type __t;$/;" m struct:_SortedAssociativeContainerConcept access:public +_SortedAssociativeContainerConcept::__vc cpp_src/boost_concept_check.h /^ typename _SortedAssociativeContainer::value_compare __vc;$/;" m struct:_SortedAssociativeContainerConcept access:public +_TEMPBUF_H cpp_src/stl_tempbuf.h 63;" d +_TREE_H cpp_src/stl_tree.h 65;" d +_TYPEINFO cpp_src/typeinfo 37;" d file: +_Temporary_buffer cpp_src/stl_tempbuf.h /^ _Temporary_buffer(_ForwardIterator __first, _ForwardIterator __last);$/;" p class:std::_Temporary_buffer access:public signature:(_ForwardIterator __first, _ForwardIterator __last) +_Temporary_buffer cpp_src/stl_tempbuf.h /^ _Temporary_buffer(const _Temporary_buffer&);$/;" p class:std::_Temporary_buffer access:private signature:(const _Temporary_buffer&) +_Temporary_buffer cpp_src/stl_tempbuf.h /^ _Temporary_buffer(_ForwardIterator __first, _ForwardIterator __last)$/;" f class:std::_Temporary_buffer signature:(_ForwardIterator __first, _ForwardIterator __last) +_Temporary_buffer cpp_src/stl_tempbuf.h /^ class _Temporary_buffer$/;" c namespace:std +_Tp cpp_src/valarray_before.h /^ typedef typename _Dom::value_type _Tp;$/;" t struct:std::_BinClos access:public +_Tp cpp_src/valarray_before.h /^ typedef value_type _Tp;$/;" t struct:std::_RefFunClos access:public +_Tp cpp_src/valarray_before.h /^ typedef value_type _Tp;$/;" t struct:std::_ValFunClos access:public +_Tp_alloc_type cpp_src/stl_deque.h /^ typedef typename _Alloc::template rebind<_Tp>::other _Tp_alloc_type;$/;" t class:std::_Deque_base access:protected +_Tp_alloc_type cpp_src/stl_deque.h /^ typedef typename _Base::_Tp_alloc_type _Tp_alloc_type;$/;" t class:std::deque access:private +_Tp_alloc_type cpp_src/stl_list.h /^ typedef typename _Alloc::template rebind<_Tp>::other _Tp_alloc_type;$/;" t class:std::_List_base access:protected +_Tp_alloc_type cpp_src/stl_list.h /^ typedef typename _Base::_Tp_alloc_type _Tp_alloc_type;$/;" t class:std::list access:private +_Tp_alloc_type cpp_src/stl_vector.h /^ typedef typename _Alloc::template rebind<_Tp>::other _Tp_alloc_type;$/;" t struct:std::_Vector_base access:public +_Tp_alloc_type cpp_src/stl_vector.h /^ typedef typename _Base::_Tp_alloc_type _Tp_alloc_type;$/;" t class:std::vector access:private +_TrivialIteratorConcept cpp_src/boost_concept_check.h /^ struct _TrivialIteratorConcept$/;" s +_TrivialIteratorConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_TrivialIteratorConcept access:public signature:() +_TrivialIteratorConcept::__i cpp_src/boost_concept_check.h /^ _Tp __i;$/;" m struct:_TrivialIteratorConcept access:public +_Type cpp_src/boost_concept_check.h /^struct _Aux_require_same<_Tp,_Tp> { typedef _Tp _Type; };$/;" t struct:_Aux_require_same access:public +_UnBase cpp_src/valarray_before.h /^ _UnBase(const _Arg& __e) : _M_expr(__e) {}$/;" f class:std::_UnBase access:public signature:(const _Arg& __e) +_UnBase cpp_src/valarray_before.h /^ class _UnBase$/;" c namespace:std +_UnClos cpp_src/valarray_before.h /^ _UnClos(const _Arg& __e) : _Base(__e) {}$/;" f struct:std::_UnClos access:public signature:(const _Arg& __e) +_UnClos cpp_src/valarray_before.h /^ struct _UnClos<_Oper, _Expr, _Dom>$/;" s namespace:std inherits:_UnBase +_UnClos cpp_src/valarray_before.h /^ struct _UnClos<_Oper, _ValArray, _Tp>$/;" s namespace:std inherits:_UnBase +_UnaryFunctionConcept cpp_src/boost_concept_check.h /^ struct _UnaryFunctionConcept$/;" s +_UnaryFunctionConcept cpp_src/boost_concept_check.h /^ struct _UnaryFunctionConcept<_Func, void, _Arg> {$/;" s +_UnaryFunctionConcept::__arg cpp_src/boost_concept_check.h /^ _Arg __arg;$/;" m struct:_UnaryFunctionConcept access:public +_UnaryFunctionConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_UnaryFunctionConcept access:public signature:() +_UnaryFunctionConcept::__f cpp_src/boost_concept_check.h /^ _Func __f;$/;" m struct:_UnaryFunctionConcept access:public +_UnaryFunctionConcept::__r cpp_src/boost_concept_check.h /^ _Return __r;$/;" m struct:_UnaryFunctionConcept access:public +_UnaryOp cpp_src/valarray /^ struct _UnaryOp $/;" s class:std::valarray file: access:private +_UnaryPredicateConcept cpp_src/boost_concept_check.h /^ struct _UnaryPredicateConcept$/;" s +_UnaryPredicateConcept::__arg cpp_src/boost_concept_check.h /^ _Arg __arg;$/;" m struct:_UnaryPredicateConcept access:public +_UnaryPredicateConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_UnaryPredicateConcept access:public signature:() +_UnaryPredicateConcept::__f cpp_src/boost_concept_check.h /^ _Func __f;$/;" m struct:_UnaryPredicateConcept access:public +_Unchecked_flip cpp_src/bitset /^ _Unchecked_flip(size_t __pos)$/;" f class:std::bitset access:public signature:(size_t __pos) +_Unchecked_reset cpp_src/bitset /^ _Unchecked_reset(size_t __pos)$/;" f class:std::bitset access:public signature:(size_t __pos) +_Unchecked_set cpp_src/bitset /^ _Unchecked_set(size_t __pos)$/;" f class:std::bitset access:public signature:(size_t __pos) +_Unchecked_set cpp_src/bitset /^ _Unchecked_set(size_t __pos, int __val)$/;" f class:std::bitset access:public signature:(size_t __pos, int __val) +_Unchecked_test cpp_src/bitset /^ _Unchecked_test(size_t __pos) const$/;" f class:std::bitset access:public signature:(size_t __pos) const +_UniqueAssociativeContainerConcept cpp_src/boost_concept_check.h /^ struct _UniqueAssociativeContainerConcept$/;" s +_UniqueAssociativeContainerConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_UniqueAssociativeContainerConcept access:public signature:() +_UniqueAssociativeContainerConcept::__first cpp_src/boost_concept_check.h /^ typename _UniqueAssociativeContainer::value_type *__first, *__last;$/;" m struct:_UniqueAssociativeContainerConcept access:public +_UniqueAssociativeContainerConcept::__last cpp_src/boost_concept_check.h /^ typename _UniqueAssociativeContainer::value_type *__first, *__last;$/;" m struct:_UniqueAssociativeContainerConcept access:public +_UniqueAssociativeContainerConcept::__pos_flag cpp_src/boost_concept_check.h /^ std::pair __pos_flag;$/;" m struct:_UniqueAssociativeContainerConcept access:public +_UniqueAssociativeContainerConcept::__t cpp_src/boost_concept_check.h /^ typename _UniqueAssociativeContainer::value_type __t;$/;" m struct:_UniqueAssociativeContainerConcept access:public +_UnsignedIntegerConcept cpp_src/boost_concept_check.h /^ struct _UnsignedIntegerConcept {$/;" s +_UnsignedIntegerConcept cpp_src/boost_concept_check.h /^ template <> struct _UnsignedIntegerConcept$/;" s +_UnsignedIntegerConcept cpp_src/boost_concept_check.h /^ template <> struct _UnsignedIntegerConcept$/;" s +_UnsignedIntegerConcept cpp_src/boost_concept_check.h /^ template <> struct _UnsignedIntegerConcept$/;" s +_UnsignedIntegerConcept cpp_src/boost_concept_check.h /^ template <> struct _UnsignedIntegerConcept$/;" s +_UnsignedIntegerConcept::__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_UnsignedIntegerConcept access:public signature:() +_UnsignedIntegerConcept::__constraints cpp_src/boost_concept_check.h /^ { void __constraints() {} };$/;" f struct:_UnsignedIntegerConcept access:public signature:() +_VALARRAY_AFTER_H cpp_src/valarray_after.h 39;" d +_VALARRAY_ARRAY_H cpp_src/valarray_array.h 39;" d +_VALARRAY_ARRAY_TCC cpp_src/valarray_array.tcc 38;" d file: +_VALARRAY_BEFORE_H cpp_src/valarray_before.h 39;" d +_VECTOR_H cpp_src/stl_vector.h 63;" d +_VECTOR_TCC cpp_src/vector.tcc 62;" d file: +_ValFunClos cpp_src/valarray_before.h /^ _ValFunClos(const _Dom& __e, _Tp __f(_Tp)) : _Base(__e, __f) {}$/;" f struct:std::_ValFunClos access:public signature:(const _Dom& __e, _Tp __f(_Tp)) +_ValFunClos cpp_src/valarray_before.h /^ _ValFunClos(const valarray<_Tp>& __v, _Tp __f(_Tp)) : _Base(__v, __f) {}$/;" f struct:std::_ValFunClos access:public signature:(const valarray<_Tp>& __v, _Tp __f(_Tp)) +_ValFunClos cpp_src/valarray_before.h /^ struct _ValFunClos<_Expr,_Dom> : _FunBase<_Dom, typename _Dom::value_type>$/;" s namespace:std inherits:_FunBase +_ValFunClos cpp_src/valarray_before.h /^ struct _ValFunClos<_ValArray,_Tp> : _FunBase, _Tp>$/;" s namespace:std inherits:_FunBase +_Value_type cpp_src/boost_concept_check.h /^ typedef typename _Container::value_type _Value_type;$/;" t struct:_ContainerConcept access:public +_Value_type cpp_src/boost_concept_check.h /^ typedef typename _Container::value_type _Value_type;$/;" t struct:_Mutable_ContainerConcept access:public +_Vector_base cpp_src/stl_vector.h /^ _Vector_base(const allocator_type& __a)$/;" f struct:std::_Vector_base access:public signature:(const allocator_type& __a) +_Vector_base cpp_src/stl_vector.h /^ _Vector_base(size_t __n, const allocator_type& __a)$/;" f struct:std::_Vector_base access:public signature:(size_t __n, const allocator_type& __a) +_Vector_base cpp_src/stl_vector.h /^ struct _Vector_base$/;" s namespace:std +_Vector_impl cpp_src/stl_vector.h /^ _Vector_impl(_Tp_alloc_type const& __a)$/;" f struct:std::_Vector_base::_Vector_impl access:public signature:(_Tp_alloc_type const& __a) +_Vector_impl cpp_src/stl_vector.h /^ struct _Vector_impl $/;" s struct:std::_Vector_base inherits:_Tp_alloc_type access:public +_Vt cpp_src/valarray_before.h /^ typedef typename _Arg::value_type _Vt;$/;" t class:std::_UnBase access:public +_Vt cpp_src/valarray_before.h /^ typedef typename _Clos::value_type _Vt;$/;" t class:std::_BinBase1 access:public +_Vt cpp_src/valarray_before.h /^ typedef typename _Clos::value_type _Vt;$/;" t class:std::_BinBase2 access:public +_Vt cpp_src/valarray_before.h /^ typedef typename _FirstArg::value_type _Vt;$/;" t class:std::_BinBase access:public +_WordT cpp_src/bitset /^ typedef unsigned long _WordT;$/;" t class:std::bitset file: access:private +_WordT cpp_src/bitset /^ typedef unsigned long _WordT;$/;" t struct:std::_Base_bitset file: access:public +_Words cpp_src/ios_base.h /^ _Words() : _M_pword(0), _M_iword(0) { }$/;" f struct:std::ios_base::_Words access:public signature:() +_Words cpp_src/ios_base.h /^ struct _Words$/;" s class:std::ios_base access:protected +__EXCEPTION__ cpp_src/exception 38;" d file: +__GXX_MERGED_TYPEINFO_NAMES cpp_src/typeinfo 53;" d file: +__a cpp_src/boost_concept_check.h /^ _First __a;$/;" m struct:_BinaryPredicateConcept access:public +__a cpp_src/boost_concept_check.h /^ _First __a;$/;" m struct:_Const_BinaryPredicateConcept access:public +__a cpp_src/boost_concept_check.h /^ _Tp __a, __b;$/;" m struct:_ComparableConcept access:public +__a cpp_src/boost_concept_check.h /^ _Tp __a, __b;$/;" m struct:_EqualityComparableConcept access:public +__a cpp_src/boost_concept_check.h /^ _Tp __a, __b;$/;" m struct:_LessThanComparableConcept access:public +__a cpp_src/boost_concept_check.h /^ _Tp __a, __b;$/;" m struct:_RandomAccessIteratorConcept access:public +__a cpp_src/boost_concept_check.h /^ _Tp __a;$/;" m struct:_AssignableConcept access:public +__a cpp_src/boost_concept_check.h /^ _Tp __a;$/;" m struct:_SGIAssignableConcept access:public +__abs cpp_src/valarray_before.h /^ struct __abs$/;" s namespace:std +__acos cpp_src/valarray_before.h /^ struct __acos$/;" s namespace:std +__add_grouping cpp_src/locale_facets.h /^ __add_grouping(_CharT* __s, _CharT __sep,$/;" p namespace:std signature:(_CharT* __s, _CharT __sep, const char* __gbeg, size_t __gsize, const _CharT* __first, const _CharT* __last) +__add_grouping cpp_src/locale_facets.tcc /^ __add_grouping(_CharT* __s, _CharT __sep,$/;" f namespace:std signature:(_CharT* __s, _CharT __sep, const char* __gbeg, size_t __gsize, const _CharT* __first, const _CharT* __last) +__adjust_heap cpp_src/stl_heap.h /^ __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,$/;" f namespace:std signature:(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __value) +__adjust_heap cpp_src/stl_heap.h /^ __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,$/;" f namespace:std signature:(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __value, _Compare __comp) +__advance cpp_src/stl_iterator_base_funcs.h /^ __advance(_BidirectionalIterator& __i, _Distance __n,$/;" f namespace:std signature:(_BidirectionalIterator& __i, _Distance __n, bidirectional_iterator_tag) +__advance cpp_src/stl_iterator_base_funcs.h /^ __advance(_InputIterator& __i, _Distance __n, input_iterator_tag)$/;" f namespace:std signature:(_InputIterator& __i, _Distance __n, input_iterator_tag) +__advance cpp_src/stl_iterator_base_funcs.h /^ __advance(_RandomAccessIterator& __i, _Distance __n,$/;" f namespace:std signature:(_RandomAccessIterator& __i, _Distance __n, random_access_iterator_tag) +__alloc_swap cpp_src/allocator.h /^ struct __alloc_swap$/;" s namespace:std +__alloc_swap cpp_src/allocator.h /^ struct __alloc_swap<_Alloc, false>$/;" s namespace:std +__anon2::__fill cpp_src/cwchar /^ int __fill[6];$/;" m struct:__anon2 file: access:public +__arg cpp_src/boost_concept_check.h /^ _Arg __arg;$/;" m struct:_UnaryFunctionConcept access:public +__arg cpp_src/boost_concept_check.h /^ _Arg __arg;$/;" m struct:_UnaryPredicateConcept access:public +__asin cpp_src/valarray_before.h /^ struct __asin$/;" s namespace:std +__atan cpp_src/valarray_before.h /^ struct __atan$/;" s namespace:std +__atan2 cpp_src/valarray_before.h /^ struct __atan2$/;" s namespace:std +__aux_require_boolean_expr cpp_src/boost_concept_check.h /^ void __aux_require_boolean_expr(const _Tp& __t) {$/;" f signature:(const _Tp& __t) +__b cpp_src/boost_concept_check.h /^ _Second __b;$/;" m struct:_BinaryPredicateConcept access:public +__b cpp_src/boost_concept_check.h /^ _Second __b;$/;" m struct:_Const_BinaryPredicateConcept access:public +__b cpp_src/boost_concept_check.h /^ _Tp __a, __b;$/;" m struct:_ComparableConcept access:public +__b cpp_src/boost_concept_check.h /^ _Tp __a, __b;$/;" m struct:_EqualityComparableConcept access:public +__b cpp_src/boost_concept_check.h /^ _Tp __a, __b;$/;" m struct:_LessThanComparableConcept access:public +__b cpp_src/boost_concept_check.h /^ _Tp __a, __b;$/;" m struct:_RandomAccessIteratorConcept access:public +__b cpp_src/boost_concept_check.h /^ _Tp __b;$/;" m struct:_CopyConstructibleConcept access:public +__b cpp_src/boost_concept_check.h /^ bool __b;$/;" m struct:_ContainerConcept access:public +__bitwise_and cpp_src/valarray_before.h /^ struct __bitwise_and$/;" s namespace:std +__bitwise_not cpp_src/valarray_before.h /^ struct __bitwise_not$/;" s namespace:std +__bitwise_or cpp_src/valarray_before.h /^ struct __bitwise_or$/;" s namespace:std +__bitwise_xor cpp_src/valarray_before.h /^ struct __bitwise_xor$/;" s namespace:std +__c cpp_src/boost_concept_check.h /^ _AssociativeContainer __c;$/;" m struct:_AssociativeContainerConcept access:public +__c cpp_src/boost_concept_check.h /^ _BackInsertionSequence __c;$/;" m struct:_BackInsertionSequenceConcept access:public +__c cpp_src/boost_concept_check.h /^ _Container __c, __c2;$/;" m struct:_Mutable_ContainerConcept access:public +__c cpp_src/boost_concept_check.h /^ _FrontInsertionSequence __c;$/;" m struct:_FrontInsertionSequenceConcept access:public +__c cpp_src/boost_concept_check.h /^ _RandomAccessContainer __c;$/;" m struct:_Mutable_RandomAccessContainerConcept access:public +__c cpp_src/boost_concept_check.h /^ _ReversibleContainer __c;$/;" m struct:_Mutable_ReversibleContainerConcept access:public +__c2 cpp_src/boost_concept_check.h /^ _Container __c, __c2;$/;" m struct:_Mutable_ContainerConcept access:public +__cache_type cpp_src/locale_facets.h /^ typedef __moneypunct_cache<_CharT, _Intl> __cache_type;$/;" t class:std::moneypunct access:public +__cache_type cpp_src/locale_facets.h /^ typedef __numpunct_cache<_CharT> __cache_type;$/;" t class:std::numpunct access:public +__cache_type cpp_src/locale_facets.h /^ typedef __timepunct_cache<_CharT> __cache_type;$/;" t class:std::__timepunct access:public +__capture_fpclassify cpp_src/cmath /^ __capture_fpclassify(_Tp __f) { return fpclassify(__f); }$/;" f signature:(_Tp __f) +__capture_isfinite cpp_src/cmath /^ __capture_isfinite(_Tp __f) { return isfinite(__f); }$/;" f signature:(_Tp __f) +__capture_isgreater cpp_src/cmath /^ __capture_isgreater(_Tp __f1, _Tp __f2)$/;" f signature:(_Tp __f1, _Tp __f2) +__capture_isgreaterequal cpp_src/cmath /^ __capture_isgreaterequal(_Tp __f1, _Tp __f2)$/;" f signature:(_Tp __f1, _Tp __f2) +__capture_isinf cpp_src/cmath /^ __capture_isinf(_Tp __f) { return isinf(__f); }$/;" f signature:(_Tp __f) +__capture_isless cpp_src/cmath /^ __capture_isless(_Tp __f1, _Tp __f2) { return isless(__f1, __f2); }$/;" f signature:(_Tp __f1, _Tp __f2) +__capture_islessequal cpp_src/cmath /^ __capture_islessequal(_Tp __f1, _Tp __f2)$/;" f signature:(_Tp __f1, _Tp __f2) +__capture_islessgreater cpp_src/cmath /^ __capture_islessgreater(_Tp __f1, _Tp __f2)$/;" f signature:(_Tp __f1, _Tp __f2) +__capture_isnan cpp_src/cmath /^ __capture_isnan(_Tp __f) { return isnan(__f); }$/;" f signature:(_Tp __f) +__capture_isnormal cpp_src/cmath /^ __capture_isnormal(_Tp __f) { return isnormal(__f); }$/;" f signature:(_Tp __f) +__capture_isunordered cpp_src/cmath /^ __capture_isunordered(_Tp __f1, _Tp __f2)$/;" f signature:(_Tp __f1, _Tp __f2) +__capture_signbit cpp_src/cmath /^ __capture_signbit(_Tp __f) { return signbit(__f); }$/;" f signature:(_Tp __f) +__char_type cpp_src/locale_facets.h /^ typedef _CharT __char_type;$/;" t class:std::__timepunct access:public +__check_facet cpp_src/localefwd.h /^ __check_facet(const _Facet* __f)$/;" f namespace:std signature:(const _Facet* __f) +__chunk_insertion_sort cpp_src/stl_algo.h /^ __chunk_insertion_sort(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Distance __chunk_size) +__chunk_insertion_sort cpp_src/stl_algo.h /^ __chunk_insertion_sort(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Distance __chunk_size, _Compare __comp) +__ci cpp_src/boost_concept_check.h /^ _Const_iterator __ci;$/;" m struct:_AssociativeContainerConcept access:public +__cmath_power cpp_src/cmath /^ template _Tp __cmath_power(_Tp, unsigned int);$/;" p namespace:std file: signature:(_Tp, unsigned int) +__cmath_power cpp_src/cmath.tcc /^ __cmath_power(_Tp __x, unsigned int __n)$/;" f namespace:std signature:(_Tp __x, unsigned int __n) +__codecvt_abstract_base cpp_src/codecvt.h /^ __codecvt_abstract_base(size_t __refs = 0) : locale::facet(__refs) { }$/;" f class:std::__codecvt_abstract_base access:protected signature:(size_t __refs = 0) +__codecvt_abstract_base cpp_src/codecvt.h /^ class __codecvt_abstract_base$/;" c namespace:std inherits:locale::facet,codecvt_base +__codecvt_type cpp_src/fstream /^ typedef codecvt __codecvt_type;$/;" t class:std::basic_filebuf file: access:public +__complex_abs cpp_src/complex /^ __complex_abs(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +__complex_abs cpp_src/complex /^ __complex_abs(__complex__ double __z) { return __builtin_cabs(__z); }$/;" f namespace:std signature:(__complex__ double __z) +__complex_abs cpp_src/complex /^ __complex_abs(__complex__ float __z) { return __builtin_cabsf(__z); }$/;" f namespace:std signature:(__complex__ float __z) +__complex_abs cpp_src/complex /^ __complex_abs(const __complex__ long double& __z)$/;" f namespace:std signature:(const __complex__ long double& __z) +__complex_arg cpp_src/complex /^ __complex_arg(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +__complex_arg cpp_src/complex /^ __complex_arg(__complex__ double __z) { return __builtin_carg(__z); }$/;" f namespace:std signature:(__complex__ double __z) +__complex_arg cpp_src/complex /^ __complex_arg(__complex__ float __z) { return __builtin_cargf(__z); }$/;" f namespace:std signature:(__complex__ float __z) +__complex_arg cpp_src/complex /^ __complex_arg(const __complex__ long double& __z)$/;" f namespace:std signature:(const __complex__ long double& __z) +__complex_cos cpp_src/complex /^ __complex_cos(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +__complex_cos cpp_src/complex /^ __complex_cos(__complex__ double __z) { return __builtin_ccos(__z); }$/;" f namespace:std signature:(__complex__ double __z) +__complex_cos cpp_src/complex /^ __complex_cos(__complex__ float __z) { return __builtin_ccosf(__z); }$/;" f namespace:std signature:(__complex__ float __z) +__complex_cos cpp_src/complex /^ __complex_cos(const __complex__ long double& __z)$/;" f namespace:std signature:(const __complex__ long double& __z) +__complex_cosh cpp_src/complex /^ __complex_cosh(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +__complex_cosh cpp_src/complex /^ __complex_cosh(__complex__ double __z) { return __builtin_ccosh(__z); }$/;" f namespace:std signature:(__complex__ double __z) +__complex_cosh cpp_src/complex /^ __complex_cosh(__complex__ float __z) { return __builtin_ccoshf(__z); }$/;" f namespace:std signature:(__complex__ float __z) +__complex_cosh cpp_src/complex /^ __complex_cosh(const __complex__ long double& __z)$/;" f namespace:std signature:(const __complex__ long double& __z) +__complex_exp cpp_src/complex /^ __complex_exp(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +__complex_exp cpp_src/complex /^ __complex_exp(__complex__ double __z) { return __builtin_cexp(__z); }$/;" f namespace:std signature:(__complex__ double __z) +__complex_exp cpp_src/complex /^ __complex_exp(__complex__ float __z) { return __builtin_cexpf(__z); }$/;" f namespace:std signature:(__complex__ float __z) +__complex_exp cpp_src/complex /^ __complex_exp(const __complex__ long double& __z)$/;" f namespace:std signature:(const __complex__ long double& __z) +__complex_log cpp_src/complex /^ __complex_log(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +__complex_log cpp_src/complex /^ __complex_log(__complex__ double __z) { return __builtin_clog(__z); }$/;" f namespace:std signature:(__complex__ double __z) +__complex_log cpp_src/complex /^ __complex_log(__complex__ float __z) { return __builtin_clogf(__z); }$/;" f namespace:std signature:(__complex__ float __z) +__complex_log cpp_src/complex /^ __complex_log(const __complex__ long double& __z)$/;" f namespace:std signature:(const __complex__ long double& __z) +__complex_pow cpp_src/complex /^ __complex_pow(const complex<_Tp>& __x, const complex<_Tp>& __y)$/;" f namespace:std signature:(const complex<_Tp>& __x, const complex<_Tp>& __y) +__complex_pow cpp_src/complex /^ __complex_pow(__complex__ double __x, __complex__ double __y)$/;" f namespace:std signature:(__complex__ double __x, __complex__ double __y) +__complex_pow cpp_src/complex /^ __complex_pow(__complex__ float __x, __complex__ float __y)$/;" f namespace:std signature:(__complex__ float __x, __complex__ float __y) +__complex_pow cpp_src/complex /^ __complex_pow(const __complex__ long double& __x,$/;" f namespace:std signature:(const __complex__ long double& __x, const __complex__ long double& __y) +__complex_sin cpp_src/complex /^ __complex_sin(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +__complex_sin cpp_src/complex /^ __complex_sin(__complex__ double __z) { return __builtin_csin(__z); }$/;" f namespace:std signature:(__complex__ double __z) +__complex_sin cpp_src/complex /^ __complex_sin(__complex__ float __z) { return __builtin_csinf(__z); }$/;" f namespace:std signature:(__complex__ float __z) +__complex_sin cpp_src/complex /^ __complex_sin(const __complex__ long double& __z)$/;" f namespace:std signature:(const __complex__ long double& __z) +__complex_sinh cpp_src/complex /^ __complex_sinh(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +__complex_sinh cpp_src/complex /^ __complex_sinh(__complex__ double __z) { return __builtin_csinh(__z); } $/;" f namespace:std signature:(__complex__ double __z) +__complex_sinh cpp_src/complex /^ __complex_sinh(__complex__ float __z) { return __builtin_csinhf(__z); } $/;" f namespace:std signature:(__complex__ float __z) +__complex_sinh cpp_src/complex /^ __complex_sinh(const __complex__ long double& __z)$/;" f namespace:std signature:(const __complex__ long double& __z) +__complex_sqrt cpp_src/complex /^ __complex_sqrt(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +__complex_sqrt cpp_src/complex /^ __complex_sqrt(__complex__ double __z) { return __builtin_csqrt(__z); }$/;" f namespace:std signature:(__complex__ double __z) +__complex_sqrt cpp_src/complex /^ __complex_sqrt(__complex__ float __z) { return __builtin_csqrtf(__z); }$/;" f namespace:std signature:(__complex__ float __z) +__complex_sqrt cpp_src/complex /^ __complex_sqrt(const __complex__ long double& __z)$/;" f namespace:std signature:(const __complex__ long double& __z) +__complex_tan cpp_src/complex /^ __complex_tan(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +__complex_tan cpp_src/complex /^ __complex_tan(__complex__ double __z) { return __builtin_ctan(__z); }$/;" f namespace:std signature:(__complex__ double __z) +__complex_tan cpp_src/complex /^ __complex_tan(__complex__ float __z) { return __builtin_ctanf(__z); }$/;" f namespace:std signature:(__complex__ float __z) +__complex_tan cpp_src/complex /^ __complex_tan(const __complex__ long double& __z)$/;" f namespace:std signature:(const __complex__ long double& __z) +__complex_tanh cpp_src/complex /^ __complex_tanh(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +__complex_tanh cpp_src/complex /^ __complex_tanh(__complex__ double __z) { return __builtin_ctanh(__z); }$/;" f namespace:std signature:(__complex__ double __z) +__complex_tanh cpp_src/complex /^ __complex_tanh(__complex__ float __z) { return __builtin_ctanhf(__z); }$/;" f namespace:std signature:(__complex__ float __z) +__complex_tanh cpp_src/complex /^ __complex_tanh(const __complex__ long double& __z)$/;" f namespace:std signature:(const __complex__ long double& __z) +__const_constraints cpp_src/boost_concept_check.h /^ void __const_constraints(const _AssociativeContainer& __c) {$/;" f struct:_AssociativeContainerConcept access:public signature:(const _AssociativeContainer& __c) +__const_constraints cpp_src/boost_concept_check.h /^ void __const_constraints(const _BackInsertionSequence& __c) {$/;" f struct:_BackInsertionSequenceConcept access:public signature:(const _BackInsertionSequence& __c) +__const_constraints cpp_src/boost_concept_check.h /^ void __const_constraints(const _Func& __fun) {$/;" f struct:_Const_BinaryPredicateConcept access:public signature:(const _Func& __fun) +__const_constraints cpp_src/boost_concept_check.h /^ void __const_constraints(const _Sequence& __c) {$/;" f struct:_SequenceConcept access:public signature:(const _Sequence& __c) +__const_constraints cpp_src/boost_concept_check.h /^ void __const_constraints(const _SortedAssociativeContainer& __c) {$/;" f struct:_SortedAssociativeContainerConcept access:public signature:(const _SortedAssociativeContainer& __c) +__const_constraints cpp_src/boost_concept_check.h /^ void __const_constraints(const _Tp& __a) {$/;" f struct:_CopyConstructibleConcept access:public signature:(const _Tp& __a) +__const_constraints cpp_src/boost_concept_check.h /^ void __const_constraints(const _Tp& __b) {$/;" f struct:_AssignableConcept access:public signature:(const _Tp& __b) +__const_constraints cpp_src/boost_concept_check.h /^ void __const_constraints(const _Tp& __b) {$/;" f struct:_SGIAssignableConcept access:public signature:(const _Tp& __b) +__constraints cpp_src/boost_concept_check.h /^ { void __constraints() {} };$/;" f struct:_IntegerConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_AssignableConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_AssociativeContainerConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_BackInsertionSequenceConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_BidirectionalIteratorConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_BinaryFunctionConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_BinaryPredicateConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_ComparableConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_Const_BinaryPredicateConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_ContainerConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_ConvertibleConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_CopyConstructibleConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_DefaultConstructibleConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_EqualityComparableConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_ForwardContainerConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_ForwardIteratorConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_FrontInsertionSequenceConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_GeneratorConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_InputIteratorConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_IntegerConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_LessThanComparableConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_MultipleAssociativeContainerConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_Mutable_BidirectionalIteratorConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_Mutable_ContainerConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_Mutable_ForwardContainerConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_Mutable_ForwardIteratorConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_Mutable_RandomAccessContainerConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_Mutable_RandomAccessIteratorConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_Mutable_ReversibleContainerConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_Mutable_TrivialIteratorConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_OutputIteratorConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_PairAssociativeContainerConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_RandomAccessContainerConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_RandomAccessIteratorConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_ReversibleContainerConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_SGIAssignableConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_SameTypeConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_SequenceConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_SignedIntegerConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_SimpleAssociativeContainerConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_SortedAssociativeContainerConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_TrivialIteratorConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_UnaryFunctionConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_UnaryPredicateConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_UniqueAssociativeContainerConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ void __constraints() {$/;" f struct:_UnsignedIntegerConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ { void __constraints() {} };$/;" f struct:_UnsignedIntegerConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ template <> struct _IntegerConcept { void __constraints() {} };$/;" f struct:_IntegerConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ template <> struct _IntegerConcept { void __constraints() {} };$/;" f struct:_IntegerConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ template <> struct _IntegerConcept { void __constraints() {} };$/;" f struct:_IntegerConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ template <> struct _IntegerConcept { void __constraints() {} };$/;" f struct:_IntegerConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ template <> struct _IntegerConcept { void __constraints() {} };$/;" f struct:_IntegerConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ template <> struct _IntegerConcept { void __constraints() {} };$/;" f struct:_IntegerConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ template <> struct _IntegerConcept { void __constraints(){} };$/;" f struct:_IntegerConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ template <> struct _SignedIntegerConcept { void __constraints() {} };$/;" f struct:_SignedIntegerConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ template <> struct _SignedIntegerConcept { void __constraints(){}};$/;" f struct:_SignedIntegerConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ template <> struct _SignedIntegerConcept { void __constraints() {} };$/;" f struct:_SignedIntegerConcept access:public signature:() +__constraints cpp_src/boost_concept_check.h /^ template <> struct _SignedIntegerConcept { void __constraints() {} };$/;" f struct:_SignedIntegerConcept access:public signature:() +__convert_to_v cpp_src/locale_facets.h /^ __convert_to_v(const char* __in, _Tv& __out, ios_base::iostate& __err,$/;" p namespace:std signature:(const char* __in, _Tv& __out, ios_base::iostate& __err, const __c_locale& __cloc) +__convert_to_v cpp_src/locale_facets.h /^ __convert_to_v(const char*, double&, ios_base::iostate&,$/;" p namespace:std signature:(const char*, double&, ios_base::iostate&, const __c_locale&) +__convert_to_v cpp_src/locale_facets.h /^ __convert_to_v(const char*, float&, ios_base::iostate&,$/;" p namespace:std signature:(const char*, float&, ios_base::iostate&, const __c_locale&) +__convert_to_v cpp_src/locale_facets.h /^ __convert_to_v(const char*, long double&, ios_base::iostate&,$/;" p namespace:std signature:(const char*, long double&, ios_base::iostate&, const __c_locale&) +__copy cpp_src/stl_algobase.h /^ struct __copy$/;" s namespace:std +__copy cpp_src/stl_algobase.h /^ struct __copy<_BoolType, random_access_iterator_tag>$/;" s namespace:std +__copy cpp_src/stl_algobase.h /^ struct __copy$/;" s namespace:std +__copy_aux cpp_src/stl_algobase.h /^ __copy_aux(_CharT*, _CharT*, ostreambuf_iterator<_CharT>);$/;" p namespace:std signature:(_CharT*, _CharT*, ostreambuf_iterator<_CharT>) +__copy_aux cpp_src/stl_algobase.h /^ __copy_aux(_II __first, _II __last, _OI __result)$/;" f namespace:std signature:(_II __first, _II __last, _OI __result) +__copy_aux cpp_src/stl_algobase.h /^ __copy_aux(const _CharT*, const _CharT*, ostreambuf_iterator<_CharT>);$/;" p namespace:std signature:(const _CharT*, const _CharT*, ostreambuf_iterator<_CharT>) +__copy_aux cpp_src/stl_algobase.h /^ __copy_aux(istreambuf_iterator<_CharT>, istreambuf_iterator<_CharT>,$/;" p namespace:std signature:(istreambuf_iterator<_CharT>, istreambuf_iterator<_CharT>, _CharT*) +__copy_aux cpp_src/streambuf /^ __copy_aux(istreambuf_iterator<_CharT2>,$/;" p class:std::basic_streambuf file: access:friend signature:(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, _CharT2*) +__copy_aux cpp_src/streambuf_iterator.h /^ __copy_aux(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>,$/;" p class:std::istreambuf_iterator access:friend signature:(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, _CharT2*) +__copy_aux cpp_src/streambuf_iterator.h /^ __copy_aux(_CharT* __first, _CharT* __last,$/;" f namespace:std signature:(_CharT* __first, _CharT* __last, ostreambuf_iterator<_CharT> __result) +__copy_aux cpp_src/streambuf_iterator.h /^ __copy_aux(const _CharT* __first, const _CharT* __last,$/;" f namespace:std signature:(const _CharT* __first, const _CharT* __last, ostreambuf_iterator<_CharT> __result) +__copy_aux cpp_src/streambuf_iterator.h /^ __copy_aux(istreambuf_iterator<_CharT> __first,$/;" f namespace:std signature:(istreambuf_iterator<_CharT> __first, istreambuf_iterator<_CharT> __last, _CharT* __result) +__copy_b cpp_src/stl_algobase.h /^ __copy_b(_BI1 __first, _BI1 __last, _BI2 __result)$/;" f struct:std::__copy_backward access:public signature:(_BI1 __first, _BI1 __last, _BI2 __result) +__copy_b cpp_src/stl_algobase.h /^ __copy_b(const _Tp* __first, const _Tp* __last, _Tp* __result)$/;" f struct:std::__copy_backward access:public signature:(const _Tp* __first, const _Tp* __last, _Tp* __result) +__copy_b_n cpp_src/stl_algobase.h /^ __copy_b_n(_BI1 __first, _BI1 __last, _BI2 __result)$/;" f struct:std::__copy_backward_normal access:public signature:(_BI1 __first, _BI1 __last, _BI2 __result) +__copy_backward cpp_src/stl_algobase.h /^ struct __copy_backward$/;" s namespace:std +__copy_backward cpp_src/stl_algobase.h /^ struct __copy_backward<_BoolType, random_access_iterator_tag>$/;" s namespace:std +__copy_backward cpp_src/stl_algobase.h /^ struct __copy_backward$/;" s namespace:std +__copy_backward_aux cpp_src/stl_algobase.h /^ __copy_backward_aux(_BI1 __first, _BI1 __last, _BI2 __result)$/;" f namespace:std signature:(_BI1 __first, _BI1 __last, _BI2 __result) +__copy_backward_normal cpp_src/stl_algobase.h /^ struct __copy_backward_normal$/;" s namespace:std +__copy_backward_normal cpp_src/stl_algobase.h /^ struct __copy_backward_normal$/;" s namespace:std +__copy_backward_normal cpp_src/stl_algobase.h /^ struct __copy_backward_normal$/;" s namespace:std +__copy_backward_normal cpp_src/stl_algobase.h /^ struct __copy_backward_normal$/;" s namespace:std +__copy_n cpp_src/stl_algobase.h /^ __copy_n(_II __first, _II __last, _OI __result)$/;" f struct:std::__copy_normal access:public signature:(_II __first, _II __last, _OI __result) +__copy_normal cpp_src/stl_algobase.h /^ struct __copy_normal$/;" s namespace:std +__copy_normal cpp_src/stl_algobase.h /^ struct __copy_normal$/;" s namespace:std +__copy_normal cpp_src/stl_algobase.h /^ struct __copy_normal$/;" s namespace:std +__copy_normal cpp_src/stl_algobase.h /^ struct __copy_normal$/;" s namespace:std +__copy_streambufs cpp_src/streambuf.tcc /^ __copy_streambufs(basic_streambuf<_CharT, _Traits>* __sbin,$/;" f namespace:std signature:(basic_streambuf<_CharT, _Traits>* __sbin, basic_streambuf<_CharT, _Traits>* __sbout) +__copy_streambufs cpp_src/streambuf.tcc /^ __copy_streambufs(basic_streambuf*,$/;" p namespace:std file: signature:(basic_streambuf*, basic_streambuf*) +__copy_streambufs cpp_src/streambuf.tcc /^ __copy_streambufs(basic_streambuf*,$/;" p namespace:std file: signature:(basic_streambuf*, basic_streambuf*) +__copy_streambufs_eof cpp_src/streambuf /^ __copy_streambufs_eof<>(__streambuf_type*, __streambuf_type*, bool&);$/;" p class:std::basic_streambuf file: access:friend signature:(__streambuf_type*, __streambuf_type*, bool&) +__copy_streambufs_eof cpp_src/streambuf /^ __copy_streambufs_eof(basic_streambuf<_CharT, _Traits>*,$/;" p namespace:std file: signature:(basic_streambuf<_CharT, _Traits>*, basic_streambuf<_CharT, _Traits>*, bool&) +__copy_streambufs_eof cpp_src/streambuf /^ __copy_streambufs_eof(basic_streambuf* __sbin,$/;" p namespace:std file: signature:(basic_streambuf* __sbin, basic_streambuf* __sbout, bool& __ineof) +__copy_streambufs_eof cpp_src/streambuf /^ __copy_streambufs_eof(basic_streambuf* __sbin,$/;" p namespace:std file: signature:(basic_streambuf* __sbin, basic_streambuf* __sbout, bool& __ineof) +__copy_streambufs_eof cpp_src/streambuf.tcc /^ __copy_streambufs_eof(basic_streambuf<_CharT, _Traits>* __sbin,$/;" f namespace:std signature:(basic_streambuf<_CharT, _Traits>* __sbin, basic_streambuf<_CharT, _Traits>* __sbout, bool& __ineof) +__copy_streambufs_eof cpp_src/streambuf.tcc /^ __copy_streambufs_eof(basic_streambuf*,$/;" p namespace:std file: signature:(basic_streambuf*, basic_streambuf*, bool&) +__copy_streambufs_eof cpp_src/streambuf.tcc /^ __copy_streambufs_eof(basic_streambuf*,$/;" p namespace:std file: signature:(basic_streambuf*, basic_streambuf*, bool&) +__cos cpp_src/valarray_before.h /^ struct __cos$/;" s namespace:std +__cosh cpp_src/valarray_before.h /^ struct __cosh$/;" s namespace:std +__cp cpp_src/boost_concept_check.h /^ _Const_iterator __cp;$/;" m struct:_SortedAssociativeContainerConcept access:public +__cr cpp_src/boost_concept_check.h /^ std::pair<_Const_iterator,_Const_iterator> __cr;$/;" m struct:_AssociativeContainerConcept access:public +__cr cpp_src/boost_concept_check.h /^ std::pair<_Const_iterator,_Const_iterator> __cr;$/;" m struct:_SortedAssociativeContainerConcept access:public +__ctype_abstract_base cpp_src/locale_facets.h /^ __ctype_abstract_base(size_t __refs = 0): facet(__refs) { }$/;" f class:std::__ctype_abstract_base access:protected signature:(size_t __refs = 0) +__ctype_abstract_base cpp_src/locale_facets.h /^ class __ctype_abstract_base : public locale::facet, public ctype_base$/;" c namespace:std inherits:locale::facet,ctype_base +__ctype_type cpp_src/basic_ios.h /^ typedef ctype<_CharT> __ctype_type;$/;" t class:std::basic_ios access:public +__ctype_type cpp_src/istream /^ typedef ctype<_CharT> __ctype_type;$/;" t class:std::basic_istream file: access:public +__ctype_type cpp_src/istream /^ typedef typename __istream_type::__ctype_type __ctype_type;$/;" t class:std::basic_istream::sentry file: access:public +__ctype_type cpp_src/ostream /^ typedef ctype<_CharT> __ctype_type;$/;" t class:std::basic_ostream file: access:public +__cxxabiv1 cpp_src/typeinfo /^namespace __cxxabiv1$/;" n file: +__deque_buf_size cpp_src/stl_deque.h /^ __deque_buf_size(size_t __size)$/;" f namespace:std signature:(size_t __size) +__destroy_aux cpp_src/stl_construct.h /^ __destroy_aux(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, __false_type) +__destroy_aux cpp_src/stl_construct.h /^ __destroy_aux(_ForwardIterator, _ForwardIterator, __true_type)$/;" f namespace:std signature:(_ForwardIterator, _ForwardIterator, __true_type) +__distance cpp_src/stl_iterator_base_funcs.h /^ __distance(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, input_iterator_tag) +__distance cpp_src/stl_iterator_base_funcs.h /^ __distance(_RandomAccessIterator __first, _RandomAccessIterator __last,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) +__divides cpp_src/valarray_before.h /^ struct __divides$/;" s namespace:std +__do_catch cpp_src/typeinfo /^ virtual bool __do_catch(const type_info *__thr_type, void **__thr_obj,$/;" p class:std::type_info file: access:public signature:(const type_info *__thr_type, void **__thr_obj, unsigned __outer) const +__do_get cpp_src/locale_facets.h /^ __do_get(iter_type __s, iter_type __end, bool __intl, ios_base& __io,$/;" p class:std::money_get access:protected signature:(iter_type __s, iter_type __end, bool __intl, ios_base& __io, ios_base::iostate& __err, double& __units) const +__do_get cpp_src/locale_facets.h /^ __do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,$/;" p class:std::num_get access:protected signature:(iter_type, iter_type, ios_base&, ios_base::iostate& __err, double&) const +__do_get cpp_src/locale_facets.tcc /^ __do_get(iter_type __beg, iter_type __end, bool __intl, ios_base& __io,$/;" f class:std::money_get signature:(iter_type __beg, iter_type __end, bool __intl, ios_base& __io, ios_base::iostate& __err, double& __units) const +__do_get cpp_src/locale_facets.tcc /^ __do_get(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::num_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, double& __v) const +__do_put cpp_src/locale_facets.h /^ __do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill,$/;" p class:std::money_put access:protected signature:(iter_type __s, bool __intl, ios_base& __io, char_type __fill, double __units) const +__do_put cpp_src/locale_facets.h /^ __do_put(iter_type, ios_base&, char_type __fill, double __v) const;$/;" p class:std::num_put access:protected signature:(iter_type, ios_base&, char_type __fill, double __v) const +__do_put cpp_src/locale_facets.tcc /^ __do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill,$/;" f class:std::money_put signature:(iter_type __s, bool __intl, ios_base& __io, char_type __fill, double __units) const +__do_put cpp_src/locale_facets.tcc /^ __do_put(iter_type __s, ios_base& __io, char_type __fill, double __v) const$/;" f class:std::num_put signature:(iter_type __s, ios_base& __io, char_type __fill, double __v) const +__do_upcast cpp_src/typeinfo /^ virtual bool __do_upcast(const __cxxabiv1::__class_type_info *__target,$/;" p class:std::type_info file: access:public signature:(const __cxxabiv1::__class_type_info *__target, void **__obj_ptr) const +__equal_to cpp_src/valarray_before.h /^ struct __equal_to$/;" s namespace:std +__error_type_must_be_a_signed_integer_type cpp_src/boost_concept_check.h /^void __error_type_must_be_a_signed_integer_type();$/;" p signature:() +__error_type_must_be_an_integer_type cpp_src/boost_concept_check.h /^void __error_type_must_be_an_integer_type();$/;" p signature:() +__error_type_must_be_an_unsigned_integer_type cpp_src/boost_concept_check.h /^void __error_type_must_be_an_unsigned_integer_type();$/;" p signature:() +__exp cpp_src/valarray_before.h /^ struct __exp$/;" s namespace:std +__f cpp_src/boost_concept_check.h /^ _Func __f;$/;" m struct:_BinaryFunctionConcept access:public +__f cpp_src/boost_concept_check.h /^ _Func __f;$/;" m struct:_BinaryPredicateConcept access:public +__f cpp_src/boost_concept_check.h /^ _Func __f;$/;" m struct:_Const_BinaryPredicateConcept access:public +__f cpp_src/boost_concept_check.h /^ _Func __f;$/;" m struct:_GeneratorConcept access:public +__f cpp_src/boost_concept_check.h /^ _Func __f;$/;" m struct:_UnaryFunctionConcept access:public +__f cpp_src/boost_concept_check.h /^ _Func __f;$/;" m struct:_UnaryPredicateConcept access:public +__f cpp_src/valarray_after.h /^ _Expr<_Clos, _Tp>::apply(_Tp __f(_Tp)) const$/;" f class:std::_Expr signature:(_Tp) const +__f cpp_src/valarray_after.h /^ _Expr<_Clos, _Tp>::apply(_Tp __f(const _Tp&)) const$/;" f class:std::_Expr signature:(const _Tp&) const +__file_type cpp_src/fstream /^ typedef __basic_file __file_type;$/;" t class:std::basic_filebuf file: access:public +__filebuf_type cpp_src/fstream /^ typedef basic_filebuf __filebuf_type;$/;" t class:std::basic_fstream file: access:public +__filebuf_type cpp_src/fstream /^ typedef basic_filebuf __filebuf_type;$/;" t class:std::basic_ifstream file: access:public +__filebuf_type cpp_src/fstream /^ typedef basic_filebuf __filebuf_type;$/;" t class:std::basic_ofstream file: access:public +__filebuf_type cpp_src/fstream /^ typedef basic_filebuf __filebuf_type;$/;" t class:std::basic_filebuf file: access:public +__fill cpp_src/cwchar /^ int __fill[6];$/;" m struct:__anon2 file: access:public +__fill cpp_src/stl_algobase.h /^ struct __fill$/;" s namespace:std +__fill cpp_src/stl_algobase.h /^ struct __fill$/;" s namespace:std +__fill_bvector cpp_src/stl_bvector.h /^ __fill_bvector(_Bit_iterator __first, _Bit_iterator __last, bool __x)$/;" f namespace:std signature:(_Bit_iterator __first, _Bit_iterator __last, bool __x) +__fill_n cpp_src/stl_algobase.h /^ struct __fill_n$/;" s namespace:std +__fill_n cpp_src/stl_algobase.h /^ struct __fill_n$/;" s namespace:std +__final_insertion_sort cpp_src/stl_algo.h /^ __final_insertion_sort(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last) +__final_insertion_sort cpp_src/stl_algo.h /^ __final_insertion_sort(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) +__find cpp_src/stl_algo.h /^ __find(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, const _Tp& __val, input_iterator_tag) +__find cpp_src/stl_algo.h /^ __find(_RandomAccessIterator __first, _RandomAccessIterator __last,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __val, random_access_iterator_tag) +__find_end cpp_src/stl_algo.h /^ __find_end(_BidirectionalIterator1 __first1,$/;" f namespace:std signature:(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, bidirectional_iterator_tag, bidirectional_iterator_tag) +__find_end cpp_src/stl_algo.h /^ __find_end(_BidirectionalIterator1 __first1,$/;" f namespace:std signature:(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, bidirectional_iterator_tag, bidirectional_iterator_tag, _BinaryPredicate __comp) +__find_end cpp_src/stl_algo.h /^ __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,$/;" f namespace:std signature:(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, forward_iterator_tag, forward_iterator_tag) +__find_end cpp_src/stl_algo.h /^ __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,$/;" f namespace:std signature:(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, forward_iterator_tag, forward_iterator_tag, _BinaryPredicate __comp) +__find_if cpp_src/stl_algo.h /^ __find_if(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _Predicate __pred, input_iterator_tag) +__find_if cpp_src/stl_algo.h /^ __find_if(_RandomAccessIterator __first, _RandomAccessIterator __last,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Predicate __pred, random_access_iterator_tag) +__first cpp_src/boost_concept_check.h /^ _First __first;$/;" m struct:_BinaryFunctionConcept access:public +__first cpp_src/boost_concept_check.h /^ typename _MultipleAssociativeContainer::value_type *__first, *__last;$/;" m struct:_MultipleAssociativeContainerConcept access:public +__first cpp_src/boost_concept_check.h /^ typename _Sequence::value_type *__first, *__last;$/;" m struct:_SequenceConcept access:public +__first cpp_src/boost_concept_check.h /^ typename _SortedAssociativeContainer::value_type *__first, *__last;$/;" m struct:_SortedAssociativeContainerConcept access:public +__first cpp_src/boost_concept_check.h /^ typename _UniqueAssociativeContainer::value_type *__first, *__last;$/;" m struct:_UniqueAssociativeContainerConcept access:public +__fun cpp_src/valarray_before.h /^ struct __fun$/;" s namespace:std +__fun cpp_src/valarray_before.h /^ struct __fun<__equal_to, _Tp>$/;" s namespace:std +__fun cpp_src/valarray_before.h /^ struct __fun<__greater, _Tp>$/;" s namespace:std +__fun cpp_src/valarray_before.h /^ struct __fun<__greater_equal, _Tp>$/;" s namespace:std +__fun cpp_src/valarray_before.h /^ struct __fun<__less, _Tp>$/;" s namespace:std +__fun cpp_src/valarray_before.h /^ struct __fun<__less_equal, _Tp>$/;" s namespace:std +__fun cpp_src/valarray_before.h /^ struct __fun<__logical_and, _Tp>$/;" s namespace:std +__fun cpp_src/valarray_before.h /^ struct __fun<__logical_not, _Tp>$/;" s namespace:std +__fun cpp_src/valarray_before.h /^ struct __fun<__logical_or, _Tp>$/;" s namespace:std +__fun cpp_src/valarray_before.h /^ struct __fun<__not_equal_to, _Tp>$/;" s namespace:std +__function_requires cpp_src/boost_concept_check.h /^inline void __function_requires()$/;" f signature:() +__gcd cpp_src/stl_algo.h /^ __gcd(_EuclideanRingElement __m, _EuclideanRingElement __n)$/;" f namespace:std signature:(_EuclideanRingElement __m, _EuclideanRingElement __n) +__get_temporary_buffer cpp_src/memory /^ __get_temporary_buffer(ptrdiff_t __len, _Tp*)$/;" f namespace:std signature:(ptrdiff_t __len, _Tp*) +__glibcxx_base_allocator cpp_src/allocator.h 142;" d +__glibcxx_class_requires cpp_src/concept_check.h 53;" d +__glibcxx_class_requires cpp_src/concept_check.h 74;" d +__glibcxx_class_requires2 cpp_src/concept_check.h 54;" d +__glibcxx_class_requires2 cpp_src/concept_check.h 76;" d +__glibcxx_class_requires3 cpp_src/concept_check.h 55;" d +__glibcxx_class_requires3 cpp_src/concept_check.h 78;" d +__glibcxx_class_requires4 cpp_src/concept_check.h 56;" d +__glibcxx_class_requires4 cpp_src/concept_check.h 80;" d +__glibcxx_digits cpp_src/limits 1157;" d file: +__glibcxx_digits cpp_src/limits 142;" d file: +__glibcxx_digits10 cpp_src/limits 1158;" d file: +__glibcxx_digits10 cpp_src/limits 146;" d file: +__glibcxx_double_has_denorm_loss cpp_src/limits 1090;" d file: +__glibcxx_double_has_denorm_loss cpp_src/limits 109;" d file: +__glibcxx_double_tinyness_before cpp_src/limits 1092;" d file: +__glibcxx_double_tinyness_before cpp_src/limits 115;" d file: +__glibcxx_double_traps cpp_src/limits 1091;" d file: +__glibcxx_double_traps cpp_src/limits 112;" d file: +__glibcxx_float_has_denorm_loss cpp_src/limits 1033;" d file: +__glibcxx_float_has_denorm_loss cpp_src/limits 95;" d file: +__glibcxx_float_tinyness_before cpp_src/limits 101;" d file: +__glibcxx_float_tinyness_before cpp_src/limits 1035;" d file: +__glibcxx_float_traps cpp_src/limits 1034;" d file: +__glibcxx_float_traps cpp_src/limits 98;" d file: +__glibcxx_function_requires cpp_src/concept_check.h 52;" d +__glibcxx_function_requires cpp_src/concept_check.h 72;" d +__glibcxx_integral_traps cpp_src/limits 86;" d file: +__glibcxx_long_double_has_denorm_loss cpp_src/limits 1148;" d file: +__glibcxx_long_double_has_denorm_loss cpp_src/limits 123;" d file: +__glibcxx_long_double_tinyness_before cpp_src/limits 1150;" d file: +__glibcxx_long_double_tinyness_before cpp_src/limits 129;" d file: +__glibcxx_long_double_traps cpp_src/limits 1149;" d file: +__glibcxx_long_double_traps cpp_src/limits 126;" d file: +__glibcxx_max cpp_src/limits 1156;" d file: +__glibcxx_max cpp_src/limits 139;" d file: +__glibcxx_min cpp_src/limits 1155;" d file: +__glibcxx_min cpp_src/limits 136;" d file: +__glibcxx_signed cpp_src/limits 1154;" d file: +__glibcxx_signed cpp_src/limits 134;" d file: +__greater cpp_src/valarray_before.h /^ struct __greater$/;" s namespace:std +__greater_equal cpp_src/valarray_before.h /^ struct __greater_equal$/;" s namespace:std +__heap_select cpp_src/stl_algo.h /^ __heap_select(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) +__heap_select cpp_src/stl_algo.h /^ __heap_select(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, _Compare __comp) +__i cpp_src/boost_concept_check.h /^ _Const_iterator __i;$/;" m struct:_ContainerConcept access:public +__i cpp_src/boost_concept_check.h /^ _Iterator __i;$/;" m struct:_AssociativeContainerConcept access:public +__i cpp_src/boost_concept_check.h /^ _Iterator __i;$/;" m struct:_Mutable_ContainerConcept access:public +__i cpp_src/boost_concept_check.h /^ _Size_type __i;$/;" m struct:_Mutable_RandomAccessContainerConcept access:public +__i cpp_src/boost_concept_check.h /^ _Tp __i, __j;$/;" m struct:_Mutable_TrivialIteratorConcept access:public +__i cpp_src/boost_concept_check.h /^ _Tp __i, __j;$/;" m struct:_RandomAccessIteratorConcept access:public +__i cpp_src/boost_concept_check.h /^ _Tp __i;$/;" m struct:_BidirectionalIteratorConcept access:public +__i cpp_src/boost_concept_check.h /^ _Tp __i;$/;" m struct:_ForwardIteratorConcept access:public +__i cpp_src/boost_concept_check.h /^ _Tp __i;$/;" m struct:_InputIteratorConcept access:public +__i cpp_src/boost_concept_check.h /^ _Tp __i;$/;" m struct:_Mutable_BidirectionalIteratorConcept access:public +__i cpp_src/boost_concept_check.h /^ _Tp __i;$/;" m struct:_Mutable_ForwardIteratorConcept access:public +__i cpp_src/boost_concept_check.h /^ _Tp __i;$/;" m struct:_Mutable_RandomAccessIteratorConcept access:public +__i cpp_src/boost_concept_check.h /^ _Tp __i;$/;" m struct:_OutputIteratorConcept access:public +__i cpp_src/boost_concept_check.h /^ _Tp __i;$/;" m struct:_TrivialIteratorConcept access:public +__inplace_stable_partition cpp_src/stl_algo.h /^ __inplace_stable_partition(_ForwardIterator __first,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, _Distance __len) +__inplace_stable_sort cpp_src/stl_algo.h /^ __inplace_stable_sort(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last) +__inplace_stable_sort cpp_src/stl_algo.h /^ __inplace_stable_sort(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) +__insertion_sort cpp_src/stl_algo.h /^ __insertion_sort(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last) +__insertion_sort cpp_src/stl_algo.h /^ __insertion_sort(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) +__int_to_char cpp_src/locale_facets.tcc /^ __int_to_char(_CharT* __bufend, _ValueT __v, const _CharT* __lit,$/;" f namespace:std signature:(_CharT* __bufend, _ValueT __v, const _CharT* __lit, ios_base::fmtflags __flags, bool __dec) +__int_type cpp_src/istream /^ typedef typename _Traits::int_type __int_type;$/;" t class:std::basic_istream::sentry file: access:public +__introselect cpp_src/stl_algo.h /^ __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Size __depth_limit) +__introselect cpp_src/stl_algo.h /^ __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Size __depth_limit, _Compare __comp) +__introsort_loop cpp_src/stl_algo.h /^ __introsort_loop(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Size __depth_limit) +__introsort_loop cpp_src/stl_algo.h /^ __introsort_loop(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Size __depth_limit, _Compare __comp) +__ioinit cpp_src/iostream /^ static ios_base::Init __ioinit;$/;" m namespace:std file: +__ios_type cpp_src/fstream /^ typedef basic_ios __ios_type;$/;" t class:std::basic_fstream file: access:public +__ios_type cpp_src/istream /^ typedef basic_ios<_CharT, _Traits> __ios_type;$/;" t class:std::basic_istream file: access:public +__ios_type cpp_src/ostream /^ typedef basic_ios<_CharT, _Traits> __ios_type;$/;" t class:std::basic_ostream file: access:public +__iostream_type cpp_src/fstream /^ typedef basic_iostream __iostream_type;$/;" t class:std::basic_fstream file: access:public +__iostream_type cpp_src/sstream /^ typedef basic_iostream __iostream_type;$/;" t class:std::basic_stringstream file: access:public +__is_function_p cpp_src/typeinfo /^ virtual bool __is_function_p() const;$/;" p class:std::type_info file: access:public signature:() const +__is_heap cpp_src/stl_heap.h /^ __is_heap(_RandomAccessIterator __first, _Distance __n)$/;" f namespace:std signature:(_RandomAccessIterator __first, _Distance __n) +__is_heap cpp_src/stl_heap.h /^ __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last) +__is_heap cpp_src/stl_heap.h /^ __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _StrictWeakOrdering __comp) +__is_heap cpp_src/stl_heap.h /^ __is_heap(_RandomAccessIterator __first, _StrictWeakOrdering __comp,$/;" f namespace:std signature:(_RandomAccessIterator __first, _StrictWeakOrdering __comp, _Distance __n) +__is_null_pointer cpp_src/basic_string.tcc /^ __is_null_pointer(_Type)$/;" f namespace:std signature:(_Type) +__is_null_pointer cpp_src/basic_string.tcc /^ __is_null_pointer(_Type* __ptr)$/;" f namespace:std signature:(_Type* __ptr) +__is_pointer_p cpp_src/typeinfo /^ virtual bool __is_pointer_p() const;$/;" p class:std::type_info file: access:public signature:() const +__istream_type cpp_src/fstream /^ typedef basic_istream __istream_type;$/;" t class:std::basic_ifstream file: access:public +__istream_type cpp_src/istream /^ typedef basic_istream<_CharT, _Traits> __istream_type;$/;" t class:std::basic_iostream file: access:public +__istream_type cpp_src/istream /^ typedef basic_istream<_CharT, _Traits> __istream_type;$/;" t class:std::basic_istream file: access:public +__istream_type cpp_src/istream /^ typedef basic_istream<_CharT, _Traits> __istream_type;$/;" t class:std::basic_istream::sentry file: access:public +__istream_type cpp_src/sstream /^ typedef basic_istream __istream_type;$/;" t class:std::basic_istringstream file: access:public +__iter_swap cpp_src/stl_algobase.h /^ struct __iter_swap$/;" s namespace:std +__iter_swap cpp_src/stl_algobase.h /^ struct __iter_swap$/;" s namespace:std +__iterator_category cpp_src/stl_iterator_base_types.h /^ __iterator_category(const _Iter&)$/;" f namespace:std signature:(const _Iter&) +__j cpp_src/boost_concept_check.h /^ _Tp __i, __j;$/;" m struct:_Mutable_TrivialIteratorConcept access:public +__j cpp_src/boost_concept_check.h /^ _Tp __i, __j;$/;" m struct:_RandomAccessIteratorConcept access:public +__k cpp_src/boost_concept_check.h /^ typename _AssociativeContainer::key_type __k;$/;" m struct:_AssociativeContainerConcept access:public +__k cpp_src/boost_concept_check.h /^ typename _SortedAssociativeContainer::key_type __k;$/;" m struct:_SortedAssociativeContainerConcept access:public +__kc cpp_src/boost_concept_check.h /^ typename _SortedAssociativeContainer::key_compare __kc;$/;" m struct:_SortedAssociativeContainerConcept access:public +__last cpp_src/boost_concept_check.h /^ typename _MultipleAssociativeContainer::value_type *__first, *__last;$/;" m struct:_MultipleAssociativeContainerConcept access:public +__last cpp_src/boost_concept_check.h /^ typename _Sequence::value_type *__first, *__last;$/;" m struct:_SequenceConcept access:public +__last cpp_src/boost_concept_check.h /^ typename _SortedAssociativeContainer::value_type *__first, *__last;$/;" m struct:_SortedAssociativeContainerConcept access:public +__last cpp_src/boost_concept_check.h /^ typename _UniqueAssociativeContainer::value_type *__first, *__last;$/;" m struct:_UniqueAssociativeContainerConcept access:public +__less cpp_src/valarray_before.h /^ struct __less$/;" s namespace:std +__less_equal cpp_src/valarray_before.h /^ struct __less_equal$/;" s namespace:std +__lg cpp_src/stl_algo.h /^ __lg(_Size __n)$/;" f namespace:std signature:(_Size __n) +__log cpp_src/valarray_before.h /^ struct __log$/;" s namespace:std +__log10 cpp_src/valarray_before.h /^ struct __log10$/;" s namespace:std +__logical_and cpp_src/valarray_before.h /^ struct __logical_and$/;" s namespace:std +__logical_not cpp_src/valarray_before.h /^ struct __logical_not$/;" s namespace:std +__logical_or cpp_src/valarray_before.h /^ struct __logical_or$/;" s namespace:std +__median cpp_src/stl_algo.h /^ __median(const _Tp& __a, const _Tp& __b, const _Tp& __c)$/;" f namespace:std signature:(const _Tp& __a, const _Tp& __b, const _Tp& __c) +__median cpp_src/stl_algo.h /^ __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp)$/;" f namespace:std signature:(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp) +__merge_adaptive cpp_src/stl_algo.h /^ __merge_adaptive(_BidirectionalIterator __first,$/;" f namespace:std signature:(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2, _Pointer __buffer, _Distance __buffer_size) +__merge_adaptive cpp_src/stl_algo.h /^ __merge_adaptive(_BidirectionalIterator __first,$/;" f namespace:std signature:(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2, _Pointer __buffer, _Distance __buffer_size, _Compare __comp) +__merge_backward cpp_src/stl_algo.h /^ __merge_backward(_BidirectionalIterator1 __first1,$/;" f namespace:std signature:(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BidirectionalIterator3 __result) +__merge_backward cpp_src/stl_algo.h /^ __merge_backward(_BidirectionalIterator1 __first1,$/;" f namespace:std signature:(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BidirectionalIterator3 __result, _Compare __comp) +__merge_sort_loop cpp_src/stl_algo.h /^ __merge_sort_loop(_RandomAccessIterator1 __first,$/;" f namespace:std signature:(_RandomAccessIterator1 __first, _RandomAccessIterator1 __last, _RandomAccessIterator2 __result, _Distance __step_size) +__merge_sort_loop cpp_src/stl_algo.h /^ __merge_sort_loop(_RandomAccessIterator1 __first,$/;" f namespace:std signature:(_RandomAccessIterator1 __first, _RandomAccessIterator1 __last, _RandomAccessIterator2 __result, _Distance __step_size, _Compare __comp) +__merge_sort_with_buffer cpp_src/stl_algo.h /^ __merge_sort_with_buffer(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Pointer __buffer) +__merge_sort_with_buffer cpp_src/stl_algo.h /^ __merge_sort_with_buffer(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Pointer __buffer, _Compare __comp) +__merge_without_buffer cpp_src/stl_algo.h /^ __merge_without_buffer(_BidirectionalIterator __first,$/;" f namespace:std signature:(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2) +__merge_without_buffer cpp_src/stl_algo.h /^ __merge_without_buffer(_BidirectionalIterator __first,$/;" f namespace:std signature:(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2, _Compare __comp) +__minus cpp_src/valarray_before.h /^ struct __minus$/;" s namespace:std +__modulus cpp_src/valarray_before.h /^ struct __modulus$/;" s namespace:std +__moneypunct_cache cpp_src/locale_facets.h /^ __moneypunct_cache(const __moneypunct_cache&);$/;" p struct:std::__moneypunct_cache access:private signature:(const __moneypunct_cache&) +__moneypunct_cache cpp_src/locale_facets.h /^ __moneypunct_cache(size_t __refs = 0) : facet(__refs),$/;" f struct:std::__moneypunct_cache access:public signature:(size_t __refs = 0) +__moneypunct_cache cpp_src/locale_facets.h /^ struct __moneypunct_cache : public locale::facet$/;" s namespace:std inherits:locale::facet +__multiplies cpp_src/valarray_before.h /^ struct __multiplies$/;" s namespace:std +__n cpp_src/boost_concept_check.h /^ _Size_type __n;$/;" m struct:_ContainerConcept access:public +__n cpp_src/boost_concept_check.h /^ _Size_type __n;$/;" m struct:_RandomAccessContainerConcept access:public +__n cpp_src/boost_concept_check.h /^ typename _AssociativeContainer::size_type __n;$/;" m struct:_AssociativeContainerConcept access:public +__n cpp_src/boost_concept_check.h /^ typename _Sequence::size_type __n;$/;" m struct:_SequenceConcept access:public +__n cpp_src/boost_concept_check.h /^ typename std::iterator_traits<_Tp>::difference_type __n;$/;" m struct:_Mutable_RandomAccessIteratorConcept access:public +__n cpp_src/boost_concept_check.h /^ typename std::iterator_traits<_Tp>::difference_type __n;$/;" m struct:_RandomAccessIteratorConcept access:public +__name cpp_src/typeinfo /^ const char *__name;$/;" m class:std::type_info file: access:protected +__negate cpp_src/valarray_before.h /^ struct __negate$/;" s namespace:std +__normal_iterator cpp_src/stl_iterator.h /^ __normal_iterator(const __normal_iterator<_Iter,$/;" f class:__normal_iterator access:public signature:(const __normal_iterator<_Iter, typename __enable_if< (std::__are_same<_Iter, typename _Container::pointer>::__value), _Container>::__type>& __i) +__normal_iterator cpp_src/stl_iterator.h /^ __normal_iterator() : _M_current(_Iterator()) { }$/;" f class:__normal_iterator access:public signature:() +__normal_iterator cpp_src/stl_iterator.h /^ __normal_iterator(const _Iterator& __i) : _M_current(__i) { }$/;" f class:__normal_iterator access:public signature:(const _Iterator& __i) +__normal_iterator cpp_src/stl_iterator.h /^ class __normal_iterator$/;" c +__normal_iterator::_M_current cpp_src/stl_iterator.h /^ _Iterator _M_current;$/;" m class:__normal_iterator access:protected +__normal_iterator::__normal_iterator cpp_src/stl_iterator.h /^ __normal_iterator(const __normal_iterator<_Iter,$/;" f class:__normal_iterator access:public signature:(const __normal_iterator<_Iter, typename __enable_if< (std::__are_same<_Iter, typename _Container::pointer>::__value), _Container>::__type>& __i) +__normal_iterator::__normal_iterator cpp_src/stl_iterator.h /^ __normal_iterator() : _M_current(_Iterator()) { }$/;" f class:__normal_iterator access:public signature:() +__normal_iterator::__normal_iterator cpp_src/stl_iterator.h /^ __normal_iterator(const _Iterator& __i) : _M_current(__i) { }$/;" f class:__normal_iterator access:public signature:(const _Iterator& __i) +__normal_iterator::base cpp_src/stl_iterator.h /^ base() const$/;" f class:__normal_iterator access:public signature:() const +__normal_iterator::difference_type cpp_src/stl_iterator.h /^ difference_type;$/;" t class:__normal_iterator access:public +__normal_iterator::iterator_category cpp_src/stl_iterator.h /^ iterator_category;$/;" t class:__normal_iterator access:public +__normal_iterator::operator * cpp_src/stl_iterator.h /^ operator*() const$/;" f class:__normal_iterator access:public signature:() const +__normal_iterator::operator + cpp_src/stl_iterator.h /^ operator+(const difference_type& __n) const$/;" f class:__normal_iterator access:public signature:(const difference_type& __n) const +__normal_iterator::operator ++ cpp_src/stl_iterator.h /^ operator++()$/;" f class:__normal_iterator access:public signature:() +__normal_iterator::operator ++ cpp_src/stl_iterator.h /^ operator++(int)$/;" f class:__normal_iterator access:public signature:(int) +__normal_iterator::operator += cpp_src/stl_iterator.h /^ operator+=(const difference_type& __n)$/;" f class:__normal_iterator access:public signature:(const difference_type& __n) +__normal_iterator::operator - cpp_src/stl_iterator.h /^ operator-(const difference_type& __n) const$/;" f class:__normal_iterator access:public signature:(const difference_type& __n) const +__normal_iterator::operator -- cpp_src/stl_iterator.h /^ operator--()$/;" f class:__normal_iterator access:public signature:() +__normal_iterator::operator -- cpp_src/stl_iterator.h /^ operator--(int)$/;" f class:__normal_iterator access:public signature:(int) +__normal_iterator::operator -= cpp_src/stl_iterator.h /^ operator-=(const difference_type& __n)$/;" f class:__normal_iterator access:public signature:(const difference_type& __n) +__normal_iterator::operator -> cpp_src/stl_iterator.h /^ operator->() const$/;" f class:__normal_iterator access:public signature:() const +__normal_iterator::operator [] cpp_src/stl_iterator.h /^ operator[](const difference_type& __n) const$/;" f class:__normal_iterator access:public signature:(const difference_type& __n) const +__normal_iterator::pointer cpp_src/stl_iterator.h /^ typedef typename iterator_traits<_Iterator>::pointer pointer;$/;" t class:__normal_iterator access:public +__normal_iterator::reference cpp_src/stl_iterator.h /^ typedef typename iterator_traits<_Iterator>::reference reference;$/;" t class:__normal_iterator access:public +__normal_iterator::value_type cpp_src/stl_iterator.h /^ typedef typename iterator_traits<_Iterator>::value_type value_type;$/;" t class:__normal_iterator access:public +__not_equal_to cpp_src/valarray_before.h /^ struct __not_equal_to$/;" s namespace:std +__num_base cpp_src/locale_facets.h /^ class __num_base$/;" c namespace:std +__num_get_type cpp_src/basic_ios.h /^ __num_get_type;$/;" t class:std::basic_ios access:public +__num_get_type cpp_src/istream /^ __num_get_type;$/;" t class:std::basic_istream file: access:public +__num_put_type cpp_src/basic_ios.h /^ __num_put_type;$/;" t class:std::basic_ios access:public +__num_put_type cpp_src/ostream /^ __num_put_type;$/;" t class:std::basic_ostream file: access:public +__numeric_limits_base cpp_src/limits /^ struct __numeric_limits_base$/;" s namespace:std file: +__numpunct_cache cpp_src/locale_facets.h /^ __numpunct_cache(const __numpunct_cache&);$/;" p struct:std::__numpunct_cache access:private signature:(const __numpunct_cache&) +__numpunct_cache cpp_src/locale_facets.h /^ __numpunct_cache(size_t __refs = 0) : facet(__refs),$/;" f struct:std::__numpunct_cache access:public signature:(size_t __refs = 0) +__numpunct_cache cpp_src/locale_facets.h /^ struct __numpunct_cache : public locale::facet$/;" s namespace:std inherits:locale::facet +__ostream_fill cpp_src/ostream_insert.h /^ __ostream_fill(basic_ostream<_CharT, _Traits>& __out, streamsize __n)$/;" f namespace:std signature:(basic_ostream<_CharT, _Traits>& __out, streamsize __n) +__ostream_insert cpp_src/ostream_insert.h /^ __ostream_insert(basic_ostream<_CharT, _Traits>& __out,$/;" f namespace:std signature:(basic_ostream<_CharT, _Traits>& __out, const _CharT* __s, streamsize __n) +__ostream_insert cpp_src/ostream_insert.h /^ extern template ostream& __ostream_insert(ostream&, const char*, streamsize);$/;" p namespace:std signature:(ostream&, const char*, streamsize) +__ostream_insert cpp_src/ostream_insert.h /^ extern template wostream& __ostream_insert(wostream&, const wchar_t*,$/;" p namespace:std signature:(wostream&, const wchar_t*, streamsize) +__ostream_type cpp_src/fstream /^ typedef basic_ostream __ostream_type;$/;" t class:std::basic_ofstream file: access:public +__ostream_type cpp_src/istream /^ typedef basic_ostream<_CharT, _Traits> __ostream_type;$/;" t class:std::basic_iostream file: access:public +__ostream_type cpp_src/ostream /^ typedef basic_ostream<_CharT, _Traits> __ostream_type;$/;" t class:std::basic_ostream file: access:public +__ostream_type cpp_src/sstream /^ typedef basic_ostream __ostream_type;$/;" t class:std::basic_ostringstream file: access:public +__ostream_write cpp_src/ostream_insert.h /^ __ostream_write(basic_ostream<_CharT, _Traits>& __out,$/;" f namespace:std signature:(basic_ostream<_CharT, _Traits>& __out, const _CharT* __s, streamsize __n) +__p cpp_src/boost_concept_check.h /^ _Iterator __p;$/;" m struct:_SortedAssociativeContainerConcept access:public +__p cpp_src/boost_concept_check.h /^ typename _Sequence::iterator __p, __q;$/;" m struct:_SequenceConcept access:public +__pad cpp_src/locale_facets.h /^ struct __pad$/;" s namespace:std +__partition cpp_src/stl_algo.h /^ __partition(_BidirectionalIterator __first, _BidirectionalIterator __last,$/;" f namespace:std signature:(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, bidirectional_iterator_tag) +__partition cpp_src/stl_algo.h /^ __partition(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) +__pf cpp_src/istream /^ operator>>(__ios_type& (*__pf)(__ios_type&))$/;" f class:std::basic_istream access:public signature:(__ios_type&) +__pf cpp_src/istream /^ operator>>(__istream_type& (*__pf)(__istream_type&))$/;" f class:std::basic_istream access:public signature:(__istream_type&) +__pf cpp_src/istream /^ operator>>(ios_base& (*__pf)(ios_base&))$/;" f class:std::basic_istream access:public signature:(ios_base&) +__pf cpp_src/ostream /^ operator<<(__ios_type& (*__pf)(__ios_type&))$/;" f class:std::basic_ostream access:public signature:(__ios_type&) +__pf cpp_src/ostream /^ operator<<(__ostream_type& (*__pf)(__ostream_type&))$/;" f class:std::basic_ostream access:public signature:(__ostream_type&) +__pf cpp_src/ostream /^ operator<<(ios_base& (*__pf) (ios_base&))$/;" f class:std::basic_ostream access:public signature:(ios_base&) +__plus cpp_src/valarray_before.h /^ struct __plus$/;" s namespace:std +__pop_heap cpp_src/stl_heap.h /^ __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __result, _Tp __value) +__pop_heap cpp_src/stl_heap.h /^ __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __result, _Tp __value, _Compare __comp) +__pos cpp_src/boost_concept_check.h /^ typename _MultipleAssociativeContainer::iterator __pos;$/;" m struct:_MultipleAssociativeContainerConcept access:public +__pos_flag cpp_src/boost_concept_check.h /^ std::pair __pos_flag;$/;" m struct:_UniqueAssociativeContainerConcept access:public +__pow cpp_src/valarray_before.h /^ struct __pow$/;" s namespace:std +__pow_helper cpp_src/cmath /^ __pow_helper(_Tp __x, int __n)$/;" f namespace:std signature:(_Tp __x, int __n) +__push_heap cpp_src/stl_heap.h /^ __push_heap(_RandomAccessIterator __first, _Distance __holeIndex,$/;" f namespace:std signature:(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __topIndex, _Tp __value, _Compare __comp) +__push_heap cpp_src/stl_heap.h /^ __push_heap(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __topIndex, _Tp __value) +__q cpp_src/boost_concept_check.h /^ typename _Sequence::iterator __p, __q;$/;" m struct:_SequenceConcept access:public +__r cpp_src/boost_concept_check.h /^ _Return __r;$/;" m struct:_BinaryFunctionConcept access:public +__r cpp_src/boost_concept_check.h /^ _Return __r;$/;" m struct:_UnaryFunctionConcept access:public +__r cpp_src/boost_concept_check.h /^ std::pair<_Iterator,_Iterator> __r;$/;" m struct:_AssociativeContainerConcept access:public +__r cpp_src/boost_concept_check.h /^ std::pair<_Iterator,_Iterator> __r;$/;" m struct:_SortedAssociativeContainerConcept access:public +__rb_verify cpp_src/stl_tree.h /^ __rb_verify() const;$/;" p class:std::_Rb_tree access:public signature:() const +__rb_verify cpp_src/stl_tree.h /^ _Rb_tree<_Key,_Val,_KeyOfValue,_Compare,_Alloc>::__rb_verify() const$/;" f class:std::_Rb_tree signature:() const +__rep cpp_src/complex /^ const _ComplexT& __rep() const { return _M_value; }$/;" f struct:std::complex access:public signature:() const +__rep cpp_src/complex /^ const complex& __rep() const;$/;" p struct:std::complex file: access:public signature:() const +__rep cpp_src/complex /^ complex<_Tp>::__rep() const { return *this; }$/;" f class:std::complex signature:() const +__reverse cpp_src/stl_algo.h /^ __reverse(_BidirectionalIterator __first, _BidirectionalIterator __last,$/;" f namespace:std signature:(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) +__reverse cpp_src/stl_algo.h /^ __reverse(_RandomAccessIterator __first, _RandomAccessIterator __last,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) +__rotate cpp_src/stl_algo.h /^ __rotate(_BidirectionalIterator __first,$/;" f namespace:std signature:(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, bidirectional_iterator_tag) +__rotate cpp_src/stl_algo.h /^ __rotate(_ForwardIterator __first,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, forward_iterator_tag) +__rotate cpp_src/stl_algo.h /^ __rotate(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, random_access_iterator_tag) +__rotate_adaptive cpp_src/stl_algo.h /^ __rotate_adaptive(_BidirectionalIterator1 __first,$/;" f namespace:std signature:(_BidirectionalIterator1 __first, _BidirectionalIterator1 __middle, _BidirectionalIterator1 __last, _Distance __len1, _Distance __len2, _BidirectionalIterator2 __buffer, _Distance __buffer_size) +__rt cpp_src/valarray /^ typedef typename __fun<_Op, _Tp>::result_type __rt;$/;" t struct:std::valarray::_UnaryOp file: access:public +__search_n cpp_src/stl_algo.h /^ __search_n(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _Integer __count, const _Tp& __val, _BinaryPredicate __binary_pred, std::forward_iterator_tag) +__search_n cpp_src/stl_algo.h /^ __search_n(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _Integer __count, const _Tp& __val, std::forward_iterator_tag) +__search_n cpp_src/stl_algo.h /^ __search_n(_RandomAccessIter __first, _RandomAccessIter __last,$/;" f namespace:std signature:(_RandomAccessIter __first, _RandomAccessIter __last, _Integer __count, const _Tp& __val, _BinaryPredicate __binary_pred, std::random_access_iterator_tag) +__search_n cpp_src/stl_algo.h /^ __search_n(_RandomAccessIter __first, _RandomAccessIter __last,$/;" f namespace:std signature:(_RandomAccessIter __first, _RandomAccessIter __last, _Integer __count, const _Tp& __val, std::random_access_iterator_tag) +__second cpp_src/boost_concept_check.h /^ _Second __second;$/;" m struct:_BinaryFunctionConcept access:public +__shift_left cpp_src/valarray_before.h /^ struct __shift_left$/;" s namespace:std +__shift_right cpp_src/valarray_before.h /^ struct __shift_right$/;" s namespace:std +__sin cpp_src/valarray_before.h /^ struct __sin$/;" s namespace:std +__sinh cpp_src/valarray_before.h /^ struct __sinh$/;" s namespace:std +__size_type cpp_src/sstream /^ typedef typename __string_type::size_type __size_type;$/;" t class:std::basic_stringbuf file: access:public +__sqrt cpp_src/valarray_before.h /^ struct __sqrt$/;" s namespace:std +__stable_partition_adaptive cpp_src/stl_algo.h /^ __stable_partition_adaptive(_ForwardIterator __first,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, _Distance __len, _Pointer __buffer, _Distance __buffer_size) +__stable_sort_adaptive cpp_src/stl_algo.h /^ __stable_sort_adaptive(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Pointer __buffer, _Distance __buffer_size) +__stable_sort_adaptive cpp_src/stl_algo.h /^ __stable_sort_adaptive(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Pointer __buffer, _Distance __buffer_size, _Compare __comp) +__state_type cpp_src/fstream /^ typedef typename traits_type::state_type __state_type;$/;" t class:std::basic_filebuf file: access:public +__streambuf_type cpp_src/fstream /^ typedef basic_streambuf __streambuf_type;$/;" t class:std::basic_filebuf file: access:public +__streambuf_type cpp_src/istream /^ typedef basic_streambuf<_CharT, _Traits> __streambuf_type;$/;" t class:std::basic_istream file: access:public +__streambuf_type cpp_src/istream /^ typedef basic_streambuf<_CharT, _Traits> __streambuf_type;$/;" t class:std::basic_istream::sentry file: access:public +__streambuf_type cpp_src/ostream /^ typedef basic_streambuf<_CharT, _Traits> __streambuf_type;$/;" t class:std::basic_ostream file: access:public +__streambuf_type cpp_src/sstream /^ typedef basic_streambuf __streambuf_type;$/;" t class:std::basic_stringbuf file: access:public +__streambuf_type cpp_src/streambuf /^ typedef basic_streambuf __streambuf_type;$/;" t class:std::basic_streambuf file: access:public +__string_type cpp_src/locale_facets.h /^ typedef basic_string<_CharT> __string_type;$/;" t class:std::__timepunct access:public +__string_type cpp_src/locale_facets.h /^ typedef basic_string<_CharT> __string_type;$/;" t class:std::time_get access:public +__string_type cpp_src/sstream /^ typedef basic_string<_CharT, _Traits, _Alloc> __string_type;$/;" t class:std::basic_istringstream file: access:public +__string_type cpp_src/sstream /^ typedef basic_string<_CharT, _Traits, _Alloc> __string_type;$/;" t class:std::basic_ostringstream file: access:public +__string_type cpp_src/sstream /^ typedef basic_string<_CharT, _Traits, _Alloc> __string_type;$/;" t class:std::basic_stringstream file: access:public +__string_type cpp_src/sstream /^ typedef basic_string __string_type;$/;" t class:std::basic_stringbuf file: access:public +__stringbuf_type cpp_src/sstream /^ typedef basic_stringbuf<_CharT, _Traits, _Alloc> __stringbuf_type;$/;" t class:std::basic_istringstream file: access:public +__stringbuf_type cpp_src/sstream /^ typedef basic_stringbuf<_CharT, _Traits, _Alloc> __stringbuf_type;$/;" t class:std::basic_ostringstream file: access:public +__stringbuf_type cpp_src/sstream /^ typedef basic_stringbuf<_CharT, _Traits, _Alloc> __stringbuf_type;$/;" t class:std::basic_stringstream file: access:public +__t cpp_src/boost_concept_check.h /^ _ValueT __t;$/;" m struct:_OutputIteratorConcept access:public +__t cpp_src/boost_concept_check.h /^ typename _BackInsertionSequence::value_type __t;$/;" m struct:_BackInsertionSequenceConcept access:public +__t cpp_src/boost_concept_check.h /^ typename _FrontInsertionSequence::value_type __t;$/;" m struct:_FrontInsertionSequenceConcept access:public +__t cpp_src/boost_concept_check.h /^ typename _MultipleAssociativeContainer::value_type __t;$/;" m struct:_MultipleAssociativeContainerConcept access:public +__t cpp_src/boost_concept_check.h /^ typename _Sequence::value_type __t;$/;" m struct:_SequenceConcept access:public +__t cpp_src/boost_concept_check.h /^ typename _SortedAssociativeContainer::value_type __t;$/;" m struct:_SortedAssociativeContainerConcept access:public +__t cpp_src/boost_concept_check.h /^ typename _UniqueAssociativeContainer::value_type __t;$/;" m struct:_UniqueAssociativeContainerConcept access:public +__tan cpp_src/valarray_before.h /^ struct __tan$/;" s namespace:std +__tanh cpp_src/valarray_before.h /^ struct __tanh$/;" s namespace:std +__throw_bad_alloc cpp_src/functexcept.h /^ __throw_bad_alloc(void) __attribute__((__noreturn__));$/;" p namespace:std signature:(void) +__throw_bad_cast cpp_src/functexcept.h /^ __throw_bad_cast(void) __attribute__((__noreturn__));$/;" p namespace:std signature:(void) +__throw_bad_exception cpp_src/functexcept.h /^ __throw_bad_exception(void) __attribute__((__noreturn__));$/;" p namespace:std signature:(void) +__throw_bad_typeid cpp_src/functexcept.h /^ __throw_bad_typeid(void) __attribute__((__noreturn__));$/;" p namespace:std signature:(void) +__throw_domain_error cpp_src/functexcept.h /^ __throw_domain_error(const char*) __attribute__((__noreturn__));$/;" p namespace:std signature:(const char*) +__throw_exception_again cpp_src/exception_defines.h 45;" d +__throw_exception_again cpp_src/exception_defines.h 48;" d +__throw_invalid_argument cpp_src/functexcept.h /^ __throw_invalid_argument(const char*) __attribute__((__noreturn__));$/;" p namespace:std signature:(const char*) +__throw_ios_failure cpp_src/functexcept.h /^ __throw_ios_failure(const char*) __attribute__((__noreturn__));$/;" p namespace:std signature:(const char*) +__throw_length_error cpp_src/functexcept.h /^ __throw_length_error(const char*) __attribute__((__noreturn__));$/;" p namespace:std signature:(const char*) +__throw_logic_error cpp_src/functexcept.h /^ __throw_logic_error(const char*) __attribute__((__noreturn__));$/;" p namespace:std signature:(const char*) +__throw_out_of_range cpp_src/functexcept.h /^ __throw_out_of_range(const char*) __attribute__((__noreturn__));$/;" p namespace:std signature:(const char*) +__throw_overflow_error cpp_src/functexcept.h /^ __throw_overflow_error(const char*) __attribute__((__noreturn__));$/;" p namespace:std signature:(const char*) +__throw_range_error cpp_src/functexcept.h /^ __throw_range_error(const char*) __attribute__((__noreturn__));$/;" p namespace:std signature:(const char*) +__throw_runtime_error cpp_src/functexcept.h /^ __throw_runtime_error(const char*) __attribute__((__noreturn__));$/;" p namespace:std signature:(const char*) +__throw_underflow_error cpp_src/functexcept.h /^ __throw_underflow_error(const char*) __attribute__((__noreturn__));$/;" p namespace:std signature:(const char*) +__timepunct cpp_src/locale_facets.h /^ __timepunct(__c_locale __cloc, const char* __s, size_t __refs = 0);$/;" p class:std::__timepunct access:public signature:(__c_locale __cloc, const char* __s, size_t __refs = 0) +__timepunct cpp_src/locale_facets.h /^ __timepunct(__cache_type* __cache, size_t __refs = 0);$/;" p class:std::__timepunct access:public signature:(__cache_type* __cache, size_t __refs = 0) +__timepunct cpp_src/locale_facets.h /^ __timepunct(size_t __refs = 0);$/;" p class:std::__timepunct access:public signature:(size_t __refs = 0) +__timepunct cpp_src/locale_facets.h /^ class __timepunct : public locale::facet$/;" c namespace:std inherits:locale::facet +__timepunct_cache cpp_src/locale_facets.h /^ __timepunct_cache(const __timepunct_cache&);$/;" p struct:std::__timepunct_cache access:private signature:(const __timepunct_cache&) +__timepunct_cache cpp_src/locale_facets.h /^ __timepunct_cache(size_t __refs = 0) : facet(__refs),$/;" f struct:std::__timepunct_cache access:public signature:(size_t __refs = 0) +__timepunct_cache cpp_src/locale_facets.h /^ struct __timepunct_cache : public locale::facet$/;" s namespace:std inherits:locale::facet +__unary_plus cpp_src/valarray_before.h /^ struct __unary_plus$/;" s namespace:std +__unguarded_insertion_sort cpp_src/stl_algo.h /^ __unguarded_insertion_sort(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last) +__unguarded_insertion_sort cpp_src/stl_algo.h /^ __unguarded_insertion_sort(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) +__unguarded_linear_insert cpp_src/stl_algo.h /^ __unguarded_linear_insert(_RandomAccessIterator __last, _Tp __val)$/;" f namespace:std signature:(_RandomAccessIterator __last, _Tp __val) +__unguarded_linear_insert cpp_src/stl_algo.h /^ __unguarded_linear_insert(_RandomAccessIterator __last, _Tp __val,$/;" f namespace:std signature:(_RandomAccessIterator __last, _Tp __val, _Compare __comp) +__unguarded_partition cpp_src/stl_algo.h /^ __unguarded_partition(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Tp __pivot) +__unguarded_partition cpp_src/stl_algo.h /^ __unguarded_partition(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Tp __pivot, _Compare __comp) +__uninitialized_copy_a cpp_src/stl_uninitialized.h /^ __uninitialized_copy_a(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _Allocator __alloc) +__uninitialized_copy_a cpp_src/stl_uninitialized.h /^ __uninitialized_copy_a(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, allocator<_Tp>) +__uninitialized_copy_aux cpp_src/stl_uninitialized.h /^ __uninitialized_copy_aux(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, __false_type) +__uninitialized_copy_aux cpp_src/stl_uninitialized.h /^ __uninitialized_copy_aux(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, __true_type) +__uninitialized_copy_copy cpp_src/stl_uninitialized.h /^ __uninitialized_copy_copy(_InputIterator1 __first1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _ForwardIterator __result, _Allocator __alloc) +__uninitialized_copy_fill cpp_src/stl_uninitialized.h /^ __uninitialized_copy_fill(_InputIterator __first1, _InputIterator __last1,$/;" f namespace:std signature:(_InputIterator __first1, _InputIterator __last1, _ForwardIterator __first2, _ForwardIterator __last2, const _Tp& __x, _Allocator __alloc) +__uninitialized_fill_a cpp_src/stl_uninitialized.h /^ __uninitialized_fill_a(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x, _Allocator __alloc) +__uninitialized_fill_a cpp_src/stl_uninitialized.h /^ __uninitialized_fill_a(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x, allocator<_Tp2>) +__uninitialized_fill_aux cpp_src/stl_uninitialized.h /^ __uninitialized_fill_aux(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x, __false_type) +__uninitialized_fill_aux cpp_src/stl_uninitialized.h /^ __uninitialized_fill_aux(_ForwardIterator __first,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x, __true_type) +__uninitialized_fill_copy cpp_src/stl_uninitialized.h /^ __uninitialized_fill_copy(_ForwardIterator __result, _ForwardIterator __mid,$/;" f namespace:std signature:(_ForwardIterator __result, _ForwardIterator __mid, const _Tp& __x, _InputIterator __first, _InputIterator __last, _Allocator __alloc) +__uninitialized_fill_n_a cpp_src/stl_uninitialized.h /^ __uninitialized_fill_n_a(_ForwardIterator __first, _Size __n, $/;" f namespace:std signature:(_ForwardIterator __first, _Size __n, const _Tp& __x, _Allocator __alloc) +__uninitialized_fill_n_a cpp_src/stl_uninitialized.h /^ __uninitialized_fill_n_a(_ForwardIterator __first, _Size __n, $/;" f namespace:std signature:(_ForwardIterator __first, _Size __n, const _Tp& __x, allocator<_Tp2>) +__uninitialized_fill_n_aux cpp_src/stl_uninitialized.h /^ __uninitialized_fill_n_aux(_ForwardIterator __first, _Size __n,$/;" f namespace:std signature:(_ForwardIterator __first, _Size __n, const _Tp& __x, __false_type) +__uninitialized_fill_n_aux cpp_src/stl_uninitialized.h /^ __uninitialized_fill_n_aux(_ForwardIterator __first, _Size __n,$/;" f namespace:std signature:(_ForwardIterator __first, _Size __n, const _Tp& __x, __true_type) +__unique_copy cpp_src/stl_algo.h /^ __unique_copy(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __binary_pred, forward_iterator_tag, output_iterator_tag) +__unique_copy cpp_src/stl_algo.h /^ __unique_copy(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, forward_iterator_tag, output_iterator_tag) +__unique_copy cpp_src/stl_algo.h /^ __unique_copy(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __binary_pred, input_iterator_tag, forward_iterator_tag) +__unique_copy cpp_src/stl_algo.h /^ __unique_copy(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, input_iterator_tag, forward_iterator_tag) +__unique_copy cpp_src/stl_algo.h /^ __unique_copy(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __binary_pred, input_iterator_tag, output_iterator_tag) +__unique_copy cpp_src/stl_algo.h /^ __unique_copy(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _OutputIterator __result, input_iterator_tag, output_iterator_tag) +__use_cache cpp_src/locale_facets.tcc /^ struct __use_cache$/;" s namespace:std file: +__use_cache cpp_src/locale_facets.tcc /^ struct __use_cache<__moneypunct_cache<_CharT, _Intl> >$/;" s namespace:std file: +__use_cache cpp_src/locale_facets.tcc /^ struct __use_cache<__numpunct_cache<_CharT> >$/;" s namespace:std file: +__valarray_copy cpp_src/valarray_array.h /^ __valarray_copy(_Array<_Tp> __a, _Array<_Tp> __b, size_t __n, size_t __s)$/;" f namespace:std signature:(_Array<_Tp> __a, _Array<_Tp> __b, size_t __n, size_t __s) +__valarray_copy cpp_src/valarray_array.h /^ __valarray_copy(_Array<_Tp> __a, _Array __i,$/;" f namespace:std signature:(_Array<_Tp> __a, _Array __i, _Array<_Tp> __b, size_t __n) +__valarray_copy cpp_src/valarray_array.h /^ __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b)$/;" f namespace:std signature:(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b) +__valarray_copy cpp_src/valarray_array.h /^ __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b,$/;" f namespace:std signature:(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b, _Array __i) +__valarray_copy cpp_src/valarray_array.h /^ __valarray_copy(_Array<_Tp> __a, size_t __n, size_t __s, _Array<_Tp> __b)$/;" f namespace:std signature:(_Array<_Tp> __a, size_t __n, size_t __s, _Array<_Tp> __b) +__valarray_copy cpp_src/valarray_array.h /^ __valarray_copy(_Array<_Tp> __a, size_t __n, size_t __s1,$/;" f namespace:std signature:(_Array<_Tp> __a, size_t __n, size_t __s1, _Array<_Tp> __b, size_t __s2) +__valarray_copy cpp_src/valarray_array.h /^ __valarray_copy(_Array<_Tp> __src, size_t __n, _Array __i,$/;" f namespace:std signature:(_Array<_Tp> __src, size_t __n, _Array __i, _Array<_Tp> __dst, _Array __j) +__valarray_copy cpp_src/valarray_array.h /^ __valarray_copy(const _Tp* __restrict__ __a, _Tp* __restrict__ __b,$/;" f namespace:std signature:(const _Tp* __restrict__ __a, _Tp* __restrict__ __b, size_t __n, size_t __s) +__valarray_copy cpp_src/valarray_array.h /^ __valarray_copy(const _Tp* __restrict__ __a, size_t __n, size_t __s,$/;" f namespace:std signature:(const _Tp* __restrict__ __a, size_t __n, size_t __s, _Tp* __restrict__ __b) +__valarray_copy cpp_src/valarray_array.h /^ __valarray_copy(const _Tp* __restrict__ __a, size_t __n,$/;" f namespace:std signature:(const _Tp* __restrict__ __a, size_t __n, _Tp* __restrict__ __b) +__valarray_copy cpp_src/valarray_array.h /^ __valarray_copy(const _Tp* __restrict__ __a, size_t __n,$/;" f namespace:std signature:(const _Tp* __restrict__ __a, size_t __n, _Tp* __restrict__ __b, const size_t* __restrict__ __i) +__valarray_copy cpp_src/valarray_array.h /^ __valarray_copy(const _Tp* __restrict__ __a,$/;" f namespace:std signature:(const _Tp* __restrict__ __a, const size_t* __restrict__ __i, _Tp* __restrict__ __b, size_t __n) +__valarray_copy cpp_src/valarray_array.h /^ __valarray_copy(const _Tp* __restrict__ __src, size_t __n, size_t __s1,$/;" f namespace:std signature:(const _Tp* __restrict__ __src, size_t __n, size_t __s1, _Tp* __restrict__ __dst, size_t __s2) +__valarray_copy cpp_src/valarray_array.h /^ __valarray_copy(const _Tp* __restrict__ __src, size_t __n,$/;" f namespace:std signature:(const _Tp* __restrict__ __src, size_t __n, const size_t* __restrict__ __i, _Tp* __restrict__ __dst, const size_t* __restrict__ __j) +__valarray_copy cpp_src/valarray_array.tcc /^ __valarray_copy(_Array<_Tp> __a, _Array __m, _Array<_Tp> __b,$/;" f namespace:std signature:(_Array<_Tp> __a, _Array __m, _Array<_Tp> __b, size_t __n) +__valarray_copy cpp_src/valarray_array.tcc /^ __valarray_copy(_Array<_Tp> __a, _Array __m, size_t __n,$/;" f namespace:std signature:(_Array<_Tp> __a, _Array __m, size_t __n, _Array<_Tp> __b, _Array __k) +__valarray_copy cpp_src/valarray_array.tcc /^ __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b,$/;" f namespace:std signature:(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b, _Array __m) +__valarray_copy cpp_src/valarray_array.tcc /^ __valarray_copy(_Array<_Tp> __e, _Array __f,$/;" f namespace:std signature:(_Array<_Tp> __e, _Array __f, size_t __n, _Array<_Tp> __a, _Array __i) +__valarray_copy cpp_src/valarray_array.tcc /^ __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n, _Array<_Tp> __a)$/;" f namespace:std signature:(const _Expr<_Dom, _Tp>& __e, size_t __n, _Array<_Tp> __a) +__valarray_copy cpp_src/valarray_array.tcc /^ __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n,$/;" f namespace:std signature:(const _Expr<_Dom, _Tp>& __e, size_t __n, _Array<_Tp> __a, _Array __m) +__valarray_copy cpp_src/valarray_array.tcc /^ __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n,$/;" f namespace:std signature:(const _Expr<_Dom, _Tp>& __e, size_t __n, _Array<_Tp> __a, _Array __i) +__valarray_copy cpp_src/valarray_array.tcc /^ __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n,$/;" f namespace:std signature:(const _Expr<_Dom, _Tp>& __e, size_t __n, _Array<_Tp> __a, size_t __s) +__valarray_copy_construct cpp_src/valarray_array.h /^ __valarray_copy_construct (const _Tp* __restrict__ __a, size_t __n,$/;" f namespace:std signature:(const _Tp* __restrict__ __a, size_t __n, size_t __s, _Tp* __restrict__ __o) +__valarray_copy_construct cpp_src/valarray_array.h /^ __valarray_copy_construct (const _Tp* __restrict__ __a,$/;" f namespace:std signature:(const _Tp* __restrict__ __a, const size_t* __restrict__ __i, _Tp* __restrict__ __o, size_t __n) +__valarray_copy_construct cpp_src/valarray_array.h /^ __valarray_copy_construct(_Array<_Tp> __a, _Array __i,$/;" f namespace:std signature:(_Array<_Tp> __a, _Array __i, _Array<_Tp> __b, size_t __n) +__valarray_copy_construct cpp_src/valarray_array.h /^ __valarray_copy_construct(_Array<_Tp> __a, size_t __n, size_t __s,$/;" f namespace:std signature:(_Array<_Tp> __a, size_t __n, size_t __s, _Array<_Tp> __b) +__valarray_copy_construct cpp_src/valarray_array.h /^ __valarray_copy_construct(const _Tp* __restrict__ __b,$/;" f namespace:std signature:(const _Tp* __restrict__ __b, const _Tp* __restrict__ __e, _Tp* __restrict__ __o) +__valarray_copy_construct cpp_src/valarray_array.tcc /^ __valarray_copy_construct(_Array<_Tp> __a, _Array __m,$/;" f namespace:std signature:(_Array<_Tp> __a, _Array __m, _Array<_Tp> __b, size_t __n) +__valarray_copy_construct cpp_src/valarray_array.tcc /^ __valarray_copy_construct(const _Expr<_Dom, _Tp>& __e, size_t __n,$/;" f namespace:std signature:(const _Expr<_Dom, _Tp>& __e, size_t __n, _Array<_Tp> __a) +__valarray_default_construct cpp_src/valarray_array.h /^ __valarray_default_construct(_Tp* __restrict__ __b, _Tp* __restrict__ __e)$/;" f namespace:std signature:(_Tp* __restrict__ __b, _Tp* __restrict__ __e) +__valarray_destroy_elements cpp_src/valarray_array.h /^ __valarray_destroy_elements(_Tp* __restrict__ __b, _Tp* __restrict__ __e)$/;" f namespace:std signature:(_Tp* __restrict__ __b, _Tp* __restrict__ __e) +__valarray_fill cpp_src/valarray_array.h /^ __valarray_fill (_Array<_Tp> __a, size_t __n, const _Tp& __t)$/;" f namespace:std signature:(_Array<_Tp> __a, size_t __n, const _Tp& __t) +__valarray_fill cpp_src/valarray_array.h /^ __valarray_fill(_Array<_Tp> __a, _Array __i,$/;" f namespace:std signature:(_Array<_Tp> __a, _Array __i, size_t __n, const _Tp& __t) +__valarray_fill cpp_src/valarray_array.h /^ __valarray_fill(_Array<_Tp> __a, size_t __n, size_t __s, const _Tp& __t)$/;" f namespace:std signature:(_Array<_Tp> __a, size_t __n, size_t __s, const _Tp& __t) +__valarray_fill cpp_src/valarray_array.h /^ __valarray_fill(_Tp* __restrict__ __a, const size_t* __restrict__ __i,$/;" f namespace:std signature:(_Tp* __restrict__ __a, const size_t* __restrict__ __i, size_t __n, const _Tp& __t) +__valarray_fill cpp_src/valarray_array.h /^ __valarray_fill(_Tp* __restrict__ __a, size_t __n, const _Tp& __t)$/;" f namespace:std signature:(_Tp* __restrict__ __a, size_t __n, const _Tp& __t) +__valarray_fill cpp_src/valarray_array.h /^ __valarray_fill(_Tp* __restrict__ __a, size_t __n,$/;" f namespace:std signature:(_Tp* __restrict__ __a, size_t __n, size_t __s, const _Tp& __t) +__valarray_fill cpp_src/valarray_array.tcc /^ __valarray_fill(_Array<_Tp> __a, size_t __n, _Array __m,$/;" f namespace:std signature:(_Array<_Tp> __a, size_t __n, _Array __m, const _Tp& __t) +__valarray_fill_construct cpp_src/valarray_array.h /^ __valarray_fill_construct(_Tp* __restrict__ __b, _Tp* __restrict__ __e,$/;" f namespace:std signature:(_Tp* __restrict__ __b, _Tp* __restrict__ __e, const _Tp __t) +__valarray_get_memory cpp_src/valarray_array.h /^ __valarray_get_memory(size_t __n)$/;" f namespace:std signature:(size_t __n) +__valarray_get_storage cpp_src/valarray_array.h /^ __valarray_get_storage(size_t __n)$/;" f namespace:std signature:(size_t __n) +__valarray_max cpp_src/valarray_array.h /^ __valarray_max(const _Ta& __a)$/;" f namespace:std signature:(const _Ta& __a) +__valarray_min cpp_src/valarray_array.h /^ __valarray_min(const _Ta& __a)$/;" f namespace:std signature:(const _Ta& __a) +__valarray_product cpp_src/valarray_array.h /^ __valarray_product(const _Tp* __restrict__ __f,$/;" f namespace:std signature:(const _Tp* __restrict__ __f, const _Tp* __restrict__ __l) +__valarray_release_memory cpp_src/valarray_array.h /^ __valarray_release_memory(void* __p)$/;" f namespace:std signature:(void* __p) +__valarray_sum cpp_src/valarray_array.h /^ __valarray_sum(const _Tp* __restrict__ __f, const _Tp* __restrict__ __l)$/;" f namespace:std signature:(const _Tp* __restrict__ __f, const _Tp* __restrict__ __l) +__vc cpp_src/boost_concept_check.h /^ typename _SortedAssociativeContainer::value_compare __vc;$/;" m struct:_SortedAssociativeContainerConcept access:public +__verbose_terminate_handler cpp_src/exception /^ void __verbose_terminate_handler ();$/;" p file: signature:() +__verify_grouping cpp_src/locale_facets.tcc /^ __verify_grouping(const char* __grouping, size_t __grouping_size,$/;" f namespace:std signature:(const char* __grouping, size_t __grouping_size, const string& __grouping_tmp) +__verify_grouping cpp_src/locale_facets.tcc /^ __verify_grouping(const char* __grouping, size_t __grouping_size,$/;" p namespace:std file: signature:(const char* __grouping, size_t __grouping_size, const string& __grouping_tmp) +__wmask_type cpp_src/locale_facets.h /^ typedef wctype_t __wmask_type;$/;" t class:std::ctype access:public +__write cpp_src/locale_facets.h /^ __write(_OutIter __s, const _CharT* __ws, int __len)$/;" f namespace:std signature:(_OutIter __s, const _CharT* __ws, int __len) +__write cpp_src/locale_facets.h /^ __write(ostreambuf_iterator<_CharT> __s, const _CharT* __ws, int __len)$/;" f namespace:std signature:(ostreambuf_iterator<_CharT> __s, const _CharT* __ws, int __len) +__x cpp_src/boost_concept_check.h /^ _From __x;$/;" m struct:_ConvertibleConcept access:public +abort cpp_src/cstdlib /^ extern "C" void abort(void);$/;" p namespace:std file: signature:(void) +abs cpp_src/cmath /^ abs(double __x)$/;" f namespace:std signature:(double __x) +abs cpp_src/cmath /^ abs(float __x)$/;" f namespace:std signature:(float __x) +abs cpp_src/cmath /^ abs(long double __x)$/;" f namespace:std signature:(long double __x) +abs cpp_src/cmath 57;" d file: +abs cpp_src/complex /^ abs(const complex<_Tp>& __z) { return __complex_abs(__z); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +abs cpp_src/complex /^ abs(const complex<_Tp>& __z) { return __complex_abs(__z.__rep()); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +abs cpp_src/complex /^ template _Tp abs(const complex<_Tp>&);$/;" p namespace:std file: signature:(const complex<_Tp>&) +accumulate cpp_src/stl_numeric.h /^ accumulate(_InputIterator __first, _InputIterator __last, _Tp __init)$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _Tp __init) +accumulate cpp_src/stl_numeric.h /^ accumulate(_InputIterator __first, _InputIterator __last, _Tp __init,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _Tp __init, _BinaryOperation __binary_op) +acos cpp_src/cmath /^ acos(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +acos cpp_src/cmath /^ acos(float __x)$/;" f namespace:std signature:(float __x) +acos cpp_src/cmath /^ acos(long double __x)$/;" f namespace:std signature:(long double __x) +acos cpp_src/cmath 59;" d file: +adjacent_difference cpp_src/stl_numeric.h /^ adjacent_difference(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryOperation __binary_op) +adjacent_difference cpp_src/stl_numeric.h /^ adjacent_difference(_InputIterator __first,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _OutputIterator __result) +adjacent_find cpp_src/stl_algo.h /^ adjacent_find(_ForwardIterator __first, _ForwardIterator __last)$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last) +adjacent_find cpp_src/stl_algo.h /^ adjacent_find(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __binary_pred) +adjustfield cpp_src/ios_base.h /^ static const fmtflags adjustfield = _S_adjustfield;$/;" m class:std::ios_base access:public +advance cpp_src/stl_iterator_base_funcs.h /^ advance(_InputIterator& __i, _Distance __n)$/;" f namespace:std signature:(_InputIterator& __i, _Distance __n) +all cpp_src/locale_classes.h /^ static const category all = (ctype | numeric | collate |$/;" m class:std::locale access:public +allocator cpp_src/allocator.h /^ allocator(const allocator<_Tp1>&) throw() { }$/;" f class:std::allocator access:public signature:(const allocator<_Tp1>&) +allocator cpp_src/allocator.h /^ allocator() throw() { }$/;" f class:std::allocator access:public signature:() +allocator cpp_src/allocator.h /^ allocator(const allocator& __a) throw()$/;" f class:std::allocator access:public signature:(const allocator& __a) +allocator cpp_src/allocator.h /^ class allocator: public __glibcxx_base_allocator<_Tp>$/;" c namespace:std inherits:__glibcxx_base_allocator +allocator cpp_src/allocator.h /^ class allocator$/;" c namespace:std +allocator_type cpp_src/basic_string.h /^ typedef _Alloc allocator_type;$/;" t class:std::basic_string access:public +allocator_type cpp_src/sstream /^ typedef _Alloc allocator_type;$/;" t class:std::basic_istringstream file: access:public +allocator_type cpp_src/sstream /^ typedef _Alloc allocator_type;$/;" t class:std::basic_ostringstream file: access:public +allocator_type cpp_src/sstream /^ typedef _Alloc allocator_type;$/;" t class:std::basic_stringbuf file: access:public +allocator_type cpp_src/sstream /^ typedef _Alloc allocator_type;$/;" t class:std::basic_stringstream file: access:public +allocator_type cpp_src/stl_bvector.h /^ typedef _Alloc allocator_type;$/;" t struct:std::_Bvector_base access:public +allocator_type cpp_src/stl_bvector.h /^ typedef _Alloc allocator_type;$/;" t class:std::vector access:public +allocator_type cpp_src/stl_deque.h /^ typedef _Alloc allocator_type;$/;" t class:std::deque access:public +allocator_type cpp_src/stl_deque.h /^ typedef _Alloc allocator_type;$/;" t class:std::_Deque_base access:public +allocator_type cpp_src/stl_list.h /^ typedef _Alloc allocator_type;$/;" t class:std::list access:public +allocator_type cpp_src/stl_list.h /^ typedef _Alloc allocator_type;$/;" t class:std::_List_base access:public +allocator_type cpp_src/stl_map.h /^ typedef _Alloc allocator_type;$/;" t class:std::map access:public +allocator_type cpp_src/stl_multimap.h /^ typedef _Alloc allocator_type;$/;" t class:std::multimap access:public +allocator_type cpp_src/stl_multiset.h /^ typedef _Alloc allocator_type;$/;" t class:std::multiset access:public +allocator_type cpp_src/stl_set.h /^ typedef _Alloc allocator_type;$/;" t class:std::set access:public +allocator_type cpp_src/stl_tree.h /^ typedef _Alloc allocator_type;$/;" t class:std::_Rb_tree access:public +allocator_type cpp_src/stl_vector.h /^ typedef _Alloc allocator_type;$/;" t class:std::vector access:public +allocator_type cpp_src/stl_vector.h /^ typedef _Alloc allocator_type;$/;" t struct:std::_Vector_base access:public +always_noconv cpp_src/codecvt.h /^ always_noconv() const throw()$/;" f class:std::__codecvt_abstract_base access:public signature:() const +any cpp_src/bitset /^ any() const$/;" f class:std::bitset access:public signature:() const +app cpp_src/ios_base.h /^ static const openmode app = _S_app;$/;" m class:std::ios_base access:public +append cpp_src/basic_string.h /^ append(_InputIterator __first, _InputIterator __last)$/;" f class:std::basic_string access:public signature:(_InputIterator __first, _InputIterator __last) +append cpp_src/basic_string.h /^ append(const _CharT* __s)$/;" f class:std::basic_string access:public signature:(const _CharT* __s) +append cpp_src/basic_string.h /^ append(const _CharT* __s, size_type __n);$/;" p class:std::basic_string access:public signature:(const _CharT* __s, size_type __n) +append cpp_src/basic_string.h /^ append(const basic_string& __str);$/;" p class:std::basic_string access:public signature:(const basic_string& __str) +append cpp_src/basic_string.h /^ append(const basic_string& __str, size_type __pos, size_type __n);$/;" p class:std::basic_string access:public signature:(const basic_string& __str, size_type __pos, size_type __n) +append cpp_src/basic_string.h /^ append(size_type __n, _CharT __c);$/;" p class:std::basic_string access:public signature:(size_type __n, _CharT __c) +append cpp_src/basic_string.tcc /^ append(const _CharT* __s, size_type __n)$/;" f class:std::basic_string signature:(const _CharT* __s, size_type __n) +append cpp_src/basic_string.tcc /^ append(const basic_string& __str)$/;" f class:std::basic_string signature:(const basic_string& __str) +append cpp_src/basic_string.tcc /^ append(const basic_string& __str, size_type __pos, size_type __n)$/;" f class:std::basic_string signature:(const basic_string& __str, size_type __pos, size_type __n) +append cpp_src/basic_string.tcc /^ append(size_type __n, _CharT __c)$/;" f class:std::basic_string signature:(size_type __n, _CharT __c) +apply cpp_src/valarray_after.h /^ valarray apply(value_type (*)(const value_type&)) const;$/;" p class:std::_Expr access:public signature:(value_type ()const value_type&)) const +apply cpp_src/valarray_after.h /^ valarray apply(value_type (*)(value_type)) const;$/;" p class:std::_Expr access:public signature:(value_type ()value_type)) const +arg cpp_src/complex /^ arg(const complex<_Tp>& __z) { return __complex_arg(__z); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +arg cpp_src/complex /^ arg(const complex<_Tp>& __z) { return __complex_arg(__z.__rep()); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +arg cpp_src/complex /^ template _Tp arg(const complex<_Tp>&);$/;" p namespace:std file: signature:(const complex<_Tp>&) +argument_type cpp_src/stl_function.h /^ typedef _Arg argument_type; \/\/\/< @c argument_type is the type of the$/;" t struct:std::unary_function access:public +asctime cpp_src/ctime 58;" d file: +asin cpp_src/cmath /^ asin(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +asin cpp_src/cmath /^ asin(float __x)$/;" f namespace:std signature:(float __x) +asin cpp_src/cmath /^ asin(long double __x)$/;" f namespace:std signature:(long double __x) +asin cpp_src/cmath 60;" d file: +assign cpp_src/basic_string.h /^ assign(_InputIterator __first, _InputIterator __last)$/;" f class:std::basic_string access:public signature:(_InputIterator __first, _InputIterator __last) +assign cpp_src/basic_string.h /^ assign(const _CharT* __s)$/;" f class:std::basic_string access:public signature:(const _CharT* __s) +assign cpp_src/basic_string.h /^ assign(const _CharT* __s, size_type __n);$/;" p class:std::basic_string access:public signature:(const _CharT* __s, size_type __n) +assign cpp_src/basic_string.h /^ assign(const basic_string& __str);$/;" p class:std::basic_string access:public signature:(const basic_string& __str) +assign cpp_src/basic_string.h /^ assign(const basic_string& __str, size_type __pos, size_type __n)$/;" f class:std::basic_string access:public signature:(const basic_string& __str, size_type __pos, size_type __n) +assign cpp_src/basic_string.h /^ assign(size_type __n, _CharT __c)$/;" f class:std::basic_string access:public signature:(size_type __n, _CharT __c) +assign cpp_src/basic_string.tcc /^ assign(const _CharT* __s, size_type __n)$/;" f class:std::basic_string signature:(const _CharT* __s, size_type __n) +assign cpp_src/basic_string.tcc /^ assign(const basic_string& __str)$/;" f class:std::basic_string signature:(const basic_string& __str) +assign cpp_src/char_traits.h /^ assign(char_type& __c1, const char_type& __c2)$/;" f struct:char_traits access:public signature:(char_type& __c1, const char_type& __c2) +assign cpp_src/char_traits.h /^ assign(char_type* __s, std::size_t __n, char_type __a);$/;" p struct:char_traits access:public signature:(char_type* __s, std::size_t __n, char_type __a) +assign cpp_src/char_traits.h /^ assign(char_type* __s, std::size_t __n, char_type __a)$/;" f class:char_traits signature:(char_type* __s, std::size_t __n, char_type __a) +assign cpp_src/stl_bvector.h /^ assign(_InputIterator __first, _InputIterator __last)$/;" f class:std::vector access:public signature:(_InputIterator __first, _InputIterator __last) +assign cpp_src/stl_bvector.h /^ assign(size_type __n, const bool& __x)$/;" f class:std::vector access:public signature:(size_type __n, const bool& __x) +assign cpp_src/stl_deque.h /^ assign(_InputIterator __first, _InputIterator __last)$/;" f class:std::deque access:public signature:(_InputIterator __first, _InputIterator __last) +assign cpp_src/stl_deque.h /^ assign(size_type __n, const value_type& __val)$/;" f class:std::deque access:public signature:(size_type __n, const value_type& __val) +assign cpp_src/stl_list.h /^ assign(_InputIterator __first, _InputIterator __last)$/;" f class:std::list access:public signature:(_InputIterator __first, _InputIterator __last) +assign cpp_src/stl_list.h /^ assign(size_type __n, const value_type& __val)$/;" f class:std::list access:public signature:(size_type __n, const value_type& __val) +assign cpp_src/stl_vector.h /^ assign(_InputIterator __first, _InputIterator __last)$/;" f class:std::vector access:public signature:(_InputIterator __first, _InputIterator __last) +assign cpp_src/stl_vector.h /^ assign(size_type __n, const value_type& __val)$/;" f class:std::vector access:public signature:(size_type __n, const value_type& __val) +at cpp_src/basic_string.h /^ at(size_type __n) const$/;" f class:std::basic_string access:public signature:(size_type __n) const +at cpp_src/basic_string.h /^ at(size_type __n)$/;" f class:std::basic_string access:public signature:(size_type __n) +at cpp_src/stl_bvector.h /^ at(size_type __n) const$/;" f class:std::vector access:public signature:(size_type __n) const +at cpp_src/stl_bvector.h /^ at(size_type __n)$/;" f class:std::vector access:public signature:(size_type __n) +at cpp_src/stl_deque.h /^ at(size_type __n) const$/;" f class:std::deque access:public signature:(size_type __n) const +at cpp_src/stl_deque.h /^ at(size_type __n)$/;" f class:std::deque access:public signature:(size_type __n) +at cpp_src/stl_map.h /^ at(const key_type& __k) const$/;" f class:std::map access:public signature:(const key_type& __k) const +at cpp_src/stl_map.h /^ at(const key_type& __k)$/;" f class:std::map access:public signature:(const key_type& __k) +at cpp_src/stl_vector.h /^ at(size_type __n) const$/;" f class:std::vector access:public signature:(size_type __n) const +at cpp_src/stl_vector.h /^ at(size_type __n)$/;" f class:std::vector access:public signature:(size_type __n) +atan cpp_src/cmath /^ atan(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +atan cpp_src/cmath /^ atan(float __x)$/;" f namespace:std signature:(float __x) +atan cpp_src/cmath /^ atan(long double __x)$/;" f namespace:std signature:(long double __x) +atan cpp_src/cmath 61;" d file: +atan2 cpp_src/cmath /^ atan2(_Tp __y, _Up __x)$/;" f namespace:std signature:(_Tp __y, _Up __x) +atan2 cpp_src/cmath /^ atan2(float __y, float __x)$/;" f namespace:std signature:(float __y, float __x) +atan2 cpp_src/cmath /^ atan2(long double __y, long double __x)$/;" f namespace:std signature:(long double __y, long double __x) +atan2 cpp_src/cmath 62;" d file: +ate cpp_src/ios_base.h /^ static const openmode ate = _S_ate;$/;" m class:std::ios_base access:public +atexit cpp_src/cstdlib /^ extern "C" int atexit(void (*)());$/;" p namespace:std file: signature:(void (*)()) +auto_ptr cpp_src/memory /^ auto_ptr(auto_ptr<_Tp1>& __a) throw() : _M_ptr(__a.release()) { }$/;" f class:std::auto_ptr access:public signature:(auto_ptr<_Tp1>& __a) +auto_ptr cpp_src/memory /^ auto_ptr(auto_ptr& __a) throw() : _M_ptr(__a.release()) { }$/;" f class:std::auto_ptr access:public signature:(auto_ptr& __a) +auto_ptr cpp_src/memory /^ auto_ptr(auto_ptr_ref __ref) throw()$/;" f class:std::auto_ptr access:public signature:(auto_ptr_ref __ref) +auto_ptr cpp_src/memory /^ auto_ptr(element_type* __p = 0) throw() : _M_ptr(__p) { }$/;" f class:std::auto_ptr access:public signature:(element_type* __p = 0) +auto_ptr cpp_src/memory /^ class auto_ptr$/;" c namespace:std file: +auto_ptr_ref cpp_src/memory /^ auto_ptr_ref(_Tp1* __p): _M_ptr(__p) { }$/;" f struct:std::auto_ptr_ref access:public signature:(_Tp1* __p) +auto_ptr_ref cpp_src/memory /^ struct auto_ptr_ref$/;" s namespace:std file: +back cpp_src/stl_bvector.h /^ back() const$/;" f class:std::vector access:public signature:() const +back cpp_src/stl_bvector.h /^ back()$/;" f class:std::vector access:public signature:() +back cpp_src/stl_deque.h /^ back() const$/;" f class:std::deque access:public signature:() const +back cpp_src/stl_deque.h /^ back()$/;" f class:std::deque access:public signature:() +back cpp_src/stl_list.h /^ back() const$/;" f class:std::list access:public signature:() const +back cpp_src/stl_list.h /^ back()$/;" f class:std::list access:public signature:() +back cpp_src/stl_queue.h /^ back() const$/;" f class:std::queue access:public signature:() const +back cpp_src/stl_queue.h /^ back()$/;" f class:std::queue access:public signature:() +back cpp_src/stl_vector.h /^ back() const$/;" f class:std::vector access:public signature:() const +back cpp_src/stl_vector.h /^ back()$/;" f class:std::vector access:public signature:() +back_insert_iterator cpp_src/stl_iterator.h /^ back_insert_iterator(_Container& __x) : container(&__x) { }$/;" f class:std::back_insert_iterator access:public signature:(_Container& __x) +back_insert_iterator cpp_src/stl_iterator.h /^ class back_insert_iterator$/;" c namespace:std inherits:iterator +back_inserter cpp_src/stl_iterator.h /^ back_inserter(_Container& __x)$/;" f namespace:std signature:(_Container& __x) +bad cpp_src/basic_ios.h /^ bad() const$/;" f class:std::basic_ios access:public signature:() const +bad_alloc cpp_src/new /^ bad_alloc() throw() { }$/;" f class:std::bad_alloc access:public signature:() +bad_alloc cpp_src/new /^ class bad_alloc : public exception $/;" c namespace:std file: inherits:exception +bad_cast cpp_src/typeinfo /^ bad_cast() throw() { }$/;" f class:std::bad_cast access:public signature:() +bad_cast cpp_src/typeinfo /^ class bad_cast : public exception $/;" c namespace:std file: inherits:exception +bad_exception cpp_src/exception /^ bad_exception() throw() { }$/;" f class:std::bad_exception access:public signature:() +bad_exception cpp_src/exception /^ class bad_exception : public exception $/;" c namespace:std file: inherits:exception +bad_typeid cpp_src/typeinfo /^ bad_typeid () throw() { }$/;" f class:std::bad_typeid access:public signature:() +bad_typeid cpp_src/typeinfo /^ class bad_typeid : public exception $/;" c namespace:std file: inherits:exception +badbit cpp_src/ios_base.h /^ static const iostate badbit = _S_badbit;$/;" m class:std::ios_base access:public +base cpp_src/stl_iterator.h /^ base() const$/;" f class:__normal_iterator access:public signature:() const +base cpp_src/stl_iterator.h /^ base() const$/;" f class:std::reverse_iterator access:public signature:() const +basefield cpp_src/ios_base.h /^ static const fmtflags basefield = _S_basefield;$/;" m class:std::ios_base access:public +basic_filebuf cpp_src/fstream /^ basic_filebuf();$/;" p class:std::basic_filebuf file: access:public signature:() +basic_filebuf cpp_src/fstream /^ class basic_filebuf : public basic_streambuf<_CharT, _Traits>$/;" c namespace:std file: inherits:basic_streambuf +basic_filebuf cpp_src/fstream.tcc /^ basic_filebuf() : __streambuf_type(), _M_lock(), _M_file(&_M_lock),$/;" f class:std::basic_filebuf signature:() +basic_fstream cpp_src/fstream /^ basic_fstream()$/;" f class:std::basic_fstream access:public signature:() +basic_fstream cpp_src/fstream /^ basic_fstream(const char* __s,$/;" f class:std::basic_fstream access:public signature:(const char* __s, ios_base::openmode __mode = ios_base::in | ios_base::out) +basic_fstream cpp_src/fstream /^ class basic_fstream : public basic_iostream<_CharT, _Traits>$/;" c namespace:std file: inherits:basic_iostream +basic_ifstream cpp_src/fstream /^ basic_ifstream() : __istream_type(), _M_filebuf()$/;" f class:std::basic_ifstream access:public signature:() +basic_ifstream cpp_src/fstream /^ basic_ifstream(const char* __s, ios_base::openmode __mode = ios_base::in)$/;" f class:std::basic_ifstream access:public signature:(const char* __s, ios_base::openmode __mode = ios_base::in) +basic_ifstream cpp_src/fstream /^ class basic_ifstream : public basic_istream<_CharT, _Traits>$/;" c namespace:std file: inherits:basic_istream +basic_ios cpp_src/basic_ios.h /^ basic_ios()$/;" f class:std::basic_ios access:protected signature:() +basic_ios cpp_src/basic_ios.h /^ basic_ios(basic_streambuf<_CharT, _Traits>* __sb)$/;" f class:std::basic_ios access:public signature:(basic_streambuf<_CharT, _Traits>* __sb) +basic_ios cpp_src/basic_ios.h /^ class basic_ios : public ios_base$/;" c namespace:std inherits:ios_base +basic_iostream cpp_src/istream /^ basic_iostream() : __istream_type(), __ostream_type()$/;" f class:std::basic_iostream access:protected signature:() +basic_iostream cpp_src/istream /^ basic_iostream(basic_streambuf<_CharT, _Traits>* __sb)$/;" f class:std::basic_iostream access:public signature:(basic_streambuf<_CharT, _Traits>* __sb) +basic_iostream cpp_src/istream /^ class basic_iostream$/;" c namespace:std file: inherits:basic_istream,basic_ostream +basic_istream cpp_src/istream /^ basic_istream(): _M_gcount(streamsize(0)) { }$/;" f class:std::basic_istream access:protected signature:() +basic_istream cpp_src/istream /^ basic_istream(__streambuf_type* __sb): _M_gcount(streamsize(0))$/;" f class:std::basic_istream access:public signature:(__streambuf_type* __sb) +basic_istream cpp_src/istream /^ class basic_istream : virtual public basic_ios<_CharT, _Traits>$/;" c namespace:std file: inherits:basic_ios +basic_istringstream cpp_src/sstream /^ basic_istringstream(const __string_type& __str,$/;" f class:std::basic_istringstream access:public signature:(const __string_type& __str, ios_base::openmode __mode = ios_base::in) +basic_istringstream cpp_src/sstream /^ basic_istringstream(ios_base::openmode __mode = ios_base::in)$/;" f class:std::basic_istringstream access:public signature:(ios_base::openmode __mode = ios_base::in) +basic_istringstream cpp_src/sstream /^ class basic_istringstream : public basic_istream<_CharT, _Traits>$/;" c namespace:std file: inherits:basic_istream +basic_ofstream cpp_src/fstream /^ basic_ofstream(): __ostream_type(), _M_filebuf()$/;" f class:std::basic_ofstream access:public signature:() +basic_ofstream cpp_src/fstream /^ basic_ofstream(const char* __s,$/;" f class:std::basic_ofstream access:public signature:(const char* __s, ios_base::openmode __mode = ios_base::out|ios_base::trunc) +basic_ofstream cpp_src/fstream /^ class basic_ofstream : public basic_ostream<_CharT,_Traits>$/;" c namespace:std file: inherits:basic_ostream +basic_ostream cpp_src/ostream /^ basic_ostream() { }$/;" f class:std::basic_ostream access:protected signature:() +basic_ostream cpp_src/ostream /^ basic_ostream(__streambuf_type* __sb)$/;" f class:std::basic_ostream access:public signature:(__streambuf_type* __sb) +basic_ostream cpp_src/ostream /^ class basic_ostream : virtual public basic_ios<_CharT, _Traits>$/;" c namespace:std file: inherits:basic_ios +basic_ostringstream cpp_src/sstream /^ basic_ostringstream(const __string_type& __str,$/;" f class:std::basic_ostringstream access:public signature:(const __string_type& __str, ios_base::openmode __mode = ios_base::out) +basic_ostringstream cpp_src/sstream /^ basic_ostringstream(ios_base::openmode __mode = ios_base::out)$/;" f class:std::basic_ostringstream access:public signature:(ios_base::openmode __mode = ios_base::out) +basic_ostringstream cpp_src/sstream /^ class basic_ostringstream : public basic_ostream<_CharT, _Traits>$/;" c namespace:std file: inherits:basic_ostream +basic_streambuf cpp_src/streambuf /^ basic_streambuf()$/;" f class:std::basic_streambuf access:protected signature:() +basic_streambuf cpp_src/streambuf /^ basic_streambuf(const __streambuf_type& __sb)$/;" f class:std::basic_streambuf file: access:private signature:(const __streambuf_type& __sb) +basic_streambuf cpp_src/streambuf /^ class basic_streambuf $/;" c namespace:std file: +basic_string cpp_src/basic_string.h /^ basic_string(_InputIterator __beg, _InputIterator __end,$/;" p class:std::basic_string access:public signature:(_InputIterator __beg, _InputIterator __end, const _Alloc& __a = _Alloc()) +basic_string cpp_src/basic_string.h /^ basic_string();$/;" p class:std::basic_string access:public signature:() +basic_string cpp_src/basic_string.h /^ basic_string(const _Alloc& __a);$/;" p class:std::basic_string access:public signature:(const _Alloc& __a) +basic_string cpp_src/basic_string.h /^ basic_string(const _CharT* __s, const _Alloc& __a = _Alloc());$/;" p class:std::basic_string access:public signature:(const _CharT* __s, const _Alloc& __a = _Alloc()) +basic_string cpp_src/basic_string.h /^ basic_string(const _CharT* __s, size_type __n,$/;" p class:std::basic_string access:public signature:(const _CharT* __s, size_type __n, const _Alloc& __a = _Alloc()) +basic_string cpp_src/basic_string.h /^ basic_string(const basic_string& __str);$/;" p class:std::basic_string access:public signature:(const basic_string& __str) +basic_string cpp_src/basic_string.h /^ basic_string(const basic_string& __str, size_type __pos,$/;" p class:std::basic_string access:public signature:(const basic_string& __str, size_type __pos, size_type __n = npos) +basic_string cpp_src/basic_string.h /^ basic_string(const basic_string& __str, size_type __pos,$/;" p class:std::basic_string access:public signature:(const basic_string& __str, size_type __pos, size_type __n, const _Alloc& __a) +basic_string cpp_src/basic_string.h /^ basic_string(size_type __n, _CharT __c, const _Alloc& __a = _Alloc());$/;" p class:std::basic_string access:public signature:(size_type __n, _CharT __c, const _Alloc& __a = _Alloc()) +basic_string cpp_src/basic_string.h /^ basic_string()$/;" f class:std::basic_string signature:() +basic_string cpp_src/basic_string.h /^ class basic_string$/;" c namespace:std +basic_string cpp_src/basic_string.tcc /^ basic_string(_InputIterator __beg, _InputIterator __end, const _Alloc& __a)$/;" f class:std::basic_string signature:(_InputIterator __beg, _InputIterator __end, const _Alloc& __a) +basic_string cpp_src/basic_string.tcc /^ basic_string(const _Alloc& __a)$/;" f class:std::basic_string signature:(const _Alloc& __a) +basic_string cpp_src/basic_string.tcc /^ basic_string(const _CharT* __s, const _Alloc& __a)$/;" f class:std::basic_string signature:(const _CharT* __s, const _Alloc& __a) +basic_string cpp_src/basic_string.tcc /^ basic_string(const _CharT* __s, size_type __n, const _Alloc& __a)$/;" f class:std::basic_string signature:(const _CharT* __s, size_type __n, const _Alloc& __a) +basic_string cpp_src/basic_string.tcc /^ basic_string(const basic_string& __str)$/;" f class:std::basic_string signature:(const basic_string& __str) +basic_string cpp_src/basic_string.tcc /^ basic_string(const basic_string& __str, size_type __pos, size_type __n)$/;" f class:std::basic_string signature:(const basic_string& __str, size_type __pos, size_type __n) +basic_string cpp_src/basic_string.tcc /^ basic_string(const basic_string& __str, size_type __pos,$/;" f class:std::basic_string signature:(const basic_string& __str, size_type __pos, size_type __n, const _Alloc& __a) +basic_string cpp_src/basic_string.tcc /^ basic_string(size_type __n, _CharT __c, const _Alloc& __a)$/;" f class:std::basic_string signature:(size_type __n, _CharT __c, const _Alloc& __a) +basic_stringbuf cpp_src/sstream /^ basic_stringbuf(const __string_type& __str,$/;" f class:std::basic_stringbuf access:public signature:(const __string_type& __str, ios_base::openmode __mode = ios_base::in | ios_base::out) +basic_stringbuf cpp_src/sstream /^ basic_stringbuf(ios_base::openmode __mode = ios_base::in | ios_base::out)$/;" f class:std::basic_stringbuf access:public signature:(ios_base::openmode __mode = ios_base::in | ios_base::out) +basic_stringbuf cpp_src/sstream /^ class basic_stringbuf : public basic_streambuf<_CharT, _Traits>$/;" c namespace:std file: inherits:basic_streambuf +basic_stringstream cpp_src/sstream /^ basic_stringstream(const __string_type& __str,$/;" f class:std::basic_stringstream access:public signature:(const __string_type& __str, ios_base::openmode __m = ios_base::out | ios_base::in) +basic_stringstream cpp_src/sstream /^ basic_stringstream(ios_base::openmode __m = ios_base::out | ios_base::in)$/;" f class:std::basic_stringstream access:public signature:(ios_base::openmode __m = ios_base::out | ios_base::in) +basic_stringstream cpp_src/sstream /^ class basic_stringstream : public basic_iostream<_CharT, _Traits>$/;" c namespace:std file: inherits:basic_iostream +before cpp_src/typeinfo /^ bool before(const type_info& __arg) const$/;" f class:std::type_info access:public signature:(const type_info& __arg) const +before cpp_src/typeinfo /^ bool before(const type_info& __arg) const;$/;" p class:std::type_info file: access:public signature:(const type_info& __arg) const +beg cpp_src/ios_base.h /^ static const seekdir beg = _S_beg;$/;" m class:std::ios_base access:public +begin cpp_src/basic_string.h /^ begin() const$/;" f class:std::basic_string access:public signature:() const +begin cpp_src/basic_string.h /^ begin()$/;" f class:std::basic_string access:public signature:() +begin cpp_src/stl_bvector.h /^ begin() const$/;" f class:std::vector access:public signature:() const +begin cpp_src/stl_bvector.h /^ begin()$/;" f class:std::vector access:public signature:() +begin cpp_src/stl_deque.h /^ begin() const$/;" f class:std::deque access:public signature:() const +begin cpp_src/stl_deque.h /^ begin()$/;" f class:std::deque access:public signature:() +begin cpp_src/stl_list.h /^ begin() const$/;" f class:std::list access:public signature:() const +begin cpp_src/stl_list.h /^ begin()$/;" f class:std::list access:public signature:() +begin cpp_src/stl_map.h /^ begin() const$/;" f class:std::map access:public signature:() const +begin cpp_src/stl_map.h /^ begin()$/;" f class:std::map access:public signature:() +begin cpp_src/stl_multimap.h /^ begin() const$/;" f class:std::multimap access:public signature:() const +begin cpp_src/stl_multimap.h /^ begin()$/;" f class:std::multimap access:public signature:() +begin cpp_src/stl_multiset.h /^ begin() const$/;" f class:std::multiset access:public signature:() const +begin cpp_src/stl_set.h /^ begin() const$/;" f class:std::set access:public signature:() const +begin cpp_src/stl_tempbuf.h /^ begin()$/;" f class:std::_Temporary_buffer access:public signature:() +begin cpp_src/stl_tree.h /^ begin() const$/;" f class:std::_Rb_tree access:public signature:() const +begin cpp_src/stl_tree.h /^ begin()$/;" f class:std::_Rb_tree access:public signature:() +begin cpp_src/stl_vector.h /^ begin() const$/;" f class:std::vector access:public signature:() const +begin cpp_src/stl_vector.h /^ begin()$/;" f class:std::vector access:public signature:() +begin cpp_src/valarray_array.h /^ _Tp* begin() const;$/;" p struct:std::_Array access:public signature:() const +begin cpp_src/valarray_array.h /^ _Array<_Tp>::begin () const$/;" f class:std::_Array signature:() const +bidirectional_iterator_tag cpp_src/stl_iterator_base_types.h /^ struct bidirectional_iterator_tag : public forward_iterator_tag {};$/;" s namespace:std inherits:forward_iterator_tag +binary cpp_src/ios_base.h /^ static const openmode binary = _S_bin;$/;" m class:std::ios_base access:public +binary_function cpp_src/stl_function.h /^ struct binary_function$/;" s namespace:std +binary_negate cpp_src/stl_function.h /^ binary_negate(const _Predicate& __x)$/;" f class:std::binary_negate access:public signature:(const _Predicate& __x) +binary_negate cpp_src/stl_function.h /^ class binary_negate$/;" c namespace:std inherits:binary_function +binary_search cpp_src/stl_algo.h /^ binary_search(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val) +binary_search cpp_src/stl_algo.h /^ binary_search(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val, _Compare __comp) +bind1st cpp_src/stl_function.h /^ bind1st(const _Operation& __fn, const _Tp& __x)$/;" f namespace:std signature:(const _Operation& __fn, const _Tp& __x) +bind2nd cpp_src/stl_function.h /^ bind2nd(const _Operation& __fn, const _Tp& __x)$/;" f namespace:std signature:(const _Operation& __fn, const _Tp& __x) +binder1st cpp_src/stl_function.h /^ binder1st(const _Operation& __x,$/;" f class:std::binder1st access:public signature:(const _Operation& __x, const typename _Operation::first_argument_type& __y) +binder1st cpp_src/stl_function.h /^ class binder1st$/;" c namespace:std inherits:unary_function +binder2nd cpp_src/stl_function.h /^ binder2nd(const _Operation& __x,$/;" f class:std::binder2nd access:public signature:(const _Operation& __x, const typename _Operation::second_argument_type& __y) +binder2nd cpp_src/stl_function.h /^ class binder2nd$/;" c namespace:std inherits:unary_function +bitset cpp_src/bitset /^ bitset(const std::basic_string<_CharT, _Traits, _Alloc>& __s,$/;" f class:std::bitset access:public signature:(const std::basic_string<_CharT, _Traits, _Alloc>& __s, size_t __position = 0) +bitset cpp_src/bitset /^ bitset(const std::basic_string<_CharT, _Traits, _Alloc>& __s,$/;" f class:std::bitset access:public signature:(const std::basic_string<_CharT, _Traits, _Alloc>& __s, size_t __position, size_t __n) +bitset cpp_src/bitset /^ bitset()$/;" f class:std::bitset access:public signature:() +bitset cpp_src/bitset /^ bitset(unsigned long __val)$/;" f class:std::bitset access:public signature:(unsigned long __val) +bitset cpp_src/bitset /^ class bitset$/;" c namespace:std file: inherits:_Base_bitset +boolalpha cpp_src/ios_base.h /^ static const fmtflags boolalpha = _S_boolalpha;$/;" m class:std::ios_base access:public +boolalpha cpp_src/ios_base.h /^ boolalpha(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +btowc cpp_src/cwchar 77;" d file: +c cpp_src/stl_queue.h /^ _Sequence c;$/;" m class:std::priority_queue access:protected +c cpp_src/stl_queue.h /^ _Sequence c;$/;" m class:std::queue access:protected +c cpp_src/stl_stack.h /^ _Sequence c;$/;" m class:std::stack access:protected +c_str cpp_src/basic_string.h /^ c_str() const$/;" f class:std::basic_string access:public signature:() const +capacity cpp_src/basic_string.h /^ capacity() const$/;" f class:std::basic_string access:public signature:() const +capacity cpp_src/stl_bvector.h /^ capacity() const$/;" f class:std::vector access:public signature:() const +capacity cpp_src/stl_vector.h /^ capacity() const$/;" f class:std::vector access:public signature:() const +catalog cpp_src/locale_facets.h /^ typedef int catalog;$/;" t struct:std::messages_base access:public +catch cpp_src/exception_defines.h 44;" d +category cpp_src/locale_classes.h /^ typedef int category;$/;" t class:std::locale access:public +ceil cpp_src/cmath /^ ceil(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +ceil cpp_src/cmath /^ ceil(float __x)$/;" f namespace:std signature:(float __x) +ceil cpp_src/cmath /^ ceil(long double __x)$/;" f namespace:std signature:(long double __x) +ceil cpp_src/cmath 63;" d file: +cerr cpp_src/iostream /^ static ostream cerr; \/\/\/< Linked to standard error (unbuffered)$/;" m namespace:std file: +char_traits cpp_src/char_traits.h /^ struct char_traits$/;" s +char_traits::assign cpp_src/char_traits.h /^ assign(char_type& __c1, const char_type& __c2)$/;" f struct:char_traits access:public signature:(char_type& __c1, const char_type& __c2) +char_traits::assign cpp_src/char_traits.h /^ assign(char_type* __s, std::size_t __n, char_type __a);$/;" p struct:char_traits access:public signature:(char_type* __s, std::size_t __n, char_type __a) +char_traits::assign cpp_src/char_traits.h /^ assign(char_type* __s, std::size_t __n, char_type __a)$/;" f class:char_traits signature:(char_type* __s, std::size_t __n, char_type __a) +char_traits::char_type cpp_src/char_traits.h /^ typedef _CharT char_type;$/;" t struct:char_traits access:public +char_traits::compare cpp_src/char_traits.h /^ compare(const char_type* __s1, const char_type* __s2, std::size_t __n);$/;" p struct:char_traits access:public signature:(const char_type* __s1, const char_type* __s2, std::size_t __n) +char_traits::compare cpp_src/char_traits.h /^ compare(const char_type* __s1, const char_type* __s2, std::size_t __n)$/;" f class:char_traits signature:(const char_type* __s1, const char_type* __s2, std::size_t __n) +char_traits::copy cpp_src/char_traits.h /^ copy(char_type* __s1, const char_type* __s2, std::size_t __n);$/;" p struct:char_traits access:public signature:(char_type* __s1, const char_type* __s2, std::size_t __n) +char_traits::copy cpp_src/char_traits.h /^ copy(char_type* __s1, const char_type* __s2, std::size_t __n)$/;" f class:char_traits signature:(char_type* __s1, const char_type* __s2, std::size_t __n) +char_traits::eof cpp_src/char_traits.h /^ eof()$/;" f struct:char_traits access:public signature:() +char_traits::eq cpp_src/char_traits.h /^ eq(const char_type& __c1, const char_type& __c2)$/;" f struct:char_traits access:public signature:(const char_type& __c1, const char_type& __c2) +char_traits::eq_int_type cpp_src/char_traits.h /^ eq_int_type(const int_type& __c1, const int_type& __c2)$/;" f struct:char_traits access:public signature:(const int_type& __c1, const int_type& __c2) +char_traits::find cpp_src/char_traits.h /^ find(const char_type* __s, std::size_t __n, const char_type& __a);$/;" p struct:char_traits access:public signature:(const char_type* __s, std::size_t __n, const char_type& __a) +char_traits::find cpp_src/char_traits.h /^ find(const char_type* __s, std::size_t __n, const char_type& __a)$/;" f class:char_traits signature:(const char_type* __s, std::size_t __n, const char_type& __a) +char_traits::int_type cpp_src/char_traits.h /^ typedef typename _Char_types<_CharT>::int_type int_type;$/;" t struct:char_traits access:public +char_traits::length cpp_src/char_traits.h /^ length(const char_type* __s);$/;" p struct:char_traits access:public signature:(const char_type* __s) +char_traits::length cpp_src/char_traits.h /^ length(const char_type* __p)$/;" f class:char_traits signature:(const char_type* __p) +char_traits::lt cpp_src/char_traits.h /^ lt(const char_type& __c1, const char_type& __c2)$/;" f struct:char_traits access:public signature:(const char_type& __c1, const char_type& __c2) +char_traits::move cpp_src/char_traits.h /^ move(char_type* __s1, const char_type* __s2, std::size_t __n);$/;" p struct:char_traits access:public signature:(char_type* __s1, const char_type* __s2, std::size_t __n) +char_traits::move cpp_src/char_traits.h /^ move(char_type* __s1, const char_type* __s2, std::size_t __n)$/;" f class:char_traits signature:(char_type* __s1, const char_type* __s2, std::size_t __n) +char_traits::not_eof cpp_src/char_traits.h /^ not_eof(const int_type& __c)$/;" f struct:char_traits access:public signature:(const int_type& __c) +char_traits::off_type cpp_src/char_traits.h /^ typedef typename _Char_types<_CharT>::off_type off_type;$/;" t struct:char_traits access:public +char_traits::pos_type cpp_src/char_traits.h /^ typedef typename _Char_types<_CharT>::pos_type pos_type;$/;" t struct:char_traits access:public +char_traits::state_type cpp_src/char_traits.h /^ typedef typename _Char_types<_CharT>::state_type state_type;$/;" t struct:char_traits access:public +char_traits::to_char_type cpp_src/char_traits.h /^ to_char_type(const int_type& __c)$/;" f struct:char_traits access:public signature:(const int_type& __c) +char_traits::to_int_type cpp_src/char_traits.h /^ to_int_type(const char_type& __c)$/;" f struct:char_traits access:public signature:(const char_type& __c) +char_type cpp_src/basic_ios.h /^ typedef _CharT char_type;$/;" t class:std::basic_ios access:public +char_type cpp_src/char_traits.h /^ typedef _CharT char_type;$/;" t struct:char_traits access:public +char_type cpp_src/fstream /^ typedef _CharT char_type;$/;" t class:std::basic_fstream file: access:public +char_type cpp_src/fstream /^ typedef _CharT char_type;$/;" t class:std::basic_ifstream file: access:public +char_type cpp_src/fstream /^ typedef _CharT char_type;$/;" t class:std::basic_ofstream file: access:public +char_type cpp_src/fstream /^ typedef _CharT char_type;$/;" t class:std::basic_filebuf file: access:public +char_type cpp_src/istream /^ typedef _CharT char_type;$/;" t class:std::basic_iostream file: access:public +char_type cpp_src/istream /^ typedef _CharT char_type;$/;" t class:std::basic_istream file: access:public +char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::collate access:public +char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::ctype access:public +char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::messages access:public +char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::messages_byname access:public +char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::money_get access:public +char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::money_put access:public +char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::moneypunct access:public +char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::moneypunct_byname access:public +char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::num_get access:public +char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::numpunct access:public +char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::numpunct_byname access:public +char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::time_get access:public +char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::time_get_byname access:public +char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::time_put access:public +char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::time_put_byname access:public +char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::ctype_byname access:public +char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::num_put access:public +char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::collate_byname access:public +char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::__ctype_abstract_base access:public +char_type cpp_src/locale_facets.h /^ typedef char char_type;$/;" t class:std::ctype access:public +char_type cpp_src/locale_facets.h /^ typedef wchar_t char_type;$/;" t class:std::ctype access:public +char_type cpp_src/ostream /^ typedef _CharT char_type;$/;" t class:std::basic_ostream file: access:public +char_type cpp_src/sstream /^ typedef _CharT char_type;$/;" t class:std::basic_istringstream file: access:public +char_type cpp_src/sstream /^ typedef _CharT char_type;$/;" t class:std::basic_ostringstream file: access:public +char_type cpp_src/sstream /^ typedef _CharT char_type;$/;" t class:std::basic_stringbuf file: access:public +char_type cpp_src/sstream /^ typedef _CharT char_type;$/;" t class:std::basic_stringstream file: access:public +char_type cpp_src/stream_iterator.h /^ typedef _CharT char_type;$/;" t class:std::istream_iterator access:public +char_type cpp_src/stream_iterator.h /^ typedef _CharT char_type;$/;" t class:std::ostream_iterator access:public +char_type cpp_src/streambuf /^ typedef _CharT char_type;$/;" t class:std::basic_streambuf file: access:public +char_type cpp_src/streambuf_iterator.h /^ typedef _CharT char_type;$/;" t class:std::istreambuf_iterator access:public +char_type cpp_src/streambuf_iterator.h /^ typedef _CharT char_type;$/;" t class:std::ostreambuf_iterator access:public +cin cpp_src/iostream /^ static istream cin; \/\/\/< Linked to standard input$/;" m namespace:std file: +classic cpp_src/locale_classes.h /^ classic();$/;" p class:std::locale access:public signature:() +classic_table cpp_src/locale_facets.h /^ classic_table() throw();$/;" p class:std::ctype access:protected signature:() +clear cpp_src/basic_ios.h /^ clear(iostate __state = goodbit);$/;" p class:std::basic_ios access:public signature:(iostate __state = goodbit) +clear cpp_src/basic_ios.tcc /^ basic_ios<_CharT, _Traits>::clear(iostate __state)$/;" f class:std::basic_ios signature:(iostate __state) +clear cpp_src/basic_string.h /^ clear()$/;" f class:std::basic_string access:public signature:() +clear cpp_src/stl_bvector.h /^ clear()$/;" f class:std::vector access:public signature:() +clear cpp_src/stl_deque.h /^ clear()$/;" f class:std::deque access:public signature:() +clear cpp_src/stl_list.h /^ clear()$/;" f class:std::list access:public signature:() +clear cpp_src/stl_map.h /^ clear()$/;" f class:std::map access:public signature:() +clear cpp_src/stl_multimap.h /^ clear()$/;" f class:std::multimap access:public signature:() +clear cpp_src/stl_multiset.h /^ clear()$/;" f class:std::multiset access:public signature:() +clear cpp_src/stl_set.h /^ clear()$/;" f class:std::set access:public signature:() +clear cpp_src/stl_tree.h /^ clear()$/;" f class:std::_Rb_tree access:public signature:() +clear cpp_src/stl_vector.h /^ clear()$/;" f class:std::vector access:public signature:() +clearerr cpp_src/cstdio 56;" d file: +clock cpp_src/ctime 54;" d file: +clog cpp_src/iostream /^ static ostream clog; \/\/\/< Linked to standard error (buffered)$/;" m namespace:std file: +close cpp_src/fstream /^ close() throw();$/;" p class:std::basic_filebuf file: access:public signature:() +close cpp_src/fstream /^ close()$/;" f class:std::basic_fstream access:public signature:() +close cpp_src/fstream /^ close()$/;" f class:std::basic_ifstream access:public signature:() +close cpp_src/fstream /^ close()$/;" f class:std::basic_ofstream access:public signature:() +close cpp_src/fstream.tcc /^ close() throw()$/;" f class:std::basic_filebuf signature:() +close cpp_src/locale_facets.h /^ close(catalog __c) const$/;" f class:std::messages access:public signature:(catalog __c) const +codecvt cpp_src/codecvt.h /^ codecvt(__c_locale __cloc, size_t __refs = 0);$/;" p class:std::codecvt access:public signature:(__c_locale __cloc, size_t __refs = 0) +codecvt cpp_src/codecvt.h /^ codecvt(size_t __refs = 0)$/;" f class:std::codecvt access:public signature:(size_t __refs = 0) +codecvt cpp_src/codecvt.h /^ codecvt(size_t __refs = 0);$/;" p class:std::codecvt access:public signature:(size_t __refs = 0) +codecvt cpp_src/codecvt.h /^ class codecvt$/;" c namespace:std inherits:__codecvt_abstract_base +codecvt cpp_src/codecvt.h /^ class codecvt$/;" c namespace:std inherits:__codecvt_abstract_base +codecvt cpp_src/codecvt.h /^ class codecvt$/;" c namespace:std inherits:__codecvt_abstract_base +codecvt_base cpp_src/codecvt.h /^ class codecvt_base$/;" c namespace:std +codecvt_byname cpp_src/codecvt.h /^ codecvt_byname(const char* __s, size_t __refs = 0)$/;" f class:std::codecvt_byname access:public signature:(const char* __s, size_t __refs = 0) +codecvt_byname cpp_src/codecvt.h /^ class codecvt_byname : public codecvt<_InternT, _ExternT, _StateT>$/;" c namespace:std inherits:codecvt +collate cpp_src/locale_classes.h /^ static const category collate = 1L << 2;$/;" m class:std::locale access:public +collate cpp_src/locale_facets.h /^ collate(__c_locale __cloc, size_t __refs = 0)$/;" f class:std::collate access:public signature:(__c_locale __cloc, size_t __refs = 0) +collate cpp_src/locale_facets.h /^ collate(size_t __refs = 0)$/;" f class:std::collate access:public signature:(size_t __refs = 0) +collate cpp_src/locale_facets.h /^ class collate : public locale::facet$/;" c namespace:std inherits:locale::facet +collate_byname cpp_src/locale_facets.h /^ collate_byname(const char* __s, size_t __refs = 0)$/;" f class:std::collate_byname access:public signature:(const char* __s, size_t __refs = 0) +collate_byname cpp_src/locale_facets.h /^ class collate_byname : public collate<_CharT>$/;" c namespace:std inherits:collate +combine cpp_src/locale_classes.h /^ combine(const locale& __other) const;$/;" p class:std::locale access:public signature:(const locale& __other) const +combine cpp_src/locale_facets.tcc /^ locale::combine(const locale& __other) const$/;" f class:std::locale signature:(const locale& __other) const +comp cpp_src/stl_map.h /^ _Compare comp;$/;" m class:std::map::value_compare access:protected +comp cpp_src/stl_multimap.h /^ _Compare comp;$/;" m class:std::multimap::value_compare access:protected +comp cpp_src/stl_queue.h /^ _Compare comp;$/;" m class:std::priority_queue access:protected +compare cpp_src/basic_string.h /^ compare(const _CharT* __s) const;$/;" p class:std::basic_string access:public signature:(const _CharT* __s) const +compare cpp_src/basic_string.h /^ compare(const basic_string& __str) const$/;" f class:std::basic_string access:public signature:(const basic_string& __str) const +compare cpp_src/basic_string.h /^ compare(size_type __pos, size_type __n, const basic_string& __str) const;$/;" p class:std::basic_string access:public signature:(size_type __pos, size_type __n, const basic_string& __str) const +compare cpp_src/basic_string.h /^ compare(size_type __pos, size_type __n1, const _CharT* __s) const;$/;" p class:std::basic_string access:public signature:(size_type __pos, size_type __n1, const _CharT* __s) const +compare cpp_src/basic_string.h /^ compare(size_type __pos, size_type __n1, const _CharT* __s,$/;" p class:std::basic_string access:public signature:(size_type __pos, size_type __n1, const _CharT* __s, size_type __n2) const +compare cpp_src/basic_string.h /^ compare(size_type __pos1, size_type __n1, const basic_string& __str,$/;" p class:std::basic_string access:public signature:(size_type __pos1, size_type __n1, const basic_string& __str, size_type __pos2, size_type __n2) const +compare cpp_src/basic_string.tcc /^ compare(const _CharT* __s) const$/;" f class:std::basic_string signature:(const _CharT* __s) const +compare cpp_src/basic_string.tcc /^ compare(size_type __pos, size_type __n, const basic_string& __str) const$/;" f class:std::basic_string signature:(size_type __pos, size_type __n, const basic_string& __str) const +compare cpp_src/basic_string.tcc /^ compare(size_type __pos, size_type __n1, const _CharT* __s) const$/;" f class:std::basic_string signature:(size_type __pos, size_type __n1, const _CharT* __s) const +compare cpp_src/basic_string.tcc /^ compare(size_type __pos, size_type __n1, const _CharT* __s,$/;" f class:std::basic_string signature:(size_type __pos, size_type __n1, const _CharT* __s, size_type __n2) const +compare cpp_src/basic_string.tcc /^ compare(size_type __pos1, size_type __n1, const basic_string& __str,$/;" f class:std::basic_string signature:(size_type __pos1, size_type __n1, const basic_string& __str, size_type __pos2, size_type __n2) const +compare cpp_src/char_traits.h /^ compare(const char_type* __s1, const char_type* __s2, std::size_t __n);$/;" p struct:char_traits access:public signature:(const char_type* __s1, const char_type* __s2, std::size_t __n) +compare cpp_src/char_traits.h /^ compare(const char_type* __s1, const char_type* __s2, std::size_t __n)$/;" f class:char_traits signature:(const char_type* __s1, const char_type* __s2, std::size_t __n) +compare cpp_src/locale_facets.h /^ compare(const _CharT* __lo1, const _CharT* __hi1,$/;" f class:std::collate access:public signature:(const _CharT* __lo1, const _CharT* __hi1, const _CharT* __lo2, const _CharT* __hi2) const +complex cpp_src/complex /^ complex(const complex<_Up>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Up>&) +complex cpp_src/complex /^ complex(_ComplexT __z) : _M_value(__z) { }$/;" f struct:std::complex access:public signature:(_ComplexT __z) +complex cpp_src/complex /^ complex(const _Tp& = _Tp(), const _Tp & = _Tp());$/;" p struct:std::complex file: access:public signature:(const _Tp& = _Tp(), const _Tp & = _Tp()) +complex cpp_src/complex /^ complex(const complex&);$/;" p struct:std::complex file: access:public signature:(const complex&) +complex cpp_src/complex /^ complex(const complex&);$/;" p struct:std::complex file: access:public signature:(const complex&) +complex cpp_src/complex /^ complex(double = 0.0, double = 0.0);$/;" p struct:std::complex file: access:public signature:(double = 0.0, double = 0.0) +complex cpp_src/complex /^ complex(float = 0.0f, float = 0.0f);$/;" p struct:std::complex file: access:public signature:(float = 0.0f, float = 0.0f) +complex cpp_src/complex /^ complex(long double = 0.0L, long double = 0.0L);$/;" p struct:std::complex file: access:public signature:(long double = 0.0L, long double = 0.0L) +complex cpp_src/complex /^ explicit complex(const complex&);$/;" p struct:std::complex file: access:public signature:(const complex&) +complex cpp_src/complex /^ explicit complex(const complex&);$/;" p struct:std::complex file: access:public signature:(const complex&) +complex cpp_src/complex /^ complex<_Tp>::complex(const _Tp& __r, const _Tp& __i)$/;" f class:std::complex signature:(const _Tp& __r, const _Tp& __i) +complex cpp_src/complex /^ complex<_Tp>::complex(const complex<_Up>& __z)$/;" f class:std::complex signature:(const complex<_Up>& __z) +complex cpp_src/complex /^ struct complex$/;" s namespace:std file: +complex cpp_src/complex /^ struct complex$/;" s namespace:std file: +complex cpp_src/complex /^ struct complex$/;" s namespace:std file: +complex cpp_src/complex /^ struct complex$/;" s namespace:std file: +complex cpp_src/complex /^ complex::complex(const complex& __z) $/;" f class:std::complex signature:(const complex& __z) +complex cpp_src/complex /^ complex::complex(const complex& __z)$/;" f class:std::complex signature:(const complex& __z) +complex cpp_src/complex /^ complex::complex(double __r, double __i)$/;" f class:std::complex signature:(double __r, double __i) +complex cpp_src/complex /^ complex::complex(const complex& __z)$/;" f class:std::complex signature:(const complex& __z) +complex cpp_src/complex /^ complex::complex(const complex& __z)$/;" f class:std::complex signature:(const complex& __z) +complex cpp_src/complex /^ complex::complex(float r, float i)$/;" f class:std::complex signature:(float r, float i) +complex cpp_src/complex /^ complex::complex(const complex& __z)$/;" f class:std::complex signature:(const complex& __z) +complex cpp_src/complex /^ complex::complex(const complex& __z)$/;" f class:std::complex signature:(const complex& __z) +complex cpp_src/complex /^ complex::complex(long double __r, long double __i)$/;" f class:std::complex signature:(long double __r, long double __i) +conj cpp_src/complex /^ conj(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +conj cpp_src/complex /^ template complex<_Tp> conj(const complex<_Tp>&);$/;" p namespace:std file: signature:(const complex<_Tp>&) +const_iterator cpp_src/basic_string.h /^ const_iterator;$/;" t class:std::basic_string access:public +const_iterator cpp_src/stl_bvector.h /^ typedef _Bit_const_iterator const_iterator;$/;" t class:std::vector access:public +const_iterator cpp_src/stl_bvector.h /^ typedef _Bit_const_iterator const_iterator;$/;" t struct:std::_Bit_const_iterator access:public +const_iterator cpp_src/stl_deque.h /^ typedef _Deque_iterator<_Tp, const _Tp&, const _Tp*> const_iterator;$/;" t class:std::_Deque_base access:public +const_iterator cpp_src/stl_deque.h /^ typedef _Deque_iterator<_Tp, const _Tp&, const _Tp*> const_iterator;$/;" t struct:std::_Deque_iterator access:public +const_iterator cpp_src/stl_deque.h /^ typedef typename _Base::const_iterator const_iterator;$/;" t class:std::deque access:public +const_iterator cpp_src/stl_list.h /^ typedef _List_const_iterator<_Tp> const_iterator;$/;" t class:std::list access:public +const_iterator cpp_src/stl_map.h /^ typedef typename _Rep_type::const_iterator const_iterator;$/;" t class:std::map access:public +const_iterator cpp_src/stl_multimap.h /^ typedef typename _Rep_type::const_iterator const_iterator;$/;" t class:std::multimap access:public +const_iterator cpp_src/stl_multiset.h /^ typedef typename _Rep_type::const_iterator const_iterator;$/;" t class:std::multiset access:public +const_iterator cpp_src/stl_set.h /^ typedef typename _Rep_type::const_iterator const_iterator;$/;" t class:std::set access:public +const_iterator cpp_src/stl_tree.h /^ typedef _Rb_tree_const_iterator const_iterator;$/;" t class:std::_Rb_tree access:public +const_iterator cpp_src/stl_vector.h /^ const_iterator;$/;" t class:std::vector access:public +const_mem_fun1_ref_t cpp_src/stl_function.h /^ class const_mem_fun1_ref_t : public binary_function<_Tp, _Arg, _Ret>$/;" c namespace:std inherits:binary_function +const_mem_fun1_t cpp_src/stl_function.h /^ class const_mem_fun1_t : public binary_function$/;" c namespace:std inherits:binary_function +const_mem_fun_ref_t cpp_src/stl_function.h /^ class const_mem_fun_ref_t : public unary_function<_Tp, _Ret>$/;" c namespace:std inherits:unary_function +const_mem_fun_t cpp_src/stl_function.h /^ class const_mem_fun_t : public unary_function$/;" c namespace:std inherits:unary_function +const_pointer cpp_src/allocator.h /^ typedef const _Tp* const_pointer;$/;" t class:std::allocator access:public +const_pointer cpp_src/allocator.h /^ typedef const void* const_pointer;$/;" t class:std::allocator access:public +const_pointer cpp_src/basic_string.h /^ typedef typename _CharT_alloc_type::const_pointer const_pointer;$/;" t class:std::basic_string access:public +const_pointer cpp_src/stl_bvector.h /^ typedef const bool* const_pointer;$/;" t class:std::vector access:public +const_pointer cpp_src/stl_deque.h /^ typedef typename _Tp_alloc_type::const_pointer const_pointer;$/;" t class:std::deque access:public +const_pointer cpp_src/stl_list.h /^ typedef typename _Tp_alloc_type::const_pointer const_pointer;$/;" t class:std::list access:public +const_pointer cpp_src/stl_map.h /^ typedef typename _Pair_alloc_type::const_pointer const_pointer;$/;" t class:std::map access:public +const_pointer cpp_src/stl_multimap.h /^ typedef typename _Pair_alloc_type::const_pointer const_pointer;$/;" t class:std::multimap access:public +const_pointer cpp_src/stl_multiset.h /^ typedef typename _Key_alloc_type::const_pointer const_pointer;$/;" t class:std::multiset access:public +const_pointer cpp_src/stl_set.h /^ typedef typename _Key_alloc_type::const_pointer const_pointer;$/;" t class:std::set access:public +const_pointer cpp_src/stl_tree.h /^ typedef const value_type* const_pointer;$/;" t class:std::_Rb_tree access:public +const_pointer cpp_src/stl_vector.h /^ typedef typename _Tp_alloc_type::const_pointer const_pointer;$/;" t class:std::vector access:public +const_reference cpp_src/allocator.h /^ typedef const _Tp& const_reference;$/;" t class:std::allocator access:public +const_reference cpp_src/basic_string.h /^ typedef typename _CharT_alloc_type::const_reference const_reference;$/;" t class:std::basic_string access:public +const_reference cpp_src/stl_bvector.h /^ typedef bool const_reference;$/;" t class:std::vector access:public +const_reference cpp_src/stl_bvector.h /^ typedef bool const_reference;$/;" t struct:std::_Bit_const_iterator access:public +const_reference cpp_src/stl_deque.h /^ typedef typename _Tp_alloc_type::const_reference const_reference;$/;" t class:std::deque access:public +const_reference cpp_src/stl_list.h /^ typedef typename _Tp_alloc_type::const_reference const_reference;$/;" t class:std::list access:public +const_reference cpp_src/stl_map.h /^ typedef typename _Pair_alloc_type::const_reference const_reference;$/;" t class:std::map access:public +const_reference cpp_src/stl_multimap.h /^ typedef typename _Pair_alloc_type::const_reference const_reference;$/;" t class:std::multimap access:public +const_reference cpp_src/stl_multiset.h /^ typedef typename _Key_alloc_type::const_reference const_reference;$/;" t class:std::multiset access:public +const_reference cpp_src/stl_queue.h /^ typedef typename _Sequence::const_reference const_reference;$/;" t class:std::priority_queue access:public +const_reference cpp_src/stl_queue.h /^ typedef typename _Sequence::const_reference const_reference;$/;" t class:std::queue access:public +const_reference cpp_src/stl_set.h /^ typedef typename _Key_alloc_type::const_reference const_reference;$/;" t class:std::set access:public +const_reference cpp_src/stl_stack.h /^ typedef typename _Sequence::const_reference const_reference;$/;" t class:std::stack access:public +const_reference cpp_src/stl_tree.h /^ typedef const value_type& const_reference;$/;" t class:std::_Rb_tree access:public +const_reference cpp_src/stl_vector.h /^ typedef typename _Tp_alloc_type::const_reference const_reference;$/;" t class:std::vector access:public +const_reverse_iterator cpp_src/basic_string.h /^ typedef std::reverse_iterator const_reverse_iterator;$/;" t class:std::basic_string access:public +const_reverse_iterator cpp_src/stl_bvector.h /^ typedef std::reverse_iterator const_reverse_iterator;$/;" t class:std::vector access:public +const_reverse_iterator cpp_src/stl_deque.h /^ typedef std::reverse_iterator const_reverse_iterator;$/;" t class:std::deque access:public +const_reverse_iterator cpp_src/stl_list.h /^ typedef std::reverse_iterator const_reverse_iterator;$/;" t class:std::list access:public +const_reverse_iterator cpp_src/stl_map.h /^ typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator;$/;" t class:std::map access:public +const_reverse_iterator cpp_src/stl_multimap.h /^ typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator;$/;" t class:std::multimap access:public +const_reverse_iterator cpp_src/stl_multiset.h /^ typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator;$/;" t class:std::multiset access:public +const_reverse_iterator cpp_src/stl_set.h /^ typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator;$/;" t class:std::set access:public +const_reverse_iterator cpp_src/stl_tree.h /^ typedef std::reverse_iterator const_reverse_iterator;$/;" t class:std::_Rb_tree access:public +const_reverse_iterator cpp_src/stl_vector.h /^ typedef std::reverse_iterator const_reverse_iterator;$/;" t class:std::vector access:public +container cpp_src/stl_iterator.h /^ _Container* container;$/;" m class:std::back_insert_iterator access:protected +container cpp_src/stl_iterator.h /^ _Container* container;$/;" m class:std::front_insert_iterator access:protected +container cpp_src/stl_iterator.h /^ _Container* container;$/;" m class:std::insert_iterator access:protected +container_type cpp_src/stl_iterator.h /^ typedef _Container container_type;$/;" t class:std::back_insert_iterator access:public +container_type cpp_src/stl_iterator.h /^ typedef _Container container_type;$/;" t class:std::front_insert_iterator access:public +container_type cpp_src/stl_iterator.h /^ typedef _Container container_type;$/;" t class:std::insert_iterator access:public +container_type cpp_src/stl_queue.h /^ typedef _Sequence container_type;$/;" t class:std::priority_queue access:public +container_type cpp_src/stl_queue.h /^ typedef _Sequence container_type;$/;" t class:std::queue access:public +container_type cpp_src/stl_stack.h /^ typedef _Sequence container_type;$/;" t class:std::stack access:public +copy cpp_src/basic_string.h /^ copy(_CharT* __s, size_type __n, size_type __pos = 0) const;$/;" p class:std::basic_string access:public signature:(_CharT* __s, size_type __n, size_type __pos = 0) const +copy cpp_src/basic_string.tcc /^ copy(_CharT* __s, size_type __n, size_type __pos) const$/;" f class:std::basic_string signature:(_CharT* __s, size_type __n, size_type __pos) const +copy cpp_src/char_traits.h /^ copy(char_type* __s1, const char_type* __s2, std::size_t __n);$/;" p struct:char_traits access:public signature:(char_type* __s1, const char_type* __s2, std::size_t __n) +copy cpp_src/char_traits.h /^ copy(char_type* __s1, const char_type* __s2, std::size_t __n)$/;" f class:char_traits signature:(char_type* __s1, const char_type* __s2, std::size_t __n) +copy cpp_src/stl_algobase.h /^ copy(_II __first, _II __last, _OI __result)$/;" f struct:std::__copy access:public signature:(_II __first, _II __last, _OI __result) +copy cpp_src/stl_algobase.h /^ copy(const _Tp* __first, const _Tp* __last, _Tp* __result)$/;" f struct:std::__copy access:public signature:(const _Tp* __first, const _Tp* __last, _Tp* __result) +copy cpp_src/stl_algobase.h /^ copy(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _OutputIterator __result) +copy cpp_src/stl_algobase.h /^ copy(istreambuf_iterator<_CharT>, istreambuf_iterator<_CharT>,$/;" p namespace:std signature:(istreambuf_iterator<_CharT>, istreambuf_iterator<_CharT>, ostreambuf_iterator<_CharT>) +copy cpp_src/streambuf_iterator.h /^ copy(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>,$/;" p class:std::istreambuf_iterator access:friend signature:(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, ostreambuf_iterator<_CharT2>) +copy cpp_src/streambuf_iterator.h /^ copy(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>,$/;" p class:std::ostreambuf_iterator access:friend signature:(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, ostreambuf_iterator<_CharT2>) +copy cpp_src/streambuf_iterator.h /^ copy(istreambuf_iterator<_CharT> __first,$/;" f namespace:std signature:(istreambuf_iterator<_CharT> __first, istreambuf_iterator<_CharT> __last, ostreambuf_iterator<_CharT> __result) +copy_backward cpp_src/stl_algobase.h /^ copy_backward(_BI1 __first, _BI1 __last, _BI2 __result)$/;" f namespace:std signature:(_BI1 __first, _BI1 __last, _BI2 __result) +copyfmt cpp_src/basic_ios.h /^ copyfmt(const basic_ios& __rhs);$/;" p class:std::basic_ios access:public signature:(const basic_ios& __rhs) +copyfmt cpp_src/basic_ios.tcc /^ basic_ios<_CharT, _Traits>::copyfmt(const basic_ios& __rhs)$/;" f class:std::basic_ios signature:(const basic_ios& __rhs) +copyfmt_event cpp_src/ios_base.h /^ copyfmt_event$/;" e enum:std::ios_base::event +cos cpp_src/cmath /^ cos(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +cos cpp_src/cmath /^ cos(float __x)$/;" f namespace:std signature:(float __x) +cos cpp_src/cmath /^ cos(long double __x)$/;" f namespace:std signature:(long double __x) +cos cpp_src/cmath 64;" d file: +cos cpp_src/complex /^ cos(const complex<_Tp>& __z) { return __complex_cos(__z); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +cos cpp_src/complex /^ cos(const complex<_Tp>& __z) { return __complex_cos(__z.__rep()); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +cos cpp_src/complex /^ template complex<_Tp> cos(const complex<_Tp>&);$/;" p namespace:std file: signature:(const complex<_Tp>&) +cosh cpp_src/cmath /^ cosh(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +cosh cpp_src/cmath /^ cosh(float __x)$/;" f namespace:std signature:(float __x) +cosh cpp_src/cmath /^ cosh(long double __x)$/;" f namespace:std signature:(long double __x) +cosh cpp_src/cmath 65;" d file: +cosh cpp_src/complex /^ cosh(const complex<_Tp>& __z) { return __complex_cosh(__z); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +cosh cpp_src/complex /^ cosh(const complex<_Tp>& __z) { return __complex_cosh(__z.__rep()); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +cosh cpp_src/complex /^ template complex<_Tp> cosh(const complex<_Tp>&);$/;" p namespace:std file: signature:(const complex<_Tp>&) +count cpp_src/bitset /^ count() const$/;" f class:std::bitset access:public signature:() const +count cpp_src/stl_algo.h /^ count(_InputIterator __first, _InputIterator __last, const _Tp& __value)$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, const _Tp& __value) +count cpp_src/stl_map.h /^ count(const key_type& __x) const$/;" f class:std::map access:public signature:(const key_type& __x) const +count cpp_src/stl_multimap.h /^ count(const key_type& __x) const$/;" f class:std::multimap access:public signature:(const key_type& __x) const +count cpp_src/stl_multiset.h /^ count(const key_type& __x) const$/;" f class:std::multiset access:public signature:(const key_type& __x) const +count cpp_src/stl_set.h /^ count(const key_type& __x) const$/;" f class:std::set access:public signature:(const key_type& __x) const +count cpp_src/stl_tree.h /^ count(const key_type& __x) const;$/;" p class:std::_Rb_tree access:public signature:(const key_type& __x) const +count cpp_src/stl_tree.h /^ count(const _Key& __k) const$/;" f class:std::_Rb_tree signature:(const _Key& __k) const +count_if cpp_src/stl_algo.h /^ count_if(_InputIterator __first, _InputIterator __last, _Predicate __pred)$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _Predicate __pred) +cout cpp_src/iostream /^ static ostream cout; \/\/\/< Linked to standard output$/;" m namespace:std file: +cshift cpp_src/valarray /^ valarray<_Tp> cshift(int) const;$/;" p class:std::valarray file: access:public signature:(int) const +cshift cpp_src/valarray /^ valarray<_Tp>::cshift(int __n) const$/;" f class:std::valarray signature:(int __n) const +cshift cpp_src/valarray_after.h /^ valarray cshift(int) const;$/;" p class:std::_Expr access:public signature:(int) const +cshift cpp_src/valarray_after.h /^ _Expr<_Clos, _Tp>::cshift(int __n) const$/;" f class:std::_Expr signature:(int __n) const +ctime cpp_src/ctime 59;" d file: +ctype cpp_src/locale_classes.h /^ static const category ctype = 1L << 0;$/;" m class:std::locale access:public +ctype cpp_src/locale_facets.h /^ ctype(__c_locale __cloc, const mask* __table = 0, bool __del = false,$/;" p class:std::ctype access:public signature:(__c_locale __cloc, const mask* __table = 0, bool __del = false, size_t __refs = 0) +ctype cpp_src/locale_facets.h /^ ctype(__c_locale __cloc, size_t __refs = 0);$/;" p class:std::ctype access:public signature:(__c_locale __cloc, size_t __refs = 0) +ctype cpp_src/locale_facets.h /^ ctype(const mask* __table = 0, bool __del = false, size_t __refs = 0);$/;" p class:std::ctype access:public signature:(const mask* __table = 0, bool __del = false, size_t __refs = 0) +ctype cpp_src/locale_facets.h /^ ctype(size_t __refs = 0) : __ctype_abstract_base<_CharT>(__refs) { }$/;" f class:std::ctype access:public signature:(size_t __refs = 0) +ctype cpp_src/locale_facets.h /^ ctype(size_t __refs = 0);$/;" p class:std::ctype access:public signature:(size_t __refs = 0) +ctype cpp_src/locale_facets.h /^ class ctype : public __ctype_abstract_base<_CharT>$/;" c namespace:std inherits:__ctype_abstract_base +ctype cpp_src/locale_facets.h /^ class ctype : public locale::facet, public ctype_base$/;" c namespace:std inherits:locale::facet,ctype_base +ctype cpp_src/locale_facets.h /^ class ctype : public __ctype_abstract_base$/;" c namespace:std inherits:__ctype_abstract_base +ctype_byname cpp_src/locale_facets.h /^ ctype_byname(const char* __s, size_t __refs = 0);$/;" p class:std::ctype_byname access:public signature:(const char* __s, size_t __refs = 0) +ctype_byname cpp_src/locale_facets.h /^ class ctype_byname : public ctype<_CharT>$/;" c namespace:std inherits:ctype +ctype_byname cpp_src/locale_facets.h /^ ctype_byname::ctype_byname(const char*, size_t refs);$/;" p class:std::ctype_byname signature:(const char*, size_t refs) +ctype_byname cpp_src/locale_facets.h /^ ctype_byname::ctype_byname(const char*, size_t refs);$/;" p class:std::ctype_byname signature:(const char*, size_t refs) +cur cpp_src/ios_base.h /^ static const seekdir cur = _S_cur;$/;" m class:std::ios_base access:public +curr_symbol cpp_src/locale_facets.h /^ curr_symbol() const$/;" f class:std::moneypunct access:public signature:() const +current cpp_src/stl_iterator.h /^ _Iterator current;$/;" m class:std::reverse_iterator access:protected +data cpp_src/basic_string.h /^ data() const$/;" f class:std::basic_string access:public signature:() const +data cpp_src/stl_bvector.h /^ data() { }$/;" f class:std::vector access:public signature:() +data cpp_src/stl_vector.h /^ data() const$/;" f class:std::vector access:public signature:() const +data cpp_src/stl_vector.h /^ data()$/;" f class:std::vector access:public signature:() +date_order cpp_src/locale_facets.h /^ date_order() const$/;" f class:std::time_get access:public signature:() const +dateorder cpp_src/locale_facets.h /^ enum dateorder { no_order, dmy, mdy, ymd, ydm };$/;" g class:std::time_base access:public +dec cpp_src/ios_base.h /^ static const fmtflags dec = _S_dec;$/;" m class:std::ios_base access:public +dec cpp_src/ios_base.h /^ dec(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +decimal_point cpp_src/locale_facets.h /^ decimal_point() const$/;" f class:std::moneypunct access:public signature:() const +decimal_point cpp_src/locale_facets.h /^ decimal_point() const$/;" f class:std::numpunct access:public signature:() const +denorm_absent cpp_src/limits /^ denorm_absent = 0,$/;" e enum:std::float_denorm_style file: +denorm_indeterminate cpp_src/limits /^ denorm_indeterminate = -1,$/;" e enum:std::float_denorm_style file: +denorm_min cpp_src/limits /^ static _Tp denorm_min() throw() { return static_cast<_Tp>(0); }$/;" f struct:std::numeric_limits access:public signature:() +denorm_min cpp_src/limits /^ static bool denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +denorm_min cpp_src/limits /^ static char denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +denorm_min cpp_src/limits /^ static double denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +denorm_min cpp_src/limits /^ static float denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +denorm_min cpp_src/limits /^ static int denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +denorm_min cpp_src/limits /^ static long denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +denorm_min cpp_src/limits /^ static long double denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +denorm_min cpp_src/limits /^ static long long denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +denorm_min cpp_src/limits /^ static short denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +denorm_min cpp_src/limits /^ static signed char denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +denorm_min cpp_src/limits /^ static unsigned char denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +denorm_min cpp_src/limits /^ static unsigned int denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +denorm_min cpp_src/limits /^ static unsigned long denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +denorm_min cpp_src/limits /^ static unsigned long long denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +denorm_min cpp_src/limits /^ static unsigned short denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +denorm_min cpp_src/limits /^ static wchar_t denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +denorm_present cpp_src/limits /^ denorm_present = 1$/;" e enum:std::float_denorm_style file: +deque cpp_src/stl_deque.h /^ deque(_InputIterator __first, _InputIterator __last,$/;" f class:std::deque access:public signature:(_InputIterator __first, _InputIterator __last, const allocator_type& __a = allocator_type()) +deque cpp_src/stl_deque.h /^ deque(const allocator_type& __a = allocator_type())$/;" f class:std::deque access:public signature:(const allocator_type& __a = allocator_type()) +deque cpp_src/stl_deque.h /^ deque(const deque& __x)$/;" f class:std::deque access:public signature:(const deque& __x) +deque cpp_src/stl_deque.h /^ deque(size_type __n, const value_type& __value = value_type(),$/;" f class:std::deque access:public signature:(size_type __n, const value_type& __value = value_type(), const allocator_type& __a = allocator_type()) +deque cpp_src/stl_deque.h /^ class deque : protected _Deque_base<_Tp, _Alloc>$/;" c namespace:std inherits:_Deque_base +difference_type cpp_src/allocator.h /^ typedef ptrdiff_t difference_type;$/;" t class:std::allocator access:public +difference_type cpp_src/allocator.h /^ typedef ptrdiff_t difference_type;$/;" t class:std::allocator access:public +difference_type cpp_src/basic_string.h /^ typedef typename _CharT_alloc_type::difference_type difference_type;$/;" t class:std::basic_string access:public +difference_type cpp_src/stl_bvector.h /^ typedef ptrdiff_t difference_type;$/;" t class:std::vector access:public +difference_type cpp_src/stl_deque.h /^ typedef ptrdiff_t difference_type;$/;" t class:std::deque access:public +difference_type cpp_src/stl_deque.h /^ typedef ptrdiff_t difference_type;$/;" t struct:std::_Deque_iterator access:public +difference_type cpp_src/stl_iterator.h /^ difference_type;$/;" t class:std::reverse_iterator access:public +difference_type cpp_src/stl_iterator.h /^ difference_type;$/;" t class:__normal_iterator access:public +difference_type cpp_src/stl_iterator_base_types.h /^ typedef _Distance difference_type;$/;" t struct:std::iterator access:public +difference_type cpp_src/stl_iterator_base_types.h /^ typedef ptrdiff_t difference_type;$/;" t struct:std::iterator_traits access:public +difference_type cpp_src/stl_iterator_base_types.h /^ typedef typename _Iterator::difference_type difference_type;$/;" t struct:std::iterator_traits access:public +difference_type cpp_src/stl_list.h /^ typedef ptrdiff_t difference_type;$/;" t class:std::list access:public +difference_type cpp_src/stl_list.h /^ typedef ptrdiff_t difference_type;$/;" t struct:std::_List_const_iterator access:public +difference_type cpp_src/stl_list.h /^ typedef ptrdiff_t difference_type;$/;" t struct:std::_List_iterator access:public +difference_type cpp_src/stl_map.h /^ typedef typename _Rep_type::difference_type difference_type;$/;" t class:std::map access:public +difference_type cpp_src/stl_multimap.h /^ typedef typename _Rep_type::difference_type difference_type;$/;" t class:std::multimap access:public +difference_type cpp_src/stl_multiset.h /^ typedef typename _Rep_type::difference_type difference_type;$/;" t class:std::multiset access:public +difference_type cpp_src/stl_set.h /^ typedef typename _Rep_type::difference_type difference_type;$/;" t class:std::set access:public +difference_type cpp_src/stl_tree.h /^ typedef ptrdiff_t difference_type;$/;" t struct:std::_Rb_tree_const_iterator access:public +difference_type cpp_src/stl_tree.h /^ typedef ptrdiff_t difference_type;$/;" t struct:std::_Rb_tree_iterator access:public +difference_type cpp_src/stl_tree.h /^ typedef ptrdiff_t difference_type;$/;" t class:std::_Rb_tree access:public +difference_type cpp_src/stl_vector.h /^ typedef ptrdiff_t difference_type;$/;" t class:std::vector access:public +difftime cpp_src/ctime 55;" d file: +digits cpp_src/limits /^ static const int digits = 1;$/;" m struct:std::numeric_limits file: access:public +digits cpp_src/limits /^ static const int digits = __DBL_MANT_DIG__;$/;" m struct:std::numeric_limits file: access:public +digits cpp_src/limits /^ static const int digits = __FLT_MANT_DIG__;$/;" m struct:std::numeric_limits file: access:public +digits cpp_src/limits /^ static const int digits = __LDBL_MANT_DIG__;$/;" m struct:std::numeric_limits file: access:public +digits cpp_src/limits /^ static const int digits = __glibcxx_digits (char);$/;" m struct:std::numeric_limits file: access:public +digits cpp_src/limits /^ static const int digits = __glibcxx_digits (int);$/;" m struct:std::numeric_limits file: access:public +digits cpp_src/limits /^ static const int digits = __glibcxx_digits (long long);$/;" m struct:std::numeric_limits file: access:public +digits cpp_src/limits /^ static const int digits = __glibcxx_digits (long);$/;" m struct:std::numeric_limits file: access:public +digits cpp_src/limits /^ static const int digits = __glibcxx_digits (short);$/;" m struct:std::numeric_limits file: access:public +digits cpp_src/limits /^ static const int digits = __glibcxx_digits (signed char);$/;" m struct:std::numeric_limits file: access:public +digits cpp_src/limits /^ static const int digits = __glibcxx_digits (unsigned char);$/;" m struct:std::numeric_limits file: access:public +digits cpp_src/limits /^ static const int digits = __glibcxx_digits (unsigned int);$/;" m struct:std::numeric_limits file: access:public +digits cpp_src/limits /^ static const int digits = __glibcxx_digits (unsigned long long);$/;" m struct:std::numeric_limits file: access:public +digits cpp_src/limits /^ static const int digits = __glibcxx_digits (unsigned long);$/;" m struct:std::numeric_limits file: access:public +digits cpp_src/limits /^ static const int digits = __glibcxx_digits (unsigned short);$/;" m struct:std::numeric_limits file: access:public +digits cpp_src/limits /^ static const int digits = __glibcxx_digits (wchar_t);$/;" m struct:std::numeric_limits file: access:public +digits cpp_src/limits /^ static const int digits = 0;$/;" m struct:std::__numeric_limits_base file: access:public +digits10 cpp_src/limits /^ static const int digits10 = 0;$/;" m struct:std::numeric_limits file: access:public +digits10 cpp_src/limits /^ static const int digits10 = __DBL_DIG__;$/;" m struct:std::numeric_limits file: access:public +digits10 cpp_src/limits /^ static const int digits10 = __FLT_DIG__;$/;" m struct:std::numeric_limits file: access:public +digits10 cpp_src/limits /^ static const int digits10 = __LDBL_DIG__;$/;" m struct:std::numeric_limits file: access:public +digits10 cpp_src/limits /^ static const int digits10 = __glibcxx_digits10 (char);$/;" m struct:std::numeric_limits file: access:public +digits10 cpp_src/limits /^ static const int digits10 = __glibcxx_digits10 (int);$/;" m struct:std::numeric_limits file: access:public +digits10 cpp_src/limits /^ static const int digits10 = __glibcxx_digits10 (long long);$/;" m struct:std::numeric_limits file: access:public +digits10 cpp_src/limits /^ static const int digits10 = __glibcxx_digits10 (long);$/;" m struct:std::numeric_limits file: access:public +digits10 cpp_src/limits /^ static const int digits10 = __glibcxx_digits10 (short);$/;" m struct:std::numeric_limits file: access:public +digits10 cpp_src/limits /^ static const int digits10 = __glibcxx_digits10 (signed char);$/;" m struct:std::numeric_limits file: access:public +digits10 cpp_src/limits /^ static const int digits10 = __glibcxx_digits10 (unsigned char);$/;" m struct:std::numeric_limits file: access:public +digits10 cpp_src/limits /^ static const int digits10 = __glibcxx_digits10 (unsigned int);$/;" m struct:std::numeric_limits file: access:public +digits10 cpp_src/limits /^ static const int digits10 = __glibcxx_digits10 (unsigned long long);$/;" m struct:std::numeric_limits file: access:public +digits10 cpp_src/limits /^ static const int digits10 = __glibcxx_digits10 (unsigned long);$/;" m struct:std::numeric_limits file: access:public +digits10 cpp_src/limits /^ static const int digits10 = __glibcxx_digits10 (unsigned short);$/;" m struct:std::numeric_limits file: access:public +digits10 cpp_src/limits /^ static const int digits10 = __glibcxx_digits10 (wchar_t);$/;" m struct:std::numeric_limits file: access:public +digits10 cpp_src/limits /^ static const int digits10 = 0;$/;" m struct:std::__numeric_limits_base file: access:public +distance cpp_src/stl_iterator_base_funcs.h /^ distance(_InputIterator __first, _InputIterator __last)$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last) +div cpp_src/cmath 58;" d file: +divides cpp_src/stl_function.h /^ struct divides : public binary_function<_Tp, _Tp, _Tp>$/;" s namespace:std inherits:binary_function +dmy cpp_src/locale_facets.h /^ enum dateorder { no_order, dmy, mdy, ymd, ydm };$/;" e enum:std::time_base::dateorder +do_always_noconv cpp_src/codecvt.h /^ bool do_always_noconv() const throw();$/;" p class:std::codecvt access:protected signature:() const +do_always_noconv cpp_src/codecvt.h /^ do_always_noconv() const throw() = 0;$/;" p class:std::__codecvt_abstract_base access:protected signature:() const +do_always_noconv cpp_src/codecvt.h /^ do_always_noconv() const throw();$/;" p class:std::codecvt access:protected signature:() const +do_close cpp_src/locale_facets.h /^ do_close(catalog) const;$/;" p class:std::messages access:protected signature:(catalog) const +do_compare cpp_src/locale_facets.h /^ do_compare(const _CharT* __lo1, const _CharT* __hi1,$/;" p class:std::collate access:protected signature:(const _CharT* __lo1, const _CharT* __hi1, const _CharT* __lo2, const _CharT* __hi2) const +do_compare cpp_src/locale_facets.tcc /^ do_compare(const _CharT* __lo1, const _CharT* __hi1,$/;" f class:std::collate signature:(const _CharT* __lo1, const _CharT* __hi1, const _CharT* __lo2, const _CharT* __hi2) const +do_curr_symbol cpp_src/locale_facets.h /^ do_curr_symbol() const$/;" f class:std::moneypunct access:protected signature:() const +do_date_order cpp_src/locale_facets.h /^ do_date_order() const;$/;" p class:std::time_get access:protected signature:() const +do_date_order cpp_src/locale_facets.tcc /^ time_get<_CharT, _InIter>::do_date_order() const$/;" f class:std::time_get signature:() const +do_decimal_point cpp_src/locale_facets.h /^ do_decimal_point() const$/;" f class:std::moneypunct access:protected signature:() const +do_decimal_point cpp_src/locale_facets.h /^ do_decimal_point() const$/;" f class:std::numpunct access:protected signature:() const +do_encoding cpp_src/codecvt.h /^ do_encoding() const throw() = 0;$/;" p class:std::__codecvt_abstract_base access:protected signature:() const +do_encoding cpp_src/codecvt.h /^ do_encoding() const throw();$/;" p class:std::codecvt access:protected signature:() const +do_encoding cpp_src/codecvt.h /^ int do_encoding() const throw();$/;" p class:std::codecvt access:protected signature:() const +do_falsename cpp_src/locale_facets.h /^ do_falsename() const$/;" f class:std::numpunct access:protected signature:() const +do_frac_digits cpp_src/locale_facets.h /^ do_frac_digits() const$/;" f class:std::moneypunct access:protected signature:() const +do_get cpp_src/locale_facets.h /^ do_get(catalog, int, int, const string_type& __dfault) const;$/;" p class:std::messages access:protected signature:(catalog, int, int, const string_type& __dfault) const +do_get cpp_src/locale_facets.h /^ do_get(iter_type __s, iter_type __end, bool __intl, ios_base& __io,$/;" p class:std::money_get access:protected signature:(iter_type __s, iter_type __end, bool __intl, ios_base& __io, ios_base::iostate& __err, long double& __units) const +do_get cpp_src/locale_facets.h /^ do_get(iter_type __s, iter_type __end, bool __intl, ios_base& __io,$/;" p class:std::money_get access:protected signature:(iter_type __s, iter_type __end, bool __intl, ios_base& __io, ios_base::iostate& __err, string_type& __digits) const +do_get cpp_src/locale_facets.h /^ do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,$/;" p class:std::num_get access:protected signature:(iter_type, iter_type, ios_base&, ios_base::iostate& __err, double&) const +do_get cpp_src/locale_facets.h /^ do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,$/;" p class:std::num_get access:protected signature:(iter_type, iter_type, ios_base&, ios_base::iostate& __err, float&) const +do_get cpp_src/locale_facets.h /^ do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,$/;" p class:std::num_get access:protected signature:(iter_type, iter_type, ios_base&, ios_base::iostate& __err, long double&) const +do_get cpp_src/locale_facets.h /^ do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,$/;" p class:std::num_get access:protected signature:(iter_type, iter_type, ios_base&, ios_base::iostate& __err, long long&) const +do_get cpp_src/locale_facets.h /^ do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,$/;" p class:std::num_get access:protected signature:(iter_type, iter_type, ios_base&, ios_base::iostate& __err, unsigned int&) const +do_get cpp_src/locale_facets.h /^ do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,$/;" p class:std::num_get access:protected signature:(iter_type, iter_type, ios_base&, ios_base::iostate& __err, unsigned long long&) const +do_get cpp_src/locale_facets.h /^ do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,$/;" p class:std::num_get access:protected signature:(iter_type, iter_type, ios_base&, ios_base::iostate& __err, unsigned long&) const +do_get cpp_src/locale_facets.h /^ do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,$/;" p class:std::num_get access:protected signature:(iter_type, iter_type, ios_base&, ios_base::iostate& __err, unsigned short&) const +do_get cpp_src/locale_facets.h /^ do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,$/;" p class:std::num_get access:protected signature:(iter_type, iter_type, ios_base&, ios_base::iostate& __err, void*&) const +do_get cpp_src/locale_facets.h /^ do_get(iter_type, iter_type, ios_base&, ios_base::iostate&, bool&) const;$/;" p class:std::num_get access:protected signature:(iter_type, iter_type, ios_base&, ios_base::iostate&, bool&) const +do_get cpp_src/locale_facets.h /^ do_get(iter_type, iter_type, ios_base&, ios_base::iostate&, long&) const;$/;" p class:std::num_get access:protected signature:(iter_type, iter_type, ios_base&, ios_base::iostate&, long&) const +do_get cpp_src/locale_facets.h /^ messages::do_get(catalog, int, int, const string&) const;$/;" p class:std::messages signature:(catalog, int, int, const string&) const +do_get cpp_src/locale_facets.h /^ messages::do_get(catalog, int, int, const wstring&) const;$/;" p class:std::messages signature:(catalog, int, int, const wstring&) const +do_get cpp_src/locale_facets.tcc /^ do_get(iter_type __beg, iter_type __end, bool __intl, ios_base& __io,$/;" f class:std::money_get signature:(iter_type __beg, iter_type __end, bool __intl, ios_base& __io, ios_base::iostate& __err, long double& __units) const +do_get cpp_src/locale_facets.tcc /^ do_get(iter_type __beg, iter_type __end, bool __intl, ios_base& __io,$/;" f class:std::money_get signature:(iter_type __beg, iter_type __end, bool __intl, ios_base& __io, ios_base::iostate& __err, string_type& __digits) const +do_get cpp_src/locale_facets.tcc /^ do_get(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::num_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, bool& __v) const +do_get cpp_src/locale_facets.tcc /^ do_get(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::num_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, double& __v) const +do_get cpp_src/locale_facets.tcc /^ do_get(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::num_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, float& __v) const +do_get cpp_src/locale_facets.tcc /^ do_get(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::num_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, long double& __v) const +do_get cpp_src/locale_facets.tcc /^ do_get(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::num_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, long long& __v) const +do_get cpp_src/locale_facets.tcc /^ do_get(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::num_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, long& __v) const +do_get cpp_src/locale_facets.tcc /^ do_get(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::num_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, unsigned int& __v) const +do_get cpp_src/locale_facets.tcc /^ do_get(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::num_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, unsigned long long& __v) const +do_get cpp_src/locale_facets.tcc /^ do_get(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::num_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, unsigned long& __v) const +do_get cpp_src/locale_facets.tcc /^ do_get(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::num_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, unsigned short& __v) const +do_get cpp_src/locale_facets.tcc /^ do_get(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::num_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, void*& __v) const +do_get_date cpp_src/locale_facets.h /^ do_get_date(iter_type __beg, iter_type __end, ios_base& __io,$/;" p class:std::time_get access:protected signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, tm* __tm) const +do_get_date cpp_src/locale_facets.tcc /^ do_get_date(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::time_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, tm* __tm) const +do_get_monthname cpp_src/locale_facets.h /^ do_get_monthname(iter_type __beg, iter_type __end, ios_base&,$/;" p class:std::time_get access:protected signature:(iter_type __beg, iter_type __end, ios_base&, ios_base::iostate& __err, tm* __tm) const +do_get_monthname cpp_src/locale_facets.tcc /^ do_get_monthname(iter_type __beg, iter_type __end,$/;" f class:std::time_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, tm* __tm) const +do_get_time cpp_src/locale_facets.h /^ do_get_time(iter_type __beg, iter_type __end, ios_base& __io,$/;" p class:std::time_get access:protected signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, tm* __tm) const +do_get_time cpp_src/locale_facets.tcc /^ do_get_time(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::time_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, tm* __tm) const +do_get_weekday cpp_src/locale_facets.h /^ do_get_weekday(iter_type __beg, iter_type __end, ios_base&,$/;" p class:std::time_get access:protected signature:(iter_type __beg, iter_type __end, ios_base&, ios_base::iostate& __err, tm* __tm) const +do_get_weekday cpp_src/locale_facets.tcc /^ do_get_weekday(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::time_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, tm* __tm) const +do_get_year cpp_src/locale_facets.h /^ do_get_year(iter_type __beg, iter_type __end, ios_base& __io,$/;" p class:std::time_get access:protected signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, tm* __tm) const +do_get_year cpp_src/locale_facets.tcc /^ do_get_year(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::time_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, tm* __tm) const +do_grouping cpp_src/locale_facets.h /^ do_grouping() const$/;" f class:std::moneypunct access:protected signature:() const +do_grouping cpp_src/locale_facets.h /^ do_grouping() const$/;" f class:std::numpunct access:protected signature:() const +do_hash cpp_src/locale_facets.h /^ do_hash(const _CharT* __lo, const _CharT* __hi) const;$/;" p class:std::collate access:protected signature:(const _CharT* __lo, const _CharT* __hi) const +do_hash cpp_src/locale_facets.tcc /^ do_hash(const _CharT* __lo, const _CharT* __hi) const$/;" f class:std::collate signature:(const _CharT* __lo, const _CharT* __hi) const +do_in cpp_src/codecvt.h /^ do_in(state_type& __state, const extern_type* __from,$/;" p class:std::__codecvt_abstract_base access:protected signature:(state_type& __state, const extern_type* __from, const extern_type* __from_end, const extern_type*& __from_next, intern_type* __to, intern_type* __to_end, intern_type*& __to_next) const +do_in cpp_src/codecvt.h /^ do_in(state_type& __state, const extern_type* __from,$/;" p class:std::codecvt access:protected signature:(state_type& __state, const extern_type* __from, const extern_type* __from_end, const extern_type*& __from_next, intern_type* __to, intern_type* __to_end, intern_type*& __to_next) const +do_in cpp_src/codecvt.h /^ do_in(state_type& __state,$/;" p class:std::codecvt access:protected signature:(state_type& __state, const extern_type* __from, const extern_type* __from_end, const extern_type*& __from_next, intern_type* __to, intern_type* __to_end, intern_type*& __to_next) const +do_is cpp_src/locale_facets.h /^ do_is(const char_type* __lo, const char_type* __hi, mask* __vec) const;$/;" p class:std::ctype access:protected signature:(const char_type* __lo, const char_type* __hi, mask* __vec) const +do_is cpp_src/locale_facets.h /^ do_is(const char_type* __lo, const char_type* __hi,$/;" p class:std::__ctype_abstract_base access:protected signature:(const char_type* __lo, const char_type* __hi, mask* __vec) const +do_is cpp_src/locale_facets.h /^ do_is(mask __m, char_type __c) const = 0;$/;" p class:std::__ctype_abstract_base access:protected signature:(mask __m, char_type __c) const +do_is cpp_src/locale_facets.h /^ do_is(mask __m, char_type __c) const;$/;" p class:std::ctype access:protected signature:(mask __m, char_type __c) const +do_length cpp_src/codecvt.h /^ do_length(state_type&, const extern_type* __from,$/;" p class:std::__codecvt_abstract_base access:protected signature:(state_type&, const extern_type* __from, const extern_type* __end, size_t __max) const +do_length cpp_src/codecvt.h /^ do_length(state_type&, const extern_type* __from,$/;" p class:std::codecvt access:protected signature:(state_type&, const extern_type* __from, const extern_type* __end, size_t __max) const +do_length cpp_src/codecvt.h /^ int do_length(state_type&, const extern_type* __from,$/;" p class:std::codecvt access:protected signature:(state_type&, const extern_type* __from, const extern_type* __end, size_t __max) const +do_max_length cpp_src/codecvt.h /^ do_max_length() const throw() = 0;$/;" p class:std::__codecvt_abstract_base access:protected signature:() const +do_max_length cpp_src/codecvt.h /^ do_max_length() const throw();$/;" p class:std::codecvt access:protected signature:() const +do_narrow cpp_src/locale_facets.h /^ do_narrow(char_type __c, char) const$/;" f class:std::ctype access:protected signature:(char_type __c, char) const +do_narrow cpp_src/locale_facets.h /^ do_narrow(char_type, char __dfault) const = 0;$/;" p class:std::__ctype_abstract_base access:protected signature:(char_type, char __dfault) const +do_narrow cpp_src/locale_facets.h /^ do_narrow(char_type, char __dfault) const;$/;" p class:std::ctype access:protected signature:(char_type, char __dfault) const +do_narrow cpp_src/locale_facets.h /^ do_narrow(const char_type* __lo, const char_type* __hi,$/;" f class:std::ctype access:protected signature:(const char_type* __lo, const char_type* __hi, char, char* __dest) const +do_narrow cpp_src/locale_facets.h /^ do_narrow(const char_type* __lo, const char_type* __hi,$/;" p class:std::__ctype_abstract_base access:protected signature:(const char_type* __lo, const char_type* __hi, char __dfault, char* __dest) const +do_narrow cpp_src/locale_facets.h /^ do_narrow(const char_type* __lo, const char_type* __hi,$/;" p class:std::ctype access:protected signature:(const char_type* __lo, const char_type* __hi, char __dfault, char* __dest) const +do_neg_format cpp_src/locale_facets.h /^ do_neg_format() const$/;" f class:std::moneypunct access:protected signature:() const +do_negative_sign cpp_src/locale_facets.h /^ do_negative_sign() const$/;" f class:std::moneypunct access:protected signature:() const +do_open cpp_src/locale_facets.h /^ do_open(const basic_string&, const locale&) const;$/;" p class:std::messages access:protected signature:(const basic_string&, const locale&) const +do_out cpp_src/codecvt.h /^ do_out(state_type& __state, const intern_type* __from,$/;" p class:std::__codecvt_abstract_base access:protected signature:(state_type& __state, const intern_type* __from, const intern_type* __from_end, const intern_type*& __from_next, extern_type* __to, extern_type* __to_end, extern_type*& __to_next) const +do_out cpp_src/codecvt.h /^ do_out(state_type& __state, const intern_type* __from,$/;" p class:std::codecvt access:protected signature:(state_type& __state, const intern_type* __from, const intern_type* __from_end, const intern_type*& __from_next, extern_type* __to, extern_type* __to_end, extern_type*& __to_next) const +do_pos_format cpp_src/locale_facets.h /^ do_pos_format() const$/;" f class:std::moneypunct access:protected signature:() const +do_positive_sign cpp_src/locale_facets.h /^ do_positive_sign() const$/;" f class:std::moneypunct access:protected signature:() const +do_put cpp_src/locale_facets.h /^ do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill,$/;" p class:std::money_put access:protected signature:(iter_type __s, bool __intl, ios_base& __io, char_type __fill, const string_type& __digits) const +do_put cpp_src/locale_facets.h /^ do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill,$/;" p class:std::money_put access:protected signature:(iter_type __s, bool __intl, ios_base& __io, char_type __fill, long double __units) const +do_put cpp_src/locale_facets.h /^ do_put(iter_type __s, ios_base& __io, char_type __fill, const tm* __tm,$/;" p class:std::time_put access:protected signature:(iter_type __s, ios_base& __io, char_type __fill, const tm* __tm, char __format, char __mod) const +do_put cpp_src/locale_facets.h /^ do_put(iter_type, ios_base&, char_type __fill, bool __v) const;$/;" p class:std::num_put access:protected signature:(iter_type, ios_base&, char_type __fill, bool __v) const +do_put cpp_src/locale_facets.h /^ do_put(iter_type, ios_base&, char_type __fill, const void* __v) const;$/;" p class:std::num_put access:protected signature:(iter_type, ios_base&, char_type __fill, const void* __v) const +do_put cpp_src/locale_facets.h /^ do_put(iter_type, ios_base&, char_type __fill, double __v) const;$/;" p class:std::num_put access:protected signature:(iter_type, ios_base&, char_type __fill, double __v) const +do_put cpp_src/locale_facets.h /^ do_put(iter_type, ios_base&, char_type __fill, long __v) const;$/;" p class:std::num_put access:protected signature:(iter_type, ios_base&, char_type __fill, long __v) const +do_put cpp_src/locale_facets.h /^ do_put(iter_type, ios_base&, char_type __fill, long double __v) const;$/;" p class:std::num_put access:protected signature:(iter_type, ios_base&, char_type __fill, long double __v) const +do_put cpp_src/locale_facets.h /^ do_put(iter_type, ios_base&, char_type __fill, long long __v) const;$/;" p class:std::num_put access:protected signature:(iter_type, ios_base&, char_type __fill, long long __v) const +do_put cpp_src/locale_facets.h /^ do_put(iter_type, ios_base&, char_type __fill, unsigned long long) const;$/;" p class:std::num_put access:protected signature:(iter_type, ios_base&, char_type __fill, unsigned long long) const +do_put cpp_src/locale_facets.h /^ do_put(iter_type, ios_base&, char_type __fill, unsigned long) const;$/;" p class:std::num_put access:protected signature:(iter_type, ios_base&, char_type __fill, unsigned long) const +do_put cpp_src/locale_facets.tcc /^ do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill,$/;" f class:std::money_put signature:(iter_type __s, bool __intl, ios_base& __io, char_type __fill, const string_type& __digits) const +do_put cpp_src/locale_facets.tcc /^ do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill,$/;" f class:std::money_put signature:(iter_type __s, bool __intl, ios_base& __io, char_type __fill, long double __units) const +do_put cpp_src/locale_facets.tcc /^ do_put(iter_type __s, ios_base& __io, char_type __fill, bool __v) const$/;" f class:std::num_put signature:(iter_type __s, ios_base& __io, char_type __fill, bool __v) const +do_put cpp_src/locale_facets.tcc /^ do_put(iter_type __s, ios_base& __io, char_type __fill, double __v) const$/;" f class:std::num_put signature:(iter_type __s, ios_base& __io, char_type __fill, double __v) const +do_put cpp_src/locale_facets.tcc /^ do_put(iter_type __s, ios_base& __io, char_type __fill, long __v) const$/;" f class:std::num_put signature:(iter_type __s, ios_base& __io, char_type __fill, long __v) const +do_put cpp_src/locale_facets.tcc /^ do_put(iter_type __s, ios_base& __io, char_type __fill, long long __v) const$/;" f class:std::num_put signature:(iter_type __s, ios_base& __io, char_type __fill, long long __v) const +do_put cpp_src/locale_facets.tcc /^ do_put(iter_type __s, ios_base& __io, char_type __fill,$/;" f class:std::num_put signature:(iter_type __s, ios_base& __io, char_type __fill, const void* __v) const +do_put cpp_src/locale_facets.tcc /^ do_put(iter_type __s, ios_base& __io, char_type __fill,$/;" f class:std::num_put signature:(iter_type __s, ios_base& __io, char_type __fill, long double __v) const +do_put cpp_src/locale_facets.tcc /^ do_put(iter_type __s, ios_base& __io, char_type __fill,$/;" f class:std::num_put signature:(iter_type __s, ios_base& __io, char_type __fill, unsigned long __v) const +do_put cpp_src/locale_facets.tcc /^ do_put(iter_type __s, ios_base& __io, char_type __fill,$/;" f class:std::num_put signature:(iter_type __s, ios_base& __io, char_type __fill, unsigned long long __v) const +do_put cpp_src/locale_facets.tcc /^ do_put(iter_type __s, ios_base& __io, char_type, const tm* __tm,$/;" f class:std::time_put signature:(iter_type __s, ios_base& __io, char_type, const tm* __tm, char __format, char __mod) const +do_scan_is cpp_src/locale_facets.h /^ do_scan_is(mask __m, const char_type* __lo, const char_type* __hi) const;$/;" p class:std::ctype access:protected signature:(mask __m, const char_type* __lo, const char_type* __hi) const +do_scan_is cpp_src/locale_facets.h /^ do_scan_is(mask __m, const char_type* __lo,$/;" p class:std::__ctype_abstract_base access:protected signature:(mask __m, const char_type* __lo, const char_type* __hi) const +do_scan_not cpp_src/locale_facets.h /^ do_scan_not(mask __m, const char_type* __lo,$/;" p class:std::__ctype_abstract_base access:protected signature:(mask __m, const char_type* __lo, const char_type* __hi) const +do_scan_not cpp_src/locale_facets.h /^ do_scan_not(mask __m, const char_type* __lo,$/;" p class:std::ctype access:protected signature:(mask __m, const char_type* __lo, const char_type* __hi) const +do_thousands_sep cpp_src/locale_facets.h /^ do_thousands_sep() const$/;" f class:std::moneypunct access:protected signature:() const +do_thousands_sep cpp_src/locale_facets.h /^ do_thousands_sep() const$/;" f class:std::numpunct access:protected signature:() const +do_tolower cpp_src/locale_facets.h /^ do_tolower(char_type __c) const;$/;" p class:std::ctype access:protected signature:(char_type __c) const +do_tolower cpp_src/locale_facets.h /^ do_tolower(char_type) const = 0;$/;" p class:std::__ctype_abstract_base access:protected signature:(char_type) const +do_tolower cpp_src/locale_facets.h /^ do_tolower(char_type) const;$/;" p class:std::ctype access:protected signature:(char_type) const +do_tolower cpp_src/locale_facets.h /^ do_tolower(char_type* __lo, const char_type* __hi) const = 0;$/;" p class:std::__ctype_abstract_base access:protected signature:(char_type* __lo, const char_type* __hi) const +do_tolower cpp_src/locale_facets.h /^ do_tolower(char_type* __lo, const char_type* __hi) const;$/;" p class:std::ctype access:protected signature:(char_type* __lo, const char_type* __hi) const +do_toupper cpp_src/locale_facets.h /^ do_toupper(char_type __c) const;$/;" p class:std::ctype access:protected signature:(char_type __c) const +do_toupper cpp_src/locale_facets.h /^ do_toupper(char_type) const = 0;$/;" p class:std::__ctype_abstract_base access:protected signature:(char_type) const +do_toupper cpp_src/locale_facets.h /^ do_toupper(char_type) const;$/;" p class:std::ctype access:protected signature:(char_type) const +do_toupper cpp_src/locale_facets.h /^ do_toupper(char_type* __lo, const char_type* __hi) const = 0;$/;" p class:std::__ctype_abstract_base access:protected signature:(char_type* __lo, const char_type* __hi) const +do_toupper cpp_src/locale_facets.h /^ do_toupper(char_type* __lo, const char_type* __hi) const;$/;" p class:std::ctype access:protected signature:(char_type* __lo, const char_type* __hi) const +do_transform cpp_src/locale_facets.h /^ do_transform(const _CharT* __lo, const _CharT* __hi) const;$/;" p class:std::collate access:protected signature:(const _CharT* __lo, const _CharT* __hi) const +do_transform cpp_src/locale_facets.tcc /^ do_transform(const _CharT* __lo, const _CharT* __hi) const$/;" f class:std::collate signature:(const _CharT* __lo, const _CharT* __hi) const +do_truename cpp_src/locale_facets.h /^ do_truename() const$/;" f class:std::numpunct access:protected signature:() const +do_unshift cpp_src/codecvt.h /^ do_unshift(state_type& __state, extern_type* __to,$/;" p class:std::__codecvt_abstract_base access:protected signature:(state_type& __state, extern_type* __to, extern_type* __to_end, extern_type*& __to_next) const +do_unshift cpp_src/codecvt.h /^ do_unshift(state_type& __state, extern_type* __to,$/;" p class:std::codecvt access:protected signature:(state_type& __state, extern_type* __to, extern_type* __to_end, extern_type*& __to_next) const +do_unshift cpp_src/codecvt.h /^ do_unshift(state_type& __state,$/;" p class:std::codecvt access:protected signature:(state_type& __state, extern_type* __to, extern_type* __to_end, extern_type*& __to_next) const +do_widen cpp_src/locale_facets.h /^ do_widen(char __c) const$/;" f class:std::ctype access:protected signature:(char __c) const +do_widen cpp_src/locale_facets.h /^ do_widen(char __c) const;$/;" p class:std::ctype access:protected signature:(char __c) const +do_widen cpp_src/locale_facets.h /^ do_widen(char) const = 0;$/;" p class:std::__ctype_abstract_base access:protected signature:(char) const +do_widen cpp_src/locale_facets.h /^ do_widen(char) const;$/;" p class:std::ctype access:protected signature:(char) const +do_widen cpp_src/locale_facets.h /^ do_widen(const char* __lo, const char* __hi, char_type* __dest) const$/;" f class:std::ctype access:protected signature:(const char* __lo, const char* __hi, char_type* __dest) const +do_widen cpp_src/locale_facets.h /^ do_widen(const char* __lo, const char* __hi, char_type* __dest) const;$/;" p class:std::ctype access:protected signature:(const char* __lo, const char* __hi, char_type* __dest) const +do_widen cpp_src/locale_facets.h /^ do_widen(const char* __lo, const char* __hi,$/;" p class:std::__ctype_abstract_base access:protected signature:(const char* __lo, const char* __hi, char_type* __dest) const +domain_error cpp_src/stdexcept /^ explicit domain_error(const string& __arg);$/;" p class:std::domain_error file: access:public signature:(const string& __arg) +domain_error cpp_src/stdexcept /^ class domain_error : public logic_error $/;" c namespace:std file: inherits:logic_error +eback cpp_src/streambuf /^ eback() const { return _M_in_beg; }$/;" f class:std::basic_streambuf access:protected signature:() const +egptr cpp_src/streambuf /^ egptr() const { return _M_in_end; }$/;" f class:std::basic_streambuf access:protected signature:() const +element_type cpp_src/memory /^ typedef _Tp element_type;$/;" t class:std::auto_ptr file: access:public +empty cpp_src/basic_string.h /^ empty() const$/;" f class:std::basic_string access:public signature:() const +empty cpp_src/stl_bvector.h /^ empty() const$/;" f class:std::vector access:public signature:() const +empty cpp_src/stl_deque.h /^ empty() const$/;" f class:std::deque access:public signature:() const +empty cpp_src/stl_list.h /^ empty() const$/;" f class:std::list access:public signature:() const +empty cpp_src/stl_map.h /^ empty() const$/;" f class:std::map access:public signature:() const +empty cpp_src/stl_multimap.h /^ empty() const$/;" f class:std::multimap access:public signature:() const +empty cpp_src/stl_multiset.h /^ empty() const$/;" f class:std::multiset access:public signature:() const +empty cpp_src/stl_queue.h /^ empty() const$/;" f class:std::priority_queue access:public signature:() const +empty cpp_src/stl_queue.h /^ empty() const$/;" f class:std::queue access:public signature:() const +empty cpp_src/stl_set.h /^ empty() const$/;" f class:std::set access:public signature:() const +empty cpp_src/stl_stack.h /^ empty() const$/;" f class:std::stack access:public signature:() const +empty cpp_src/stl_tree.h /^ empty() const$/;" f class:std::_Rb_tree access:public signature:() const +empty cpp_src/stl_vector.h /^ empty() const$/;" f class:std::vector access:public signature:() const +encoding cpp_src/codecvt.h /^ encoding() const throw()$/;" f class:std::__codecvt_abstract_base access:public signature:() const +end cpp_src/basic_string.h /^ end() const$/;" f class:std::basic_string access:public signature:() const +end cpp_src/basic_string.h /^ end()$/;" f class:std::basic_string access:public signature:() +end cpp_src/ios_base.h /^ static const seekdir end = _S_end;$/;" m class:std::ios_base access:public +end cpp_src/stl_bvector.h /^ end() const$/;" f class:std::vector access:public signature:() const +end cpp_src/stl_bvector.h /^ end()$/;" f class:std::vector access:public signature:() +end cpp_src/stl_deque.h /^ end() const$/;" f class:std::deque access:public signature:() const +end cpp_src/stl_deque.h /^ end()$/;" f class:std::deque access:public signature:() +end cpp_src/stl_list.h /^ end() const$/;" f class:std::list access:public signature:() const +end cpp_src/stl_list.h /^ end()$/;" f class:std::list access:public signature:() +end cpp_src/stl_map.h /^ end() const$/;" f class:std::map access:public signature:() const +end cpp_src/stl_map.h /^ end()$/;" f class:std::map access:public signature:() +end cpp_src/stl_multimap.h /^ end() const$/;" f class:std::multimap access:public signature:() const +end cpp_src/stl_multimap.h /^ end()$/;" f class:std::multimap access:public signature:() +end cpp_src/stl_multiset.h /^ end() const$/;" f class:std::multiset access:public signature:() const +end cpp_src/stl_set.h /^ end() const$/;" f class:std::set access:public signature:() const +end cpp_src/stl_tempbuf.h /^ end()$/;" f class:std::_Temporary_buffer access:public signature:() +end cpp_src/stl_tree.h /^ end() const$/;" f class:std::_Rb_tree access:public signature:() const +end cpp_src/stl_tree.h /^ end()$/;" f class:std::_Rb_tree access:public signature:() +end cpp_src/stl_vector.h /^ end() const$/;" f class:std::vector access:public signature:() const +end cpp_src/stl_vector.h /^ end()$/;" f class:std::vector access:public signature:() +endl cpp_src/ostream /^ endl(basic_ostream<_CharT, _Traits>& __os)$/;" f namespace:std signature:(basic_ostream<_CharT, _Traits>& __os) +endl cpp_src/ostream.tcc /^ extern template ostream& endl(ostream&);$/;" p namespace:std file: signature:(ostream&) +endl cpp_src/ostream.tcc /^ extern template wostream& endl(wostream&);$/;" p namespace:std file: signature:(wostream&) +ends cpp_src/ostream /^ ends(basic_ostream<_CharT, _Traits>& __os)$/;" f namespace:std signature:(basic_ostream<_CharT, _Traits>& __os) +ends cpp_src/ostream.tcc /^ extern template ostream& ends(ostream&);$/;" p namespace:std file: signature:(ostream&) +ends cpp_src/ostream.tcc /^ extern template wostream& ends(wostream&);$/;" p namespace:std file: signature:(wostream&) +eof cpp_src/basic_ios.h /^ eof() const$/;" f class:std::basic_ios access:public signature:() const +eof cpp_src/char_traits.h /^ eof()$/;" f struct:char_traits access:public signature:() +eofbit cpp_src/ios_base.h /^ static const iostate eofbit = _S_eofbit;$/;" m class:std::ios_base access:public +epptr cpp_src/streambuf /^ epptr() const { return _M_out_end; }$/;" f class:std::basic_streambuf access:protected signature:() const +epsilon cpp_src/limits /^ static _Tp epsilon() throw() { return static_cast<_Tp>(0); }$/;" f struct:std::numeric_limits access:public signature:() +epsilon cpp_src/limits /^ static bool epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +epsilon cpp_src/limits /^ static char epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +epsilon cpp_src/limits /^ static double epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +epsilon cpp_src/limits /^ static float epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +epsilon cpp_src/limits /^ static int epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +epsilon cpp_src/limits /^ static long double epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +epsilon cpp_src/limits /^ static long epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +epsilon cpp_src/limits /^ static long long epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +epsilon cpp_src/limits /^ static short epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +epsilon cpp_src/limits /^ static signed char epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +epsilon cpp_src/limits /^ static unsigned char epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +epsilon cpp_src/limits /^ static unsigned int epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +epsilon cpp_src/limits /^ static unsigned long epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +epsilon cpp_src/limits /^ static unsigned long long epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +epsilon cpp_src/limits /^ static unsigned short epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +epsilon cpp_src/limits /^ static wchar_t epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +eq cpp_src/char_traits.h /^ eq(const char_type& __c1, const char_type& __c2)$/;" f struct:char_traits access:public signature:(const char_type& __c1, const char_type& __c2) +eq_int_type cpp_src/char_traits.h /^ eq_int_type(const int_type& __c1, const int_type& __c2)$/;" f struct:char_traits access:public signature:(const int_type& __c1, const int_type& __c2) +equal cpp_src/stl_algobase.h /^ equal(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) +equal cpp_src/stl_algobase.h /^ equal(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __binary_pred) +equal cpp_src/streambuf_iterator.h /^ equal(const istreambuf_iterator& __b) const$/;" f class:std::istreambuf_iterator access:public signature:(const istreambuf_iterator& __b) const +equal_range cpp_src/stl_algo.h /^ equal_range(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val) +equal_range cpp_src/stl_algo.h /^ equal_range(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val, _Compare __comp) +equal_range cpp_src/stl_map.h /^ equal_range(const key_type& __x) const$/;" f class:std::map access:public signature:(const key_type& __x) const +equal_range cpp_src/stl_map.h /^ equal_range(const key_type& __x)$/;" f class:std::map access:public signature:(const key_type& __x) +equal_range cpp_src/stl_multimap.h /^ equal_range(const key_type& __x) const$/;" f class:std::multimap access:public signature:(const key_type& __x) const +equal_range cpp_src/stl_multimap.h /^ equal_range(const key_type& __x)$/;" f class:std::multimap access:public signature:(const key_type& __x) +equal_range cpp_src/stl_multiset.h /^ equal_range(const key_type& __x) const$/;" f class:std::multiset access:public signature:(const key_type& __x) const +equal_range cpp_src/stl_multiset.h /^ equal_range(const key_type& __x)$/;" f class:std::multiset access:public signature:(const key_type& __x) +equal_range cpp_src/stl_set.h /^ equal_range(const key_type& __x) const$/;" f class:std::set access:public signature:(const key_type& __x) const +equal_range cpp_src/stl_set.h /^ equal_range(const key_type& __x)$/;" f class:std::set access:public signature:(const key_type& __x) +equal_range cpp_src/stl_tree.h /^ equal_range(const key_type& __x) const;$/;" p class:std::_Rb_tree access:public signature:(const key_type& __x) const +equal_range cpp_src/stl_tree.h /^ equal_range(const key_type& __x);$/;" p class:std::_Rb_tree access:public signature:(const key_type& __x) +equal_range cpp_src/stl_tree.h /^ equal_range(const _Key& __k) const$/;" f class:std::_Rb_tree signature:(const _Key& __k) const +equal_range cpp_src/stl_tree.h /^ equal_range(const _Key& __k)$/;" f class:std::_Rb_tree signature:(const _Key& __k) +equal_to cpp_src/stl_function.h /^ struct equal_to : public binary_function<_Tp, _Tp, bool>$/;" s namespace:std inherits:binary_function +erase cpp_src/basic_string.h /^ erase(iterator __first, iterator __last)$/;" f class:std::basic_string access:public signature:(iterator __first, iterator __last) +erase cpp_src/basic_string.h /^ erase(iterator __position)$/;" f class:std::basic_string access:public signature:(iterator __position) +erase cpp_src/basic_string.h /^ erase(size_type __pos = 0, size_type __n = npos)$/;" f class:std::basic_string access:public signature:(size_type __pos = 0, size_type __n = npos) +erase cpp_src/deque.tcc /^ erase(iterator __first, iterator __last)$/;" f class:std::deque signature:(iterator __first, iterator __last) +erase cpp_src/deque.tcc /^ erase(iterator __position)$/;" f class:std::deque signature:(iterator __position) +erase cpp_src/list.tcc /^ erase(iterator __position)$/;" f class:std::list signature:(iterator __position) +erase cpp_src/stl_bvector.h /^ erase(iterator __first, iterator __last)$/;" f class:std::vector access:public signature:(iterator __first, iterator __last) +erase cpp_src/stl_bvector.h /^ erase(iterator __position)$/;" f class:std::vector access:public signature:(iterator __position) +erase cpp_src/stl_deque.h /^ erase(iterator __first, iterator __last);$/;" p class:std::deque access:public signature:(iterator __first, iterator __last) +erase cpp_src/stl_deque.h /^ erase(iterator __position);$/;" p class:std::deque access:public signature:(iterator __position) +erase cpp_src/stl_list.h /^ erase(iterator __first, iterator __last)$/;" f class:std::list access:public signature:(iterator __first, iterator __last) +erase cpp_src/stl_list.h /^ erase(iterator __position);$/;" p class:std::list access:public signature:(iterator __position) +erase cpp_src/stl_map.h /^ erase(const key_type& __x)$/;" f class:std::map access:public signature:(const key_type& __x) +erase cpp_src/stl_map.h /^ erase(iterator __first, iterator __last)$/;" f class:std::map access:public signature:(iterator __first, iterator __last) +erase cpp_src/stl_map.h /^ erase(iterator __position)$/;" f class:std::map access:public signature:(iterator __position) +erase cpp_src/stl_multimap.h /^ erase(const key_type& __x)$/;" f class:std::multimap access:public signature:(const key_type& __x) +erase cpp_src/stl_multimap.h /^ erase(iterator __first, iterator __last)$/;" f class:std::multimap access:public signature:(iterator __first, iterator __last) +erase cpp_src/stl_multimap.h /^ erase(iterator __position)$/;" f class:std::multimap access:public signature:(iterator __position) +erase cpp_src/stl_multiset.h /^ erase(const key_type& __x)$/;" f class:std::multiset access:public signature:(const key_type& __x) +erase cpp_src/stl_multiset.h /^ erase(iterator __first, iterator __last)$/;" f class:std::multiset access:public signature:(iterator __first, iterator __last) +erase cpp_src/stl_multiset.h /^ erase(iterator __position)$/;" f class:std::multiset access:public signature:(iterator __position) +erase cpp_src/stl_set.h /^ erase(const key_type& __x)$/;" f class:std::set access:public signature:(const key_type& __x) +erase cpp_src/stl_set.h /^ erase(iterator __first, iterator __last)$/;" f class:std::set access:public signature:(iterator __first, iterator __last) +erase cpp_src/stl_set.h /^ erase(iterator __position)$/;" f class:std::set access:public signature:(iterator __position) +erase cpp_src/stl_tree.h /^ erase(const key_type& __x);$/;" p class:std::_Rb_tree access:public signature:(const key_type& __x) +erase cpp_src/stl_tree.h /^ erase(const key_type* __first, const key_type* __last);$/;" p class:std::_Rb_tree access:public signature:(const key_type* __first, const key_type* __last) +erase cpp_src/stl_tree.h /^ erase(const_iterator __first, const_iterator __last);$/;" p class:std::_Rb_tree access:public signature:(const_iterator __first, const_iterator __last) +erase cpp_src/stl_tree.h /^ erase(const_iterator __position);$/;" p class:std::_Rb_tree access:public signature:(const_iterator __position) +erase cpp_src/stl_tree.h /^ erase(iterator __first, iterator __last);$/;" p class:std::_Rb_tree access:public signature:(iterator __first, iterator __last) +erase cpp_src/stl_tree.h /^ erase(iterator __position);$/;" p class:std::_Rb_tree access:public signature:(iterator __position) +erase cpp_src/stl_tree.h /^ erase(const _Key& __x)$/;" f class:std::_Rb_tree signature:(const _Key& __x) +erase cpp_src/stl_tree.h /^ erase(const _Key* __first, const _Key* __last)$/;" f class:std::_Rb_tree signature:(const _Key* __first, const _Key* __last) +erase cpp_src/stl_tree.h /^ erase(const_iterator __first, const_iterator __last)$/;" f class:std::_Rb_tree signature:(const_iterator __first, const_iterator __last) +erase cpp_src/stl_tree.h /^ erase(const_iterator __position)$/;" f class:std::_Rb_tree signature:(const_iterator __position) +erase cpp_src/stl_tree.h /^ erase(iterator __first, iterator __last)$/;" f class:std::_Rb_tree signature:(iterator __first, iterator __last) +erase cpp_src/stl_tree.h /^ erase(iterator __position)$/;" f class:std::_Rb_tree signature:(iterator __position) +erase cpp_src/stl_vector.h /^ erase(iterator __first, iterator __last);$/;" p class:std::vector access:public signature:(iterator __first, iterator __last) +erase cpp_src/stl_vector.h /^ erase(iterator __position);$/;" p class:std::vector access:public signature:(iterator __position) +erase cpp_src/vector.tcc /^ erase(iterator __first, iterator __last)$/;" f class:std::vector signature:(iterator __first, iterator __last) +erase cpp_src/vector.tcc /^ erase(iterator __position)$/;" f class:std::vector signature:(iterator __position) +erase_event cpp_src/ios_base.h /^ erase_event,$/;" e enum:std::ios_base::event +errno cpp_src/cerrno 54;" d file: +error cpp_src/codecvt.h /^ error,$/;" e enum:std::codecvt_base::result +event cpp_src/ios_base.h /^ enum event$/;" g class:std::ios_base access:public +event_callback cpp_src/ios_base.h /^ typedef void (*event_callback) (event, ios_base&, int);$/;" t class:std::ios_base access:public +exception cpp_src/exception /^ exception() throw() { }$/;" f class:std::exception access:public signature:() +exception cpp_src/exception /^ class exception $/;" c namespace:std file: +exceptions cpp_src/basic_ios.h /^ exceptions() const$/;" f class:std::basic_ios access:public signature:() const +exceptions cpp_src/basic_ios.h /^ exceptions(iostate __except)$/;" f class:std::basic_ios access:public signature:(iostate __except) +exit cpp_src/cstdlib /^ extern "C" void exit(int);$/;" p namespace:std file: signature:(int) +exp cpp_src/cmath /^ exp(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +exp cpp_src/cmath /^ exp(float __x)$/;" f namespace:std signature:(float __x) +exp cpp_src/cmath /^ exp(long double __x)$/;" f namespace:std signature:(long double __x) +exp cpp_src/cmath 66;" d file: +exp cpp_src/complex /^ exp(const complex<_Tp>& __z) { return __complex_exp(__z); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +exp cpp_src/complex /^ exp(const complex<_Tp>& __z) { return __complex_exp(__z.__rep()); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +exp cpp_src/complex /^ template complex<_Tp> exp(const complex<_Tp>&);$/;" p namespace:std file: signature:(const complex<_Tp>&) +extern_type cpp_src/codecvt.h /^ typedef _ExternT extern_type;$/;" t class:std::__codecvt_abstract_base access:public +extern_type cpp_src/codecvt.h /^ typedef _ExternT extern_type;$/;" t class:std::codecvt access:public +extern_type cpp_src/codecvt.h /^ typedef char extern_type;$/;" t class:std::codecvt access:public +fabs cpp_src/cmath /^ fabs(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +fabs cpp_src/cmath /^ fabs(float __x)$/;" f namespace:std signature:(float __x) +fabs cpp_src/cmath /^ fabs(long double __x)$/;" f namespace:std signature:(long double __x) +fabs cpp_src/cmath 67;" d file: +facet cpp_src/locale_classes.h /^ facet(const facet&); \/\/ Not defined.$/;" p class:std::locale::facet access:private signature:(const facet&) +facet cpp_src/locale_classes.h /^ facet(size_t __refs = 0) throw() : _M_refcount(__refs ? 1 : 0)$/;" f class:std::locale::facet access:protected signature:(size_t __refs = 0) +facet cpp_src/locale_classes.h /^ class locale::facet$/;" c class:std::locale +fail cpp_src/basic_ios.h /^ fail() const$/;" f class:std::basic_ios access:public signature:() const +failbit cpp_src/ios_base.h /^ static const iostate failbit = _S_failbit;$/;" m class:std::ios_base access:public +failed cpp_src/streambuf_iterator.h /^ failed() const throw()$/;" f class:std::ostreambuf_iterator access:public signature:() const +failure cpp_src/ios_base.h /^ failure(const string& __str) throw();$/;" p class:std::ios_base::failure access:public signature:(const string& __str) +failure cpp_src/ios_base.h /^ class failure : public exception$/;" c class:std::ios_base inherits:exception access:public +falsename cpp_src/locale_facets.h /^ falsename() const$/;" f class:std::numpunct access:public signature:() const +fclose cpp_src/cstdio 57;" d file: +feof cpp_src/cstdio 58;" d file: +ferror cpp_src/cstdio 59;" d file: +fflush cpp_src/cstdio 60;" d file: +fgetc cpp_src/cstdio 61;" d file: +fgetpos cpp_src/cstdio 62;" d file: +fgets cpp_src/cstdio 63;" d file: +fgetwc cpp_src/cwchar 78;" d file: +fgetws cpp_src/cwchar 79;" d file: +field cpp_src/locale_facets.h /^ struct pattern { char field[4]; };$/;" m struct:std::money_base::pattern access:public +filebuf cpp_src/iosfwd /^ typedef basic_filebuf filebuf; \/\/\/< @isiosfwd$/;" t namespace:std file: +fill cpp_src/basic_ios.h /^ fill() const$/;" f class:std::basic_ios access:public signature:() const +fill cpp_src/basic_ios.h /^ fill(char_type __ch)$/;" f class:std::basic_ios access:public signature:(char_type __ch) +fill cpp_src/deque.tcc /^ fill(const _Deque_iterator<_Tp, _Tp&, _Tp*>& __first,$/;" f namespace:std signature:(const _Deque_iterator<_Tp, _Tp&, _Tp*>& __first, const _Deque_iterator<_Tp, _Tp&, _Tp*>& __last, const _Tp& __value) +fill cpp_src/stl_algobase.h /^ fill(_ForwardIterator __first, _ForwardIterator __last,$/;" f struct:std::__fill access:public signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) +fill cpp_src/stl_algobase.h /^ fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value)$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) +fill cpp_src/stl_algobase.h /^ fill(char* __first, char* __last, const char& __c)$/;" f namespace:std signature:(char* __first, char* __last, const char& __c) +fill cpp_src/stl_algobase.h /^ fill(signed char* __first, signed char* __last, const signed char& __c)$/;" f namespace:std signature:(signed char* __first, signed char* __last, const signed char& __c) +fill cpp_src/stl_algobase.h /^ fill(unsigned char* __first, unsigned char* __last, const unsigned char& __c)$/;" f namespace:std signature:(unsigned char* __first, unsigned char* __last, const unsigned char& __c) +fill cpp_src/stl_bvector.h /^ fill(_Bit_iterator __first, _Bit_iterator __last, const bool& __x)$/;" f namespace:std signature:(_Bit_iterator __first, _Bit_iterator __last, const bool& __x) +fill cpp_src/stl_deque.h /^ fill(const _Deque_iterator<_Tp, _Tp&, _Tp*>& __first,$/;" p namespace:std signature:(const _Deque_iterator<_Tp, _Tp&, _Tp*>& __first, const _Deque_iterator<_Tp, _Tp&, _Tp*>& __last, const _Tp& __value) +fill_n cpp_src/stl_algobase.h /^ fill_n(_OutputIterator __first, _Size __n, const _Tp& __value)$/;" f struct:std::__fill_n access:public signature:(_OutputIterator __first, _Size __n, const _Tp& __value) +fill_n cpp_src/stl_algobase.h /^ fill_n(_OutputIterator __first, _Size __n, const _Tp& __value)$/;" f namespace:std signature:(_OutputIterator __first, _Size __n, const _Tp& __value) +fill_n cpp_src/stl_algobase.h /^ fill_n(char* __first, _Size __n, const char& __c)$/;" f namespace:std signature:(char* __first, _Size __n, const char& __c) +fill_n cpp_src/stl_algobase.h /^ fill_n(signed char* __first, _Size __n, const signed char& __c)$/;" f namespace:std signature:(signed char* __first, _Size __n, const signed char& __c) +fill_n cpp_src/stl_algobase.h /^ fill_n(unsigned char* __first, _Size __n, const unsigned char& __c)$/;" f namespace:std signature:(unsigned char* __first, _Size __n, const unsigned char& __c) +find cpp_src/basic_string.h /^ find(_CharT __c, size_type __pos = 0) const;$/;" p class:std::basic_string access:public signature:(_CharT __c, size_type __pos = 0) const +find cpp_src/basic_string.h /^ find(const _CharT* __s, size_type __pos = 0) const$/;" f class:std::basic_string access:public signature:(const _CharT* __s, size_type __pos = 0) const +find cpp_src/basic_string.h /^ find(const _CharT* __s, size_type __pos, size_type __n) const;$/;" p class:std::basic_string access:public signature:(const _CharT* __s, size_type __pos, size_type __n) const +find cpp_src/basic_string.h /^ find(const basic_string& __str, size_type __pos = 0) const$/;" f class:std::basic_string access:public signature:(const basic_string& __str, size_type __pos = 0) const +find cpp_src/basic_string.tcc /^ find(_CharT __c, size_type __pos) const$/;" f class:std::basic_string signature:(_CharT __c, size_type __pos) const +find cpp_src/basic_string.tcc /^ find(const _CharT* __s, size_type __pos, size_type __n) const$/;" f class:std::basic_string signature:(const _CharT* __s, size_type __pos, size_type __n) const +find cpp_src/char_traits.h /^ find(const char_type* __s, std::size_t __n, const char_type& __a);$/;" p struct:char_traits access:public signature:(const char_type* __s, std::size_t __n, const char_type& __a) +find cpp_src/char_traits.h /^ find(const char_type* __s, std::size_t __n, const char_type& __a)$/;" f class:char_traits signature:(const char_type* __s, std::size_t __n, const char_type& __a) +find cpp_src/stl_algo.h /^ find(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, const _Tp& __val) +find cpp_src/stl_algo.h /^ find(istreambuf_iterator<_CharT>, istreambuf_iterator<_CharT>,$/;" p namespace:std signature:(istreambuf_iterator<_CharT>, istreambuf_iterator<_CharT>, const _CharT&) +find cpp_src/stl_map.h /^ find(const key_type& __x) const$/;" f class:std::map access:public signature:(const key_type& __x) const +find cpp_src/stl_map.h /^ find(const key_type& __x)$/;" f class:std::map access:public signature:(const key_type& __x) +find cpp_src/stl_multimap.h /^ find(const key_type& __x) const$/;" f class:std::multimap access:public signature:(const key_type& __x) const +find cpp_src/stl_multimap.h /^ find(const key_type& __x)$/;" f class:std::multimap access:public signature:(const key_type& __x) +find cpp_src/stl_multiset.h /^ find(const key_type& __x) const$/;" f class:std::multiset access:public signature:(const key_type& __x) const +find cpp_src/stl_multiset.h /^ find(const key_type& __x)$/;" f class:std::multiset access:public signature:(const key_type& __x) +find cpp_src/stl_set.h /^ find(const key_type& __x) const$/;" f class:std::set access:public signature:(const key_type& __x) const +find cpp_src/stl_set.h /^ find(const key_type& __x)$/;" f class:std::set access:public signature:(const key_type& __x) +find cpp_src/stl_tree.h /^ find(const key_type& __x) const;$/;" p class:std::_Rb_tree access:public signature:(const key_type& __x) const +find cpp_src/stl_tree.h /^ find(const key_type& __x);$/;" p class:std::_Rb_tree access:public signature:(const key_type& __x) +find cpp_src/stl_tree.h /^ find(const _Key& __k) const$/;" f class:std::_Rb_tree signature:(const _Key& __k) const +find cpp_src/stl_tree.h /^ find(const _Key& __k)$/;" f class:std::_Rb_tree signature:(const _Key& __k) +find cpp_src/streambuf /^ find(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>,$/;" p class:std::basic_streambuf file: access:friend signature:(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, const _CharT2&) +find cpp_src/streambuf_iterator.h /^ find(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>,$/;" p class:std::istreambuf_iterator access:friend signature:(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, const _CharT2&) +find cpp_src/streambuf_iterator.h /^ find(istreambuf_iterator<_CharT> __first,$/;" f namespace:std signature:(istreambuf_iterator<_CharT> __first, istreambuf_iterator<_CharT> __last, const _CharT& __val) +find_end cpp_src/stl_algo.h /^ find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,$/;" f namespace:std signature:(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2) +find_end cpp_src/stl_algo.h /^ find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,$/;" f namespace:std signature:(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __comp) +find_first_not_of cpp_src/basic_string.h /^ find_first_not_of(_CharT __c, size_type __pos = 0) const;$/;" p class:std::basic_string access:public signature:(_CharT __c, size_type __pos = 0) const +find_first_not_of cpp_src/basic_string.h /^ find_first_not_of(const _CharT* __s, size_type __pos = 0) const$/;" f class:std::basic_string access:public signature:(const _CharT* __s, size_type __pos = 0) const +find_first_not_of cpp_src/basic_string.h /^ find_first_not_of(const _CharT* __s, size_type __pos,$/;" p class:std::basic_string access:public signature:(const _CharT* __s, size_type __pos, size_type __n) const +find_first_not_of cpp_src/basic_string.h /^ find_first_not_of(const basic_string& __str, size_type __pos = 0) const$/;" f class:std::basic_string access:public signature:(const basic_string& __str, size_type __pos = 0) const +find_first_not_of cpp_src/basic_string.tcc /^ find_first_not_of(_CharT __c, size_type __pos) const$/;" f class:std::basic_string signature:(_CharT __c, size_type __pos) const +find_first_not_of cpp_src/basic_string.tcc /^ find_first_not_of(const _CharT* __s, size_type __pos, size_type __n) const$/;" f class:std::basic_string signature:(const _CharT* __s, size_type __pos, size_type __n) const +find_first_of cpp_src/basic_string.h /^ find_first_of(_CharT __c, size_type __pos = 0) const$/;" f class:std::basic_string access:public signature:(_CharT __c, size_type __pos = 0) const +find_first_of cpp_src/basic_string.h /^ find_first_of(const _CharT* __s, size_type __pos = 0) const$/;" f class:std::basic_string access:public signature:(const _CharT* __s, size_type __pos = 0) const +find_first_of cpp_src/basic_string.h /^ find_first_of(const _CharT* __s, size_type __pos, size_type __n) const;$/;" p class:std::basic_string access:public signature:(const _CharT* __s, size_type __pos, size_type __n) const +find_first_of cpp_src/basic_string.h /^ find_first_of(const basic_string& __str, size_type __pos = 0) const$/;" f class:std::basic_string access:public signature:(const basic_string& __str, size_type __pos = 0) const +find_first_of cpp_src/basic_string.tcc /^ find_first_of(const _CharT* __s, size_type __pos, size_type __n) const$/;" f class:std::basic_string signature:(const _CharT* __s, size_type __pos, size_type __n) const +find_first_of cpp_src/stl_algo.h /^ find_first_of(_InputIterator __first1, _InputIterator __last1,$/;" f namespace:std signature:(_InputIterator __first1, _InputIterator __last1, _ForwardIterator __first2, _ForwardIterator __last2) +find_first_of cpp_src/stl_algo.h /^ find_first_of(_InputIterator __first1, _InputIterator __last1,$/;" f namespace:std signature:(_InputIterator __first1, _InputIterator __last1, _ForwardIterator __first2, _ForwardIterator __last2, _BinaryPredicate __comp) +find_if cpp_src/stl_algo.h /^ find_if(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _Predicate __pred) +find_last_not_of cpp_src/basic_string.h /^ find_last_not_of(_CharT __c, size_type __pos = npos) const;$/;" p class:std::basic_string access:public signature:(_CharT __c, size_type __pos = npos) const +find_last_not_of cpp_src/basic_string.h /^ find_last_not_of(const _CharT* __s, size_type __pos = npos) const$/;" f class:std::basic_string access:public signature:(const _CharT* __s, size_type __pos = npos) const +find_last_not_of cpp_src/basic_string.h /^ find_last_not_of(const _CharT* __s, size_type __pos,$/;" p class:std::basic_string access:public signature:(const _CharT* __s, size_type __pos, size_type __n) const +find_last_not_of cpp_src/basic_string.h /^ find_last_not_of(const basic_string& __str, size_type __pos = npos) const$/;" f class:std::basic_string access:public signature:(const basic_string& __str, size_type __pos = npos) const +find_last_not_of cpp_src/basic_string.tcc /^ find_last_not_of(_CharT __c, size_type __pos) const$/;" f class:std::basic_string signature:(_CharT __c, size_type __pos) const +find_last_not_of cpp_src/basic_string.tcc /^ find_last_not_of(const _CharT* __s, size_type __pos, size_type __n) const$/;" f class:std::basic_string signature:(const _CharT* __s, size_type __pos, size_type __n) const +find_last_of cpp_src/basic_string.h /^ find_last_of(_CharT __c, size_type __pos = npos) const$/;" f class:std::basic_string access:public signature:(_CharT __c, size_type __pos = npos) const +find_last_of cpp_src/basic_string.h /^ find_last_of(const _CharT* __s, size_type __pos = npos) const$/;" f class:std::basic_string access:public signature:(const _CharT* __s, size_type __pos = npos) const +find_last_of cpp_src/basic_string.h /^ find_last_of(const _CharT* __s, size_type __pos, size_type __n) const;$/;" p class:std::basic_string access:public signature:(const _CharT* __s, size_type __pos, size_type __n) const +find_last_of cpp_src/basic_string.h /^ find_last_of(const basic_string& __str, size_type __pos = npos) const$/;" f class:std::basic_string access:public signature:(const basic_string& __str, size_type __pos = npos) const +find_last_of cpp_src/basic_string.tcc /^ find_last_of(const _CharT* __s, size_type __pos, size_type __n) const$/;" f class:std::basic_string signature:(const _CharT* __s, size_type __pos, size_type __n) const +first cpp_src/stl_pair.h /^ _T1 first; \/\/\/< @c first is a copy of the first object$/;" m struct:std::pair access:public +first_argument_type cpp_src/stl_function.h /^ typedef _Arg1 first_argument_type; \/\/\/< the type of the first argument$/;" t struct:std::binary_function access:public +first_type cpp_src/stl_pair.h /^ typedef _T1 first_type; \/\/\/< @c first_type is the first bound type$/;" t struct:std::pair access:public +fixed cpp_src/ios_base.h /^ static const fmtflags fixed = _S_fixed;$/;" m class:std::ios_base access:public +fixed cpp_src/ios_base.h /^ fixed(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +flags cpp_src/ios_base.h /^ flags() const { return _M_flags; }$/;" f class:std::ios_base access:public signature:() const +flags cpp_src/ios_base.h /^ flags(fmtflags __fmtfl)$/;" f class:std::ios_base access:public signature:(fmtflags __fmtfl) +flip cpp_src/bitset /^ flip()$/;" f class:std::bitset::reference access:public signature:() +flip cpp_src/bitset /^ flip()$/;" f class:std::bitset access:public signature:() +flip cpp_src/bitset /^ flip(size_t __position)$/;" f class:std::bitset access:public signature:(size_t __position) +flip cpp_src/bitset /^ flip(size_t)$/;" f class:std::bitset signature:(size_t) +flip cpp_src/stl_bvector.h /^ flip()$/;" f class:std::vector access:public signature:() +flip cpp_src/stl_bvector.h /^ flip()$/;" f struct:std::_Bit_reference access:public signature:() +float_denorm_style cpp_src/limits /^ enum float_denorm_style$/;" g namespace:std file: +float_round_style cpp_src/limits /^ enum float_round_style$/;" g namespace:std file: +floatfield cpp_src/ios_base.h /^ static const fmtflags floatfield = _S_floatfield;$/;" m class:std::ios_base access:public +floor cpp_src/cmath /^ floor(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +floor cpp_src/cmath /^ floor(float __x)$/;" f namespace:std signature:(float __x) +floor cpp_src/cmath /^ floor(long double __x)$/;" f namespace:std signature:(long double __x) +floor cpp_src/cmath 68;" d file: +flush cpp_src/ostream /^ flush();$/;" p class:std::basic_ostream file: access:public signature:() +flush cpp_src/ostream /^ flush(basic_ostream<_CharT, _Traits>& __os)$/;" f namespace:std signature:(basic_ostream<_CharT, _Traits>& __os) +flush cpp_src/ostream.tcc /^ flush()$/;" f class:std::basic_ostream signature:() +flush cpp_src/ostream.tcc /^ extern template ostream& flush(ostream&);$/;" p namespace:std file: signature:(ostream&) +flush cpp_src/ostream.tcc /^ extern template wostream& flush(wostream&);$/;" p namespace:std file: signature:(wostream&) +fmod cpp_src/cmath /^ fmod(float __x, float __y)$/;" f namespace:std signature:(float __x, float __y) +fmod cpp_src/cmath /^ fmod(long double __x, long double __y)$/;" f namespace:std signature:(long double __x, long double __y) +fmod cpp_src/cmath 69;" d file: +fmtflags cpp_src/ios_base.h /^ typedef _Ios_Fmtflags fmtflags;$/;" t class:std::ios_base access:public +fopen cpp_src/cstdio 64;" d file: +for_each cpp_src/stl_algo.h /^ for_each(_InputIterator __first, _InputIterator __last, _Function __f)$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _Function __f) +forward_iterator_tag cpp_src/stl_iterator_base_types.h /^ struct forward_iterator_tag : public input_iterator_tag {};$/;" s namespace:std inherits:input_iterator_tag +fpos cpp_src/postypes.h /^ fpos()$/;" f class:std::fpos access:public signature:() +fpos cpp_src/postypes.h /^ fpos(streamoff __off)$/;" f class:std::fpos access:public signature:(streamoff __off) +fpos cpp_src/postypes.h /^ class fpos$/;" c namespace:std +fprintf cpp_src/cstdio 65;" d file: +fputc cpp_src/cstdio 66;" d file: +fputs cpp_src/cstdio 67;" d file: +fputwc cpp_src/cwchar 80;" d file: +fputws cpp_src/cwchar 81;" d file: +frac_digits cpp_src/locale_facets.h /^ frac_digits() const$/;" f class:std::moneypunct access:public signature:() const +fread cpp_src/cstdio 68;" d file: +freopen cpp_src/cstdio 69;" d file: +frexp cpp_src/cmath /^ frexp(_Tp __x, int* __exp)$/;" f namespace:std signature:(_Tp __x, int* __exp) +frexp cpp_src/cmath /^ frexp(float __x, int* __exp)$/;" f namespace:std signature:(float __x, int* __exp) +frexp cpp_src/cmath /^ frexp(long double __x, int* __exp)$/;" f namespace:std signature:(long double __x, int* __exp) +frexp cpp_src/cmath 70;" d file: +front cpp_src/stl_bvector.h /^ front() const$/;" f class:std::vector access:public signature:() const +front cpp_src/stl_bvector.h /^ front()$/;" f class:std::vector access:public signature:() +front cpp_src/stl_deque.h /^ front() const$/;" f class:std::deque access:public signature:() const +front cpp_src/stl_deque.h /^ front()$/;" f class:std::deque access:public signature:() +front cpp_src/stl_list.h /^ front() const$/;" f class:std::list access:public signature:() const +front cpp_src/stl_list.h /^ front()$/;" f class:std::list access:public signature:() +front cpp_src/stl_queue.h /^ front() const$/;" f class:std::queue access:public signature:() const +front cpp_src/stl_queue.h /^ front()$/;" f class:std::queue access:public signature:() +front cpp_src/stl_vector.h /^ front() const$/;" f class:std::vector access:public signature:() const +front cpp_src/stl_vector.h /^ front()$/;" f class:std::vector access:public signature:() +front_insert_iterator cpp_src/stl_iterator.h /^ explicit front_insert_iterator(_Container& __x) : container(&__x) { }$/;" f class:std::front_insert_iterator access:public signature:(_Container& __x) +front_insert_iterator cpp_src/stl_iterator.h /^ class front_insert_iterator$/;" c namespace:std inherits:iterator +front_inserter cpp_src/stl_iterator.h /^ front_inserter(_Container& __x)$/;" f namespace:std signature:(_Container& __x) +fscanf cpp_src/cstdio 70;" d file: +fseek cpp_src/cstdio 71;" d file: +fsetpos cpp_src/cstdio 72;" d file: +fstream cpp_src/iosfwd /^ typedef basic_fstream fstream; \/\/\/< @isiosfwd$/;" t namespace:std file: +ftell cpp_src/cstdio 73;" d file: +func cpp_src/valarray /^ _Expr<_RefFunClos<_ValArray, _Tp>, _Tp> apply(_Tp func(const _Tp&)) const;$/;" p class:std::valarray file: access:public signature:(const _Tp&) const +func cpp_src/valarray /^ _Expr<_ValFunClos<_ValArray, _Tp>, _Tp> apply(_Tp func(_Tp)) const;$/;" p class:std::valarray file: access:public signature:(_Tp) const +func cpp_src/valarray /^ valarray<_Tp>::apply(_Tp func(_Tp)) const$/;" f class:std::valarray signature:(_Tp) const +func cpp_src/valarray /^ valarray<_Tp>::apply(_Tp func(const _Tp &)) const$/;" f class:std::valarray signature:(const _Tp &) const +fwide cpp_src/cwchar 82;" d file: +fwprintf cpp_src/cwchar 83;" d file: +fwrite cpp_src/cstdio 74;" d file: +fwscanf cpp_src/cwchar 84;" d file: +gbump cpp_src/streambuf /^ gbump(int __n) { _M_in_cur += __n; }$/;" f class:std::basic_streambuf access:protected signature:(int __n) +gcount cpp_src/istream /^ gcount() const $/;" f class:std::basic_istream access:public signature:() const +generate cpp_src/stl_algo.h /^ generate(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) +generate_n cpp_src/stl_algo.h /^ generate_n(_OutputIterator __first, _Size __n, _Generator __gen)$/;" f namespace:std signature:(_OutputIterator __first, _Size __n, _Generator __gen) +get cpp_src/istream /^ get();$/;" p class:std::basic_istream file: access:public signature:() +get cpp_src/istream /^ get(__streambuf_type& __sb)$/;" f class:std::basic_istream access:public signature:(__streambuf_type& __sb) +get cpp_src/istream /^ get(__streambuf_type& __sb, char_type __delim);$/;" p class:std::basic_istream file: access:public signature:(__streambuf_type& __sb, char_type __delim) +get cpp_src/istream /^ get(char_type& __c);$/;" p class:std::basic_istream file: access:public signature:(char_type& __c) +get cpp_src/istream /^ get(char_type* __s, streamsize __n)$/;" f class:std::basic_istream access:public signature:(char_type* __s, streamsize __n) +get cpp_src/istream /^ get(char_type* __s, streamsize __n, char_type __delim);$/;" p class:std::basic_istream file: access:public signature:(char_type* __s, streamsize __n, char_type __delim) +get cpp_src/istream.tcc /^ get(__streambuf_type& __sb, char_type __delim)$/;" f class:std::basic_istream signature:(__streambuf_type& __sb, char_type __delim) +get cpp_src/istream.tcc /^ get(char_type& __c)$/;" f class:std::basic_istream signature:(char_type& __c) +get cpp_src/istream.tcc /^ get(char_type* __s, streamsize __n, char_type __delim)$/;" f class:std::basic_istream signature:(char_type* __s, streamsize __n, char_type __delim) +get cpp_src/istream.tcc /^ get(void)$/;" f class:std::basic_istream signature:(void) +get cpp_src/locale_facets.h /^ get(catalog __c, int __set, int __msgid, const string_type& __s) const$/;" f class:std::messages access:public signature:(catalog __c, int __set, int __msgid, const string_type& __s) const +get cpp_src/locale_facets.h /^ get(iter_type __in, iter_type __end, ios_base& __io,$/;" f class:std::num_get access:public signature:(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, bool& __v) const +get cpp_src/locale_facets.h /^ get(iter_type __in, iter_type __end, ios_base& __io,$/;" f class:std::num_get access:public signature:(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, double& __v) const +get cpp_src/locale_facets.h /^ get(iter_type __in, iter_type __end, ios_base& __io,$/;" f class:std::num_get access:public signature:(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, float& __v) const +get cpp_src/locale_facets.h /^ get(iter_type __in, iter_type __end, ios_base& __io,$/;" f class:std::num_get access:public signature:(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, long double& __v) const +get cpp_src/locale_facets.h /^ get(iter_type __in, iter_type __end, ios_base& __io,$/;" f class:std::num_get access:public signature:(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, long long& __v) const +get cpp_src/locale_facets.h /^ get(iter_type __in, iter_type __end, ios_base& __io,$/;" f class:std::num_get access:public signature:(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, long& __v) const +get cpp_src/locale_facets.h /^ get(iter_type __in, iter_type __end, ios_base& __io,$/;" f class:std::num_get access:public signature:(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, unsigned int& __v) const +get cpp_src/locale_facets.h /^ get(iter_type __in, iter_type __end, ios_base& __io,$/;" f class:std::num_get access:public signature:(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, unsigned long long& __v) const +get cpp_src/locale_facets.h /^ get(iter_type __in, iter_type __end, ios_base& __io,$/;" f class:std::num_get access:public signature:(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, unsigned long& __v) const +get cpp_src/locale_facets.h /^ get(iter_type __in, iter_type __end, ios_base& __io,$/;" f class:std::num_get access:public signature:(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, unsigned short& __v) const +get cpp_src/locale_facets.h /^ get(iter_type __in, iter_type __end, ios_base& __io,$/;" f class:std::num_get access:public signature:(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, void*& __v) const +get cpp_src/locale_facets.h /^ get(iter_type __s, iter_type __end, bool __intl, ios_base& __io,$/;" f class:std::money_get access:public signature:(iter_type __s, iter_type __end, bool __intl, ios_base& __io, ios_base::iostate& __err, long double& __units) const +get cpp_src/locale_facets.h /^ get(iter_type __s, iter_type __end, bool __intl, ios_base& __io,$/;" f class:std::money_get access:public signature:(iter_type __s, iter_type __end, bool __intl, ios_base& __io, ios_base::iostate& __err, string_type& __digits) const +get cpp_src/memory /^ get() const throw() { return _M_ptr; }$/;" f class:std::auto_ptr access:public signature:() const +get_allocator cpp_src/basic_string.h /^ get_allocator() const$/;" f class:std::basic_string access:public signature:() const +get_allocator cpp_src/stl_bvector.h /^ get_allocator() const$/;" f struct:std::_Bvector_base access:public signature:() const +get_allocator cpp_src/stl_bvector.h /^ allocator_type get_allocator() const$/;" f class:std::vector access:public signature:() const +get_allocator cpp_src/stl_deque.h /^ get_allocator() const$/;" f class:std::_Deque_base access:public signature:() const +get_allocator cpp_src/stl_deque.h /^ get_allocator() const$/;" f class:std::deque access:public signature:() const +get_allocator cpp_src/stl_list.h /^ get_allocator() const$/;" f class:std::_List_base access:public signature:() const +get_allocator cpp_src/stl_list.h /^ get_allocator() const$/;" f class:std::list access:public signature:() const +get_allocator cpp_src/stl_map.h /^ get_allocator() const$/;" f class:std::map access:public signature:() const +get_allocator cpp_src/stl_multimap.h /^ get_allocator() const$/;" f class:std::multimap access:public signature:() const +get_allocator cpp_src/stl_multiset.h /^ get_allocator() const$/;" f class:std::multiset access:public signature:() const +get_allocator cpp_src/stl_set.h /^ get_allocator() const$/;" f class:std::set access:public signature:() const +get_allocator cpp_src/stl_tree.h /^ get_allocator() const$/;" f class:std::_Rb_tree access:public signature:() const +get_allocator cpp_src/stl_vector.h /^ get_allocator() const$/;" f struct:std::_Vector_base access:public signature:() const +get_date cpp_src/locale_facets.h /^ get_date(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::time_get access:public signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, tm* __tm) const +get_monthname cpp_src/locale_facets.h /^ get_monthname(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::time_get access:public signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, tm* __tm) const +get_temporary_buffer cpp_src/memory /^ get_temporary_buffer(ptrdiff_t __len)$/;" f namespace:std signature:(ptrdiff_t __len) +get_time cpp_src/locale_facets.h /^ get_time(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::time_get access:public signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, tm* __tm) const +get_weekday cpp_src/locale_facets.h /^ get_weekday(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::time_get access:public signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, tm* __tm) const +get_year cpp_src/locale_facets.h /^ get_year(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::time_get access:public signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, tm* __tm) const +getc cpp_src/cstdio 75;" d file: +getchar cpp_src/cstdio 76;" d file: +getline cpp_src/basic_string.h /^ getline(basic_istream<_CharT, _Traits>& __is,$/;" f namespace:std signature:(basic_istream<_CharT, _Traits>& __is, basic_string<_CharT, _Traits, _Alloc>& __str) +getline cpp_src/basic_string.h /^ getline(basic_istream<_CharT, _Traits>& __is,$/;" p namespace:std signature:(basic_istream<_CharT, _Traits>& __is, basic_string<_CharT, _Traits, _Alloc>& __str, _CharT __delim) +getline cpp_src/basic_string.h /^ getline(basic_istream& __in, basic_string& __str,$/;" p namespace:std signature:(basic_istream& __in, basic_string& __str, char __delim) +getline cpp_src/basic_string.h /^ getline(basic_istream& __in, basic_string& __str,$/;" p namespace:std signature:(basic_istream& __in, basic_string& __str, wchar_t __delim) +getline cpp_src/basic_string.tcc /^ getline(basic_istream&, string&);$/;" p namespace:std file: signature:(basic_istream&, string&) +getline cpp_src/basic_string.tcc /^ getline(basic_istream&, string&, char);$/;" p namespace:std file: signature:(basic_istream&, string&, char) +getline cpp_src/basic_string.tcc /^ getline(basic_istream&, wstring&);$/;" p namespace:std file: signature:(basic_istream&, wstring&) +getline cpp_src/basic_string.tcc /^ getline(basic_istream&, wstring&, wchar_t);$/;" p namespace:std file: signature:(basic_istream&, wstring&, wchar_t) +getline cpp_src/istream /^ getline(char_type* __s, streamsize __n)$/;" f class:std::basic_istream access:public signature:(char_type* __s, streamsize __n) +getline cpp_src/istream /^ getline(char_type* __s, streamsize __n, char_type __delim);$/;" p class:std::basic_istream file: access:public signature:(char_type* __s, streamsize __n, char_type __delim) +getline cpp_src/istream /^ getline(char_type* __s, streamsize __n, char_type __delim);$/;" p class:std::basic_istream file: signature:(char_type* __s, streamsize __n, char_type __delim) +getline cpp_src/istream.tcc /^ getline(basic_istream<_CharT, _Traits>& __in,$/;" f namespace:std signature:(basic_istream<_CharT, _Traits>& __in, basic_string<_CharT, _Traits, _Alloc>& __str, _CharT __delim) +getline cpp_src/istream.tcc /^ getline(char_type* __s, streamsize __n, char_type __delim)$/;" f class:std::basic_istream signature:(char_type* __s, streamsize __n, char_type __delim) +getline cpp_src/streambuf /^ getline(basic_istream<_CharT2, _Traits2>&,$/;" p class:std::basic_streambuf file: access:friend signature:(basic_istream<_CharT2, _Traits2>&, basic_string<_CharT2, _Traits2, _Alloc>&, _CharT2) +getloc cpp_src/ios_base.h /^ getloc() const { return _M_ios_locale; }$/;" f class:std::ios_base access:public signature:() const +getloc cpp_src/streambuf /^ getloc() const$/;" f class:std::basic_streambuf access:public signature:() const +gets cpp_src/cstdio 77;" d file: +getwc cpp_src/cwchar 85;" d file: +getwchar cpp_src/cwchar 86;" d file: +global cpp_src/locale_classes.h /^ global(const locale&);$/;" p class:std::locale access:public signature:(const locale&) +gmtime cpp_src/ctime 60;" d file: +good cpp_src/basic_ios.h /^ good() const$/;" f class:std::basic_ios access:public signature:() const +goodbit cpp_src/ios_base.h /^ static const iostate goodbit = _S_goodbit;$/;" m class:std::ios_base access:public +gptr cpp_src/streambuf /^ gptr() const { return _M_in_cur; }$/;" f class:std::basic_streambuf access:protected signature:() const +greater cpp_src/stl_function.h /^ struct greater : public binary_function<_Tp, _Tp, bool>$/;" s namespace:std inherits:binary_function +greater_equal cpp_src/stl_function.h /^ struct greater_equal : public binary_function<_Tp, _Tp, bool>$/;" s namespace:std inherits:binary_function +grouping cpp_src/locale_facets.h /^ grouping() const$/;" f class:std::moneypunct access:public signature:() const +grouping cpp_src/locale_facets.h /^ grouping() const$/;" f class:std::numpunct access:public signature:() const +gslice cpp_src/gslice.h /^ gslice ();$/;" p class:std::gslice access:public signature:() +gslice cpp_src/gslice.h /^ gslice(const gslice&);$/;" p class:std::gslice access:public signature:(const gslice&) +gslice cpp_src/gslice.h /^ gslice(size_t, const valarray&, const valarray&);$/;" p class:std::gslice access:public signature:(size_t, const valarray&, const valarray&) +gslice cpp_src/gslice.h /^ class gslice$/;" c namespace:std +gslice cpp_src/gslice.h /^ gslice::gslice(const gslice& __g) : _M_index(__g._M_index)$/;" f class:std::gslice signature:(const gslice& __g) +gslice cpp_src/gslice.h /^ gslice::gslice(size_t __o, const valarray& __l,$/;" f class:std::gslice signature:(size_t __o, const valarray& __l, const valarray& __s) +gslice cpp_src/gslice.h /^ inline gslice::gslice () : _M_index(0) {}$/;" f class:std::gslice signature:() +gslice_array cpp_src/gslice_array.h /^ gslice_array();$/;" p class:std::gslice_array access:private signature:() +gslice_array cpp_src/gslice_array.h /^ gslice_array(_Array<_Tp>, const valarray&);$/;" p class:std::gslice_array access:private signature:(_Array<_Tp>, const valarray&) +gslice_array cpp_src/gslice_array.h /^ gslice_array(const gslice_array&);$/;" p class:std::gslice_array access:public signature:(const gslice_array&) +gslice_array cpp_src/gslice_array.h /^ class gslice_array$/;" c namespace:std +gslice_array cpp_src/gslice_array.h /^ gslice_array<_Tp>::gslice_array(_Array<_Tp> __a,$/;" f class:std::gslice_array signature:(_Array<_Tp> __a, const valarray& __i) +gslice_array cpp_src/gslice_array.h /^ gslice_array<_Tp>::gslice_array(const gslice_array<_Tp>& __a)$/;" f class:std::gslice_array signature:(const gslice_array<_Tp>& __a) +has_denorm cpp_src/limits /^ static const float_denorm_style has_denorm = denorm_absent;$/;" m struct:std::numeric_limits file: access:public +has_denorm cpp_src/limits /^ static const float_denorm_style has_denorm$/;" m struct:std::numeric_limits file: access:public +has_denorm cpp_src/limits /^ static const float_denorm_style has_denorm = denorm_absent;$/;" m struct:std::__numeric_limits_base file: access:public +has_denorm_loss cpp_src/limits /^ static const bool has_denorm_loss = __glibcxx_double_has_denorm_loss;$/;" m struct:std::numeric_limits file: access:public +has_denorm_loss cpp_src/limits /^ static const bool has_denorm_loss = __glibcxx_float_has_denorm_loss;$/;" m struct:std::numeric_limits file: access:public +has_denorm_loss cpp_src/limits /^ static const bool has_denorm_loss = false;$/;" m struct:std::numeric_limits file: access:public +has_denorm_loss cpp_src/limits /^ static const bool has_denorm_loss$/;" m struct:std::numeric_limits file: access:public +has_denorm_loss cpp_src/limits /^ static const bool has_denorm_loss = false;$/;" m struct:std::__numeric_limits_base file: access:public +has_facet cpp_src/locale_classes.h /^ has_facet(const locale&) throw ();$/;" p class:std::locale::id access:friend signature:(const locale&) +has_facet cpp_src/locale_classes.h /^ has_facet(const locale&) throw();$/;" p class:std::locale access:friend signature:(const locale&) +has_facet cpp_src/locale_classes.h /^ has_facet(const locale&) throw();$/;" p class:std::locale::_Impl access:friend signature:(const locale&) +has_facet cpp_src/locale_facets.tcc /^ has_facet(const locale& __loc) throw()$/;" f namespace:std signature:(const locale& __loc) +has_facet cpp_src/locale_facets.tcc /^ has_facet<__timepunct >(const locale&);$/;" p namespace:std file: signature:(const locale&) +has_facet cpp_src/locale_facets.tcc /^ has_facet<__timepunct >(const locale&);$/;" p namespace:std file: signature:(const locale&) +has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +has_facet cpp_src/localefwd.h /^ has_facet(const locale& __loc) throw();$/;" p namespace:std signature:(const locale& __loc) +has_infinity cpp_src/limits /^ static const bool has_infinity = __DBL_HAS_INFINITY__;$/;" m struct:std::numeric_limits file: access:public +has_infinity cpp_src/limits /^ static const bool has_infinity = __FLT_HAS_INFINITY__;$/;" m struct:std::numeric_limits file: access:public +has_infinity cpp_src/limits /^ static const bool has_infinity = __LDBL_HAS_INFINITY__;$/;" m struct:std::numeric_limits file: access:public +has_infinity cpp_src/limits /^ static const bool has_infinity = false;$/;" m struct:std::numeric_limits file: access:public +has_infinity cpp_src/limits /^ static const bool has_infinity = false;$/;" m struct:std::__numeric_limits_base file: access:public +has_quiet_NaN cpp_src/limits /^ static const bool has_quiet_NaN = __DBL_HAS_QUIET_NAN__;$/;" m struct:std::numeric_limits file: access:public +has_quiet_NaN cpp_src/limits /^ static const bool has_quiet_NaN = __FLT_HAS_QUIET_NAN__;$/;" m struct:std::numeric_limits file: access:public +has_quiet_NaN cpp_src/limits /^ static const bool has_quiet_NaN = __LDBL_HAS_QUIET_NAN__;$/;" m struct:std::numeric_limits file: access:public +has_quiet_NaN cpp_src/limits /^ static const bool has_quiet_NaN = false;$/;" m struct:std::numeric_limits file: access:public +has_quiet_NaN cpp_src/limits /^ static const bool has_quiet_NaN = false;$/;" m struct:std::__numeric_limits_base file: access:public +has_signaling_NaN cpp_src/limits /^ static const bool has_signaling_NaN = false;$/;" m struct:std::numeric_limits file: access:public +has_signaling_NaN cpp_src/limits /^ static const bool has_signaling_NaN = has_quiet_NaN;$/;" m struct:std::numeric_limits file: access:public +has_signaling_NaN cpp_src/limits /^ static const bool has_signaling_NaN = false;$/;" m struct:std::__numeric_limits_base file: access:public +hash cpp_src/locale_facets.h /^ hash(const _CharT* __lo, const _CharT* __hi) const$/;" f class:std::collate access:public signature:(const _CharT* __lo, const _CharT* __hi) const +hex cpp_src/ios_base.h /^ static const fmtflags hex = _S_hex;$/;" m class:std::ios_base access:public +hex cpp_src/ios_base.h /^ hex(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +hook cpp_src/stl_list.h /^ hook(_List_node_base * const __position);$/;" p struct:std::_List_node_base access:public signature:(_List_node_base * const __position) +id cpp_src/codecvt.h /^ static locale::id id;$/;" m class:std::codecvt access:public +id cpp_src/codecvt.h /^ static locale::id id;$/;" m class:std::codecvt access:public +id cpp_src/codecvt.h /^ locale::id codecvt<_InternT, _ExternT, _StateT>::id;$/;" m class:std::codecvt +id cpp_src/locale_classes.h /^ id() { }$/;" f class:std::locale::id access:public signature:() +id cpp_src/locale_classes.h /^ id(const id&); \/\/ Not defined.$/;" p class:std::locale::id access:private signature:(const id&) +id cpp_src/locale_classes.h /^ class locale::id$/;" c class:std::locale +id cpp_src/locale_facets.h /^ static locale::id id;$/;" m class:std::__timepunct access:public +id cpp_src/locale_facets.h /^ static locale::id id;$/;" m class:std::collate access:public +id cpp_src/locale_facets.h /^ static locale::id id;$/;" m class:std::ctype access:public +id cpp_src/locale_facets.h /^ static locale::id id;$/;" m class:std::messages access:public +id cpp_src/locale_facets.h /^ static locale::id id;$/;" m class:std::money_get access:public +id cpp_src/locale_facets.h /^ static locale::id id;$/;" m class:std::money_put access:public +id cpp_src/locale_facets.h /^ static locale::id id;$/;" m class:std::moneypunct access:public +id cpp_src/locale_facets.h /^ static locale::id id;$/;" m class:std::num_get access:public +id cpp_src/locale_facets.h /^ static locale::id id;$/;" m class:std::numpunct access:public +id cpp_src/locale_facets.h /^ static locale::id id;$/;" m class:std::time_get access:public +id cpp_src/locale_facets.h /^ static locale::id id;$/;" m class:std::time_put access:public +id cpp_src/locale_facets.h /^ static locale::id id;$/;" m class:std::ctype access:public +id cpp_src/locale_facets.h /^ static locale::id id;$/;" m class:std::num_put access:public +id cpp_src/locale_facets.h /^ static locale::id id;$/;" m class:std::ctype access:public +id cpp_src/locale_facets.h /^ locale::id __timepunct<_CharT>::id;$/;" m class:std::__timepunct +id cpp_src/locale_facets.h /^ locale::id collate<_CharT>::id;$/;" m class:std::collate +id cpp_src/locale_facets.h /^ locale::id ctype<_CharT>::id;$/;" m class:std::ctype +id cpp_src/locale_facets.h /^ locale::id messages<_CharT>::id;$/;" m class:std::messages +id cpp_src/locale_facets.h /^ locale::id money_get<_CharT, _InIter>::id;$/;" m class:std::money_get +id cpp_src/locale_facets.h /^ locale::id money_put<_CharT, _OutIter>::id;$/;" m class:std::money_put +id cpp_src/locale_facets.h /^ locale::id moneypunct<_CharT, _Intl>::id;$/;" m class:std::moneypunct +id cpp_src/locale_facets.h /^ locale::id num_get<_CharT, _InIter>::id;$/;" m class:std::num_get +id cpp_src/locale_facets.h /^ locale::id num_put<_CharT, _OutIter>::id;$/;" m class:std::num_put +id cpp_src/locale_facets.h /^ locale::id numpunct<_CharT>::id;$/;" m class:std::numpunct +id cpp_src/locale_facets.h /^ locale::id time_get<_CharT, _InIter>::id;$/;" m class:std::time_get +id cpp_src/locale_facets.h /^ locale::id time_put<_CharT, _OutIter>::id;$/;" m class:std::time_put +ifstream cpp_src/iosfwd /^ typedef basic_ifstream ifstream; \/\/\/< @isiosfwd$/;" t namespace:std file: +ignore cpp_src/istream /^ ignore();$/;" p class:std::basic_istream file: access:public signature:() +ignore cpp_src/istream /^ ignore(streamsize __n);$/;" p class:std::basic_istream file: access:public signature:(streamsize __n) +ignore cpp_src/istream /^ ignore(streamsize __n, int_type __delim);$/;" p class:std::basic_istream file: access:public signature:(streamsize __n, int_type __delim) +ignore cpp_src/istream /^ ignore(streamsize __n);$/;" p class:std::basic_istream file: signature:(streamsize __n) +ignore cpp_src/istream /^ ignore(streamsize __n, int_type __delim);$/;" p class:std::basic_istream file: signature:(streamsize __n, int_type __delim) +ignore cpp_src/istream.tcc /^ ignore(streamsize __n)$/;" f class:std::basic_istream signature:(streamsize __n) +ignore cpp_src/istream.tcc /^ ignore(streamsize __n, int_type __delim)$/;" f class:std::basic_istream signature:(streamsize __n, int_type __delim) +ignore cpp_src/istream.tcc /^ ignore(void)$/;" f class:std::basic_istream signature:(void) +imag cpp_src/complex /^ _Tp& imag();$/;" p struct:std::complex file: access:public signature:() +imag cpp_src/complex /^ const _Tp& imag() const;$/;" p struct:std::complex file: access:public signature:() const +imag cpp_src/complex /^ const double& imag() const;$/;" p struct:std::complex file: access:public signature:() const +imag cpp_src/complex /^ const float& imag() const;$/;" p struct:std::complex file: access:public signature:() const +imag cpp_src/complex /^ const long double& imag() const;$/;" p struct:std::complex file: access:public signature:() const +imag cpp_src/complex /^ double& imag();$/;" p struct:std::complex file: access:public signature:() +imag cpp_src/complex /^ float& imag();$/;" p struct:std::complex file: access:public signature:() +imag cpp_src/complex /^ long double& imag();$/;" p struct:std::complex file: access:public signature:() +imag cpp_src/complex /^ complex<_Tp>::imag() const { return _M_imag; }$/;" f class:std::complex signature:() const +imag cpp_src/complex /^ complex<_Tp>::imag() { return _M_imag; }$/;" f class:std::complex signature:() +imag cpp_src/complex /^ imag(complex<_Tp>& __z)$/;" f namespace:std signature:(complex<_Tp>& __z) +imag cpp_src/complex /^ imag(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +imag cpp_src/complex /^ complex::imag() const$/;" f class:std::complex signature:() const +imag cpp_src/complex /^ complex::imag()$/;" f class:std::complex signature:() +imag cpp_src/complex /^ complex::imag() const$/;" f class:std::complex signature:() const +imag cpp_src/complex /^ complex::imag()$/;" f class:std::complex signature:() +imag cpp_src/complex /^ complex::imag() const$/;" f class:std::complex signature:() const +imag cpp_src/complex /^ complex::imag()$/;" f class:std::complex signature:() +imbue cpp_src/basic_ios.h /^ imbue(const locale& __loc);$/;" p class:std::basic_ios access:public signature:(const locale& __loc) +imbue cpp_src/basic_ios.tcc /^ basic_ios<_CharT, _Traits>::imbue(const locale& __loc)$/;" f class:std::basic_ios signature:(const locale& __loc) +imbue cpp_src/fstream /^ imbue(const locale& __loc);$/;" p class:std::basic_filebuf file: access:protected signature:(const locale& __loc) +imbue cpp_src/fstream.tcc /^ imbue(const locale& __loc)$/;" f class:std::basic_filebuf signature:(const locale& __loc) +imbue cpp_src/ios_base.h /^ imbue(const locale& __loc);$/;" p class:std::ios_base access:public signature:(const locale& __loc) +imbue cpp_src/streambuf /^ imbue(const locale&) $/;" f class:std::basic_streambuf access:protected signature:(const locale&) +imbue_event cpp_src/ios_base.h /^ imbue_event,$/;" e enum:std::ios_base::event +in cpp_src/codecvt.h /^ in(state_type& __state, const extern_type* __from,$/;" f class:std::__codecvt_abstract_base access:public signature:(state_type& __state, const extern_type* __from, const extern_type* __from_end, const extern_type*& __from_next, intern_type* __to, intern_type* __to_end, intern_type*& __to_next) const +in cpp_src/ios_base.h /^ static const openmode in = _S_in;$/;" m class:std::ios_base access:public +in_avail cpp_src/streambuf /^ in_avail() $/;" f class:std::basic_streambuf access:public signature:() +includes cpp_src/stl_algo.h /^ includes(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) +includes cpp_src/stl_algo.h /^ includes(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) +indirect_array cpp_src/indirect_array.h /^ indirect_array();$/;" p class:std::indirect_array access:private signature:() +indirect_array cpp_src/indirect_array.h /^ indirect_array(_Array<_Tp>, size_t, _Array);$/;" p class:std::indirect_array access:private signature:(_Array<_Tp>, size_t, _Array) +indirect_array cpp_src/indirect_array.h /^ indirect_array(const indirect_array&);$/;" p class:std::indirect_array access:public signature:(const indirect_array&) +indirect_array cpp_src/indirect_array.h /^ class indirect_array$/;" c namespace:std +indirect_array cpp_src/indirect_array.h /^ indirect_array<_Tp>::indirect_array(_Array<_Tp> __a, size_t __s,$/;" f class:std::indirect_array signature:(_Array<_Tp> __a, size_t __s, _Array __i) +indirect_array cpp_src/indirect_array.h /^ indirect_array<_Tp>::indirect_array(const indirect_array<_Tp>& __a)$/;" f class:std::indirect_array signature:(const indirect_array<_Tp>& __a) +infinity cpp_src/limits /^ static _Tp infinity() throw() { return static_cast<_Tp>(0); }$/;" f struct:std::numeric_limits access:public signature:() +infinity cpp_src/limits /^ static bool infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +infinity cpp_src/limits /^ static char infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +infinity cpp_src/limits /^ static double infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +infinity cpp_src/limits /^ static float infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +infinity cpp_src/limits /^ static int infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +infinity cpp_src/limits /^ static long double infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +infinity cpp_src/limits /^ static long infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +infinity cpp_src/limits /^ static long long infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +infinity cpp_src/limits /^ static short infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +infinity cpp_src/limits /^ static signed char infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +infinity cpp_src/limits /^ static unsigned char infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +infinity cpp_src/limits /^ static unsigned int infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +infinity cpp_src/limits /^ static unsigned long infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +infinity cpp_src/limits /^ static unsigned long long infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +infinity cpp_src/limits /^ static unsigned short infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +infinity cpp_src/limits /^ static wchar_t infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +init cpp_src/basic_ios.h /^ init(basic_streambuf<_CharT, _Traits>* __sb);$/;" p class:std::basic_ios access:protected signature:(basic_streambuf<_CharT, _Traits>* __sb) +init cpp_src/basic_ios.tcc /^ basic_ios<_CharT, _Traits>::init(basic_streambuf<_CharT, _Traits>* __sb)$/;" f class:std::basic_ios signature:(basic_streambuf<_CharT, _Traits>* __sb) +inner_product cpp_src/stl_numeric.h /^ inner_product(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _Tp __init) +inner_product cpp_src/stl_numeric.h /^ inner_product(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _Tp __init, _BinaryOperation1 __binary_op1, _BinaryOperation2 __binary_op2) +inplace_merge cpp_src/stl_algo.h /^ inplace_merge(_BidirectionalIterator __first,$/;" f namespace:std signature:(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) +inplace_merge cpp_src/stl_algo.h /^ inplace_merge(_BidirectionalIterator __first,$/;" f namespace:std signature:(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Compare __comp) +input_iterator_tag cpp_src/stl_iterator_base_types.h /^ struct input_iterator_tag {};$/;" s namespace:std +insert cpp_src/basic_string.h /^ insert(iterator __p, _InputIterator __beg, _InputIterator __end)$/;" f class:std::basic_string access:public signature:(iterator __p, _InputIterator __beg, _InputIterator __end) +insert cpp_src/basic_string.h /^ insert(iterator __p, _CharT __c)$/;" f class:std::basic_string access:public signature:(iterator __p, _CharT __c) +insert cpp_src/basic_string.h /^ insert(iterator __p, size_type __n, _CharT __c)$/;" f class:std::basic_string access:public signature:(iterator __p, size_type __n, _CharT __c) +insert cpp_src/basic_string.h /^ insert(size_type __pos, const _CharT* __s)$/;" f class:std::basic_string access:public signature:(size_type __pos, const _CharT* __s) +insert cpp_src/basic_string.h /^ insert(size_type __pos, const _CharT* __s, size_type __n);$/;" p class:std::basic_string access:public signature:(size_type __pos, const _CharT* __s, size_type __n) +insert cpp_src/basic_string.h /^ insert(size_type __pos, size_type __n, _CharT __c)$/;" f class:std::basic_string access:public signature:(size_type __pos, size_type __n, _CharT __c) +insert cpp_src/basic_string.h /^ insert(size_type __pos1, const basic_string& __str)$/;" f class:std::basic_string access:public signature:(size_type __pos1, const basic_string& __str) +insert cpp_src/basic_string.h /^ insert(size_type __pos1, const basic_string& __str,$/;" f class:std::basic_string access:public signature:(size_type __pos1, const basic_string& __str, size_type __pos2, size_type __n) +insert cpp_src/basic_string.tcc /^ insert(size_type __pos, const _CharT* __s, size_type __n)$/;" f class:std::basic_string signature:(size_type __pos, const _CharT* __s, size_type __n) +insert cpp_src/deque.tcc /^ insert(iterator __position, const value_type& __x)$/;" f class:std::deque signature:(iterator __position, const value_type& __x) +insert cpp_src/list.tcc /^ insert(iterator __position, const value_type& __x)$/;" f class:std::list signature:(iterator __position, const value_type& __x) +insert cpp_src/stl_bvector.h /^ insert(iterator __position,$/;" f class:std::vector access:public signature:(iterator __position, _InputIterator __first, _InputIterator __last) +insert cpp_src/stl_bvector.h /^ insert(iterator __position, const bool& __x = bool())$/;" f class:std::vector access:public signature:(iterator __position, const bool& __x = bool()) +insert cpp_src/stl_bvector.h /^ insert(iterator __position, size_type __n, const bool& __x)$/;" f class:std::vector access:public signature:(iterator __position, size_type __n, const bool& __x) +insert cpp_src/stl_deque.h /^ insert(iterator __position, _InputIterator __first,$/;" f class:std::deque access:public signature:(iterator __position, _InputIterator __first, _InputIterator __last) +insert cpp_src/stl_deque.h /^ insert(iterator __position, const value_type& __x);$/;" p class:std::deque access:public signature:(iterator __position, const value_type& __x) +insert cpp_src/stl_deque.h /^ insert(iterator __position, size_type __n, const value_type& __x)$/;" f class:std::deque access:public signature:(iterator __position, size_type __n, const value_type& __x) +insert cpp_src/stl_list.h /^ insert(iterator __position, _InputIterator __first,$/;" f class:std::list access:public signature:(iterator __position, _InputIterator __first, _InputIterator __last) +insert cpp_src/stl_list.h /^ insert(iterator __position, const value_type& __x);$/;" p class:std::list access:public signature:(iterator __position, const value_type& __x) +insert cpp_src/stl_list.h /^ insert(iterator __position, size_type __n, const value_type& __x)$/;" f class:std::list access:public signature:(iterator __position, size_type __n, const value_type& __x) +insert cpp_src/stl_map.h /^ insert(_InputIterator __first, _InputIterator __last)$/;" f class:std::map access:public signature:(_InputIterator __first, _InputIterator __last) +insert cpp_src/stl_map.h /^ insert(const value_type& __x)$/;" f class:std::map access:public signature:(const value_type& __x) +insert cpp_src/stl_map.h /^ insert(iterator __position, const value_type& __x)$/;" f class:std::map access:public signature:(iterator __position, const value_type& __x) +insert cpp_src/stl_multimap.h /^ insert(_InputIterator __first, _InputIterator __last)$/;" f class:std::multimap access:public signature:(_InputIterator __first, _InputIterator __last) +insert cpp_src/stl_multimap.h /^ insert(const value_type& __x)$/;" f class:std::multimap access:public signature:(const value_type& __x) +insert cpp_src/stl_multimap.h /^ insert(iterator __position, const value_type& __x)$/;" f class:std::multimap access:public signature:(iterator __position, const value_type& __x) +insert cpp_src/stl_multiset.h /^ insert(_InputIterator __first, _InputIterator __last)$/;" f class:std::multiset access:public signature:(_InputIterator __first, _InputIterator __last) +insert cpp_src/stl_multiset.h /^ insert(const value_type& __x)$/;" f class:std::multiset access:public signature:(const value_type& __x) +insert cpp_src/stl_multiset.h /^ insert(iterator __position, const value_type& __x)$/;" f class:std::multiset access:public signature:(iterator __position, const value_type& __x) +insert cpp_src/stl_set.h /^ insert(_InputIterator __first, _InputIterator __last)$/;" f class:std::set access:public signature:(_InputIterator __first, _InputIterator __last) +insert cpp_src/stl_set.h /^ insert(const value_type& __x)$/;" f class:std::set access:public signature:(const value_type& __x) +insert cpp_src/stl_set.h /^ insert(iterator __position, const value_type& __x)$/;" f class:std::set access:public signature:(iterator __position, const value_type& __x) +insert cpp_src/stl_vector.h /^ insert(iterator __position, _InputIterator __first,$/;" f class:std::vector access:public signature:(iterator __position, _InputIterator __first, _InputIterator __last) +insert cpp_src/stl_vector.h /^ insert(iterator __position, const value_type& __x);$/;" p class:std::vector access:public signature:(iterator __position, const value_type& __x) +insert cpp_src/stl_vector.h /^ insert(iterator __position, size_type __n, const value_type& __x)$/;" f class:std::vector access:public signature:(iterator __position, size_type __n, const value_type& __x) +insert cpp_src/vector.tcc /^ insert(iterator __position, const value_type& __x)$/;" f class:std::vector signature:(iterator __position, const value_type& __x) +insert_iterator cpp_src/stl_iterator.h /^ insert_iterator(_Container& __x, typename _Container::iterator __i)$/;" f class:std::insert_iterator access:public signature:(_Container& __x, typename _Container::iterator __i) +insert_iterator cpp_src/stl_iterator.h /^ class insert_iterator$/;" c namespace:std inherits:iterator +inserter cpp_src/stl_iterator.h /^ inserter(_Container& __x, _Iterator __i)$/;" f namespace:std signature:(_Container& __x, _Iterator __i) +int_type cpp_src/basic_ios.h /^ typedef typename _Traits::int_type int_type;$/;" t class:std::basic_ios access:public +int_type cpp_src/char_traits.h /^ typedef typename _Char_types<_CharT>::int_type int_type;$/;" t struct:char_traits access:public +int_type cpp_src/char_traits.h /^ typedef unsigned long int_type;$/;" t struct:_Char_types access:public +int_type cpp_src/fstream /^ typedef typename traits_type::int_type int_type;$/;" t class:std::basic_filebuf file: access:public +int_type cpp_src/fstream /^ typedef typename traits_type::int_type int_type;$/;" t class:std::basic_fstream file: access:public +int_type cpp_src/fstream /^ typedef typename traits_type::int_type int_type;$/;" t class:std::basic_ifstream file: access:public +int_type cpp_src/fstream /^ typedef typename traits_type::int_type int_type;$/;" t class:std::basic_ofstream file: access:public +int_type cpp_src/istream /^ typedef typename _Traits::int_type int_type;$/;" t class:std::basic_iostream file: access:public +int_type cpp_src/istream /^ typedef typename _Traits::int_type int_type;$/;" t class:std::basic_istream file: access:public +int_type cpp_src/ostream /^ typedef typename _Traits::int_type int_type;$/;" t class:std::basic_ostream file: access:public +int_type cpp_src/sstream /^ typedef typename traits_type::int_type int_type;$/;" t class:std::basic_istringstream file: access:public +int_type cpp_src/sstream /^ typedef typename traits_type::int_type int_type;$/;" t class:std::basic_ostringstream file: access:public +int_type cpp_src/sstream /^ typedef typename traits_type::int_type int_type;$/;" t class:std::basic_stringbuf file: access:public +int_type cpp_src/sstream /^ typedef typename traits_type::int_type int_type;$/;" t class:std::basic_stringstream file: access:public +int_type cpp_src/streambuf /^ typedef typename traits_type::int_type int_type;$/;" t class:std::basic_streambuf file: access:public +int_type cpp_src/streambuf_iterator.h /^ typedef typename _Traits::int_type int_type;$/;" t class:std::istreambuf_iterator access:public +intern_type cpp_src/codecvt.h /^ typedef _InternT intern_type;$/;" t class:std::__codecvt_abstract_base access:public +intern_type cpp_src/codecvt.h /^ typedef _InternT intern_type;$/;" t class:std::codecvt access:public +intern_type cpp_src/codecvt.h /^ typedef char intern_type;$/;" t class:std::codecvt access:public +intern_type cpp_src/codecvt.h /^ typedef wchar_t intern_type;$/;" t class:std::codecvt access:public +internal cpp_src/ios_base.h /^ static const fmtflags internal = _S_internal;$/;" m class:std::ios_base access:public +internal cpp_src/ios_base.h /^ internal(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +intl cpp_src/locale_facets.h /^ static const bool intl = _Intl;$/;" m class:std::moneypunct access:public +intl cpp_src/locale_facets.h /^ static const bool intl = _Intl;$/;" m class:std::moneypunct_byname access:public +intl cpp_src/locale_facets.h /^ const bool moneypunct<_CharT, _Intl>::intl;$/;" m class:std::moneypunct +intl cpp_src/locale_facets.h /^ const bool moneypunct_byname<_CharT, _Intl>::intl;$/;" m class:std::moneypunct_byname +invalid_argument cpp_src/stdexcept /^ explicit invalid_argument(const string& __arg);$/;" p class:std::invalid_argument file: access:public signature:(const string& __arg) +invalid_argument cpp_src/stdexcept /^ class invalid_argument : public logic_error $/;" c namespace:std file: inherits:logic_error +io_state cpp_src/ios_base.h /^ typedef int io_state;$/;" t class:std::ios_base access:public +ios cpp_src/iosfwd /^ typedef basic_ios ios; \/\/\/< @isiosfwd$/;" t namespace:std file: +ios_base cpp_src/ios_base.h /^ ios_base();$/;" p class:std::ios_base access:protected signature:() +ios_base cpp_src/ios_base.h /^ ios_base(const ios_base&);$/;" p class:std::ios_base access:private signature:(const ios_base&) +ios_base cpp_src/ios_base.h /^ class ios_base$/;" c namespace:std +iostate cpp_src/ios_base.h /^ typedef _Ios_Iostate iostate;$/;" t class:std::ios_base access:public +iostream cpp_src/iosfwd /^ typedef basic_iostream iostream; \/\/\/< @isiosfwd$/;" t namespace:std file: +is cpp_src/locale_facets.h /^ is(const char* __lo, const char* __hi, mask* __vec) const;$/;" p class:std::ctype access:public signature:(const char* __lo, const char* __hi, mask* __vec) const +is cpp_src/locale_facets.h /^ is(const char_type *__lo, const char_type *__hi, mask *__vec) const$/;" f class:std::__ctype_abstract_base access:public signature:(const char_type *__lo, const char_type *__hi, mask *__vec) const +is cpp_src/locale_facets.h /^ is(mask __m, char __c) const;$/;" p class:std::ctype access:public signature:(mask __m, char __c) const +is cpp_src/locale_facets.h /^ is(mask __m, char_type __c) const$/;" f class:std::__ctype_abstract_base access:public signature:(mask __m, char_type __c) const +is_bounded cpp_src/limits /^ static const bool is_bounded = true;$/;" m struct:std::numeric_limits file: access:public +is_bounded cpp_src/limits /^ static const bool is_bounded = false;$/;" m struct:std::__numeric_limits_base file: access:public +is_exact cpp_src/limits /^ static const bool is_exact = false;$/;" m struct:std::numeric_limits file: access:public +is_exact cpp_src/limits /^ static const bool is_exact = true;$/;" m struct:std::numeric_limits file: access:public +is_exact cpp_src/limits /^ static const bool is_exact = false;$/;" m struct:std::__numeric_limits_base file: access:public +is_iec559 cpp_src/limits /^ static const bool is_iec559 = false;$/;" m struct:std::numeric_limits file: access:public +is_iec559 cpp_src/limits /^ static const bool is_iec559$/;" m struct:std::numeric_limits file: access:public +is_iec559 cpp_src/limits /^ static const bool is_iec559 = false;$/;" m struct:std::__numeric_limits_base file: access:public +is_integer cpp_src/limits /^ static const bool is_integer = false;$/;" m struct:std::numeric_limits file: access:public +is_integer cpp_src/limits /^ static const bool is_integer = true;$/;" m struct:std::numeric_limits file: access:public +is_integer cpp_src/limits /^ static const bool is_integer = false;$/;" m struct:std::__numeric_limits_base file: access:public +is_modulo cpp_src/limits /^ static const bool is_modulo = false;$/;" m struct:std::numeric_limits file: access:public +is_modulo cpp_src/limits /^ static const bool is_modulo = true;$/;" m struct:std::numeric_limits file: access:public +is_modulo cpp_src/limits /^ static const bool is_modulo = false;$/;" m struct:std::__numeric_limits_base file: access:public +is_open cpp_src/fstream /^ is_open() const throw()$/;" f class:std::basic_filebuf access:public signature:() const +is_open cpp_src/fstream /^ is_open() const$/;" f class:std::basic_fstream access:public signature:() const +is_open cpp_src/fstream /^ is_open() const$/;" f class:std::basic_ifstream access:public signature:() const +is_open cpp_src/fstream /^ is_open() const$/;" f class:std::basic_ofstream access:public signature:() const +is_open cpp_src/fstream /^ is_open()$/;" f class:std::basic_fstream access:public signature:() +is_open cpp_src/fstream /^ is_open()$/;" f class:std::basic_ifstream access:public signature:() +is_open cpp_src/fstream /^ is_open()$/;" f class:std::basic_ofstream access:public signature:() +is_signed cpp_src/limits /^ static const bool is_signed = __glibcxx_signed (char);$/;" m struct:std::numeric_limits file: access:public +is_signed cpp_src/limits /^ static const bool is_signed = __glibcxx_signed (wchar_t);$/;" m struct:std::numeric_limits file: access:public +is_signed cpp_src/limits /^ static const bool is_signed = false;$/;" m struct:std::numeric_limits file: access:public +is_signed cpp_src/limits /^ static const bool is_signed = true;$/;" m struct:std::numeric_limits file: access:public +is_signed cpp_src/limits /^ static const bool is_signed = false;$/;" m struct:std::__numeric_limits_base file: access:public +is_specialized cpp_src/limits /^ static const bool is_specialized = true;$/;" m struct:std::numeric_limits file: access:public +is_specialized cpp_src/limits /^ static const bool is_specialized = false;$/;" m struct:std::__numeric_limits_base file: access:public +isalnum cpp_src/cctype 54;" d file: +isalnum cpp_src/locale_facets.h /^ isalnum(_CharT __c, const locale& __loc)$/;" f namespace:std signature:(_CharT __c, const locale& __loc) +isalnum cpp_src/localefwd.h /^ isalnum(_CharT, const locale&);$/;" p namespace:std signature:(_CharT, const locale&) +isalpha cpp_src/cctype 55;" d file: +isalpha cpp_src/locale_facets.h /^ isalpha(_CharT __c, const locale& __loc)$/;" f namespace:std signature:(_CharT __c, const locale& __loc) +isalpha cpp_src/localefwd.h /^ isalpha(_CharT, const locale&);$/;" p namespace:std signature:(_CharT, const locale&) +iscntrl cpp_src/cctype 56;" d file: +iscntrl cpp_src/locale_facets.h /^ iscntrl(_CharT __c, const locale& __loc)$/;" f namespace:std signature:(_CharT __c, const locale& __loc) +iscntrl cpp_src/localefwd.h /^ iscntrl(_CharT, const locale&);$/;" p namespace:std signature:(_CharT, const locale&) +isdigit cpp_src/cctype 57;" d file: +isdigit cpp_src/locale_facets.h /^ isdigit(_CharT __c, const locale& __loc)$/;" f namespace:std signature:(_CharT __c, const locale& __loc) +isdigit cpp_src/localefwd.h /^ isdigit(_CharT, const locale&);$/;" p namespace:std signature:(_CharT, const locale&) +isgraph cpp_src/cctype 58;" d file: +isgraph cpp_src/locale_facets.h /^ isgraph(_CharT __c, const locale& __loc)$/;" f namespace:std signature:(_CharT __c, const locale& __loc) +isgraph cpp_src/localefwd.h /^ isgraph(_CharT, const locale&);$/;" p namespace:std signature:(_CharT, const locale&) +islower cpp_src/cctype 59;" d file: +islower cpp_src/locale_facets.h /^ islower(_CharT __c, const locale& __loc)$/;" f namespace:std signature:(_CharT __c, const locale& __loc) +islower cpp_src/localefwd.h /^ islower(_CharT, const locale&);$/;" p namespace:std signature:(_CharT, const locale&) +isprint cpp_src/cctype 60;" d file: +isprint cpp_src/locale_facets.h /^ isprint(_CharT __c, const locale& __loc)$/;" f namespace:std signature:(_CharT __c, const locale& __loc) +isprint cpp_src/localefwd.h /^ isprint(_CharT, const locale&);$/;" p namespace:std signature:(_CharT, const locale&) +ispunct cpp_src/cctype 61;" d file: +ispunct cpp_src/locale_facets.h /^ ispunct(_CharT __c, const locale& __loc)$/;" f namespace:std signature:(_CharT __c, const locale& __loc) +ispunct cpp_src/localefwd.h /^ ispunct(_CharT, const locale&);$/;" p namespace:std signature:(_CharT, const locale&) +isspace cpp_src/cctype 62;" d file: +isspace cpp_src/locale_facets.h /^ isspace(_CharT __c, const locale& __loc)$/;" f namespace:std signature:(_CharT __c, const locale& __loc) +isspace cpp_src/localefwd.h /^ isspace(_CharT, const locale&);$/;" p namespace:std signature:(_CharT, const locale&) +istream cpp_src/iosfwd /^ typedef basic_istream istream; \/\/\/< @isiosfwd$/;" t namespace:std file: +istream_iterator cpp_src/stream_iterator.h /^ istream_iterator()$/;" f class:std::istream_iterator access:public signature:() +istream_iterator cpp_src/stream_iterator.h /^ istream_iterator(const istream_iterator& __obj)$/;" f class:std::istream_iterator access:public signature:(const istream_iterator& __obj) +istream_iterator cpp_src/stream_iterator.h /^ istream_iterator(istream_type& __s)$/;" f class:std::istream_iterator access:public signature:(istream_type& __s) +istream_iterator cpp_src/stream_iterator.h /^ class istream_iterator$/;" c namespace:std inherits:iterator +istream_type cpp_src/stream_iterator.h /^ typedef basic_istream<_CharT, _Traits> istream_type;$/;" t class:std::istream_iterator access:public +istream_type cpp_src/streambuf_iterator.h /^ typedef basic_istream<_CharT, _Traits> istream_type;$/;" t class:std::istreambuf_iterator access:public +istreambuf_iterator cpp_src/streambuf_iterator.h /^ istreambuf_iterator() throw()$/;" f class:std::istreambuf_iterator access:public signature:() +istreambuf_iterator cpp_src/streambuf_iterator.h /^ istreambuf_iterator(istream_type& __s) throw()$/;" f class:std::istreambuf_iterator access:public signature:(istream_type& __s) +istreambuf_iterator cpp_src/streambuf_iterator.h /^ istreambuf_iterator(streambuf_type* __s) throw()$/;" f class:std::istreambuf_iterator access:public signature:(streambuf_type* __s) +istreambuf_iterator cpp_src/streambuf_iterator.h /^ class istreambuf_iterator$/;" c namespace:std inherits:iterator +istringstream cpp_src/iosfwd /^ typedef basic_istringstream istringstream; \/\/\/< @isiosfwd$/;" t namespace:std file: +isupper cpp_src/cctype 63;" d file: +isupper cpp_src/locale_facets.h /^ isupper(_CharT __c, const locale& __loc)$/;" f namespace:std signature:(_CharT __c, const locale& __loc) +isupper cpp_src/localefwd.h /^ isupper(_CharT, const locale&);$/;" p namespace:std signature:(_CharT, const locale&) +iswalnum cpp_src/cwctype 57;" d file: +iswalpha cpp_src/cwctype 58;" d file: +iswblank cpp_src/cwctype 60;" d file: +iswcntrl cpp_src/cwctype 62;" d file: +iswctype cpp_src/cwctype 63;" d file: +iswdigit cpp_src/cwctype 64;" d file: +iswgraph cpp_src/cwctype 65;" d file: +iswlower cpp_src/cwctype 66;" d file: +iswprint cpp_src/cwctype 67;" d file: +iswpunct cpp_src/cwctype 68;" d file: +iswspace cpp_src/cwctype 69;" d file: +iswupper cpp_src/cwctype 70;" d file: +iswxdigit cpp_src/cwctype 71;" d file: +isxdigit cpp_src/cctype 64;" d file: +isxdigit cpp_src/locale_facets.h /^ isxdigit(_CharT __c, const locale& __loc)$/;" f namespace:std signature:(_CharT __c, const locale& __loc) +isxdigit cpp_src/localefwd.h /^ isxdigit(_CharT, const locale&);$/;" p namespace:std signature:(_CharT, const locale&) +iter cpp_src/stl_iterator.h /^ typename _Container::iterator iter;$/;" m class:std::insert_iterator access:protected +iter_swap cpp_src/stl_algobase.h /^ iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)$/;" f struct:std::__iter_swap access:public signature:(_ForwardIterator1 __a, _ForwardIterator2 __b) +iter_swap cpp_src/stl_algobase.h /^ iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)$/;" f namespace:std signature:(_ForwardIterator1 __a, _ForwardIterator2 __b) +iter_type cpp_src/locale_facets.h /^ typedef _InIter iter_type;$/;" t class:std::money_get access:public +iter_type cpp_src/locale_facets.h /^ typedef _InIter iter_type;$/;" t class:std::num_get access:public +iter_type cpp_src/locale_facets.h /^ typedef _InIter iter_type;$/;" t class:std::time_get access:public +iter_type cpp_src/locale_facets.h /^ typedef _InIter iter_type;$/;" t class:std::time_get_byname access:public +iter_type cpp_src/locale_facets.h /^ typedef _OutIter iter_type;$/;" t class:std::money_put access:public +iter_type cpp_src/locale_facets.h /^ typedef _OutIter iter_type;$/;" t class:std::time_put access:public +iter_type cpp_src/locale_facets.h /^ typedef _OutIter iter_type;$/;" t class:std::time_put_byname access:public +iter_type cpp_src/locale_facets.h /^ typedef _OutIter iter_type;$/;" t class:std::num_put access:public +iterator cpp_src/basic_string.h /^ typedef __gnu_cxx::__normal_iterator iterator;$/;" t class:std::basic_string access:public +iterator cpp_src/stl_bvector.h /^ typedef _Bit_iterator iterator;$/;" t class:std::vector access:public +iterator cpp_src/stl_bvector.h /^ typedef _Bit_iterator iterator;$/;" t struct:std::_Bit_iterator access:public +iterator cpp_src/stl_deque.h /^ typedef _Deque_iterator<_Tp, _Tp&, _Tp*> iterator;$/;" t class:std::_Deque_base access:public +iterator cpp_src/stl_deque.h /^ typedef _Deque_iterator<_Tp, _Tp&, _Tp*> iterator;$/;" t struct:std::_Deque_iterator access:public +iterator cpp_src/stl_deque.h /^ typedef typename _Base::iterator iterator;$/;" t class:std::deque access:public +iterator cpp_src/stl_iterator_base_types.h /^ struct iterator$/;" s namespace:std +iterator cpp_src/stl_list.h /^ typedef _List_iterator<_Tp> iterator;$/;" t class:std::list access:public +iterator cpp_src/stl_list.h /^ typedef _List_iterator<_Tp> iterator;$/;" t struct:std::_List_const_iterator access:public +iterator cpp_src/stl_map.h /^ typedef typename _Rep_type::iterator iterator;$/;" t class:std::map access:public +iterator cpp_src/stl_multimap.h /^ typedef typename _Rep_type::iterator iterator;$/;" t class:std::multimap access:public +iterator cpp_src/stl_multiset.h /^ typedef typename _Rep_type::const_iterator iterator;$/;" t class:std::multiset access:public +iterator cpp_src/stl_set.h /^ typedef typename _Rep_type::const_iterator iterator;$/;" t class:std::set access:public +iterator cpp_src/stl_tempbuf.h /^ typedef pointer iterator;$/;" t class:std::_Temporary_buffer access:public +iterator cpp_src/stl_tree.h /^ typedef _Rb_tree_iterator<_Tp> iterator;$/;" t struct:std::_Rb_tree_const_iterator access:public +iterator cpp_src/stl_tree.h /^ typedef _Rb_tree_iterator iterator;$/;" t class:std::_Rb_tree access:public +iterator cpp_src/stl_vector.h /^ typedef __gnu_cxx::__normal_iterator iterator;$/;" t class:std::vector access:public +iterator_category cpp_src/stl_deque.h /^ typedef std::random_access_iterator_tag iterator_category;$/;" t struct:std::_Deque_iterator access:public +iterator_category cpp_src/stl_iterator.h /^ iterator_category;$/;" t class:__normal_iterator access:public +iterator_category cpp_src/stl_iterator_base_types.h /^ typedef _Category iterator_category;$/;" t struct:std::iterator access:public +iterator_category cpp_src/stl_iterator_base_types.h /^ typedef random_access_iterator_tag iterator_category;$/;" t struct:std::iterator_traits access:public +iterator_category cpp_src/stl_iterator_base_types.h /^ typedef typename _Iterator::iterator_category iterator_category;$/;" t struct:std::iterator_traits access:public +iterator_category cpp_src/stl_list.h /^ typedef std::bidirectional_iterator_tag iterator_category;$/;" t struct:std::_List_const_iterator access:public +iterator_category cpp_src/stl_list.h /^ typedef std::bidirectional_iterator_tag iterator_category;$/;" t struct:std::_List_iterator access:public +iterator_category cpp_src/stl_tree.h /^ typedef bidirectional_iterator_tag iterator_category;$/;" t struct:std::_Rb_tree_const_iterator access:public +iterator_category cpp_src/stl_tree.h /^ typedef bidirectional_iterator_tag iterator_category;$/;" t struct:std::_Rb_tree_iterator access:public +iterator_traits cpp_src/stl_iterator_base_types.h /^ struct iterator_traits$/;" s namespace:std +iterator_traits cpp_src/stl_iterator_base_types.h /^ struct iterator_traits<_Tp*>$/;" s namespace:std +iterator_traits cpp_src/stl_iterator_base_types.h /^ struct iterator_traits$/;" s namespace:std +iterator_type cpp_src/stl_iterator.h /^ typedef _Iterator iterator_type;$/;" t class:std::reverse_iterator access:public +iword cpp_src/ios_base.h /^ iword(int __ix)$/;" f class:std::ios_base access:public signature:(int __ix) +key_comp cpp_src/stl_map.h /^ key_comp() const$/;" f class:std::map access:public signature:() const +key_comp cpp_src/stl_multimap.h /^ key_comp() const$/;" f class:std::multimap access:public signature:() const +key_comp cpp_src/stl_multiset.h /^ key_comp() const$/;" f class:std::multiset access:public signature:() const +key_comp cpp_src/stl_set.h /^ key_comp() const$/;" f class:std::set access:public signature:() const +key_comp cpp_src/stl_tree.h /^ key_comp() const$/;" f class:std::_Rb_tree access:public signature:() const +key_compare cpp_src/stl_map.h /^ typedef _Compare key_compare;$/;" t class:std::map access:public +key_compare cpp_src/stl_multimap.h /^ typedef _Compare key_compare;$/;" t class:std::multimap access:public +key_compare cpp_src/stl_multiset.h /^ typedef _Compare key_compare;$/;" t class:std::multiset access:public +key_compare cpp_src/stl_set.h /^ typedef _Compare key_compare;$/;" t class:std::set access:public +key_type cpp_src/stl_map.h /^ typedef _Key key_type;$/;" t class:std::map access:public +key_type cpp_src/stl_multimap.h /^ typedef _Key key_type;$/;" t class:std::multimap access:public +key_type cpp_src/stl_multiset.h /^ typedef _Key key_type;$/;" t class:std::multiset access:public +key_type cpp_src/stl_set.h /^ typedef _Key key_type;$/;" t class:std::set access:public +key_type cpp_src/stl_tree.h /^ typedef _Key key_type;$/;" t class:std::_Rb_tree access:public +ldexp cpp_src/cmath /^ ldexp(_Tp __x, int __exp)$/;" f namespace:std signature:(_Tp __x, int __exp) +ldexp cpp_src/cmath /^ ldexp(float __x, int __exp)$/;" f namespace:std signature:(float __x, int __exp) +ldexp cpp_src/cmath /^ ldexp(long double __x, int __exp)$/;" f namespace:std signature:(long double __x, int __exp) +ldexp cpp_src/cmath 71;" d file: +left cpp_src/ios_base.h /^ static const fmtflags left = _S_left;$/;" m class:std::ios_base access:public +left cpp_src/ios_base.h /^ left(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +length cpp_src/basic_string.h /^ length() const$/;" f class:std::basic_string access:public signature:() const +length cpp_src/char_traits.h /^ length(const char_type* __s);$/;" p struct:char_traits access:public signature:(const char_type* __s) +length cpp_src/char_traits.h /^ length(const char_type* __p)$/;" f class:char_traits signature:(const char_type* __p) +length cpp_src/codecvt.h /^ length(state_type& __state, const extern_type* __from,$/;" f class:std::__codecvt_abstract_base access:public signature:(state_type& __state, const extern_type* __from, const extern_type* __end, size_t __max) const +length_error cpp_src/stdexcept /^ explicit length_error(const string& __arg);$/;" p class:std::length_error file: access:public signature:(const string& __arg) +length_error cpp_src/stdexcept /^ class length_error : public logic_error $/;" c namespace:std file: inherits:logic_error +less cpp_src/stl_function.h /^ struct less : public binary_function<_Tp, _Tp, bool>$/;" s namespace:std inherits:binary_function +less_equal cpp_src/stl_function.h /^ struct less_equal : public binary_function<_Tp, _Tp, bool>$/;" s namespace:std inherits:binary_function +lexicographical_compare cpp_src/stl_algobase.h /^ lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) +lexicographical_compare cpp_src/stl_algobase.h /^ lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) +lexicographical_compare cpp_src/stl_algobase.h /^ lexicographical_compare(const char* __first1, const char* __last1,$/;" f namespace:std signature:(const char* __first1, const char* __last1, const char* __first2, const char* __last2) +lexicographical_compare cpp_src/stl_algobase.h /^ lexicographical_compare(const unsigned char* __first1,$/;" f namespace:std signature:(const unsigned char* __first1, const unsigned char* __last1, const unsigned char* __first2, const unsigned char* __last2) +list cpp_src/stl_list.h /^ list(_InputIterator __first, _InputIterator __last,$/;" f class:std::list access:public signature:(_InputIterator __first, _InputIterator __last, const allocator_type& __a = allocator_type()) +list cpp_src/stl_list.h /^ list(const allocator_type& __a = allocator_type())$/;" f class:std::list access:public signature:(const allocator_type& __a = allocator_type()) +list cpp_src/stl_list.h /^ list(const list& __x)$/;" f class:std::list access:public signature:(const list& __x) +list cpp_src/stl_list.h /^ list(size_type __n, const value_type& __value = value_type(),$/;" f class:std::list access:public signature:(size_type __n, const value_type& __value = value_type(), const allocator_type& __a = allocator_type()) +list cpp_src/stl_list.h /^ class list : protected _List_base<_Tp, _Alloc>$/;" c namespace:std inherits:_List_base +locale cpp_src/locale_classes.h /^ locale(const locale& __other, _Facet* __f);$/;" p class:std::locale access:public signature:(const locale& __other, _Facet* __f) +locale cpp_src/locale_classes.h /^ locale() throw();$/;" p class:std::locale access:public signature:() +locale cpp_src/locale_classes.h /^ locale(_Impl*) throw();$/;" p class:std::locale access:private signature:(_Impl*) +locale cpp_src/locale_classes.h /^ locale(const char* __s);$/;" p class:std::locale access:public signature:(const char* __s) +locale cpp_src/locale_classes.h /^ locale(const locale& __base, const char* __s, category __cat);$/;" p class:std::locale access:public signature:(const locale& __base, const char* __s, category __cat) +locale cpp_src/locale_classes.h /^ locale(const locale& __base, const locale& __add, category __cat);$/;" p class:std::locale access:public signature:(const locale& __base, const locale& __add, category __cat) +locale cpp_src/locale_classes.h /^ locale(const locale& __other) throw();$/;" p class:std::locale access:public signature:(const locale& __other) +locale cpp_src/locale_classes.h /^ locale::locale(const locale& __other, _Facet* __f)$/;" f class:std::locale signature:(const locale& __other, _Facet* __f) +locale cpp_src/locale_classes.h /^ class locale$/;" c namespace:std +localeconv cpp_src/clocale 55;" d file: +localtime cpp_src/ctime 61;" d file: +log cpp_src/cmath /^ log(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +log cpp_src/cmath /^ log(float __x)$/;" f namespace:std signature:(float __x) +log cpp_src/cmath /^ log(long double __x)$/;" f namespace:std signature:(long double __x) +log cpp_src/cmath 72;" d file: +log cpp_src/complex /^ log(const complex<_Tp>& __z) { return __complex_log(__z); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +log cpp_src/complex /^ log(const complex<_Tp>& __z) { return __complex_log(__z.__rep()); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +log cpp_src/complex /^ template complex<_Tp> log(const complex<_Tp>&);$/;" p namespace:std file: signature:(const complex<_Tp>&) +log10 cpp_src/cmath /^ log10(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +log10 cpp_src/cmath /^ log10(float __x)$/;" f namespace:std signature:(float __x) +log10 cpp_src/cmath /^ log10(long double __x)$/;" f namespace:std signature:(long double __x) +log10 cpp_src/cmath 73;" d file: +log10 cpp_src/complex /^ log10(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +log10 cpp_src/complex /^ template complex<_Tp> log10(const complex<_Tp>&);$/;" p namespace:std file: signature:(const complex<_Tp>&) +logic_error cpp_src/stdexcept /^ logic_error(const string& __arg);$/;" p class:std::logic_error file: access:public signature:(const string& __arg) +logic_error cpp_src/stdexcept /^ class logic_error : public exception $/;" c namespace:std file: inherits:exception +logical_and cpp_src/stl_function.h /^ struct logical_and : public binary_function<_Tp, _Tp, bool>$/;" s namespace:std inherits:binary_function +logical_not cpp_src/stl_function.h /^ struct logical_not : public unary_function<_Tp, bool>$/;" s namespace:std inherits:unary_function +logical_or cpp_src/stl_function.h /^ struct logical_or : public binary_function<_Tp, _Tp, bool>$/;" s namespace:std inherits:binary_function +longjmp cpp_src/csetjmp 54;" d file: +lower_bound cpp_src/stl_algo.h /^ lower_bound(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val) +lower_bound cpp_src/stl_algo.h /^ lower_bound(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val, _Compare __comp) +lower_bound cpp_src/stl_map.h /^ lower_bound(const key_type& __x) const$/;" f class:std::map access:public signature:(const key_type& __x) const +lower_bound cpp_src/stl_map.h /^ lower_bound(const key_type& __x)$/;" f class:std::map access:public signature:(const key_type& __x) +lower_bound cpp_src/stl_multimap.h /^ lower_bound(const key_type& __x) const$/;" f class:std::multimap access:public signature:(const key_type& __x) const +lower_bound cpp_src/stl_multimap.h /^ lower_bound(const key_type& __x)$/;" f class:std::multimap access:public signature:(const key_type& __x) +lower_bound cpp_src/stl_multiset.h /^ lower_bound(const key_type& __x) const$/;" f class:std::multiset access:public signature:(const key_type& __x) const +lower_bound cpp_src/stl_multiset.h /^ lower_bound(const key_type& __x)$/;" f class:std::multiset access:public signature:(const key_type& __x) +lower_bound cpp_src/stl_set.h /^ lower_bound(const key_type& __x) const$/;" f class:std::set access:public signature:(const key_type& __x) const +lower_bound cpp_src/stl_set.h /^ lower_bound(const key_type& __x)$/;" f class:std::set access:public signature:(const key_type& __x) +lower_bound cpp_src/stl_tree.h /^ lower_bound(const key_type& __x) const;$/;" p class:std::_Rb_tree access:public signature:(const key_type& __x) const +lower_bound cpp_src/stl_tree.h /^ lower_bound(const key_type& __x);$/;" p class:std::_Rb_tree access:public signature:(const key_type& __x) +lower_bound cpp_src/stl_tree.h /^ lower_bound(const _Key& __k) const$/;" f class:std::_Rb_tree signature:(const _Key& __k) const +lower_bound cpp_src/stl_tree.h /^ lower_bound(const _Key& __k)$/;" f class:std::_Rb_tree signature:(const _Key& __k) +lt cpp_src/char_traits.h /^ lt(const char_type& __c1, const char_type& __c2)$/;" f struct:char_traits access:public signature:(const char_type& __c1, const char_type& __c2) +make_heap cpp_src/stl_heap.h /^ make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last) +make_heap cpp_src/stl_heap.h /^ make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) +make_pair cpp_src/stl_pair.h /^ make_pair(_T1 __x, _T2 __y)$/;" f namespace:std signature:(_T1 __x, _T2 __y) +map cpp_src/stl_map.h /^ map(_InputIterator __first, _InputIterator __last)$/;" f class:std::map access:public signature:(_InputIterator __first, _InputIterator __last) +map cpp_src/stl_map.h /^ map(_InputIterator __first, _InputIterator __last,$/;" f class:std::map access:public signature:(_InputIterator __first, _InputIterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) +map cpp_src/stl_map.h /^ map()$/;" f class:std::map access:public signature:() +map cpp_src/stl_map.h /^ map(const _Compare& __comp, const allocator_type& __a = allocator_type())$/;" f class:std::map access:public signature:(const _Compare& __comp, const allocator_type& __a = allocator_type()) +map cpp_src/stl_map.h /^ map(const map& __x)$/;" f class:std::map access:public signature:(const map& __x) +map cpp_src/stl_map.h /^ class map$/;" c namespace:std +mapped_type cpp_src/stl_map.h /^ typedef _Tp mapped_type;$/;" t class:std::map access:public +mapped_type cpp_src/stl_multimap.h /^ typedef _Tp mapped_type;$/;" t class:std::multimap access:public +mask cpp_src/locale_facets.h /^ typedef typename __ctype_abstract_base<_CharT>::mask mask;$/;" t class:std::ctype access:public +mask_array cpp_src/mask_array.h /^ mask_array (const mask_array&);$/;" p class:std::mask_array access:public signature:(const mask_array&) +mask_array cpp_src/mask_array.h /^ mask_array();$/;" p class:std::mask_array access:private signature:() +mask_array cpp_src/mask_array.h /^ mask_array(_Array<_Tp>, size_t, _Array);$/;" p class:std::mask_array access:private signature:(_Array<_Tp>, size_t, _Array) +mask_array cpp_src/mask_array.h /^ class mask_array$/;" c namespace:std +mask_array cpp_src/mask_array.h /^ inline mask_array<_Tp>::mask_array(const mask_array<_Tp>& a)$/;" f class:std::mask_array signature:(const mask_array<_Tp>& a) +mask_array cpp_src/mask_array.h /^ mask_array<_Tp>::mask_array(_Array<_Tp> __a, size_t __s, _Array __m)$/;" f class:std::mask_array signature:(_Array<_Tp> __a, size_t __s, _Array __m) +max cpp_src/limits /^ static _Tp max() throw() { return static_cast<_Tp>(0); }$/;" f struct:std::numeric_limits access:public signature:() +max cpp_src/limits /^ static bool max() throw()$/;" f struct:std::numeric_limits access:public signature:() +max cpp_src/limits /^ static char max() throw()$/;" f struct:std::numeric_limits access:public signature:() +max cpp_src/limits /^ static double max() throw()$/;" f struct:std::numeric_limits access:public signature:() +max cpp_src/limits /^ static float max() throw()$/;" f struct:std::numeric_limits access:public signature:() +max cpp_src/limits /^ static int max() throw()$/;" f struct:std::numeric_limits access:public signature:() +max cpp_src/limits /^ static long double max() throw()$/;" f struct:std::numeric_limits access:public signature:() +max cpp_src/limits /^ static long long max() throw()$/;" f struct:std::numeric_limits access:public signature:() +max cpp_src/limits /^ static long max() throw()$/;" f struct:std::numeric_limits access:public signature:() +max cpp_src/limits /^ static short max() throw()$/;" f struct:std::numeric_limits access:public signature:() +max cpp_src/limits /^ static signed char max() throw()$/;" f struct:std::numeric_limits access:public signature:() +max cpp_src/limits /^ static unsigned char max() throw()$/;" f struct:std::numeric_limits access:public signature:() +max cpp_src/limits /^ static unsigned int max() throw()$/;" f struct:std::numeric_limits access:public signature:() +max cpp_src/limits /^ static unsigned long long max() throw()$/;" f struct:std::numeric_limits access:public signature:() +max cpp_src/limits /^ static unsigned long max() throw()$/;" f struct:std::numeric_limits access:public signature:() +max cpp_src/limits /^ static unsigned short max() throw()$/;" f struct:std::numeric_limits access:public signature:() +max cpp_src/limits /^ static wchar_t max() throw()$/;" f struct:std::numeric_limits access:public signature:() +max cpp_src/stl_algobase.h /^ max(const _Tp& __a, const _Tp& __b)$/;" f namespace:std signature:(const _Tp& __a, const _Tp& __b) +max cpp_src/stl_algobase.h /^ max(const _Tp& __a, const _Tp& __b, _Compare __comp)$/;" f namespace:std signature:(const _Tp& __a, const _Tp& __b, _Compare __comp) +max cpp_src/valarray /^ _Tp max() const; $/;" p class:std::valarray file: access:public signature:() const +max cpp_src/valarray /^ valarray<_Tp>::max() const$/;" f class:std::valarray signature:() const +max cpp_src/valarray_after.h /^ value_type max() const;$/;" p class:std::_Expr access:public signature:() const +max cpp_src/valarray_after.h /^ _Expr<_Clos, _Tp>::max() const$/;" f class:std::_Expr signature:() const +max_element cpp_src/stl_algo.h /^ max_element(_ForwardIterator __first, _ForwardIterator __last)$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last) +max_element cpp_src/stl_algo.h /^ max_element(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) +max_exponent cpp_src/limits /^ static const int max_exponent = 0;$/;" m struct:std::numeric_limits file: access:public +max_exponent cpp_src/limits /^ static const int max_exponent = __DBL_MAX_EXP__;$/;" m struct:std::numeric_limits file: access:public +max_exponent cpp_src/limits /^ static const int max_exponent = __FLT_MAX_EXP__;$/;" m struct:std::numeric_limits file: access:public +max_exponent cpp_src/limits /^ static const int max_exponent = __LDBL_MAX_EXP__;$/;" m struct:std::numeric_limits file: access:public +max_exponent cpp_src/limits /^ static const int max_exponent = 0;$/;" m struct:std::__numeric_limits_base file: access:public +max_exponent10 cpp_src/limits /^ static const int max_exponent10 = 0;$/;" m struct:std::numeric_limits file: access:public +max_exponent10 cpp_src/limits /^ static const int max_exponent10 = __DBL_MAX_10_EXP__;$/;" m struct:std::numeric_limits file: access:public +max_exponent10 cpp_src/limits /^ static const int max_exponent10 = __FLT_MAX_10_EXP__;$/;" m struct:std::numeric_limits file: access:public +max_exponent10 cpp_src/limits /^ static const int max_exponent10 = __LDBL_MAX_10_EXP__;$/;" m struct:std::numeric_limits file: access:public +max_exponent10 cpp_src/limits /^ static const int max_exponent10 = 0;$/;" m struct:std::__numeric_limits_base file: access:public +max_length cpp_src/codecvt.h /^ max_length() const throw()$/;" f class:std::__codecvt_abstract_base access:public signature:() const +max_size cpp_src/basic_string.h /^ max_size() const$/;" f class:std::basic_string access:public signature:() const +max_size cpp_src/stl_bvector.h /^ max_size() const$/;" f class:std::vector access:public signature:() const +max_size cpp_src/stl_deque.h /^ max_size() const$/;" f class:std::deque access:public signature:() const +max_size cpp_src/stl_list.h /^ max_size() const$/;" f class:std::list access:public signature:() const +max_size cpp_src/stl_map.h /^ max_size() const$/;" f class:std::map access:public signature:() const +max_size cpp_src/stl_multimap.h /^ max_size() const$/;" f class:std::multimap access:public signature:() const +max_size cpp_src/stl_multiset.h /^ max_size() const$/;" f class:std::multiset access:public signature:() const +max_size cpp_src/stl_set.h /^ max_size() const$/;" f class:std::set access:public signature:() const +max_size cpp_src/stl_tree.h /^ max_size() const$/;" f class:std::_Rb_tree access:public signature:() const +max_size cpp_src/stl_vector.h /^ max_size() const$/;" f class:std::vector access:public signature:() const +mbrlen cpp_src/cwchar 87;" d file: +mbrtowc cpp_src/cwchar 88;" d file: +mbsinit cpp_src/cwchar 89;" d file: +mbsrtowcs cpp_src/cwchar 90;" d file: +mbstate_t cpp_src/cwchar /^ } mbstate_t;$/;" t typeref:struct:__anon2 file: +mdy cpp_src/locale_facets.h /^ enum dateorder { no_order, dmy, mdy, ymd, ydm };$/;" e enum:std::time_base::dateorder +mem_fun1_ref_t cpp_src/stl_function.h /^ class mem_fun1_ref_t : public binary_function<_Tp, _Arg, _Ret>$/;" c namespace:std inherits:binary_function +mem_fun1_t cpp_src/stl_function.h /^ class mem_fun1_t : public binary_function<_Tp*, _Arg, _Ret>$/;" c namespace:std inherits:binary_function +mem_fun_ref_t cpp_src/stl_function.h /^ class mem_fun_ref_t : public unary_function<_Tp, _Ret>$/;" c namespace:std inherits:unary_function +mem_fun_t cpp_src/stl_function.h /^ class mem_fun_t : public unary_function<_Tp*, _Ret>$/;" c namespace:std inherits:unary_function +memchr cpp_src/cstring /^ memchr(void* __p, int __c, size_t __n)$/;" f namespace:std signature:(void* __p, int __c, size_t __n) +memchr cpp_src/cstring 66;" d file: +memcmp cpp_src/cstring 61;" d file: +memcpy cpp_src/cstring 55;" d file: +memmove cpp_src/cstring 56;" d file: +memset cpp_src/cstring 74;" d file: +merge cpp_src/list.tcc /^ merge(list& __x, _StrictWeakOrdering __comp)$/;" f class:std::list signature:(list& __x, _StrictWeakOrdering __comp) +merge cpp_src/list.tcc /^ merge(list& __x)$/;" f class:std::list signature:(list& __x) +merge cpp_src/stl_algo.h /^ merge(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) +merge cpp_src/stl_algo.h /^ merge(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) +merge cpp_src/stl_list.h /^ merge(list&, _StrictWeakOrdering);$/;" p class:std::list access:public signature:(list&, _StrictWeakOrdering) +merge cpp_src/stl_list.h /^ merge(list& __x);$/;" p class:std::list access:public signature:(list& __x) +messages cpp_src/locale_classes.h /^ static const category messages = 1L << 5;$/;" m class:std::locale access:public +messages cpp_src/locale_facets.h /^ messages(__c_locale __cloc, const char* __s, size_t __refs = 0);$/;" p class:std::messages access:public signature:(__c_locale __cloc, const char* __s, size_t __refs = 0) +messages cpp_src/locale_facets.h /^ messages(size_t __refs = 0);$/;" p class:std::messages access:public signature:(size_t __refs = 0) +messages cpp_src/locale_facets.h /^ class messages : public locale::facet, public messages_base$/;" c namespace:std inherits:locale::facet,messages_base +messages_base cpp_src/locale_facets.h /^ struct messages_base$/;" s namespace:std +messages_byname cpp_src/locale_facets.h /^ messages_byname(const char* __s, size_t __refs = 0);$/;" p class:std::messages_byname access:public signature:(const char* __s, size_t __refs = 0) +messages_byname cpp_src/locale_facets.h /^ class messages_byname : public messages<_CharT>$/;" c namespace:std inherits:messages +min cpp_src/limits /^ static _Tp min() throw() { return static_cast<_Tp>(0); }$/;" f struct:std::numeric_limits access:public signature:() +min cpp_src/limits /^ static bool min() throw()$/;" f struct:std::numeric_limits access:public signature:() +min cpp_src/limits /^ static char min() throw()$/;" f struct:std::numeric_limits access:public signature:() +min cpp_src/limits /^ static double min() throw()$/;" f struct:std::numeric_limits access:public signature:() +min cpp_src/limits /^ static float min() throw()$/;" f struct:std::numeric_limits access:public signature:() +min cpp_src/limits /^ static int min() throw()$/;" f struct:std::numeric_limits access:public signature:() +min cpp_src/limits /^ static long double min() throw()$/;" f struct:std::numeric_limits access:public signature:() +min cpp_src/limits /^ static long long min() throw()$/;" f struct:std::numeric_limits access:public signature:() +min cpp_src/limits /^ static long min() throw()$/;" f struct:std::numeric_limits access:public signature:() +min cpp_src/limits /^ static short min() throw()$/;" f struct:std::numeric_limits access:public signature:() +min cpp_src/limits /^ static signed char min() throw()$/;" f struct:std::numeric_limits access:public signature:() +min cpp_src/limits /^ static unsigned char min() throw()$/;" f struct:std::numeric_limits access:public signature:() +min cpp_src/limits /^ static unsigned int min() throw()$/;" f struct:std::numeric_limits access:public signature:() +min cpp_src/limits /^ static unsigned long long min() throw()$/;" f struct:std::numeric_limits access:public signature:() +min cpp_src/limits /^ static unsigned long min() throw()$/;" f struct:std::numeric_limits access:public signature:() +min cpp_src/limits /^ static unsigned short min() throw()$/;" f struct:std::numeric_limits access:public signature:() +min cpp_src/limits /^ static wchar_t min() throw()$/;" f struct:std::numeric_limits access:public signature:() +min cpp_src/stl_algobase.h /^ min(const _Tp& __a, const _Tp& __b)$/;" f namespace:std signature:(const _Tp& __a, const _Tp& __b) +min cpp_src/stl_algobase.h /^ min(const _Tp& __a, const _Tp& __b, _Compare __comp)$/;" f namespace:std signature:(const _Tp& __a, const _Tp& __b, _Compare __comp) +min cpp_src/valarray /^ _Tp min() const; $/;" p class:std::valarray file: access:public signature:() const +min cpp_src/valarray /^ valarray<_Tp>::min() const$/;" f class:std::valarray signature:() const +min cpp_src/valarray_after.h /^ value_type min() const;$/;" p class:std::_Expr access:public signature:() const +min cpp_src/valarray_after.h /^ _Expr<_Clos, _Tp>::min() const$/;" f class:std::_Expr signature:() const +min_element cpp_src/stl_algo.h /^ min_element(_ForwardIterator __first, _ForwardIterator __last)$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last) +min_element cpp_src/stl_algo.h /^ min_element(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) +min_exponent cpp_src/limits /^ static const int min_exponent = 0;$/;" m struct:std::numeric_limits file: access:public +min_exponent cpp_src/limits /^ static const int min_exponent = __DBL_MIN_EXP__;$/;" m struct:std::numeric_limits file: access:public +min_exponent cpp_src/limits /^ static const int min_exponent = __FLT_MIN_EXP__;$/;" m struct:std::numeric_limits file: access:public +min_exponent cpp_src/limits /^ static const int min_exponent = __LDBL_MIN_EXP__;$/;" m struct:std::numeric_limits file: access:public +min_exponent cpp_src/limits /^ static const int min_exponent = 0;$/;" m struct:std::__numeric_limits_base file: access:public +min_exponent10 cpp_src/limits /^ static const int min_exponent10 = 0;$/;" m struct:std::numeric_limits file: access:public +min_exponent10 cpp_src/limits /^ static const int min_exponent10 = __DBL_MIN_10_EXP__;$/;" m struct:std::numeric_limits file: access:public +min_exponent10 cpp_src/limits /^ static const int min_exponent10 = __FLT_MIN_10_EXP__;$/;" m struct:std::numeric_limits file: access:public +min_exponent10 cpp_src/limits /^ static const int min_exponent10 = __LDBL_MIN_10_EXP__;$/;" m struct:std::numeric_limits file: access:public +min_exponent10 cpp_src/limits /^ static const int min_exponent10 = 0;$/;" m struct:std::__numeric_limits_base file: access:public +minus cpp_src/stl_function.h /^ struct minus : public binary_function<_Tp, _Tp, _Tp>$/;" s namespace:std inherits:binary_function +mismatch cpp_src/stl_algobase.h /^ mismatch(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) +mismatch cpp_src/stl_algobase.h /^ mismatch(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __binary_pred) +mktime cpp_src/ctime 56;" d file: +modf cpp_src/cmath /^ modf(float __x, float* __iptr)$/;" f namespace:std signature:(float __x, float* __iptr) +modf cpp_src/cmath /^ modf(long double __x, long double* __iptr)$/;" f namespace:std signature:(long double __x, long double* __iptr) +modf cpp_src/cmath 74;" d file: +modulus cpp_src/stl_function.h /^ struct modulus : public binary_function<_Tp, _Tp, _Tp>$/;" s namespace:std inherits:binary_function +monetary cpp_src/locale_classes.h /^ static const category monetary = 1L << 4;$/;" m class:std::locale access:public +money_base cpp_src/locale_facets.h /^ class money_base$/;" c namespace:std +money_get cpp_src/locale_facets.h /^ money_get(size_t __refs = 0) : facet(__refs) { }$/;" f class:std::money_get access:public signature:(size_t __refs = 0) +money_get cpp_src/locale_facets.h /^ class money_get : public locale::facet$/;" c namespace:std inherits:locale::facet +money_put cpp_src/locale_facets.h /^ money_put(size_t __refs = 0) : facet(__refs) { }$/;" f class:std::money_put access:public signature:(size_t __refs = 0) +money_put cpp_src/locale_facets.h /^ class money_put : public locale::facet$/;" c namespace:std inherits:locale::facet +moneypunct cpp_src/locale_facets.h /^ moneypunct(__c_locale __cloc, const char* __s, size_t __refs = 0)$/;" f class:std::moneypunct access:public signature:(__c_locale __cloc, const char* __s, size_t __refs = 0) +moneypunct cpp_src/locale_facets.h /^ moneypunct(__cache_type* __cache, size_t __refs = 0)$/;" f class:std::moneypunct access:public signature:(__cache_type* __cache, size_t __refs = 0) +moneypunct cpp_src/locale_facets.h /^ moneypunct(size_t __refs = 0) : facet(__refs), _M_data(NULL)$/;" f class:std::moneypunct access:public signature:(size_t __refs = 0) +moneypunct cpp_src/locale_facets.h /^ class moneypunct : public locale::facet, public money_base$/;" c namespace:std inherits:locale::facet,money_base +moneypunct_byname cpp_src/locale_facets.h /^ moneypunct_byname(const char* __s, size_t __refs = 0)$/;" f class:std::moneypunct_byname access:public signature:(const char* __s, size_t __refs = 0) +moneypunct_byname cpp_src/locale_facets.h /^ class moneypunct_byname : public moneypunct<_CharT, _Intl>$/;" c namespace:std inherits:moneypunct +move cpp_src/char_traits.h /^ move(char_type* __s1, const char_type* __s2, std::size_t __n);$/;" p struct:char_traits access:public signature:(char_type* __s1, const char_type* __s2, std::size_t __n) +move cpp_src/char_traits.h /^ move(char_type* __s1, const char_type* __s2, std::size_t __n)$/;" f class:char_traits signature:(char_type* __s1, const char_type* __s2, std::size_t __n) +multimap cpp_src/stl_multimap.h /^ multimap(_InputIterator __first, _InputIterator __last)$/;" f class:std::multimap access:public signature:(_InputIterator __first, _InputIterator __last) +multimap cpp_src/stl_multimap.h /^ multimap(_InputIterator __first, _InputIterator __last,$/;" f class:std::multimap access:public signature:(_InputIterator __first, _InputIterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) +multimap cpp_src/stl_multimap.h /^ multimap()$/;" f class:std::multimap access:public signature:() +multimap cpp_src/stl_multimap.h /^ multimap(const _Compare& __comp,$/;" f class:std::multimap access:public signature:(const _Compare& __comp, const allocator_type& __a = allocator_type()) +multimap cpp_src/stl_multimap.h /^ multimap(const multimap& __x)$/;" f class:std::multimap access:public signature:(const multimap& __x) +multimap cpp_src/stl_multimap.h /^ class multimap$/;" c namespace:std +multiplies cpp_src/stl_function.h /^ struct multiplies : public binary_function<_Tp, _Tp, _Tp>$/;" s namespace:std inherits:binary_function +multiset cpp_src/stl_multiset.h /^ multiset(_InputIterator __first, _InputIterator __last)$/;" f class:std::multiset access:public signature:(_InputIterator __first, _InputIterator __last) +multiset cpp_src/stl_multiset.h /^ multiset(_InputIterator __first, _InputIterator __last,$/;" f class:std::multiset access:public signature:(_InputIterator __first, _InputIterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) +multiset cpp_src/stl_multiset.h /^ multiset()$/;" f class:std::multiset access:public signature:() +multiset cpp_src/stl_multiset.h /^ multiset(const _Compare& __comp,$/;" f class:std::multiset access:public signature:(const _Compare& __comp, const allocator_type& __a = allocator_type()) +multiset cpp_src/stl_multiset.h /^ multiset(const multiset<_Key,_Compare,_Alloc>& __x)$/;" f class:std::multiset access:public signature:(const multiset<_Key,_Compare,_Alloc>& __x) +multiset cpp_src/stl_multiset.h /^ class multiset$/;" c namespace:std +name cpp_src/locale_classes.h /^ name() const;$/;" p class:std::locale access:public signature:() const +name cpp_src/typeinfo /^ const char* name() const$/;" f class:std::type_info access:public signature:() const +narrow cpp_src/basic_ios.h /^ narrow(char_type __c, char __dfault) const;$/;" p class:std::basic_ios access:public signature:(char_type __c, char __dfault) const +narrow cpp_src/basic_ios.tcc /^ basic_ios<_CharT, _Traits>::narrow(char_type __c, char __dfault) const$/;" f class:std::basic_ios signature:(char_type __c, char __dfault) const +narrow cpp_src/locale_facets.h /^ narrow(char_type __c, char __dfault) const$/;" f class:std::__ctype_abstract_base access:public signature:(char_type __c, char __dfault) const +narrow cpp_src/locale_facets.h /^ narrow(char_type __c, char __dfault) const$/;" f class:std::ctype access:public signature:(char_type __c, char __dfault) const +narrow cpp_src/locale_facets.h /^ narrow(const char_type* __lo, const char_type* __hi,$/;" f class:std::__ctype_abstract_base access:public signature:(const char_type* __lo, const char_type* __hi, char __dfault, char *__to) const +narrow cpp_src/locale_facets.h /^ narrow(const char_type* __lo, const char_type* __hi,$/;" f class:std::ctype access:public signature:(const char_type* __lo, const char_type* __hi, char __dfault, char *__to) const +neg_format cpp_src/locale_facets.h /^ neg_format() const$/;" f class:std::moneypunct access:public signature:() const +negate cpp_src/stl_function.h /^ struct negate : public unary_function<_Tp, _Tp>$/;" s namespace:std inherits:unary_function +negative_sign cpp_src/locale_facets.h /^ negative_sign() const$/;" f class:std::moneypunct access:public signature:() const +new_handler cpp_src/new /^ typedef void (*new_handler)();$/;" t namespace:std file: +next_permutation cpp_src/stl_algo.h /^ next_permutation(_BidirectionalIterator __first,$/;" f namespace:std signature:(_BidirectionalIterator __first, _BidirectionalIterator __last) +next_permutation cpp_src/stl_algo.h /^ next_permutation(_BidirectionalIterator __first,$/;" f namespace:std signature:(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) +no_order cpp_src/locale_facets.h /^ enum dateorder { no_order, dmy, mdy, ymd, ydm };$/;" e enum:std::time_base::dateorder +noboolalpha cpp_src/ios_base.h /^ noboolalpha(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +noconv cpp_src/codecvt.h /^ noconv$/;" e enum:std::codecvt_base::result +none cpp_src/bitset /^ none() const$/;" f class:std::bitset access:public signature:() const +none cpp_src/locale_classes.h /^ static const category none = 0;$/;" m class:std::locale access:public +none cpp_src/locale_facets.h /^ enum part { none, space, symbol, sign, value };$/;" e enum:std::money_base::part +norm cpp_src/complex /^ norm(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +norm cpp_src/complex /^ template _Tp norm(const complex<_Tp>&);$/;" p namespace:std file: signature:(const complex<_Tp>&) +noshowbase cpp_src/ios_base.h /^ noshowbase(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +noshowpoint cpp_src/ios_base.h /^ noshowpoint(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +noshowpos cpp_src/ios_base.h /^ noshowpos(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +noskipws cpp_src/ios_base.h /^ noskipws(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +not1 cpp_src/stl_function.h /^ not1(const _Predicate& __pred)$/;" f namespace:std signature:(const _Predicate& __pred) +not2 cpp_src/stl_function.h /^ not2(const _Predicate& __pred)$/;" f namespace:std signature:(const _Predicate& __pred) +not_eof cpp_src/char_traits.h /^ not_eof(const int_type& __c)$/;" f struct:char_traits access:public signature:(const int_type& __c) +not_equal_to cpp_src/stl_function.h /^ struct not_equal_to : public binary_function<_Tp, _Tp, bool>$/;" s namespace:std inherits:binary_function +nothrow_t cpp_src/new /^ struct nothrow_t { };$/;" s namespace:std file: +nounitbuf cpp_src/ios_base.h /^ nounitbuf(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +nouppercase cpp_src/ios_base.h /^ nouppercase(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +npos cpp_src/basic_string.h /^ static const size_type npos = static_cast(-1);$/;" m class:std::basic_string access:public +npos cpp_src/basic_string.tcc /^ basic_string<_CharT, _Traits, _Alloc>::npos;$/;" m class:std::basic_string file: +nth_element cpp_src/stl_algo.h /^ nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) +nth_element cpp_src/stl_algo.h /^ nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) +num_get cpp_src/locale_facets.h /^ num_get(size_t __refs = 0) : facet(__refs) { }$/;" f class:std::num_get access:public signature:(size_t __refs = 0) +num_get cpp_src/locale_facets.h /^ class num_get : public locale::facet$/;" c namespace:std inherits:locale::facet +num_put cpp_src/locale_facets.h /^ num_put(size_t __refs = 0) : facet(__refs) { }$/;" f class:std::num_put access:public signature:(size_t __refs = 0) +num_put cpp_src/locale_facets.h /^ class num_put : public locale::facet$/;" c namespace:std inherits:locale::facet +numeric cpp_src/locale_classes.h /^ static const category numeric = 1L << 1;$/;" m class:std::locale access:public +numeric_limits cpp_src/limits /^ struct numeric_limits : public __numeric_limits_base$/;" s namespace:std file: inherits:__numeric_limits_base +numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +numpunct cpp_src/locale_facets.h /^ numpunct(__c_locale __cloc, size_t __refs = 0)$/;" f class:std::numpunct access:public signature:(__c_locale __cloc, size_t __refs = 0) +numpunct cpp_src/locale_facets.h /^ numpunct(__cache_type* __cache, size_t __refs = 0)$/;" f class:std::numpunct access:public signature:(__cache_type* __cache, size_t __refs = 0) +numpunct cpp_src/locale_facets.h /^ numpunct(size_t __refs = 0) : facet(__refs), _M_data(NULL)$/;" f class:std::numpunct access:public signature:(size_t __refs = 0) +numpunct cpp_src/locale_facets.h /^ class numpunct : public locale::facet$/;" c namespace:std inherits:locale::facet +numpunct_byname cpp_src/locale_facets.h /^ numpunct_byname(const char* __s, size_t __refs = 0)$/;" f class:std::numpunct_byname access:public signature:(const char* __s, size_t __refs = 0) +numpunct_byname cpp_src/locale_facets.h /^ class numpunct_byname : public numpunct<_CharT>$/;" c namespace:std inherits:numpunct +oct cpp_src/ios_base.h /^ static const fmtflags oct = _S_oct;$/;" m class:std::ios_base access:public +oct cpp_src/ios_base.h /^ oct(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +off_type cpp_src/basic_ios.h /^ typedef typename _Traits::off_type off_type;$/;" t class:std::basic_ios access:public +off_type cpp_src/char_traits.h /^ typedef std::streamoff off_type;$/;" t struct:_Char_types access:public +off_type cpp_src/char_traits.h /^ typedef typename _Char_types<_CharT>::off_type off_type;$/;" t struct:char_traits access:public +off_type cpp_src/fstream /^ typedef typename traits_type::off_type off_type;$/;" t class:std::basic_filebuf file: access:public +off_type cpp_src/fstream /^ typedef typename traits_type::off_type off_type;$/;" t class:std::basic_fstream file: access:public +off_type cpp_src/fstream /^ typedef typename traits_type::off_type off_type;$/;" t class:std::basic_ifstream file: access:public +off_type cpp_src/fstream /^ typedef typename traits_type::off_type off_type;$/;" t class:std::basic_ofstream file: access:public +off_type cpp_src/istream /^ typedef typename _Traits::off_type off_type;$/;" t class:std::basic_iostream file: access:public +off_type cpp_src/istream /^ typedef typename _Traits::off_type off_type;$/;" t class:std::basic_istream file: access:public +off_type cpp_src/ostream /^ typedef typename _Traits::off_type off_type;$/;" t class:std::basic_ostream file: access:public +off_type cpp_src/sstream /^ typedef typename traits_type::off_type off_type;$/;" t class:std::basic_istringstream file: access:public +off_type cpp_src/sstream /^ typedef typename traits_type::off_type off_type;$/;" t class:std::basic_ostringstream file: access:public +off_type cpp_src/sstream /^ typedef typename traits_type::off_type off_type;$/;" t class:std::basic_stringbuf file: access:public +off_type cpp_src/sstream /^ typedef typename traits_type::off_type off_type;$/;" t class:std::basic_stringstream file: access:public +off_type cpp_src/streambuf /^ typedef typename traits_type::off_type off_type;$/;" t class:std::basic_streambuf file: access:public +ofstream cpp_src/iosfwd /^ typedef basic_ofstream ofstream; \/\/\/< @isiosfwd$/;" t namespace:std file: +ok cpp_src/codecvt.h /^ ok,$/;" e enum:std::codecvt_base::result +op cpp_src/stl_function.h /^ _Operation op;$/;" m class:std::binder1st access:protected +op cpp_src/stl_function.h /^ _Operation op;$/;" m class:std::binder2nd access:protected +open cpp_src/fstream /^ open(const char* __s, ios_base::openmode __mode = ios_base::in)$/;" f class:std::basic_ifstream access:public signature:(const char* __s, ios_base::openmode __mode = ios_base::in) +open cpp_src/fstream /^ open(const char* __s, ios_base::openmode __mode);$/;" p class:std::basic_filebuf file: access:public signature:(const char* __s, ios_base::openmode __mode) +open cpp_src/fstream /^ open(const char* __s,$/;" f class:std::basic_fstream access:public signature:(const char* __s, ios_base::openmode __mode = ios_base::in | ios_base::out) +open cpp_src/fstream /^ open(const char* __s,$/;" f class:std::basic_ofstream access:public signature:(const char* __s, ios_base::openmode __mode = ios_base::out | ios_base::trunc) +open cpp_src/fstream.tcc /^ open(const char* __s, ios_base::openmode __mode)$/;" f class:std::basic_filebuf signature:(const char* __s, ios_base::openmode __mode) +open cpp_src/locale_facets.h /^ open(const basic_string& __s, const locale& __loc) const$/;" f class:std::messages access:public signature:(const basic_string& __s, const locale& __loc) const +open cpp_src/locale_facets.h /^ open(const basic_string&, const locale&, const char*) const;$/;" p class:std::messages access:public signature:(const basic_string&, const locale&, const char*) const +open_mode cpp_src/ios_base.h /^ typedef int open_mode;$/;" t class:std::ios_base access:public +openmode cpp_src/ios_base.h /^ typedef _Ios_Openmode openmode;$/;" t class:std::ios_base access:public +operator ! cpp_src/basic_ios.h /^ operator!() const$/;" f class:std::basic_ios access:public signature:() const +operator ! cpp_src/valarray /^ typename _UnaryOp<__logical_not>::_Rt operator!() const;$/;" p class:std::valarray file: access:public signature:() const +operator ! cpp_src/valarray_after.h /^ operator!() const;$/;" p class:std::_Expr access:public signature:() const +operator ! cpp_src/valarray_after.h /^ _Expr<_Dom, _Tp>::operator!() const$/;" f class:std::_Expr signature:() const +operator != cpp_src/allocator.h /^ operator!=(const allocator<_T1>&, const allocator<_T2>&)$/;" f namespace:std signature:(const allocator<_T1>&, const allocator<_T2>&) +operator != cpp_src/allocator.h /^ operator!=(const allocator<_Tp>&, const allocator<_Tp>&)$/;" f namespace:std signature:(const allocator<_Tp>&, const allocator<_Tp>&) +operator != cpp_src/basic_string.h /^ operator!=(const _CharT* __lhs,$/;" f namespace:std signature:(const _CharT* __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) +operator != cpp_src/basic_string.h /^ operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,$/;" f namespace:std signature:(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const _CharT* __rhs) +operator != cpp_src/basic_string.h /^ operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,$/;" f namespace:std signature:(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) +operator != cpp_src/bitset /^ operator!=(const bitset<_Nb>& __rhs) const$/;" f class:std::bitset access:public signature:(const bitset<_Nb>& __rhs) const +operator != cpp_src/complex /^ operator!=(const _Tp& __x, const complex<_Tp>& __y)$/;" f namespace:std signature:(const _Tp& __x, const complex<_Tp>& __y) +operator != cpp_src/complex /^ operator!=(const complex<_Tp>& __x, const _Tp& __y)$/;" f namespace:std signature:(const complex<_Tp>& __x, const _Tp& __y) +operator != cpp_src/complex /^ operator!=(const complex<_Tp>& __x, const complex<_Tp>& __y)$/;" f namespace:std signature:(const complex<_Tp>& __x, const complex<_Tp>& __y) +operator != cpp_src/locale_classes.h /^ operator!=(const locale& __other) const throw ()$/;" f class:std::locale access:public signature:(const locale& __other) const +operator != cpp_src/postypes.h /^ operator!=(const fpos<_StateT>& __lhs, const fpos<_StateT>& __rhs)$/;" f namespace:std signature:(const fpos<_StateT>& __lhs, const fpos<_StateT>& __rhs) +operator != cpp_src/stl_bvector.h /^ operator!=(const _Bit_iterator_base& __i) const$/;" f struct:std::_Bit_iterator_base access:public signature:(const _Bit_iterator_base& __i) const +operator != cpp_src/stl_deque.h /^ operator!=(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x,$/;" f namespace:std signature:(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) +operator != cpp_src/stl_deque.h /^ operator!=(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x,$/;" f namespace:std signature:(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) +operator != cpp_src/stl_deque.h /^ operator!=(const deque<_Tp, _Alloc>& __x,$/;" f namespace:std signature:(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) +operator != cpp_src/stl_iterator.h /^ operator!=(const __normal_iterator<_Iterator, _Container>& __lhs,$/;" f signature:(const __normal_iterator<_Iterator, _Container>& __lhs, const __normal_iterator<_Iterator, _Container>& __rhs) +operator != cpp_src/stl_iterator.h /^ operator!=(const __normal_iterator<_IteratorL, _Container>& __lhs,$/;" f signature:(const __normal_iterator<_IteratorL, _Container>& __lhs, const __normal_iterator<_IteratorR, _Container>& __rhs) +operator != cpp_src/stl_iterator.h /^ operator!=(const reverse_iterator<_Iterator>& __x,$/;" f namespace:std signature:(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) +operator != cpp_src/stl_iterator.h /^ operator!=(const reverse_iterator<_IteratorL>& __x,$/;" f namespace:std signature:(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) +operator != cpp_src/stl_list.h /^ operator!=(const _Self& __x) const$/;" f struct:std::_List_const_iterator access:public signature:(const _Self& __x) const +operator != cpp_src/stl_list.h /^ operator!=(const _Self& __x) const$/;" f struct:std::_List_iterator access:public signature:(const _Self& __x) const +operator != cpp_src/stl_list.h /^ operator!=(const _List_iterator<_Val>& __x,$/;" f namespace:std signature:(const _List_iterator<_Val>& __x, const _List_const_iterator<_Val>& __y) +operator != cpp_src/stl_list.h /^ operator!=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)$/;" f namespace:std signature:(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) +operator != cpp_src/stl_map.h /^ operator!=(const map<_Key, _Tp, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const map<_Key, _Tp, _Compare, _Alloc>& __x, const map<_Key, _Tp, _Compare, _Alloc>& __y) +operator != cpp_src/stl_multimap.h /^ operator!=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, const multimap<_Key, _Tp, _Compare, _Alloc>& __y) +operator != cpp_src/stl_multiset.h /^ operator!=(const multiset<_Key, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const multiset<_Key, _Compare, _Alloc>& __x, const multiset<_Key, _Compare, _Alloc>& __y) +operator != cpp_src/stl_pair.h /^ operator!=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)$/;" f namespace:std signature:(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) +operator != cpp_src/stl_queue.h /^ operator!=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)$/;" f namespace:std signature:(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) +operator != cpp_src/stl_relops.h /^ operator!=(const _Tp& __x, const _Tp& __y)$/;" f namespace:std::rel_ops signature:(const _Tp& __x, const _Tp& __y) +operator != cpp_src/stl_set.h /^ operator!=(const set<_Key, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const set<_Key, _Compare, _Alloc>& __x, const set<_Key, _Compare, _Alloc>& __y) +operator != cpp_src/stl_stack.h /^ operator!=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)$/;" f namespace:std signature:(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) +operator != cpp_src/stl_tree.h /^ operator!=(const _Self& __x) const$/;" f struct:std::_Rb_tree_const_iterator access:public signature:(const _Self& __x) const +operator != cpp_src/stl_tree.h /^ operator!=(const _Self& __x) const$/;" f struct:std::_Rb_tree_iterator access:public signature:(const _Self& __x) const +operator != cpp_src/stl_tree.h /^ operator!=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) +operator != cpp_src/stl_tree.h /^ operator!=(const _Rb_tree_iterator<_Val>& __x,$/;" f namespace:std signature:(const _Rb_tree_iterator<_Val>& __x, const _Rb_tree_const_iterator<_Val>& __y) +operator != cpp_src/stl_vector.h /^ operator!=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)$/;" f namespace:std signature:(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) +operator != cpp_src/stream_iterator.h /^ operator!=(const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __x,$/;" f namespace:std signature:(const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __x, const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __y) +operator != cpp_src/streambuf_iterator.h /^ operator!=(const istreambuf_iterator<_CharT, _Traits>& __a,$/;" f namespace:std signature:(const istreambuf_iterator<_CharT, _Traits>& __a, const istreambuf_iterator<_CharT, _Traits>& __b) +operator != cpp_src/typeinfo /^ bool operator!=(const type_info& __arg) const$/;" f class:std::type_info access:public signature:(const type_info& __arg) const +operator %= cpp_src/gslice_array.h /^ void operator%=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator %= cpp_src/gslice_array.h /^ void operator%=(const valarray<_Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const valarray<_Tp>&) const +operator %= cpp_src/indirect_array.h /^ void operator%=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator %= cpp_src/indirect_array.h /^ void operator%=(const valarray<_Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const valarray<_Tp>&) const +operator %= cpp_src/mask_array.h /^ void operator%=(const _Expr<_Dom,_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const _Expr<_Dom,_Tp>&) const +operator %= cpp_src/mask_array.h /^ void operator%=(const valarray<_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const valarray<_Tp>&) const +operator %= cpp_src/slice_array.h /^ void operator%=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::slice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator %= cpp_src/slice_array.h /^ void operator%=(const valarray<_Tp>&) const;$/;" p class:std::slice_array access:public signature:(const valarray<_Tp>&) const +operator %= cpp_src/valarray /^ valarray<_Tp>& operator%=(const _Expr<_Dom, _Tp>&);$/;" p class:std::valarray file: access:public signature:(const _Expr<_Dom, _Tp>&) +operator %= cpp_src/valarray /^ valarray<_Tp>& operator%=(const _Tp&);$/;" p class:std::valarray file: access:public signature:(const _Tp&) +operator %= cpp_src/valarray /^ valarray<_Tp>& operator%=(const valarray<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const valarray<_Tp>&) +operator & cpp_src/bitset /^ operator&(const bitset<_Nb>& __x, const bitset<_Nb>& __y)$/;" f namespace:std signature:(const bitset<_Nb>& __x, const bitset<_Nb>& __y) +operator & cpp_src/ios_base.h /^ operator&(_Ios_Fmtflags __a, _Ios_Fmtflags __b)$/;" f namespace:std signature:(_Ios_Fmtflags __a, _Ios_Fmtflags __b) +operator & cpp_src/ios_base.h /^ operator&(_Ios_Iostate __a, _Ios_Iostate __b)$/;" f namespace:std signature:(_Ios_Iostate __a, _Ios_Iostate __b) +operator & cpp_src/ios_base.h /^ operator&(_Ios_Openmode __a, _Ios_Openmode __b)$/;" f namespace:std signature:(_Ios_Openmode __a, _Ios_Openmode __b) +operator &= cpp_src/bitset /^ operator&=(const bitset<_Nb>& __rhs)$/;" f class:std::bitset access:public signature:(const bitset<_Nb>& __rhs) +operator &= cpp_src/gslice_array.h /^ void operator&=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator &= cpp_src/gslice_array.h /^ void operator&=(const valarray<_Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const valarray<_Tp>&) const +operator &= cpp_src/indirect_array.h /^ void operator&=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator &= cpp_src/indirect_array.h /^ void operator&=(const valarray<_Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const valarray<_Tp>&) const +operator &= cpp_src/ios_base.h /^ operator&=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b)$/;" f namespace:std signature:(_Ios_Fmtflags& __a, _Ios_Fmtflags __b) +operator &= cpp_src/ios_base.h /^ operator&=(_Ios_Iostate& __a, _Ios_Iostate __b)$/;" f namespace:std signature:(_Ios_Iostate& __a, _Ios_Iostate __b) +operator &= cpp_src/ios_base.h /^ operator&=(_Ios_Openmode& __a, _Ios_Openmode __b)$/;" f namespace:std signature:(_Ios_Openmode& __a, _Ios_Openmode __b) +operator &= cpp_src/mask_array.h /^ void operator&=(const _Expr<_Dom,_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const _Expr<_Dom,_Tp>&) const +operator &= cpp_src/mask_array.h /^ void operator&=(const valarray<_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const valarray<_Tp>&) const +operator &= cpp_src/slice_array.h /^ void operator&=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::slice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator &= cpp_src/slice_array.h /^ void operator&=(const valarray<_Tp>&) const;$/;" p class:std::slice_array access:public signature:(const valarray<_Tp>&) const +operator &= cpp_src/valarray /^ valarray<_Tp>& operator&=(const _Expr<_Dom, _Tp>&);$/;" p class:std::valarray file: access:public signature:(const _Expr<_Dom, _Tp>&) +operator &= cpp_src/valarray /^ valarray<_Tp>& operator&=(const _Tp&);$/;" p class:std::valarray file: access:public signature:(const _Tp&) +operator &= cpp_src/valarray /^ valarray<_Tp>& operator&=(const valarray<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const valarray<_Tp>&) +operator () cpp_src/locale_classes.h /^ operator()(const basic_string<_Char, _Traits, _Alloc>& __s1,$/;" p class:std::locale access:public signature:(const basic_string<_Char, _Traits, _Alloc>& __s1, const basic_string<_Char, _Traits, _Alloc>& __s2) const +operator () cpp_src/locale_facets.tcc /^ operator() (const locale& __loc) const$/;" f struct:std::__use_cache access:public signature:(const locale& __loc) const +operator () cpp_src/locale_facets.tcc /^ operator() (const locale& __loc) const;$/;" p struct:std::__use_cache file: access:public signature:(const locale& __loc) const +operator () cpp_src/locale_facets.tcc /^ locale::operator()(const basic_string<_CharT, _Traits, _Alloc>& __s1,$/;" f class:std::locale signature:(const basic_string<_CharT, _Traits, _Alloc>& __s1, const basic_string<_CharT, _Traits, _Alloc>& __s2) const +operator () cpp_src/stl_function.h /^ operator()(_Arg __x) const$/;" f class:std::pointer_to_unary_function access:public signature:(_Arg __x) const +operator () cpp_src/stl_function.h /^ operator()(_Arg1 __x, _Arg2 __y) const$/;" f class:std::pointer_to_binary_function access:public signature:(_Arg1 __x, _Arg2 __y) const +operator () cpp_src/stl_function.h /^ operator()(_Pair& __x) const$/;" f struct:std::_Select1st access:public signature:(_Pair& __x) const +operator () cpp_src/stl_function.h /^ operator()(_Pair& __x) const$/;" f struct:std::_Select2nd access:public signature:(_Pair& __x) const +operator () cpp_src/stl_function.h /^ operator()(_Tp& __r) const$/;" f class:std::mem_fun_ref_t access:public signature:(_Tp& __r) const +operator () cpp_src/stl_function.h /^ operator()(_Tp& __r, _Arg __x) const$/;" f class:std::mem_fun1_ref_t access:public signature:(_Tp& __r, _Arg __x) const +operator () cpp_src/stl_function.h /^ operator()(_Tp& __x) const$/;" f struct:std::_Identity access:public signature:(_Tp& __x) const +operator () cpp_src/stl_function.h /^ operator()(_Tp* __p) const$/;" f class:std::mem_fun_t access:public signature:(_Tp* __p) const +operator () cpp_src/stl_function.h /^ operator()(_Tp* __p, _Arg __x) const$/;" f class:std::mem_fun1_t access:public signature:(_Tp* __p, _Arg __x) const +operator () cpp_src/stl_function.h /^ operator()(const _Pair& __x) const$/;" f struct:std::_Select1st access:public signature:(const _Pair& __x) const +operator () cpp_src/stl_function.h /^ operator()(const _Pair& __x) const$/;" f struct:std::_Select2nd access:public signature:(const _Pair& __x) const +operator () cpp_src/stl_function.h /^ operator()(const _Tp& __r) const$/;" f class:std::const_mem_fun_ref_t access:public signature:(const _Tp& __r) const +operator () cpp_src/stl_function.h /^ operator()(const _Tp& __r, _Arg __x) const$/;" f class:std::const_mem_fun1_ref_t access:public signature:(const _Tp& __r, _Arg __x) const +operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x) const$/;" f struct:std::_Identity access:public signature:(const _Tp& __x) const +operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x) const$/;" f struct:std::logical_not access:public signature:(const _Tp& __x) const +operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x) const$/;" f struct:std::negate access:public signature:(const _Tp& __x) const +operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::divides access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::equal_to access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::greater access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::greater_equal access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::less access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::less_equal access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::logical_and access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::logical_or access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::minus access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::modulus access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::multiplies access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::not_equal_to access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::plus access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/stl_function.h /^ operator()(const _Tp* __p) const$/;" f class:std::const_mem_fun_t access:public signature:(const _Tp* __p) const +operator () cpp_src/stl_function.h /^ operator()(const _Tp* __p, _Arg __x) const$/;" f class:std::const_mem_fun1_t access:public signature:(const _Tp* __p, _Arg __x) const +operator () cpp_src/stl_function.h /^ operator()(const typename _Operation::first_argument_type& __x) const$/;" f class:std::binder2nd access:public signature:(const typename _Operation::first_argument_type& __x) const +operator () cpp_src/stl_function.h /^ operator()(const typename _Operation::second_argument_type& __x) const$/;" f class:std::binder1st access:public signature:(const typename _Operation::second_argument_type& __x) const +operator () cpp_src/stl_function.h /^ operator()(const typename _Predicate::argument_type& __x) const$/;" f class:std::unary_negate access:public signature:(const typename _Predicate::argument_type& __x) const +operator () cpp_src/stl_function.h /^ operator()(const typename _Predicate::first_argument_type& __x,$/;" f class:std::binary_negate access:public signature:(const typename _Predicate::first_argument_type& __x, const typename _Predicate::second_argument_type& __y) const +operator () cpp_src/stl_function.h /^ operator()(typename _Operation::first_argument_type& __x) const$/;" f class:std::binder2nd access:public signature:(typename _Operation::first_argument_type& __x) const +operator () cpp_src/stl_function.h /^ operator()(typename _Operation::second_argument_type& __x) const$/;" f class:std::binder1st access:public signature:(typename _Operation::second_argument_type& __x) const +operator () cpp_src/stl_map.h /^ bool operator()(const value_type& __x, const value_type& __y) const$/;" f class:std::map::value_compare access:public signature:(const value_type& __x, const value_type& __y) const +operator () cpp_src/stl_multimap.h /^ bool operator()(const value_type& __x, const value_type& __y) const$/;" f class:std::multimap::value_compare access:public signature:(const value_type& __x, const value_type& __y) const +operator () cpp_src/valarray_after.h /^ const _Clos& operator()() const;$/;" p class:std::_Expr access:public signature:() const +operator () cpp_src/valarray_after.h /^ _Expr<_Clos, _Tp>::operator()() const$/;" f class:std::_Expr signature:() const +operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__abs access:public signature:(const _Tp& __t) const +operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__acos access:public signature:(const _Tp& __t) const +operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__asin access:public signature:(const _Tp& __t) const +operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__atan access:public signature:(const _Tp& __t) const +operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__bitwise_not access:public signature:(const _Tp& __t) const +operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__cos access:public signature:(const _Tp& __t) const +operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__cosh access:public signature:(const _Tp& __t) const +operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__exp access:public signature:(const _Tp& __t) const +operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__log access:public signature:(const _Tp& __t) const +operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__log10 access:public signature:(const _Tp& __t) const +operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__negate access:public signature:(const _Tp& __t) const +operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__sin access:public signature:(const _Tp& __t) const +operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__sinh access:public signature:(const _Tp& __t) const +operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__sqrt access:public signature:(const _Tp& __t) const +operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__tan access:public signature:(const _Tp& __t) const +operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__tanh access:public signature:(const _Tp& __t) const +operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__unary_plus access:public signature:(const _Tp& __t) const +operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__atan2 access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__bitwise_and access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__bitwise_or access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__bitwise_xor access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__divides access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__minus access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__modulus access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__multiplies access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__plus access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__pow access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__shift_left access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__shift_right access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/valarray_before.h /^ bool operator()(const _Tp& __x) const { return !__x; }$/;" f struct:std::__logical_not access:public signature:(const _Tp& __x) const +operator () cpp_src/valarray_before.h /^ bool operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__equal_to access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/valarray_before.h /^ bool operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__greater access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/valarray_before.h /^ bool operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__greater_equal access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/valarray_before.h /^ bool operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__less access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/valarray_before.h /^ bool operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__less_equal access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/valarray_before.h /^ bool operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__logical_and access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/valarray_before.h /^ bool operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__logical_or access:public signature:(const _Tp& __x, const _Tp& __y) const +operator () cpp_src/valarray_before.h /^ bool operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__not_equal_to access:public signature:(const _Tp& __x, const _Tp& __y) const +operator * cpp_src/complex /^ operator*(const _Tp& __x, const complex<_Tp>& __y)$/;" f namespace:std signature:(const _Tp& __x, const complex<_Tp>& __y) +operator * cpp_src/complex /^ operator*(const complex<_Tp>& __x, const _Tp& __y)$/;" f namespace:std signature:(const complex<_Tp>& __x, const _Tp& __y) +operator * cpp_src/complex /^ operator*(const complex<_Tp>& __x, const complex<_Tp>& __y)$/;" f namespace:std signature:(const complex<_Tp>& __x, const complex<_Tp>& __y) +operator * cpp_src/memory /^ operator*() const throw() $/;" f class:std::auto_ptr access:public signature:() const +operator * cpp_src/stl_bvector.h /^ operator*() const$/;" f struct:std::_Bit_const_iterator access:public signature:() const +operator * cpp_src/stl_bvector.h /^ operator*() const$/;" f struct:std::_Bit_iterator access:public signature:() const +operator * cpp_src/stl_deque.h /^ operator*() const$/;" f struct:std::_Deque_iterator access:public signature:() const +operator * cpp_src/stl_iterator.h /^ operator*() const$/;" f class:__normal_iterator access:public signature:() const +operator * cpp_src/stl_iterator.h /^ operator*() const$/;" f class:std::reverse_iterator access:public signature:() const +operator * cpp_src/stl_iterator.h /^ operator*()$/;" f class:std::back_insert_iterator access:public signature:() +operator * cpp_src/stl_iterator.h /^ operator*()$/;" f class:std::front_insert_iterator access:public signature:() +operator * cpp_src/stl_iterator.h /^ operator*()$/;" f class:std::insert_iterator access:public signature:() +operator * cpp_src/stl_list.h /^ operator*() const$/;" f struct:std::_List_const_iterator access:public signature:() const +operator * cpp_src/stl_list.h /^ operator*() const$/;" f struct:std::_List_iterator access:public signature:() const +operator * cpp_src/stl_raw_storage_iter.h /^ operator*() { return *this; }$/;" f class:std::raw_storage_iterator access:public signature:() +operator * cpp_src/stl_tree.h /^ operator*() const$/;" f struct:std::_Rb_tree_const_iterator access:public signature:() const +operator * cpp_src/stl_tree.h /^ operator*() const$/;" f struct:std::_Rb_tree_iterator access:public signature:() const +operator * cpp_src/stream_iterator.h /^ operator*() const$/;" f class:std::istream_iterator access:public signature:() const +operator * cpp_src/stream_iterator.h /^ operator*()$/;" f class:std::ostream_iterator access:public signature:() +operator * cpp_src/streambuf_iterator.h /^ operator*() const$/;" f class:std::istreambuf_iterator access:public signature:() const +operator * cpp_src/streambuf_iterator.h /^ operator*()$/;" f class:std::ostreambuf_iterator access:public signature:() +operator *= cpp_src/complex /^ complex<_Tp>& operator*=(const complex<_Up>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Up>&) +operator *= cpp_src/complex /^ complex& operator*=(const complex<_Tp>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Tp>&) +operator *= cpp_src/complex /^ complex& operator*=(const complex<_Tp>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Tp>&) +operator *= cpp_src/complex /^ complex& operator*=(const complex<_Tp>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Tp>&) +operator *= cpp_src/complex /^ complex<_Tp>& operator*=(const _Tp&);$/;" p struct:std::complex file: access:public signature:(const _Tp&) +operator *= cpp_src/complex /^ complex& operator*=(double);$/;" p struct:std::complex file: access:public signature:(double) +operator *= cpp_src/complex /^ complex& operator*=(float);$/;" p struct:std::complex file: access:public signature:(float) +operator *= cpp_src/complex /^ complex& operator*= (long double);$/;" p struct:std::complex file: access:public signature:(long double) +operator *= cpp_src/complex /^ complex<_Tp>::operator*=(const _Tp& __t)$/;" f class:std::complex signature:(const _Tp& __t) +operator *= cpp_src/complex /^ complex<_Tp>::operator*=(const complex<_Up>& __z)$/;" f class:std::complex signature:(const complex<_Up>& __z) +operator *= cpp_src/complex /^ complex::operator*=(const complex<_Tp>& __z)$/;" f class:std::complex signature:(const complex<_Tp>& __z) +operator *= cpp_src/complex /^ complex::operator*=(const complex<_Tp>& __z)$/;" f class:std::complex signature:(const complex<_Tp>& __z) +operator *= cpp_src/complex /^ complex::operator*=(const complex<_Tp>& __z)$/;" f class:std::complex signature:(const complex<_Tp>& __z) +operator *= cpp_src/complex /^ complex::operator*=(double __d)$/;" f class:std::complex signature:(double __d) +operator *= cpp_src/complex /^ complex::operator*=(float __f)$/;" f class:std::complex signature:(float __f) +operator *= cpp_src/complex /^ complex::operator*=(long double __r)$/;" f class:std::complex signature:(long double __r) +operator *= cpp_src/gslice_array.h /^ void operator*=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator *= cpp_src/gslice_array.h /^ void operator*=(const valarray<_Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const valarray<_Tp>&) const +operator *= cpp_src/indirect_array.h /^ void operator*=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator *= cpp_src/indirect_array.h /^ void operator*=(const valarray<_Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const valarray<_Tp>&) const +operator *= cpp_src/mask_array.h /^ void operator*=(const _Expr<_Dom,_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const _Expr<_Dom,_Tp>&) const +operator *= cpp_src/mask_array.h /^ void operator*=(const valarray<_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const valarray<_Tp>&) const +operator *= cpp_src/slice_array.h /^ void operator*=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::slice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator *= cpp_src/slice_array.h /^ void operator*=(const valarray<_Tp>&) const;$/;" p class:std::slice_array access:public signature:(const valarray<_Tp>&) const +operator *= cpp_src/valarray /^ valarray<_Tp>& operator*=(const _Expr<_Dom, _Tp>&);$/;" p class:std::valarray file: access:public signature:(const _Expr<_Dom, _Tp>&) +operator *= cpp_src/valarray /^ valarray<_Tp>& operator*=(const _Tp&);$/;" p class:std::valarray file: access:public signature:(const _Tp&) +operator *= cpp_src/valarray /^ valarray<_Tp>& operator*=(const valarray<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const valarray<_Tp>&) +operator + cpp_src/basic_string.h /^ operator+(_CharT __lhs, const basic_string<_CharT,_Traits,_Alloc>& __rhs);$/;" p namespace:std signature:(_CharT __lhs, const basic_string<_CharT,_Traits,_Alloc>& __rhs) +operator + cpp_src/basic_string.h /^ operator+(const _CharT* __lhs,$/;" p namespace:std signature:(const _CharT* __lhs, const basic_string<_CharT,_Traits,_Alloc>& __rhs) +operator + cpp_src/basic_string.h /^ operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs, _CharT __rhs)$/;" f namespace:std signature:(const basic_string<_CharT, _Traits, _Alloc>& __lhs, _CharT __rhs) +operator + cpp_src/basic_string.h /^ operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs,$/;" f namespace:std signature:(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const _CharT* __rhs) +operator + cpp_src/basic_string.h /^ operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs,$/;" f namespace:std signature:(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) +operator + cpp_src/basic_string.tcc /^ operator+(_CharT __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs)$/;" f namespace:std signature:(_CharT __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) +operator + cpp_src/basic_string.tcc /^ operator+(const _CharT* __lhs,$/;" f namespace:std signature:(const _CharT* __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) +operator + cpp_src/complex /^ operator+(const _Tp& __x, const complex<_Tp>& __y)$/;" f namespace:std signature:(const _Tp& __x, const complex<_Tp>& __y) +operator + cpp_src/complex /^ operator+(const complex<_Tp>& __x)$/;" f namespace:std signature:(const complex<_Tp>& __x) +operator + cpp_src/complex /^ operator+(const complex<_Tp>& __x, const _Tp& __y)$/;" f namespace:std signature:(const complex<_Tp>& __x, const _Tp& __y) +operator + cpp_src/complex /^ operator+(const complex<_Tp>& __x, const complex<_Tp>& __y)$/;" f namespace:std signature:(const complex<_Tp>& __x, const complex<_Tp>& __y) +operator + cpp_src/postypes.h /^ operator+(streamoff __off) const$/;" f class:std::fpos access:public signature:(streamoff __off) const +operator + cpp_src/stl_bvector.h /^ operator+(difference_type __i) const$/;" f struct:std::_Bit_const_iterator access:public signature:(difference_type __i) const +operator + cpp_src/stl_bvector.h /^ operator+(difference_type __i) const$/;" f struct:std::_Bit_iterator access:public signature:(difference_type __i) const +operator + cpp_src/stl_bvector.h /^ operator+(ptrdiff_t __n, const _Bit_const_iterator& __x)$/;" f namespace:std signature:(ptrdiff_t __n, const _Bit_const_iterator& __x) +operator + cpp_src/stl_bvector.h /^ operator+(ptrdiff_t __n, const _Bit_iterator& __x)$/;" f namespace:std signature:(ptrdiff_t __n, const _Bit_iterator& __x) +operator + cpp_src/stl_deque.h /^ operator+(difference_type __n) const$/;" f struct:std::_Deque_iterator access:public signature:(difference_type __n) const +operator + cpp_src/stl_deque.h /^ operator+(ptrdiff_t __n, const _Deque_iterator<_Tp, _Ref, _Ptr>& __x)$/;" f namespace:std signature:(ptrdiff_t __n, const _Deque_iterator<_Tp, _Ref, _Ptr>& __x) +operator + cpp_src/stl_iterator.h /^ operator+(const difference_type& __n) const$/;" f class:__normal_iterator access:public signature:(const difference_type& __n) const +operator + cpp_src/stl_iterator.h /^ operator+(difference_type __n) const$/;" f class:std::reverse_iterator access:public signature:(difference_type __n) const +operator + cpp_src/stl_iterator.h /^ operator+(typename __normal_iterator<_Iterator, _Container>::difference_type$/;" f signature:(typename __normal_iterator<_Iterator, _Container>::difference_type __n, const __normal_iterator<_Iterator, _Container>& __i) +operator + cpp_src/stl_iterator.h /^ operator+(typename reverse_iterator<_Iterator>::difference_type __n,$/;" f namespace:std signature:(typename reverse_iterator<_Iterator>::difference_type __n, const reverse_iterator<_Iterator>& __x) +operator + cpp_src/valarray /^ typename _UnaryOp<__unary_plus>::_Rt operator+() const;$/;" p class:std::valarray file: access:public signature:() const +operator + cpp_src/valarray_after.h /^ operator+() const;$/;" p class:std::_Expr access:public signature:() const +operator ++ cpp_src/stl_bvector.h /^ operator++()$/;" f struct:std::_Bit_const_iterator access:public signature:() +operator ++ cpp_src/stl_bvector.h /^ operator++()$/;" f struct:std::_Bit_iterator access:public signature:() +operator ++ cpp_src/stl_bvector.h /^ operator++(int)$/;" f struct:std::_Bit_const_iterator access:public signature:(int) +operator ++ cpp_src/stl_bvector.h /^ operator++(int)$/;" f struct:std::_Bit_iterator access:public signature:(int) +operator ++ cpp_src/stl_deque.h /^ operator++()$/;" f struct:std::_Deque_iterator access:public signature:() +operator ++ cpp_src/stl_deque.h /^ operator++(int)$/;" f struct:std::_Deque_iterator access:public signature:(int) +operator ++ cpp_src/stl_iterator.h /^ operator++()$/;" f class:__normal_iterator access:public signature:() +operator ++ cpp_src/stl_iterator.h /^ operator++()$/;" f class:std::back_insert_iterator access:public signature:() +operator ++ cpp_src/stl_iterator.h /^ operator++()$/;" f class:std::front_insert_iterator access:public signature:() +operator ++ cpp_src/stl_iterator.h /^ operator++()$/;" f class:std::insert_iterator access:public signature:() +operator ++ cpp_src/stl_iterator.h /^ operator++()$/;" f class:std::reverse_iterator access:public signature:() +operator ++ cpp_src/stl_iterator.h /^ operator++(int)$/;" f class:__normal_iterator access:public signature:(int) +operator ++ cpp_src/stl_iterator.h /^ operator++(int)$/;" f class:std::back_insert_iterator access:public signature:(int) +operator ++ cpp_src/stl_iterator.h /^ operator++(int)$/;" f class:std::front_insert_iterator access:public signature:(int) +operator ++ cpp_src/stl_iterator.h /^ operator++(int)$/;" f class:std::insert_iterator access:public signature:(int) +operator ++ cpp_src/stl_iterator.h /^ operator++(int)$/;" f class:std::reverse_iterator access:public signature:(int) +operator ++ cpp_src/stl_list.h /^ operator++()$/;" f struct:std::_List_const_iterator access:public signature:() +operator ++ cpp_src/stl_list.h /^ operator++()$/;" f struct:std::_List_iterator access:public signature:() +operator ++ cpp_src/stl_list.h /^ operator++(int)$/;" f struct:std::_List_const_iterator access:public signature:(int) +operator ++ cpp_src/stl_list.h /^ operator++(int)$/;" f struct:std::_List_iterator access:public signature:(int) +operator ++ cpp_src/stl_raw_storage_iter.h /^ operator++()$/;" f class:std::raw_storage_iterator access:public signature:() +operator ++ cpp_src/stl_raw_storage_iter.h /^ operator++(int)$/;" f class:std::raw_storage_iterator access:public signature:(int) +operator ++ cpp_src/stl_tree.h /^ operator++()$/;" f struct:std::_Rb_tree_const_iterator access:public signature:() +operator ++ cpp_src/stl_tree.h /^ operator++()$/;" f struct:std::_Rb_tree_iterator access:public signature:() +operator ++ cpp_src/stl_tree.h /^ operator++(int)$/;" f struct:std::_Rb_tree_const_iterator access:public signature:(int) +operator ++ cpp_src/stl_tree.h /^ operator++(int)$/;" f struct:std::_Rb_tree_iterator access:public signature:(int) +operator ++ cpp_src/stream_iterator.h /^ operator++()$/;" f class:std::istream_iterator access:public signature:() +operator ++ cpp_src/stream_iterator.h /^ operator++()$/;" f class:std::ostream_iterator access:public signature:() +operator ++ cpp_src/stream_iterator.h /^ operator++(int)$/;" f class:std::istream_iterator access:public signature:(int) +operator ++ cpp_src/stream_iterator.h /^ operator++(int)$/;" f class:std::ostream_iterator access:public signature:(int) +operator ++ cpp_src/streambuf_iterator.h /^ operator++()$/;" f class:std::istreambuf_iterator access:public signature:() +operator ++ cpp_src/streambuf_iterator.h /^ operator++()$/;" f class:std::ostreambuf_iterator access:public signature:() +operator ++ cpp_src/streambuf_iterator.h /^ operator++(int)$/;" f class:std::istreambuf_iterator access:public signature:(int) +operator ++ cpp_src/streambuf_iterator.h /^ operator++(int)$/;" f class:std::ostreambuf_iterator access:public signature:(int) +operator += cpp_src/basic_string.h /^ operator+=(_CharT __c)$/;" f class:std::basic_string access:public signature:(_CharT __c) +operator += cpp_src/basic_string.h /^ operator+=(const _CharT* __s)$/;" f class:std::basic_string access:public signature:(const _CharT* __s) +operator += cpp_src/basic_string.h /^ operator+=(const basic_string& __str)$/;" f class:std::basic_string access:public signature:(const basic_string& __str) +operator += cpp_src/complex /^ complex<_Tp>& operator+=(const complex<_Up>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Up>&) +operator += cpp_src/complex /^ complex& operator+=(const complex<_Tp>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Tp>&) +operator += cpp_src/complex /^ complex& operator+=(const complex<_Tp>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Tp>&) +operator += cpp_src/complex /^ complex& operator+=(const complex<_Tp>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Tp>&) +operator += cpp_src/complex /^ complex<_Tp>& operator+=(const _Tp&);$/;" p struct:std::complex file: access:public signature:(const _Tp&) +operator += cpp_src/complex /^ complex& operator+=(double);$/;" p struct:std::complex file: access:public signature:(double) +operator += cpp_src/complex /^ complex& operator+=(float);$/;" p struct:std::complex file: access:public signature:(float) +operator += cpp_src/complex /^ complex& operator+= (long double);$/;" p struct:std::complex file: access:public signature:(long double) +operator += cpp_src/complex /^ complex<_Tp>::operator+=(const _Tp& __t)$/;" f class:std::complex signature:(const _Tp& __t) +operator += cpp_src/complex /^ complex<_Tp>::operator+=(const complex<_Up>& __z)$/;" f class:std::complex signature:(const complex<_Up>& __z) +operator += cpp_src/complex /^ complex::operator+=(const complex<_Tp>& __z)$/;" f class:std::complex signature:(const complex<_Tp>& __z) +operator += cpp_src/complex /^ complex::operator+=(const complex<_Tp>& __z)$/;" f class:std::complex signature:(const complex<_Tp>& __z) +operator += cpp_src/complex /^ complex::operator+=(double __d)$/;" f class:std::complex signature:(double __d) +operator += cpp_src/complex /^ complex::operator+=(const complex<_Tp>& __z)$/;" f class:std::complex signature:(const complex<_Tp>& __z) +operator += cpp_src/complex /^ complex::operator+=(float __f)$/;" f class:std::complex signature:(float __f) +operator += cpp_src/complex /^ complex::operator+=(long double __r)$/;" f class:std::complex signature:(long double __r) +operator += cpp_src/gslice_array.h /^ void operator+=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator += cpp_src/gslice_array.h /^ void operator+=(const valarray<_Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const valarray<_Tp>&) const +operator += cpp_src/indirect_array.h /^ void operator+=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator += cpp_src/indirect_array.h /^ void operator+=(const valarray<_Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const valarray<_Tp>&) const +operator += cpp_src/mask_array.h /^ void operator+=(const _Expr<_Dom,_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const _Expr<_Dom,_Tp>&) const +operator += cpp_src/mask_array.h /^ void operator+=(const valarray<_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const valarray<_Tp>&) const +operator += cpp_src/postypes.h /^ operator+=(streamoff __off)$/;" f class:std::fpos access:public signature:(streamoff __off) +operator += cpp_src/slice_array.h /^ void operator+=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::slice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator += cpp_src/slice_array.h /^ void operator+=(const valarray<_Tp>&) const;$/;" p class:std::slice_array access:public signature:(const valarray<_Tp>&) const +operator += cpp_src/stl_bvector.h /^ operator+=(difference_type __i)$/;" f struct:std::_Bit_const_iterator access:public signature:(difference_type __i) +operator += cpp_src/stl_bvector.h /^ operator+=(difference_type __i)$/;" f struct:std::_Bit_iterator access:public signature:(difference_type __i) +operator += cpp_src/stl_deque.h /^ operator+=(difference_type __n)$/;" f struct:std::_Deque_iterator access:public signature:(difference_type __n) +operator += cpp_src/stl_iterator.h /^ operator+=(const difference_type& __n)$/;" f class:__normal_iterator access:public signature:(const difference_type& __n) +operator += cpp_src/stl_iterator.h /^ operator+=(difference_type __n)$/;" f class:std::reverse_iterator access:public signature:(difference_type __n) +operator += cpp_src/valarray /^ valarray<_Tp>& operator+=(const _Expr<_Dom, _Tp>&);$/;" p class:std::valarray file: access:public signature:(const _Expr<_Dom, _Tp>&) +operator += cpp_src/valarray /^ valarray<_Tp>& operator+=(const _Tp&);$/;" p class:std::valarray file: access:public signature:(const _Tp&) +operator += cpp_src/valarray /^ valarray<_Tp>& operator+=(const valarray<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const valarray<_Tp>&) +operator - cpp_src/complex /^ operator-(const _Tp& __x, const complex<_Tp>& __y)$/;" f namespace:std signature:(const _Tp& __x, const complex<_Tp>& __y) +operator - cpp_src/complex /^ operator-(const complex<_Tp>& __x)$/;" f namespace:std signature:(const complex<_Tp>& __x) +operator - cpp_src/complex /^ operator-(const complex<_Tp>& __x, const _Tp& __y)$/;" f namespace:std signature:(const complex<_Tp>& __x, const _Tp& __y) +operator - cpp_src/complex /^ operator-(const complex<_Tp>& __x, const complex<_Tp>& __y)$/;" f namespace:std signature:(const complex<_Tp>& __x, const complex<_Tp>& __y) +operator - cpp_src/postypes.h /^ operator-(const fpos& __other) const$/;" f class:std::fpos access:public signature:(const fpos& __other) const +operator - cpp_src/postypes.h /^ operator-(streamoff __off) const$/;" f class:std::fpos access:public signature:(streamoff __off) const +operator - cpp_src/stl_bvector.h /^ operator-(difference_type __i) const$/;" f struct:std::_Bit_const_iterator access:public signature:(difference_type __i) const +operator - cpp_src/stl_bvector.h /^ operator-(difference_type __i) const$/;" f struct:std::_Bit_iterator access:public signature:(difference_type __i) const +operator - cpp_src/stl_bvector.h /^ operator-(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y)$/;" f namespace:std signature:(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y) +operator - cpp_src/stl_deque.h /^ operator-(difference_type __n) const$/;" f struct:std::_Deque_iterator access:public signature:(difference_type __n) const +operator - cpp_src/stl_deque.h /^ operator-(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x,$/;" f namespace:std signature:(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) +operator - cpp_src/stl_deque.h /^ operator-(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x,$/;" f namespace:std signature:(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) +operator - cpp_src/stl_iterator.h /^ operator-(const difference_type& __n) const$/;" f class:__normal_iterator access:public signature:(const difference_type& __n) const +operator - cpp_src/stl_iterator.h /^ operator-(difference_type __n) const$/;" f class:std::reverse_iterator access:public signature:(difference_type __n) const +operator - cpp_src/stl_iterator.h /^ operator-(const __normal_iterator<_Iterator, _Container>& __lhs,$/;" f signature:(const __normal_iterator<_Iterator, _Container>& __lhs, const __normal_iterator<_Iterator, _Container>& __rhs) +operator - cpp_src/stl_iterator.h /^ operator-(const __normal_iterator<_IteratorL, _Container>& __lhs,$/;" f signature:(const __normal_iterator<_IteratorL, _Container>& __lhs, const __normal_iterator<_IteratorR, _Container>& __rhs) +operator - cpp_src/stl_iterator.h /^ operator-(const reverse_iterator<_Iterator>& __x,$/;" f namespace:std signature:(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) +operator - cpp_src/stl_iterator.h /^ operator-(const reverse_iterator<_IteratorL>& __x,$/;" f namespace:std signature:(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) +operator - cpp_src/valarray /^ typename _UnaryOp<__negate>::_Rt operator-() const;$/;" p class:std::valarray file: access:public signature:() const +operator - cpp_src/valarray_after.h /^ operator-() const;$/;" p class:std::_Expr access:public signature:() const +operator -- cpp_src/stl_bvector.h /^ operator--()$/;" f struct:std::_Bit_const_iterator access:public signature:() +operator -- cpp_src/stl_bvector.h /^ operator--()$/;" f struct:std::_Bit_iterator access:public signature:() +operator -- cpp_src/stl_bvector.h /^ operator--(int)$/;" f struct:std::_Bit_const_iterator access:public signature:(int) +operator -- cpp_src/stl_bvector.h /^ operator--(int)$/;" f struct:std::_Bit_iterator access:public signature:(int) +operator -- cpp_src/stl_deque.h /^ operator--()$/;" f struct:std::_Deque_iterator access:public signature:() +operator -- cpp_src/stl_deque.h /^ operator--(int)$/;" f struct:std::_Deque_iterator access:public signature:(int) +operator -- cpp_src/stl_iterator.h /^ operator--()$/;" f class:__normal_iterator access:public signature:() +operator -- cpp_src/stl_iterator.h /^ operator--()$/;" f class:std::reverse_iterator access:public signature:() +operator -- cpp_src/stl_iterator.h /^ operator--(int)$/;" f class:__normal_iterator access:public signature:(int) +operator -- cpp_src/stl_iterator.h /^ operator--(int)$/;" f class:std::reverse_iterator access:public signature:(int) +operator -- cpp_src/stl_list.h /^ operator--()$/;" f struct:std::_List_const_iterator access:public signature:() +operator -- cpp_src/stl_list.h /^ operator--()$/;" f struct:std::_List_iterator access:public signature:() +operator -- cpp_src/stl_list.h /^ operator--(int)$/;" f struct:std::_List_const_iterator access:public signature:(int) +operator -- cpp_src/stl_list.h /^ operator--(int)$/;" f struct:std::_List_iterator access:public signature:(int) +operator -- cpp_src/stl_tree.h /^ operator--()$/;" f struct:std::_Rb_tree_const_iterator access:public signature:() +operator -- cpp_src/stl_tree.h /^ operator--()$/;" f struct:std::_Rb_tree_iterator access:public signature:() +operator -- cpp_src/stl_tree.h /^ operator--(int)$/;" f struct:std::_Rb_tree_const_iterator access:public signature:(int) +operator -- cpp_src/stl_tree.h /^ operator--(int)$/;" f struct:std::_Rb_tree_iterator access:public signature:(int) +operator -= cpp_src/complex /^ complex<_Tp>& operator-=(const complex<_Up>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Up>&) +operator -= cpp_src/complex /^ complex& operator-=(const complex<_Tp>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Tp>&) +operator -= cpp_src/complex /^ complex& operator-=(const complex<_Tp>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Tp>&) +operator -= cpp_src/complex /^ complex& operator-=(const complex<_Tp>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Tp>&) +operator -= cpp_src/complex /^ complex<_Tp>& operator-=(const _Tp&);$/;" p struct:std::complex file: access:public signature:(const _Tp&) +operator -= cpp_src/complex /^ complex& operator-=(double);$/;" p struct:std::complex file: access:public signature:(double) +operator -= cpp_src/complex /^ complex& operator-=(float);$/;" p struct:std::complex file: access:public signature:(float) +operator -= cpp_src/complex /^ complex& operator-= (long double);$/;" p struct:std::complex file: access:public signature:(long double) +operator -= cpp_src/complex /^ complex<_Tp>::operator-=(const _Tp& __t)$/;" f class:std::complex signature:(const _Tp& __t) +operator -= cpp_src/complex /^ complex<_Tp>::operator-=(const complex<_Up>& __z)$/;" f class:std::complex signature:(const complex<_Up>& __z) +operator -= cpp_src/complex /^ complex::operator-=(const complex<_Tp>& __z)$/;" f class:std::complex signature:(const complex<_Tp>& __z) +operator -= cpp_src/complex /^ complex::operator-=(const complex<_Tp>& __z)$/;" f class:std::complex signature:(const complex<_Tp>& __z) +operator -= cpp_src/complex /^ complex::operator-=(const complex<_Tp>& __z)$/;" f class:std::complex signature:(const complex<_Tp>& __z) +operator -= cpp_src/complex /^ complex::operator-=(double __d)$/;" f class:std::complex signature:(double __d) +operator -= cpp_src/complex /^ complex::operator-=(float __f)$/;" f class:std::complex signature:(float __f) +operator -= cpp_src/complex /^ complex::operator-=(long double __r)$/;" f class:std::complex signature:(long double __r) +operator -= cpp_src/gslice_array.h /^ void operator-=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator -= cpp_src/gslice_array.h /^ void operator-=(const valarray<_Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const valarray<_Tp>&) const +operator -= cpp_src/indirect_array.h /^ void operator-=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator -= cpp_src/indirect_array.h /^ void operator-=(const valarray<_Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const valarray<_Tp>&) const +operator -= cpp_src/mask_array.h /^ void operator-=(const _Expr<_Dom,_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const _Expr<_Dom,_Tp>&) const +operator -= cpp_src/mask_array.h /^ void operator-=(const valarray<_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const valarray<_Tp>&) const +operator -= cpp_src/postypes.h /^ operator-=(streamoff __off)$/;" f class:std::fpos access:public signature:(streamoff __off) +operator -= cpp_src/slice_array.h /^ void operator-=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::slice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator -= cpp_src/slice_array.h /^ void operator-=(const valarray<_Tp>&) const;$/;" p class:std::slice_array access:public signature:(const valarray<_Tp>&) const +operator -= cpp_src/stl_bvector.h /^ operator-=(difference_type __i)$/;" f struct:std::_Bit_const_iterator access:public signature:(difference_type __i) +operator -= cpp_src/stl_bvector.h /^ operator-=(difference_type __i)$/;" f struct:std::_Bit_iterator access:public signature:(difference_type __i) +operator -= cpp_src/stl_deque.h /^ operator-=(difference_type __n)$/;" f struct:std::_Deque_iterator access:public signature:(difference_type __n) +operator -= cpp_src/stl_iterator.h /^ operator-=(const difference_type& __n)$/;" f class:__normal_iterator access:public signature:(const difference_type& __n) +operator -= cpp_src/stl_iterator.h /^ operator-=(difference_type __n)$/;" f class:std::reverse_iterator access:public signature:(difference_type __n) +operator -= cpp_src/valarray /^ valarray<_Tp>& operator-=(const _Expr<_Dom, _Tp>&);$/;" p class:std::valarray file: access:public signature:(const _Expr<_Dom, _Tp>&) +operator -= cpp_src/valarray /^ valarray<_Tp>& operator-=(const _Tp&);$/;" p class:std::valarray file: access:public signature:(const _Tp&) +operator -= cpp_src/valarray /^ valarray<_Tp>& operator-=(const valarray<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const valarray<_Tp>&) +operator -> cpp_src/memory /^ operator->() const throw() $/;" f class:std::auto_ptr access:public signature:() const +operator -> cpp_src/stl_deque.h /^ operator->() const$/;" f struct:std::_Deque_iterator access:public signature:() const +operator -> cpp_src/stl_iterator.h /^ operator->() const$/;" f class:__normal_iterator access:public signature:() const +operator -> cpp_src/stl_iterator.h /^ operator->() const$/;" f class:std::reverse_iterator access:public signature:() const +operator -> cpp_src/stl_list.h /^ operator->() const$/;" f struct:std::_List_const_iterator access:public signature:() const +operator -> cpp_src/stl_list.h /^ operator->() const$/;" f struct:std::_List_iterator access:public signature:() const +operator -> cpp_src/stl_tree.h /^ operator->() const$/;" f struct:std::_Rb_tree_const_iterator access:public signature:() const +operator -> cpp_src/stl_tree.h /^ operator->() const$/;" f struct:std::_Rb_tree_iterator access:public signature:() const +operator -> cpp_src/stream_iterator.h /^ operator->() const { return &(operator*()); }$/;" f class:std::istream_iterator access:public signature:() const +operator / cpp_src/complex /^ operator\/(const _Tp& __x, const complex<_Tp>& __y)$/;" f namespace:std signature:(const _Tp& __x, const complex<_Tp>& __y) +operator / cpp_src/complex /^ operator\/(const complex<_Tp>& __x, const _Tp& __y)$/;" f namespace:std signature:(const complex<_Tp>& __x, const _Tp& __y) +operator / cpp_src/complex /^ operator\/(const complex<_Tp>& __x, const complex<_Tp>& __y)$/;" f namespace:std signature:(const complex<_Tp>& __x, const complex<_Tp>& __y) +operator /= cpp_src/complex /^ complex<_Tp>& operator\/=(const complex<_Up>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Up>&) +operator /= cpp_src/complex /^ complex& operator\/=(const complex<_Tp>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Tp>&) +operator /= cpp_src/complex /^ complex&operator\/=(const complex<_Tp>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Tp>&) +operator /= cpp_src/complex /^ complex& operator\/=(const complex<_Tp>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Tp>&) +operator /= cpp_src/complex /^ complex<_Tp>& operator\/=(const _Tp&);$/;" p struct:std::complex file: access:public signature:(const _Tp&) +operator /= cpp_src/complex /^ complex& operator\/=(double);$/;" p struct:std::complex file: access:public signature:(double) +operator /= cpp_src/complex /^ complex& operator\/=(float);$/;" p struct:std::complex file: access:public signature:(float) +operator /= cpp_src/complex /^ complex& operator\/= (long double);$/;" p struct:std::complex file: access:public signature:(long double) +operator /= cpp_src/complex /^ complex<_Tp>::operator\/=(const _Tp& __t)$/;" f class:std::complex signature:(const _Tp& __t) +operator /= cpp_src/complex /^ complex<_Tp>::operator\/=(const complex<_Up>& __z)$/;" f class:std::complex signature:(const complex<_Up>& __z) +operator /= cpp_src/complex /^ complex::operator\/=(const complex<_Tp>& __z)$/;" f class:std::complex signature:(const complex<_Tp>& __z) +operator /= cpp_src/complex /^ complex::operator\/=(const complex<_Tp>& __z)$/;" f class:std::complex signature:(const complex<_Tp>& __z) +operator /= cpp_src/complex /^ complex::operator\/=(const complex<_Tp>& __z)$/;" f class:std::complex signature:(const complex<_Tp>& __z) +operator /= cpp_src/complex /^ complex::operator\/=(double __d)$/;" f class:std::complex signature:(double __d) +operator /= cpp_src/complex /^ complex::operator\/=(float __f)$/;" f class:std::complex signature:(float __f) +operator /= cpp_src/complex /^ complex::operator\/=(long double __r)$/;" f class:std::complex signature:(long double __r) +operator /= cpp_src/gslice_array.h /^ void operator\/=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator /= cpp_src/gslice_array.h /^ void operator\/=(const valarray<_Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const valarray<_Tp>&) const +operator /= cpp_src/indirect_array.h /^ void operator\/=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator /= cpp_src/indirect_array.h /^ void operator\/=(const valarray<_Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const valarray<_Tp>&) const +operator /= cpp_src/mask_array.h /^ void operator\/=(const _Expr<_Dom,_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const _Expr<_Dom,_Tp>&) const +operator /= cpp_src/mask_array.h /^ void operator\/=(const valarray<_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const valarray<_Tp>&) const +operator /= cpp_src/slice_array.h /^ void operator\/=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::slice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator /= cpp_src/slice_array.h /^ void operator\/=(const valarray<_Tp>&) const;$/;" p class:std::slice_array access:public signature:(const valarray<_Tp>&) const +operator /= cpp_src/valarray /^ valarray<_Tp>& operator\/=(const _Expr<_Dom, _Tp>&);$/;" p class:std::valarray file: access:public signature:(const _Expr<_Dom, _Tp>&) +operator /= cpp_src/valarray /^ valarray<_Tp>& operator\/=(const _Tp&);$/;" p class:std::valarray file: access:public signature:(const _Tp&) +operator /= cpp_src/valarray /^ valarray<_Tp>& operator\/=(const valarray<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const valarray<_Tp>&) +operator < cpp_src/basic_string.h /^ operator<(const _CharT* __lhs,$/;" f namespace:std signature:(const _CharT* __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) +operator < cpp_src/basic_string.h /^ operator<(const basic_string<_CharT, _Traits, _Alloc>& __lhs,$/;" f namespace:std signature:(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const _CharT* __rhs) +operator < cpp_src/basic_string.h /^ operator<(const basic_string<_CharT, _Traits, _Alloc>& __lhs,$/;" f namespace:std signature:(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) +operator < cpp_src/stl_bvector.h /^ operator<(const _Bit_iterator_base& __i) const$/;" f struct:std::_Bit_iterator_base access:public signature:(const _Bit_iterator_base& __i) const +operator < cpp_src/stl_bvector.h /^ operator<(const _Bit_reference& __x) const$/;" f struct:std::_Bit_reference access:public signature:(const _Bit_reference& __x) const +operator < cpp_src/stl_deque.h /^ operator<(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x,$/;" f namespace:std signature:(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) +operator < cpp_src/stl_deque.h /^ operator<(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x,$/;" f namespace:std signature:(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) +operator < cpp_src/stl_deque.h /^ operator<(const deque<_Tp, _Alloc>& __x,$/;" f namespace:std signature:(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) +operator < cpp_src/stl_iterator.h /^ operator<(const __normal_iterator<_Iterator, _Container>& __lhs,$/;" f signature:(const __normal_iterator<_Iterator, _Container>& __lhs, const __normal_iterator<_Iterator, _Container>& __rhs) +operator < cpp_src/stl_iterator.h /^ operator<(const __normal_iterator<_IteratorL, _Container>& __lhs,$/;" f signature:(const __normal_iterator<_IteratorL, _Container>& __lhs, const __normal_iterator<_IteratorR, _Container>& __rhs) +operator < cpp_src/stl_iterator.h /^ operator<(const reverse_iterator<_Iterator>& __x,$/;" f namespace:std signature:(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) +operator < cpp_src/stl_iterator.h /^ operator<(const reverse_iterator<_IteratorL>& __x,$/;" f namespace:std signature:(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) +operator < cpp_src/stl_list.h /^ operator<(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)$/;" f namespace:std signature:(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) +operator < cpp_src/stl_map.h /^ operator< (const map<_K1, _T1, _C1, _A1>&,$/;" p class:std::map access:friend signature:(const map<_K1, _T1, _C1, _A1>&, const map<_K1, _T1, _C1, _A1>&) +operator < cpp_src/stl_map.h /^ operator<(const map<_Key, _Tp, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const map<_Key, _Tp, _Compare, _Alloc>& __x, const map<_Key, _Tp, _Compare, _Alloc>& __y) +operator < cpp_src/stl_multimap.h /^ operator< (const multimap<_K1, _T1, _C1, _A1>&,$/;" p class:std::multimap access:friend signature:(const multimap<_K1, _T1, _C1, _A1>&, const multimap<_K1, _T1, _C1, _A1>&) +operator < cpp_src/stl_multimap.h /^ operator<(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, const multimap<_Key, _Tp, _Compare, _Alloc>& __y) +operator < cpp_src/stl_multiset.h /^ operator< (const multiset<_K1, _C1, _A1>&,$/;" p class:std::multiset access:friend signature:(const multiset<_K1, _C1, _A1>&, const multiset<_K1, _C1, _A1>&) +operator < cpp_src/stl_multiset.h /^ operator<(const multiset<_Key, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const multiset<_Key, _Compare, _Alloc>& __x, const multiset<_Key, _Compare, _Alloc>& __y) +operator < cpp_src/stl_pair.h /^ operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)$/;" f namespace:std signature:(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) +operator < cpp_src/stl_queue.h /^ operator<(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);$/;" p class:std::queue access:friend signature:(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&) +operator < cpp_src/stl_queue.h /^ operator<(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)$/;" f namespace:std signature:(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) +operator < cpp_src/stl_set.h /^ operator< (const set<_K1, _C1, _A1>&, const set<_K1, _C1, _A1>&);$/;" p class:std::set access:friend signature:(const set<_K1, _C1, _A1>&, const set<_K1, _C1, _A1>&) +operator < cpp_src/stl_set.h /^ operator<(const set<_Key, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const set<_Key, _Compare, _Alloc>& __x, const set<_Key, _Compare, _Alloc>& __y) +operator < cpp_src/stl_stack.h /^ operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);$/;" p class:std::stack access:friend signature:(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&) +operator < cpp_src/stl_stack.h /^ operator<(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)$/;" f namespace:std signature:(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) +operator < cpp_src/stl_tree.h /^ operator<(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) +operator < cpp_src/stl_vector.h /^ operator<(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)$/;" f namespace:std signature:(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) +operator << cpp_src/basic_string.h /^ operator<<(basic_ostream<_CharT, _Traits>& __os,$/;" f namespace:std signature:(basic_ostream<_CharT, _Traits>& __os, const basic_string<_CharT, _Traits, _Alloc>& __str) +operator << cpp_src/basic_string.tcc /^ operator<<(basic_ostream&, const string&);$/;" p namespace:std file: signature:(basic_ostream&, const string&) +operator << cpp_src/basic_string.tcc /^ operator<<(basic_ostream&, const wstring&);$/;" p namespace:std file: signature:(basic_ostream&, const wstring&) +operator << cpp_src/bitset /^ operator<<(size_t __position) const$/;" f class:std::bitset access:public signature:(size_t __position) const +operator << cpp_src/bitset /^ operator<<(std::basic_ostream<_CharT, _Traits>& __os,$/;" f namespace:std signature:(std::basic_ostream<_CharT, _Traits>& __os, const bitset<_Nb>& __x) +operator << cpp_src/complex /^ operator<<(basic_ostream<_CharT, _Traits>& __os, const complex<_Tp>& __x)$/;" f namespace:std signature:(basic_ostream<_CharT, _Traits>& __os, const complex<_Tp>& __x) +operator << cpp_src/iomanip /^ operator<<(basic_ostream<_CharT,_Traits>& __os, _Resetiosflags __f)$/;" f namespace:std signature:(basic_ostream<_CharT,_Traits>& __os, _Resetiosflags __f) +operator << cpp_src/iomanip /^ operator<<(basic_ostream<_CharT,_Traits>& __os, _Setbase __f)$/;" f namespace:std signature:(basic_ostream<_CharT,_Traits>& __os, _Setbase __f) +operator << cpp_src/iomanip /^ operator<<(basic_ostream<_CharT,_Traits>& __os, _Setfill<_CharT> __f)$/;" f namespace:std signature:(basic_ostream<_CharT,_Traits>& __os, _Setfill<_CharT> __f) +operator << cpp_src/iomanip /^ operator<<(basic_ostream<_CharT,_Traits>& __os, _Setiosflags __f)$/;" f namespace:std signature:(basic_ostream<_CharT,_Traits>& __os, _Setiosflags __f) +operator << cpp_src/iomanip /^ operator<<(basic_ostream<_CharT,_Traits>& __os, _Setprecision __f)$/;" f namespace:std signature:(basic_ostream<_CharT,_Traits>& __os, _Setprecision __f) +operator << cpp_src/iomanip /^ operator<<(basic_ostream<_CharT,_Traits>& __os, _Setw __f)$/;" f namespace:std signature:(basic_ostream<_CharT,_Traits>& __os, _Setw __f) +operator << cpp_src/iomanip /^ extern template ostream& operator<<(ostream&, _Resetiosflags);$/;" p namespace:std file: signature:(ostream&, _Resetiosflags) +operator << cpp_src/iomanip /^ extern template ostream& operator<<(ostream&, _Setbase);$/;" p namespace:std file: signature:(ostream&, _Setbase) +operator << cpp_src/iomanip /^ extern template ostream& operator<<(ostream&, _Setfill);$/;" p namespace:std file: signature:(ostream&, _Setfill) +operator << cpp_src/iomanip /^ extern template ostream& operator<<(ostream&, _Setiosflags);$/;" p namespace:std file: signature:(ostream&, _Setiosflags) +operator << cpp_src/iomanip /^ extern template ostream& operator<<(ostream&, _Setprecision);$/;" p namespace:std file: signature:(ostream&, _Setprecision) +operator << cpp_src/iomanip /^ extern template ostream& operator<<(ostream&, _Setw);$/;" p namespace:std file: signature:(ostream&, _Setw) +operator << cpp_src/iomanip /^ extern template wostream& operator<<(wostream&, _Resetiosflags);$/;" p namespace:std file: signature:(wostream&, _Resetiosflags) +operator << cpp_src/iomanip /^ extern template wostream& operator<<(wostream&, _Setbase);$/;" p namespace:std file: signature:(wostream&, _Setbase) +operator << cpp_src/iomanip /^ extern template wostream& operator<<(wostream&, _Setfill);$/;" p namespace:std file: signature:(wostream&, _Setfill) +operator << cpp_src/iomanip /^ extern template wostream& operator<<(wostream&, _Setiosflags);$/;" p namespace:std file: signature:(wostream&, _Setiosflags) +operator << cpp_src/iomanip /^ extern template wostream& operator<<(wostream&, _Setprecision);$/;" p namespace:std file: signature:(wostream&, _Setprecision) +operator << cpp_src/iomanip /^ extern template wostream& operator<<(wostream&, _Setw);$/;" p namespace:std file: signature:(wostream&, _Setw) +operator << cpp_src/ostream /^ operator<<(__streambuf_type* __sb);$/;" p class:std::basic_ostream file: access:public signature:(__streambuf_type* __sb) +operator << cpp_src/ostream /^ operator<<(bool __n)$/;" f class:std::basic_ostream access:public signature:(bool __n) +operator << cpp_src/ostream /^ operator<<(const void* __p)$/;" f class:std::basic_ostream access:public signature:(const void* __p) +operator << cpp_src/ostream /^ operator<<(double __f)$/;" f class:std::basic_ostream access:public signature:(double __f) +operator << cpp_src/ostream /^ operator<<(float __f)$/;" f class:std::basic_ostream access:public signature:(float __f) +operator << cpp_src/ostream /^ operator<<(int __n);$/;" p class:std::basic_ostream file: access:public signature:(int __n) +operator << cpp_src/ostream /^ operator<<(long __n)$/;" f class:std::basic_ostream access:public signature:(long __n) +operator << cpp_src/ostream /^ operator<<(long double __f)$/;" f class:std::basic_ostream access:public signature:(long double __f) +operator << cpp_src/ostream /^ operator<<(long long __n)$/;" f class:std::basic_ostream access:public signature:(long long __n) +operator << cpp_src/ostream /^ operator<<(short __n);$/;" p class:std::basic_ostream file: access:public signature:(short __n) +operator << cpp_src/ostream /^ operator<<(unsigned int __n)$/;" f class:std::basic_ostream access:public signature:(unsigned int __n) +operator << cpp_src/ostream /^ operator<<(unsigned long __n)$/;" f class:std::basic_ostream access:public signature:(unsigned long __n) +operator << cpp_src/ostream /^ operator<<(unsigned long long __n)$/;" f class:std::basic_ostream access:public signature:(unsigned long long __n) +operator << cpp_src/ostream /^ operator<<(unsigned short __n)$/;" f class:std::basic_ostream access:public signature:(unsigned short __n) +operator << cpp_src/ostream /^ operator<<(basic_ostream<_CharT, _Traits>& __out, _CharT __c)$/;" f namespace:std signature:(basic_ostream<_CharT, _Traits>& __out, _CharT __c) +operator << cpp_src/ostream /^ operator<<(basic_ostream<_CharT, _Traits>& __out, char __c)$/;" f namespace:std signature:(basic_ostream<_CharT, _Traits>& __out, char __c) +operator << cpp_src/ostream /^ operator<<(basic_ostream<_CharT, _Traits>& __out, const _CharT* __s)$/;" f namespace:std signature:(basic_ostream<_CharT, _Traits>& __out, const _CharT* __s) +operator << cpp_src/ostream /^ operator<<(basic_ostream<_CharT, _Traits>& __out, const char* __s);$/;" p namespace:std file: signature:(basic_ostream<_CharT, _Traits>& __out, const char* __s) +operator << cpp_src/ostream /^ operator<<(basic_ostream& __out, char __c)$/;" f namespace:std signature:(basic_ostream& __out, char __c) +operator << cpp_src/ostream /^ operator<<(basic_ostream& __out, const char* __s)$/;" f namespace:std signature:(basic_ostream& __out, const char* __s) +operator << cpp_src/ostream /^ operator<<(basic_ostream& __out, const signed char* __s)$/;" f namespace:std signature:(basic_ostream& __out, const signed char* __s) +operator << cpp_src/ostream /^ operator<<(basic_ostream& __out, const unsigned char* __s)$/;" f namespace:std signature:(basic_ostream& __out, const unsigned char* __s) +operator << cpp_src/ostream /^ operator<<(basic_ostream& __out, signed char __c)$/;" f namespace:std signature:(basic_ostream& __out, signed char __c) +operator << cpp_src/ostream /^ operator<<(basic_ostream& __out, unsigned char __c)$/;" f namespace:std signature:(basic_ostream& __out, unsigned char __c) +operator << cpp_src/ostream.tcc /^ operator<<(__streambuf_type* __sbin)$/;" f class:std::basic_ostream signature:(__streambuf_type* __sbin) +operator << cpp_src/ostream.tcc /^ operator<<(basic_ostream<_CharT, _Traits>& __out, const char* __s)$/;" f namespace:std signature:(basic_ostream<_CharT, _Traits>& __out, const char* __s) +operator << cpp_src/ostream.tcc /^ operator<<(int __n)$/;" f class:std::basic_ostream signature:(int __n) +operator << cpp_src/ostream.tcc /^ operator<<(short __n)$/;" f class:std::basic_ostream signature:(short __n) +operator << cpp_src/ostream.tcc /^ extern template ostream& operator<<(ostream&, char);$/;" p namespace:std file: signature:(ostream&, char) +operator << cpp_src/ostream.tcc /^ extern template ostream& operator<<(ostream&, const char*);$/;" p namespace:std file: signature:(ostream&, const char*) +operator << cpp_src/ostream.tcc /^ extern template ostream& operator<<(ostream&, const signed char*);$/;" p namespace:std file: signature:(ostream&, const signed char*) +operator << cpp_src/ostream.tcc /^ extern template ostream& operator<<(ostream&, const unsigned char*);$/;" p namespace:std file: signature:(ostream&, const unsigned char*) +operator << cpp_src/ostream.tcc /^ extern template ostream& operator<<(ostream&, signed char);$/;" p namespace:std file: signature:(ostream&, signed char) +operator << cpp_src/ostream.tcc /^ extern template ostream& operator<<(ostream&, unsigned char);$/;" p namespace:std file: signature:(ostream&, unsigned char) +operator << cpp_src/ostream.tcc /^ extern template wostream& operator<<(wostream&, char);$/;" p namespace:std file: signature:(wostream&, char) +operator << cpp_src/ostream.tcc /^ extern template wostream& operator<<(wostream&, const char*);$/;" p namespace:std file: signature:(wostream&, const char*) +operator << cpp_src/ostream.tcc /^ extern template wostream& operator<<(wostream&, const wchar_t*);$/;" p namespace:std file: signature:(wostream&, const wchar_t*) +operator << cpp_src/ostream.tcc /^ extern template wostream& operator<<(wostream&, wchar_t);$/;" p namespace:std file: signature:(wostream&, wchar_t) +operator <<= cpp_src/bitset /^ operator<<=(size_t __position)$/;" f class:std::bitset access:public signature:(size_t __position) +operator <<= cpp_src/gslice_array.h /^ void operator<<=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator <<= cpp_src/gslice_array.h /^ void operator<<=(const valarray<_Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const valarray<_Tp>&) const +operator <<= cpp_src/indirect_array.h /^ void operator<<=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator <<= cpp_src/indirect_array.h /^ void operator<<=(const valarray<_Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const valarray<_Tp>&) const +operator <<= cpp_src/mask_array.h /^ void operator<<=(const _Expr<_Dom,_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const _Expr<_Dom,_Tp>&) const +operator <<= cpp_src/mask_array.h /^ void operator<<=(const valarray<_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const valarray<_Tp>&) const +operator <<= cpp_src/slice_array.h /^ void operator<<=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::slice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator <<= cpp_src/slice_array.h /^ void operator<<=(const valarray<_Tp>&) const;$/;" p class:std::slice_array access:public signature:(const valarray<_Tp>&) const +operator <<= cpp_src/valarray /^ valarray<_Tp>& operator<<=(const _Expr<_Dom, _Tp>&);$/;" p class:std::valarray file: access:public signature:(const _Expr<_Dom, _Tp>&) +operator <<= cpp_src/valarray /^ valarray<_Tp>& operator<<=(const _Tp&);$/;" p class:std::valarray file: access:public signature:(const _Tp&) +operator <<= cpp_src/valarray /^ valarray<_Tp>& operator<<=(const valarray<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const valarray<_Tp>&) +operator <= cpp_src/basic_string.h /^ operator<=(const _CharT* __lhs,$/;" f namespace:std signature:(const _CharT* __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) +operator <= cpp_src/basic_string.h /^ operator<=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,$/;" f namespace:std signature:(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const _CharT* __rhs) +operator <= cpp_src/basic_string.h /^ operator<=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,$/;" f namespace:std signature:(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) +operator <= cpp_src/stl_bvector.h /^ operator<=(const _Bit_iterator_base& __i) const$/;" f struct:std::_Bit_iterator_base access:public signature:(const _Bit_iterator_base& __i) const +operator <= cpp_src/stl_deque.h /^ operator<=(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x,$/;" f namespace:std signature:(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) +operator <= cpp_src/stl_deque.h /^ operator<=(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x,$/;" f namespace:std signature:(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) +operator <= cpp_src/stl_deque.h /^ operator<=(const deque<_Tp, _Alloc>& __x,$/;" f namespace:std signature:(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) +operator <= cpp_src/stl_iterator.h /^ operator<=(const __normal_iterator<_Iterator, _Container>& __lhs,$/;" f signature:(const __normal_iterator<_Iterator, _Container>& __lhs, const __normal_iterator<_Iterator, _Container>& __rhs) +operator <= cpp_src/stl_iterator.h /^ operator<=(const __normal_iterator<_IteratorL, _Container>& __lhs,$/;" f signature:(const __normal_iterator<_IteratorL, _Container>& __lhs, const __normal_iterator<_IteratorR, _Container>& __rhs) +operator <= cpp_src/stl_iterator.h /^ operator<=(const reverse_iterator<_Iterator>& __x,$/;" f namespace:std signature:(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) +operator <= cpp_src/stl_iterator.h /^ operator<=(const reverse_iterator<_IteratorL>& __x,$/;" f namespace:std signature:(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) +operator <= cpp_src/stl_list.h /^ operator<=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)$/;" f namespace:std signature:(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) +operator <= cpp_src/stl_map.h /^ operator<=(const map<_Key, _Tp, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const map<_Key, _Tp, _Compare, _Alloc>& __x, const map<_Key, _Tp, _Compare, _Alloc>& __y) +operator <= cpp_src/stl_multimap.h /^ operator<=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, const multimap<_Key, _Tp, _Compare, _Alloc>& __y) +operator <= cpp_src/stl_multiset.h /^ operator<=(const multiset<_Key, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const multiset<_Key, _Compare, _Alloc>& __x, const multiset<_Key, _Compare, _Alloc>& __y) +operator <= cpp_src/stl_pair.h /^ operator<=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)$/;" f namespace:std signature:(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) +operator <= cpp_src/stl_queue.h /^ operator<=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)$/;" f namespace:std signature:(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) +operator <= cpp_src/stl_relops.h /^ operator<=(const _Tp& __x, const _Tp& __y)$/;" f namespace:std::rel_ops signature:(const _Tp& __x, const _Tp& __y) +operator <= cpp_src/stl_set.h /^ operator<=(const set<_Key, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const set<_Key, _Compare, _Alloc>& __x, const set<_Key, _Compare, _Alloc>& __y) +operator <= cpp_src/stl_stack.h /^ operator<=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)$/;" f namespace:std signature:(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) +operator <= cpp_src/stl_tree.h /^ operator<=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) +operator <= cpp_src/stl_vector.h /^ operator<=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)$/;" f namespace:std signature:(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) +operator = cpp_src/basic_string.h /^ operator=(_CharT __c) $/;" f class:std::basic_string access:public signature:(_CharT __c) +operator = cpp_src/basic_string.h /^ operator=(const _CharT* __s) $/;" f class:std::basic_string access:public signature:(const _CharT* __s) +operator = cpp_src/basic_string.h /^ operator=(const basic_string& __str) $/;" f class:std::basic_string access:public signature:(const basic_string& __str) +operator = cpp_src/bitset /^ operator=(bool __x)$/;" f class:std::bitset::reference access:public signature:(bool __x) +operator = cpp_src/bitset /^ operator=(const reference& __j)$/;" f class:std::bitset::reference access:public signature:(const reference& __j) +operator = cpp_src/complex /^ complex<_Tp>& operator=(const complex<_Up>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Up>&) +operator = cpp_src/complex /^ complex& operator=(const complex<_Tp>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Tp>&) +operator = cpp_src/complex /^ complex&operator=(const complex<_Tp>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Tp>&) +operator = cpp_src/complex /^ complex& operator=(const complex<_Tp>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Tp>&) +operator = cpp_src/complex /^ complex<_Tp>& operator=(const _Tp&);$/;" p struct:std::complex file: access:public signature:(const _Tp&) +operator = cpp_src/complex /^ complex& operator=(double);$/;" p struct:std::complex file: access:public signature:(double) +operator = cpp_src/complex /^ complex& operator=(float);$/;" p struct:std::complex file: access:public signature:(float) +operator = cpp_src/complex /^ complex& operator= (long double);$/;" p struct:std::complex file: access:public signature:(long double) +operator = cpp_src/complex /^ complex<_Tp>::operator=(const _Tp& __t)$/;" f class:std::complex signature:(const _Tp& __t) +operator = cpp_src/complex /^ complex<_Tp>::operator=(const complex<_Up>& __z)$/;" f class:std::complex signature:(const complex<_Up>& __z) +operator = cpp_src/complex /^ complex::operator=(const complex<_Tp>& __z)$/;" f class:std::complex signature:(const complex<_Tp>& __z) +operator = cpp_src/complex /^ complex::operator=(const complex<_Tp>& __z)$/;" f class:std::complex signature:(const complex<_Tp>& __z) +operator = cpp_src/complex /^ complex::operator=(double __d)$/;" f class:std::complex signature:(double __d) +operator = cpp_src/complex /^ complex::operator=(const complex<_Tp>& __z)$/;" f class:std::complex signature:(const complex<_Tp>& __z) +operator = cpp_src/complex /^ complex::operator=(float __f)$/;" f class:std::complex signature:(float __f) +operator = cpp_src/complex /^ complex::operator=(long double __r)$/;" f class:std::complex signature:(long double __r) +operator = cpp_src/deque.tcc /^ operator=(const deque& __x)$/;" f class:std::deque signature:(const deque& __x) +operator = cpp_src/gslice.h /^ gslice& operator=(const gslice&);$/;" p class:std::gslice access:public signature:(const gslice&) +operator = cpp_src/gslice.h /^ gslice::operator= (const gslice& __g)$/;" f class:std::gslice signature:(const gslice& __g) +operator = cpp_src/gslice_array.h /^ void operator=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator = cpp_src/gslice_array.h /^ gslice_array& operator=(const gslice_array&);$/;" p class:std::gslice_array access:public signature:(const gslice_array&) +operator = cpp_src/gslice_array.h /^ gslice_array<_Tp>::operator=(const _Expr<_Dom, _Tp>& __e) const$/;" f class:std::gslice_array signature:(const _Expr<_Dom, _Tp>& __e) const +operator = cpp_src/gslice_array.h /^ void operator=(const _Tp&) const;$/;" p class:std::gslice_array access:public signature:(const _Tp&) const +operator = cpp_src/gslice_array.h /^ void operator=(const valarray<_Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const valarray<_Tp>&) const +operator = cpp_src/gslice_array.h /^ gslice_array<_Tp>::operator=(const _Tp& __t) const$/;" f class:std::gslice_array signature:(const _Tp& __t) const +operator = cpp_src/gslice_array.h /^ gslice_array<_Tp>::operator=(const gslice_array<_Tp>& __a)$/;" f class:std::gslice_array signature:(const gslice_array<_Tp>& __a) +operator = cpp_src/gslice_array.h /^ gslice_array<_Tp>::operator=(const valarray<_Tp>& __v) const$/;" f class:std::gslice_array signature:(const valarray<_Tp>& __v) const +operator = cpp_src/indirect_array.h /^ indirect_array& operator=(const indirect_array&);$/;" p class:std::indirect_array access:public signature:(const indirect_array&) +operator = cpp_src/indirect_array.h /^ indirect_array<_Tp>::operator=(const _Expr<_Dom, _Tp>& __e) const$/;" f class:std::indirect_array signature:(const _Expr<_Dom, _Tp>& __e) const +operator = cpp_src/indirect_array.h /^ void operator= (const _Tp&) const;$/;" p class:std::indirect_array access:public signature:(const _Tp&) const +operator = cpp_src/indirect_array.h /^ void operator=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator = cpp_src/indirect_array.h /^ void operator=(const valarray<_Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const valarray<_Tp>&) const +operator = cpp_src/indirect_array.h /^ indirect_array<_Tp>::operator=(const _Tp& __t) const$/;" f class:std::indirect_array signature:(const _Tp& __t) const +operator = cpp_src/indirect_array.h /^ indirect_array<_Tp>::operator=(const indirect_array<_Tp>& __a)$/;" f class:std::indirect_array signature:(const indirect_array<_Tp>& __a) +operator = cpp_src/indirect_array.h /^ indirect_array<_Tp>::operator=(const valarray<_Tp>& __v) const$/;" f class:std::indirect_array signature:(const valarray<_Tp>& __v) const +operator = cpp_src/ios_base.h /^ operator=(const ios_base&);$/;" p class:std::ios_base access:private signature:(const ios_base&) +operator = cpp_src/list.tcc /^ operator=(const list& __x)$/;" f class:std::list signature:(const list& __x) +operator = cpp_src/locale_classes.h /^ operator=(const _Impl&); \/\/ Not defined.$/;" p class:std::locale::_Impl access:private signature:(const _Impl&) +operator = cpp_src/locale_classes.h /^ operator=(const facet&); \/\/ Not defined.$/;" p class:std::locale::facet access:private signature:(const facet&) +operator = cpp_src/locale_classes.h /^ operator=(const id&); \/\/ Not defined.$/;" p class:std::locale::id access:private signature:(const id&) +operator = cpp_src/locale_classes.h /^ operator=(const locale& __other) throw();$/;" p class:std::locale access:public signature:(const locale& __other) +operator = cpp_src/locale_facets.h /^ operator=(const __moneypunct_cache&);$/;" p struct:std::__moneypunct_cache access:private signature:(const __moneypunct_cache&) +operator = cpp_src/locale_facets.h /^ operator=(const __numpunct_cache&);$/;" p struct:std::__numpunct_cache access:private signature:(const __numpunct_cache&) +operator = cpp_src/locale_facets.h /^ operator=(const __timepunct_cache&);$/;" p struct:std::__timepunct_cache access:private signature:(const __timepunct_cache&) +operator = cpp_src/mask_array.h /^ void operator=(const _Expr<_Dom,_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const _Expr<_Dom,_Tp>&) const +operator = cpp_src/mask_array.h /^ mask_array& operator=(const mask_array&);$/;" p class:std::mask_array access:public signature:(const mask_array&) +operator = cpp_src/mask_array.h /^ mask_array<_Tp>::operator=(const _Expr<_Ex, _Tp>& __e) const$/;" f class:std::mask_array signature:(const _Expr<_Ex, _Tp>& __e) const +operator = cpp_src/mask_array.h /^ void operator=(const _Tp&) const;$/;" p class:std::mask_array access:public signature:(const _Tp&) const +operator = cpp_src/mask_array.h /^ void operator=(const valarray<_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const valarray<_Tp>&) const +operator = cpp_src/mask_array.h /^ mask_array<_Tp>::operator=(const _Tp& __t) const$/;" f class:std::mask_array signature:(const _Tp& __t) const +operator = cpp_src/mask_array.h /^ mask_array<_Tp>::operator=(const mask_array<_Tp>& __a)$/;" f class:std::mask_array signature:(const mask_array<_Tp>& __a) +operator = cpp_src/mask_array.h /^ mask_array<_Tp>::operator=(const valarray<_Tp>& __v) const$/;" f class:std::mask_array signature:(const valarray<_Tp>& __v) const +operator = cpp_src/memory /^ operator=(auto_ptr<_Tp1>& __a) throw()$/;" f class:std::auto_ptr access:public signature:(auto_ptr<_Tp1>& __a) +operator = cpp_src/memory /^ operator=(auto_ptr& __a) throw()$/;" f class:std::auto_ptr access:public signature:(auto_ptr& __a) +operator = cpp_src/memory /^ operator=(auto_ptr_ref __ref) throw()$/;" f class:std::auto_ptr access:public signature:(auto_ptr_ref __ref) +operator = cpp_src/slice_array.h /^ void operator=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::slice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator = cpp_src/slice_array.h /^ slice_array& operator=(const slice_array&);$/;" p class:std::slice_array access:public signature:(const slice_array&) +operator = cpp_src/slice_array.h /^ void operator=(const _Tp &) const;$/;" p class:std::slice_array access:public signature:(const _Tp &) const +operator = cpp_src/slice_array.h /^ void operator=(const valarray<_Tp>&) const;$/;" p class:std::slice_array access:public signature:(const valarray<_Tp>&) const +operator = cpp_src/slice_array.h /^ slice_array<_Tp>::operator=(const _Expr<_Dom,_Tp>& __e) const$/;" f class:std::slice_array signature:(const _Expr<_Dom,_Tp>& __e) const +operator = cpp_src/slice_array.h /^ slice_array<_Tp>::operator=(const _Tp& __t) const$/;" f class:std::slice_array signature:(const _Tp& __t) const +operator = cpp_src/slice_array.h /^ slice_array<_Tp>::operator=(const slice_array<_Tp>& __a)$/;" f class:std::slice_array signature:(const slice_array<_Tp>& __a) +operator = cpp_src/slice_array.h /^ slice_array<_Tp>::operator=(const valarray<_Tp>& __v) const$/;" f class:std::slice_array signature:(const valarray<_Tp>& __v) const +operator = cpp_src/stl_bvector.h /^ operator=(bool __x)$/;" f struct:std::_Bit_reference access:public signature:(bool __x) +operator = cpp_src/stl_bvector.h /^ operator=(const _Bit_reference& __x)$/;" f struct:std::_Bit_reference access:public signature:(const _Bit_reference& __x) +operator = cpp_src/stl_bvector.h /^ operator=(const vector& __x)$/;" f class:std::vector access:public signature:(const vector& __x) +operator = cpp_src/stl_deque.h /^ operator=(const deque& __x);$/;" p class:std::deque access:public signature:(const deque& __x) +operator = cpp_src/stl_iterator.h /^ operator=(const typename _Container::const_reference __value)$/;" f class:std::insert_iterator access:public signature:(const typename _Container::const_reference __value) +operator = cpp_src/stl_iterator.h /^ operator=(typename _Container::const_reference __value)$/;" f class:std::back_insert_iterator access:public signature:(typename _Container::const_reference __value) +operator = cpp_src/stl_iterator.h /^ operator=(typename _Container::const_reference __value)$/;" f class:std::front_insert_iterator access:public signature:(typename _Container::const_reference __value) +operator = cpp_src/stl_list.h /^ operator=(const list& __x);$/;" p class:std::list access:public signature:(const list& __x) +operator = cpp_src/stl_map.h /^ operator=(const map& __x)$/;" f class:std::map access:public signature:(const map& __x) +operator = cpp_src/stl_multimap.h /^ operator=(const multimap& __x)$/;" f class:std::multimap access:public signature:(const multimap& __x) +operator = cpp_src/stl_multiset.h /^ operator=(const multiset<_Key,_Compare,_Alloc>& __x)$/;" f class:std::multiset access:public signature:(const multiset<_Key,_Compare,_Alloc>& __x) +operator = cpp_src/stl_raw_storage_iter.h /^ operator=(const _Tp& __element)$/;" f class:std::raw_storage_iterator access:public signature:(const _Tp& __element) +operator = cpp_src/stl_set.h /^ operator=(const set<_Key, _Compare, _Alloc>& __x)$/;" f class:std::set access:public signature:(const set<_Key, _Compare, _Alloc>& __x) +operator = cpp_src/stl_tempbuf.h /^ operator=(const _Temporary_buffer&);$/;" p class:std::_Temporary_buffer access:private signature:(const _Temporary_buffer&) +operator = cpp_src/stl_tree.h /^ operator=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x);$/;" p class:std::_Rb_tree access:public signature:(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x) +operator = cpp_src/stl_tree.h /^ operator=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x)$/;" f class:std::_Rb_tree signature:(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x) +operator = cpp_src/stl_vector.h /^ operator=(const vector& __x);$/;" p class:std::vector access:public signature:(const vector& __x) +operator = cpp_src/stream_iterator.h /^ operator=(const _Tp& __value)$/;" f class:std::ostream_iterator access:public signature:(const _Tp& __value) +operator = cpp_src/streambuf /^ operator=(const __streambuf_type&) { return *this; };$/;" f class:std::basic_streambuf file: access:private signature:(const __streambuf_type&) +operator = cpp_src/streambuf_iterator.h /^ operator=(_CharT __c)$/;" f class:std::ostreambuf_iterator access:public signature:(_CharT __c) +operator = cpp_src/typeinfo /^ type_info& operator=(const type_info&);$/;" p class:std::type_info file: access:private signature:(const type_info&) +operator = cpp_src/valarray /^ operator= (const _Expr<_Dom, _Tp>&);$/;" p class:std::valarray file: access:public signature:(const _Expr<_Dom, _Tp>&) +operator = cpp_src/valarray /^ valarray<_Tp>& operator=(const _Tp&);$/;" p class:std::valarray file: access:public signature:(const _Tp&) +operator = cpp_src/valarray /^ valarray<_Tp>& operator=(const gslice_array<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const gslice_array<_Tp>&) +operator = cpp_src/valarray /^ valarray<_Tp>& operator=(const indirect_array<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const indirect_array<_Tp>&) +operator = cpp_src/valarray /^ valarray<_Tp>& operator=(const mask_array<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const mask_array<_Tp>&) +operator = cpp_src/valarray /^ valarray<_Tp>& operator=(const slice_array<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const slice_array<_Tp>&) +operator = cpp_src/valarray /^ valarray<_Tp>& operator=(const valarray<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const valarray<_Tp>&) +operator = cpp_src/valarray /^ valarray<_Tp>::operator=(const _Expr<_Dom, _Tp>& __e)$/;" f class:std::valarray signature:(const _Expr<_Dom, _Tp>& __e) +operator = cpp_src/valarray /^ valarray<_Tp>::operator=(const _Tp& __t)$/;" f class:std::valarray signature:(const _Tp& __t) +operator = cpp_src/valarray /^ valarray<_Tp>::operator=(const gslice_array<_Tp>& __ga)$/;" f class:std::valarray signature:(const gslice_array<_Tp>& __ga) +operator = cpp_src/valarray /^ valarray<_Tp>::operator=(const indirect_array<_Tp>& __ia)$/;" f class:std::valarray signature:(const indirect_array<_Tp>& __ia) +operator = cpp_src/valarray /^ valarray<_Tp>::operator=(const mask_array<_Tp>& __ma)$/;" f class:std::valarray signature:(const mask_array<_Tp>& __ma) +operator = cpp_src/valarray /^ valarray<_Tp>::operator=(const slice_array<_Tp>& __sa)$/;" f class:std::valarray signature:(const slice_array<_Tp>& __sa) +operator = cpp_src/valarray /^ valarray<_Tp>::operator=(const valarray<_Tp>& __v)$/;" f class:std::valarray signature:(const valarray<_Tp>& __v) +operator = cpp_src/vector.tcc /^ operator=(const vector<_Tp, _Alloc>& __x)$/;" f class:std::vector signature:(const vector<_Tp, _Alloc>& __x) +operator == cpp_src/allocator.h /^ operator==(const allocator<_T1>&, const allocator<_T2>&)$/;" f namespace:std signature:(const allocator<_T1>&, const allocator<_T2>&) +operator == cpp_src/allocator.h /^ operator==(const allocator<_Tp>&, const allocator<_Tp>&)$/;" f namespace:std signature:(const allocator<_Tp>&, const allocator<_Tp>&) +operator == cpp_src/basic_string.h /^ operator==(const _CharT* __lhs,$/;" f namespace:std signature:(const _CharT* __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) +operator == cpp_src/basic_string.h /^ operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs,$/;" f namespace:std signature:(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const _CharT* __rhs) +operator == cpp_src/basic_string.h /^ operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs,$/;" f namespace:std signature:(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) +operator == cpp_src/bitset /^ operator==(const bitset<_Nb>& __rhs) const$/;" f class:std::bitset access:public signature:(const bitset<_Nb>& __rhs) const +operator == cpp_src/complex /^ operator==(const _Tp& __x, const complex<_Tp>& __y)$/;" f namespace:std signature:(const _Tp& __x, const complex<_Tp>& __y) +operator == cpp_src/complex /^ operator==(const complex<_Tp>& __x, const _Tp& __y)$/;" f namespace:std signature:(const complex<_Tp>& __x, const _Tp& __y) +operator == cpp_src/complex /^ operator==(const complex<_Tp>& __x, const complex<_Tp>& __y)$/;" f namespace:std signature:(const complex<_Tp>& __x, const complex<_Tp>& __y) +operator == cpp_src/locale_classes.h /^ operator==(const locale& __other) const throw ();$/;" p class:std::locale access:public signature:(const locale& __other) const +operator == cpp_src/postypes.h /^ operator==(const fpos<_StateT>& __lhs, const fpos<_StateT>& __rhs)$/;" f namespace:std signature:(const fpos<_StateT>& __lhs, const fpos<_StateT>& __rhs) +operator == cpp_src/stl_bvector.h /^ operator==(const _Bit_iterator_base& __i) const$/;" f struct:std::_Bit_iterator_base access:public signature:(const _Bit_iterator_base& __i) const +operator == cpp_src/stl_bvector.h /^ operator==(const _Bit_reference& __x) const$/;" f struct:std::_Bit_reference access:public signature:(const _Bit_reference& __x) const +operator == cpp_src/stl_deque.h /^ operator==(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x,$/;" f namespace:std signature:(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) +operator == cpp_src/stl_deque.h /^ operator==(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x,$/;" f namespace:std signature:(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) +operator == cpp_src/stl_deque.h /^ operator==(const deque<_Tp, _Alloc>& __x,$/;" f namespace:std signature:(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) +operator == cpp_src/stl_iterator.h /^ operator==(const __normal_iterator<_Iterator, _Container>& __lhs,$/;" f signature:(const __normal_iterator<_Iterator, _Container>& __lhs, const __normal_iterator<_Iterator, _Container>& __rhs) +operator == cpp_src/stl_iterator.h /^ operator==(const __normal_iterator<_IteratorL, _Container>& __lhs,$/;" f signature:(const __normal_iterator<_IteratorL, _Container>& __lhs, const __normal_iterator<_IteratorR, _Container>& __rhs) +operator == cpp_src/stl_iterator.h /^ operator==(const reverse_iterator<_Iterator>& __x,$/;" f namespace:std signature:(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) +operator == cpp_src/stl_iterator.h /^ operator==(const reverse_iterator<_IteratorL>& __x,$/;" f namespace:std signature:(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) +operator == cpp_src/stl_list.h /^ operator==(const _Self& __x) const$/;" f struct:std::_List_const_iterator access:public signature:(const _Self& __x) const +operator == cpp_src/stl_list.h /^ operator==(const _Self& __x) const$/;" f struct:std::_List_iterator access:public signature:(const _Self& __x) const +operator == cpp_src/stl_list.h /^ operator==(const _List_iterator<_Val>& __x,$/;" f namespace:std signature:(const _List_iterator<_Val>& __x, const _List_const_iterator<_Val>& __y) +operator == cpp_src/stl_list.h /^ operator==(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)$/;" f namespace:std signature:(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) +operator == cpp_src/stl_map.h /^ operator== (const map<_K1, _T1, _C1, _A1>&,$/;" p class:std::map access:friend signature:(const map<_K1, _T1, _C1, _A1>&, const map<_K1, _T1, _C1, _A1>&) +operator == cpp_src/stl_map.h /^ operator==(const map<_Key, _Tp, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const map<_Key, _Tp, _Compare, _Alloc>& __x, const map<_Key, _Tp, _Compare, _Alloc>& __y) +operator == cpp_src/stl_multimap.h /^ operator== (const multimap<_K1, _T1, _C1, _A1>&,$/;" p class:std::multimap access:friend signature:(const multimap<_K1, _T1, _C1, _A1>&, const multimap<_K1, _T1, _C1, _A1>&) +operator == cpp_src/stl_multimap.h /^ operator==(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, const multimap<_Key, _Tp, _Compare, _Alloc>& __y) +operator == cpp_src/stl_multiset.h /^ operator== (const multiset<_K1, _C1, _A1>&,$/;" p class:std::multiset access:friend signature:(const multiset<_K1, _C1, _A1>&, const multiset<_K1, _C1, _A1>&) +operator == cpp_src/stl_multiset.h /^ operator==(const multiset<_Key, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const multiset<_Key, _Compare, _Alloc>& __x, const multiset<_Key, _Compare, _Alloc>& __y) +operator == cpp_src/stl_pair.h /^ operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)$/;" f namespace:std signature:(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) +operator == cpp_src/stl_queue.h /^ operator==(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);$/;" p class:std::queue access:friend signature:(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&) +operator == cpp_src/stl_queue.h /^ operator==(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)$/;" f namespace:std signature:(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) +operator == cpp_src/stl_set.h /^ operator== (const set<_K1, _C1, _A1>&, const set<_K1, _C1, _A1>&);$/;" p class:std::set access:friend signature:(const set<_K1, _C1, _A1>&, const set<_K1, _C1, _A1>&) +operator == cpp_src/stl_set.h /^ operator==(const set<_Key, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const set<_Key, _Compare, _Alloc>& __x, const set<_Key, _Compare, _Alloc>& __y) +operator == cpp_src/stl_stack.h /^ operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);$/;" p class:std::stack access:friend signature:(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&) +operator == cpp_src/stl_stack.h /^ operator==(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)$/;" f namespace:std signature:(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) +operator == cpp_src/stl_tree.h /^ operator==(const _Self& __x) const$/;" f struct:std::_Rb_tree_const_iterator access:public signature:(const _Self& __x) const +operator == cpp_src/stl_tree.h /^ operator==(const _Self& __x) const$/;" f struct:std::_Rb_tree_iterator access:public signature:(const _Self& __x) const +operator == cpp_src/stl_tree.h /^ operator==(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) +operator == cpp_src/stl_tree.h /^ operator==(const _Rb_tree_iterator<_Val>& __x,$/;" f namespace:std signature:(const _Rb_tree_iterator<_Val>& __x, const _Rb_tree_const_iterator<_Val>& __y) +operator == cpp_src/stl_vector.h /^ operator==(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)$/;" f namespace:std signature:(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) +operator == cpp_src/stream_iterator.h /^ operator==(const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __x,$/;" f namespace:std signature:(const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __x, const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __y) +operator == cpp_src/streambuf_iterator.h /^ operator==(const istreambuf_iterator<_CharT, _Traits>& __a,$/;" f namespace:std signature:(const istreambuf_iterator<_CharT, _Traits>& __a, const istreambuf_iterator<_CharT, _Traits>& __b) +operator == cpp_src/typeinfo /^ bool operator==(const type_info& __arg) const$/;" f class:std::type_info access:public signature:(const type_info& __arg) const +operator == cpp_src/typeinfo /^ bool operator==(const type_info& __arg) const;$/;" p class:std::type_info file: access:public signature:(const type_info& __arg) const +operator > cpp_src/basic_string.h /^ operator>(const _CharT* __lhs,$/;" f namespace:std signature:(const _CharT* __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) +operator > cpp_src/basic_string.h /^ operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs,$/;" f namespace:std signature:(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const _CharT* __rhs) +operator > cpp_src/basic_string.h /^ operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs,$/;" f namespace:std signature:(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) +operator > cpp_src/stl_bvector.h /^ operator>(const _Bit_iterator_base& __i) const$/;" f struct:std::_Bit_iterator_base access:public signature:(const _Bit_iterator_base& __i) const +operator > cpp_src/stl_deque.h /^ operator>(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x,$/;" f namespace:std signature:(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) +operator > cpp_src/stl_deque.h /^ operator>(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x,$/;" f namespace:std signature:(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) +operator > cpp_src/stl_deque.h /^ operator>(const deque<_Tp, _Alloc>& __x,$/;" f namespace:std signature:(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) +operator > cpp_src/stl_iterator.h /^ operator>(const __normal_iterator<_Iterator, _Container>& __lhs,$/;" f signature:(const __normal_iterator<_Iterator, _Container>& __lhs, const __normal_iterator<_Iterator, _Container>& __rhs) +operator > cpp_src/stl_iterator.h /^ operator>(const __normal_iterator<_IteratorL, _Container>& __lhs,$/;" f signature:(const __normal_iterator<_IteratorL, _Container>& __lhs, const __normal_iterator<_IteratorR, _Container>& __rhs) +operator > cpp_src/stl_iterator.h /^ operator>(const reverse_iterator<_Iterator>& __x,$/;" f namespace:std signature:(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) +operator > cpp_src/stl_iterator.h /^ operator>(const reverse_iterator<_IteratorL>& __x,$/;" f namespace:std signature:(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) +operator > cpp_src/stl_list.h /^ operator>(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)$/;" f namespace:std signature:(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) +operator > cpp_src/stl_map.h /^ operator>(const map<_Key, _Tp, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const map<_Key, _Tp, _Compare, _Alloc>& __x, const map<_Key, _Tp, _Compare, _Alloc>& __y) +operator > cpp_src/stl_multimap.h /^ operator>(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, const multimap<_Key, _Tp, _Compare, _Alloc>& __y) +operator > cpp_src/stl_multiset.h /^ operator>(const multiset<_Key,_Compare,_Alloc>& __x,$/;" f namespace:std signature:(const multiset<_Key,_Compare,_Alloc>& __x, const multiset<_Key,_Compare,_Alloc>& __y) +operator > cpp_src/stl_pair.h /^ operator>(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)$/;" f namespace:std signature:(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) +operator > cpp_src/stl_queue.h /^ operator>(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)$/;" f namespace:std signature:(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) +operator > cpp_src/stl_relops.h /^ operator>(const _Tp& __x, const _Tp& __y)$/;" f namespace:std::rel_ops signature:(const _Tp& __x, const _Tp& __y) +operator > cpp_src/stl_set.h /^ operator>(const set<_Key, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const set<_Key, _Compare, _Alloc>& __x, const set<_Key, _Compare, _Alloc>& __y) +operator > cpp_src/stl_stack.h /^ operator>(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)$/;" f namespace:std signature:(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) +operator > cpp_src/stl_tree.h /^ operator>(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) +operator > cpp_src/stl_vector.h /^ operator>(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)$/;" f namespace:std signature:(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) +operator >= cpp_src/basic_string.h /^ operator>=(const _CharT* __lhs,$/;" f namespace:std signature:(const _CharT* __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) +operator >= cpp_src/basic_string.h /^ operator>=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,$/;" f namespace:std signature:(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const _CharT* __rhs) +operator >= cpp_src/basic_string.h /^ operator>=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,$/;" f namespace:std signature:(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) +operator >= cpp_src/stl_bvector.h /^ operator>=(const _Bit_iterator_base& __i) const$/;" f struct:std::_Bit_iterator_base access:public signature:(const _Bit_iterator_base& __i) const +operator >= cpp_src/stl_deque.h /^ operator>=(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x,$/;" f namespace:std signature:(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) +operator >= cpp_src/stl_deque.h /^ operator>=(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x,$/;" f namespace:std signature:(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) +operator >= cpp_src/stl_deque.h /^ operator>=(const deque<_Tp, _Alloc>& __x,$/;" f namespace:std signature:(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) +operator >= cpp_src/stl_iterator.h /^ operator>=(const __normal_iterator<_Iterator, _Container>& __lhs,$/;" f signature:(const __normal_iterator<_Iterator, _Container>& __lhs, const __normal_iterator<_Iterator, _Container>& __rhs) +operator >= cpp_src/stl_iterator.h /^ operator>=(const __normal_iterator<_IteratorL, _Container>& __lhs,$/;" f signature:(const __normal_iterator<_IteratorL, _Container>& __lhs, const __normal_iterator<_IteratorR, _Container>& __rhs) +operator >= cpp_src/stl_iterator.h /^ operator>=(const reverse_iterator<_Iterator>& __x,$/;" f namespace:std signature:(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) +operator >= cpp_src/stl_iterator.h /^ operator>=(const reverse_iterator<_IteratorL>& __x,$/;" f namespace:std signature:(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) +operator >= cpp_src/stl_list.h /^ operator>=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)$/;" f namespace:std signature:(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) +operator >= cpp_src/stl_map.h /^ operator>=(const map<_Key, _Tp, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const map<_Key, _Tp, _Compare, _Alloc>& __x, const map<_Key, _Tp, _Compare, _Alloc>& __y) +operator >= cpp_src/stl_multimap.h /^ operator>=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, const multimap<_Key, _Tp, _Compare, _Alloc>& __y) +operator >= cpp_src/stl_multiset.h /^ operator>=(const multiset<_Key, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const multiset<_Key, _Compare, _Alloc>& __x, const multiset<_Key, _Compare, _Alloc>& __y) +operator >= cpp_src/stl_pair.h /^ operator>=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)$/;" f namespace:std signature:(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) +operator >= cpp_src/stl_queue.h /^ operator>=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)$/;" f namespace:std signature:(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) +operator >= cpp_src/stl_relops.h /^ operator>=(const _Tp& __x, const _Tp& __y)$/;" f namespace:std::rel_ops signature:(const _Tp& __x, const _Tp& __y) +operator >= cpp_src/stl_set.h /^ operator>=(const set<_Key, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const set<_Key, _Compare, _Alloc>& __x, const set<_Key, _Compare, _Alloc>& __y) +operator >= cpp_src/stl_stack.h /^ operator>=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)$/;" f namespace:std signature:(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) +operator >= cpp_src/stl_tree.h /^ operator>=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) +operator >= cpp_src/stl_vector.h /^ operator>=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)$/;" f namespace:std signature:(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) +operator >> cpp_src/basic_string.h /^ operator>>(basic_istream<_CharT, _Traits>& __is,$/;" p namespace:std signature:(basic_istream<_CharT, _Traits>& __is, basic_string<_CharT, _Traits, _Alloc>& __str) +operator >> cpp_src/basic_string.h /^ operator>>(basic_istream& __is, basic_string& __str);$/;" p namespace:std signature:(basic_istream& __is, basic_string& __str) +operator >> cpp_src/basic_string.tcc /^ operator>>(basic_istream&, string&);$/;" p namespace:std file: signature:(basic_istream&, string&) +operator >> cpp_src/basic_string.tcc /^ operator>>(basic_istream&, wstring&);$/;" p namespace:std file: signature:(basic_istream&, wstring&) +operator >> cpp_src/bitset /^ operator>>(size_t __position) const$/;" f class:std::bitset access:public signature:(size_t __position) const +operator >> cpp_src/bitset /^ operator>>(std::basic_istream<_CharT, _Traits>& __is, bitset<_Nb>& __x)$/;" f namespace:std signature:(std::basic_istream<_CharT, _Traits>& __is, bitset<_Nb>& __x) +operator >> cpp_src/complex /^ operator>>(basic_istream<_CharT, _Traits>& __is, complex<_Tp>& __x)$/;" f namespace:std signature:(basic_istream<_CharT, _Traits>& __is, complex<_Tp>& __x) +operator >> cpp_src/iomanip /^ operator>>(basic_istream<_CharT,_Traits>& __is, _Resetiosflags __f)$/;" f namespace:std signature:(basic_istream<_CharT,_Traits>& __is, _Resetiosflags __f) +operator >> cpp_src/iomanip /^ operator>>(basic_istream<_CharT,_Traits>& __is, _Setbase __f)$/;" f namespace:std signature:(basic_istream<_CharT,_Traits>& __is, _Setbase __f) +operator >> cpp_src/iomanip /^ operator>>(basic_istream<_CharT,_Traits>& __is, _Setfill<_CharT> __f)$/;" f namespace:std signature:(basic_istream<_CharT,_Traits>& __is, _Setfill<_CharT> __f) +operator >> cpp_src/iomanip /^ operator>>(basic_istream<_CharT,_Traits>& __is, _Setiosflags __f)$/;" f namespace:std signature:(basic_istream<_CharT,_Traits>& __is, _Setiosflags __f) +operator >> cpp_src/iomanip /^ operator>>(basic_istream<_CharT,_Traits>& __is, _Setprecision __f)$/;" f namespace:std signature:(basic_istream<_CharT,_Traits>& __is, _Setprecision __f) +operator >> cpp_src/iomanip /^ operator>>(basic_istream<_CharT,_Traits>& __is, _Setw __f)$/;" f namespace:std signature:(basic_istream<_CharT,_Traits>& __is, _Setw __f) +operator >> cpp_src/iomanip /^ extern template istream& operator>>(istream&, _Resetiosflags);$/;" p namespace:std file: signature:(istream&, _Resetiosflags) +operator >> cpp_src/iomanip /^ extern template istream& operator>>(istream&, _Setbase);$/;" p namespace:std file: signature:(istream&, _Setbase) +operator >> cpp_src/iomanip /^ extern template istream& operator>>(istream&, _Setfill);$/;" p namespace:std file: signature:(istream&, _Setfill) +operator >> cpp_src/iomanip /^ extern template istream& operator>>(istream&, _Setiosflags);$/;" p namespace:std file: signature:(istream&, _Setiosflags) +operator >> cpp_src/iomanip /^ extern template istream& operator>>(istream&, _Setprecision);$/;" p namespace:std file: signature:(istream&, _Setprecision) +operator >> cpp_src/iomanip /^ extern template istream& operator>>(istream&, _Setw);$/;" p namespace:std file: signature:(istream&, _Setw) +operator >> cpp_src/iomanip /^ extern template wistream& operator>>(wistream&, _Resetiosflags);$/;" p namespace:std file: signature:(wistream&, _Resetiosflags) +operator >> cpp_src/iomanip /^ extern template wistream& operator>>(wistream&, _Setbase);$/;" p namespace:std file: signature:(wistream&, _Setbase) +operator >> cpp_src/iomanip /^ extern template wistream& operator>>(wistream&, _Setfill);$/;" p namespace:std file: signature:(wistream&, _Setfill) +operator >> cpp_src/iomanip /^ extern template wistream& operator>>(wistream&, _Setiosflags);$/;" p namespace:std file: signature:(wistream&, _Setiosflags) +operator >> cpp_src/iomanip /^ extern template wistream& operator>>(wistream&, _Setprecision);$/;" p namespace:std file: signature:(wistream&, _Setprecision) +operator >> cpp_src/iomanip /^ extern template wistream& operator>>(wistream&, _Setw);$/;" p namespace:std file: signature:(wistream&, _Setw) +operator >> cpp_src/istream /^ operator>>(basic_istream<_CharT2, _Traits2>&, _CharT2&);$/;" p class:std::basic_istream file: access:friend signature:(basic_istream<_CharT2, _Traits2>&, _CharT2&) +operator >> cpp_src/istream /^ operator>>(basic_istream<_CharT2, _Traits2>&, _CharT2*);$/;" p class:std::basic_istream file: access:friend signature:(basic_istream<_CharT2, _Traits2>&, _CharT2*) +operator >> cpp_src/istream /^ operator>>(__streambuf_type* __sb);$/;" p class:std::basic_istream file: access:public signature:(__streambuf_type* __sb) +operator >> cpp_src/istream /^ operator>>(bool& __n)$/;" f class:std::basic_istream access:public signature:(bool& __n) +operator >> cpp_src/istream /^ operator>>(double& __f)$/;" f class:std::basic_istream access:public signature:(double& __f) +operator >> cpp_src/istream /^ operator>>(float& __f)$/;" f class:std::basic_istream access:public signature:(float& __f) +operator >> cpp_src/istream /^ operator>>(int& __n);$/;" p class:std::basic_istream file: access:public signature:(int& __n) +operator >> cpp_src/istream /^ operator>>(long double& __f)$/;" f class:std::basic_istream access:public signature:(long double& __f) +operator >> cpp_src/istream /^ operator>>(long long& __n)$/;" f class:std::basic_istream access:public signature:(long long& __n) +operator >> cpp_src/istream /^ operator>>(long& __n)$/;" f class:std::basic_istream access:public signature:(long& __n) +operator >> cpp_src/istream /^ operator>>(short& __n);$/;" p class:std::basic_istream file: access:public signature:(short& __n) +operator >> cpp_src/istream /^ operator>>(unsigned int& __n)$/;" f class:std::basic_istream access:public signature:(unsigned int& __n) +operator >> cpp_src/istream /^ operator>>(unsigned long long& __n)$/;" f class:std::basic_istream access:public signature:(unsigned long long& __n) +operator >> cpp_src/istream /^ operator>>(unsigned long& __n)$/;" f class:std::basic_istream access:public signature:(unsigned long& __n) +operator >> cpp_src/istream /^ operator>>(unsigned short& __n)$/;" f class:std::basic_istream access:public signature:(unsigned short& __n) +operator >> cpp_src/istream /^ operator>>(void*& __p)$/;" f class:std::basic_istream access:public signature:(void*& __p) +operator >> cpp_src/istream /^ operator>>(basic_istream<_CharT, _Traits>& __in, _CharT& __c);$/;" p namespace:std file: signature:(basic_istream<_CharT, _Traits>& __in, _CharT& __c) +operator >> cpp_src/istream /^ operator>>(basic_istream<_CharT, _Traits>& __in, _CharT* __s);$/;" p namespace:std file: signature:(basic_istream<_CharT, _Traits>& __in, _CharT* __s) +operator >> cpp_src/istream /^ operator>>(basic_istream& __in, signed char& __c)$/;" f namespace:std signature:(basic_istream& __in, signed char& __c) +operator >> cpp_src/istream /^ operator>>(basic_istream& __in, signed char* __s)$/;" f namespace:std signature:(basic_istream& __in, signed char* __s) +operator >> cpp_src/istream /^ operator>>(basic_istream& __in, unsigned char& __c)$/;" f namespace:std signature:(basic_istream& __in, unsigned char& __c) +operator >> cpp_src/istream /^ operator>>(basic_istream& __in, unsigned char* __s)$/;" f namespace:std signature:(basic_istream& __in, unsigned char* __s) +operator >> cpp_src/istream /^ operator>>(basic_istream& __in, char* __s);$/;" p namespace:std file: signature:(basic_istream& __in, char* __s) +operator >> cpp_src/istream.tcc /^ operator>>(__streambuf_type* __sbout)$/;" f class:std::basic_istream signature:(__streambuf_type* __sbout) +operator >> cpp_src/istream.tcc /^ operator>>(basic_istream<_CharT, _Traits>& __in, _CharT& __c)$/;" f namespace:std signature:(basic_istream<_CharT, _Traits>& __in, _CharT& __c) +operator >> cpp_src/istream.tcc /^ operator>>(basic_istream<_CharT, _Traits>& __in, _CharT* __s)$/;" f namespace:std signature:(basic_istream<_CharT, _Traits>& __in, _CharT* __s) +operator >> cpp_src/istream.tcc /^ operator>>(basic_istream<_CharT, _Traits>& __in,$/;" f namespace:std signature:(basic_istream<_CharT, _Traits>& __in, basic_string<_CharT, _Traits, _Alloc>& __str) +operator >> cpp_src/istream.tcc /^ operator>>(int& __n)$/;" f class:std::basic_istream signature:(int& __n) +operator >> cpp_src/istream.tcc /^ operator>>(short& __n)$/;" f class:std::basic_istream signature:(short& __n) +operator >> cpp_src/istream.tcc /^ extern template istream& operator>>(istream&, char&);$/;" p namespace:std file: signature:(istream&, char&) +operator >> cpp_src/istream.tcc /^ extern template istream& operator>>(istream&, char*);$/;" p namespace:std file: signature:(istream&, char*) +operator >> cpp_src/istream.tcc /^ extern template istream& operator>>(istream&, signed char&);$/;" p namespace:std file: signature:(istream&, signed char&) +operator >> cpp_src/istream.tcc /^ extern template istream& operator>>(istream&, signed char*);$/;" p namespace:std file: signature:(istream&, signed char*) +operator >> cpp_src/istream.tcc /^ extern template istream& operator>>(istream&, unsigned char&);$/;" p namespace:std file: signature:(istream&, unsigned char&) +operator >> cpp_src/istream.tcc /^ extern template istream& operator>>(istream&, unsigned char*);$/;" p namespace:std file: signature:(istream&, unsigned char*) +operator >> cpp_src/istream.tcc /^ extern template wistream& operator>>(wistream&, wchar_t&);$/;" p namespace:std file: signature:(wistream&, wchar_t&) +operator >> cpp_src/istream.tcc /^ extern template wistream& operator>>(wistream&, wchar_t*);$/;" p namespace:std file: signature:(wistream&, wchar_t*) +operator >> cpp_src/streambuf /^ operator>>(basic_istream<_CharT2, _Traits2>&, _CharT2*);$/;" p class:std::basic_streambuf file: access:friend signature:(basic_istream<_CharT2, _Traits2>&, _CharT2*) +operator >> cpp_src/streambuf /^ operator>>(basic_istream<_CharT2, _Traits2>&,$/;" p class:std::basic_streambuf file: access:friend signature:(basic_istream<_CharT2, _Traits2>&, basic_string<_CharT2, _Traits2, _Alloc>&) +operator >>= cpp_src/bitset /^ operator>>=(size_t __position)$/;" f class:std::bitset access:public signature:(size_t __position) +operator >>= cpp_src/gslice_array.h /^ void operator>>=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator >>= cpp_src/gslice_array.h /^ void operator>>=(const valarray<_Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const valarray<_Tp>&) const +operator >>= cpp_src/indirect_array.h /^ void operator>>=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator >>= cpp_src/indirect_array.h /^ void operator>>=(const valarray<_Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const valarray<_Tp>&) const +operator >>= cpp_src/mask_array.h /^ void operator>>=(const _Expr<_Dom,_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const _Expr<_Dom,_Tp>&) const +operator >>= cpp_src/mask_array.h /^ void operator>>=(const valarray<_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const valarray<_Tp>&) const +operator >>= cpp_src/slice_array.h /^ void operator>>=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::slice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator >>= cpp_src/slice_array.h /^ void operator>>=(const valarray<_Tp>&) const;$/;" p class:std::slice_array access:public signature:(const valarray<_Tp>&) const +operator >>= cpp_src/valarray /^ valarray<_Tp>& operator>>=(const _Expr<_Dom, _Tp>&);$/;" p class:std::valarray file: access:public signature:(const _Expr<_Dom, _Tp>&) +operator >>= cpp_src/valarray /^ valarray<_Tp>& operator>>=(const _Tp&);$/;" p class:std::valarray file: access:public signature:(const _Tp&) +operator >>= cpp_src/valarray /^ valarray<_Tp>& operator>>=(const valarray<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const valarray<_Tp>&) +operator [] cpp_src/basic_string.h /^ operator[] (size_type __pos) const$/;" f class:std::basic_string access:public signature:(size_type __pos) const +operator [] cpp_src/basic_string.h /^ operator[](size_type __pos)$/;" f class:std::basic_string access:public signature:(size_type __pos) +operator [] cpp_src/bitset /^ operator[](size_t __position) const$/;" f class:std::bitset access:public signature:(size_t __position) const +operator [] cpp_src/bitset /^ operator[](size_t __position)$/;" f class:std::bitset access:public signature:(size_t __position) +operator [] cpp_src/stl_bvector.h /^ operator[](difference_type __i) const$/;" f struct:std::_Bit_const_iterator access:public signature:(difference_type __i) const +operator [] cpp_src/stl_bvector.h /^ operator[](difference_type __i) const$/;" f struct:std::_Bit_iterator access:public signature:(difference_type __i) const +operator [] cpp_src/stl_bvector.h /^ operator[](size_type __n) const$/;" f class:std::vector access:public signature:(size_type __n) const +operator [] cpp_src/stl_bvector.h /^ operator[](size_type __n)$/;" f class:std::vector access:public signature:(size_type __n) +operator [] cpp_src/stl_deque.h /^ operator[](difference_type __n) const$/;" f struct:std::_Deque_iterator access:public signature:(difference_type __n) const +operator [] cpp_src/stl_deque.h /^ operator[](size_type __n) const$/;" f class:std::deque access:public signature:(size_type __n) const +operator [] cpp_src/stl_deque.h /^ operator[](size_type __n)$/;" f class:std::deque access:public signature:(size_type __n) +operator [] cpp_src/stl_iterator.h /^ operator[](const difference_type& __n) const$/;" f class:__normal_iterator access:public signature:(const difference_type& __n) const +operator [] cpp_src/stl_iterator.h /^ operator[](difference_type __n) const$/;" f class:std::reverse_iterator access:public signature:(difference_type __n) const +operator [] cpp_src/stl_map.h /^ operator[](const key_type& __k)$/;" f class:std::map access:public signature:(const key_type& __k) +operator [] cpp_src/stl_vector.h /^ operator[](size_type __n) const$/;" f class:std::vector access:public signature:(size_type __n) const +operator [] cpp_src/stl_vector.h /^ operator[](size_type __n)$/;" f class:std::vector access:public signature:(size_type __n) +operator [] cpp_src/valarray /^ operator[](const valarray&) const;$/;" p class:std::valarray file: access:public signature:(const valarray&) const +operator [] cpp_src/valarray /^ _Expr<_GClos<_ValArray, _Tp>, _Tp> operator[](const gslice&) const;$/;" p class:std::valarray file: access:public signature:(const gslice&) const +operator [] cpp_src/valarray /^ _Expr<_SClos<_ValArray, _Tp>, _Tp> operator[](slice) const;$/;" p class:std::valarray file: access:public signature:(slice) const +operator [] cpp_src/valarray /^ _Tp& operator[](size_t);$/;" p class:std::valarray file: access:public signature:(size_t) +operator [] cpp_src/valarray /^ const _Tp& operator[](size_t) const;$/;" p class:std::valarray file: access:public signature:(size_t) const +operator [] cpp_src/valarray /^ gslice_array<_Tp> operator[](const gslice&);$/;" p class:std::valarray file: access:public signature:(const gslice&) +operator [] cpp_src/valarray /^ indirect_array<_Tp> operator[](const valarray&);$/;" p class:std::valarray file: access:public signature:(const valarray&) +operator [] cpp_src/valarray /^ mask_array<_Tp> operator[](const valarray&);$/;" p class:std::valarray file: access:public signature:(const valarray&) +operator [] cpp_src/valarray /^ slice_array<_Tp> operator[](slice);$/;" p class:std::valarray file: access:public signature:(slice) +operator [] cpp_src/valarray /^ valarray<_Tp> operator[](const valarray&) const;$/;" p class:std::valarray file: access:public signature:(const valarray&) const +operator [] cpp_src/valarray /^ valarray<_Tp>::operator[](const gslice& __gs) const$/;" f class:std::valarray signature:(const gslice& __gs) const +operator [] cpp_src/valarray /^ valarray<_Tp>::operator[](const gslice& __gs)$/;" f class:std::valarray signature:(const gslice& __gs) +operator [] cpp_src/valarray /^ valarray<_Tp>::operator[](const valarray& __m) const$/;" f class:std::valarray signature:(const valarray& __m) const +operator [] cpp_src/valarray /^ valarray<_Tp>::operator[](const valarray& __m)$/;" f class:std::valarray signature:(const valarray& __m) +operator [] cpp_src/valarray /^ valarray<_Tp>::operator[](const valarray& __i) const$/;" f class:std::valarray signature:(const valarray& __i) const +operator [] cpp_src/valarray /^ valarray<_Tp>::operator[](const valarray& __i)$/;" f class:std::valarray signature:(const valarray& __i) +operator [] cpp_src/valarray /^ valarray<_Tp>::operator[](size_t __i) const$/;" f class:std::valarray signature:(size_t __i) const +operator [] cpp_src/valarray /^ valarray<_Tp>::operator[](size_t __i)$/;" f class:std::valarray signature:(size_t __i) +operator [] cpp_src/valarray /^ valarray<_Tp>::operator[](slice __s) const$/;" f class:std::valarray signature:(slice __s) const +operator [] cpp_src/valarray /^ valarray<_Tp>::operator[](slice __s)$/;" f class:std::valarray signature:(slice __s) +operator [] cpp_src/valarray_after.h /^ operator[] (size_t __i) const$/;" f class:std::_GBase access:public signature:(size_t __i) const +operator [] cpp_src/valarray_after.h /^ operator[] (size_t __i) const$/;" f class:std::_IBase access:public signature:(size_t __i) const +operator [] cpp_src/valarray_after.h /^ valarray operator[](const gslice&) const;$/;" p class:std::_Expr access:public signature:(const gslice&) const +operator [] cpp_src/valarray_after.h /^ valarray operator[](const valarray&) const;$/;" p class:std::_Expr access:public signature:(const valarray&) const +operator [] cpp_src/valarray_after.h /^ valarray operator[](const valarray&) const;$/;" p class:std::_Expr access:public signature:(const valarray&) const +operator [] cpp_src/valarray_after.h /^ valarray operator[](slice) const;$/;" p class:std::_Expr access:public signature:(slice) const +operator [] cpp_src/valarray_after.h /^ value_type operator[](size_t) const;$/;" p class:std::_Expr access:public signature:(size_t) const +operator [] cpp_src/valarray_after.h /^ _Expr<_Clos, _Tp>::operator[](const gslice& __gs) const$/;" f class:std::_Expr signature:(const gslice& __gs) const +operator [] cpp_src/valarray_after.h /^ _Expr<_Clos, _Tp>::operator[](const valarray& __m) const$/;" f class:std::_Expr signature:(const valarray& __m) const +operator [] cpp_src/valarray_after.h /^ _Expr<_Clos, _Tp>::operator[](const valarray& __i) const$/;" f class:std::_Expr signature:(const valarray& __i) const +operator [] cpp_src/valarray_after.h /^ _Expr<_Clos, _Tp>::operator[](size_t __i) const$/;" f class:std::_Expr signature:(size_t __i) const +operator [] cpp_src/valarray_after.h /^ _Expr<_Clos, _Tp>::operator[](slice __s) const$/;" f class:std::_Expr signature:(slice __s) const +operator [] cpp_src/valarray_before.h /^ operator[] (size_t __i) const$/;" f class:std::_SBase access:public signature:(size_t __i) const +operator [] cpp_src/valarray_before.h /^ value_type operator[](size_t __i) const$/;" f class:std::_BinBase access:public signature:(size_t __i) const +operator [] cpp_src/valarray_before.h /^ value_type operator[](size_t __i) const$/;" f class:std::_BinBase1 access:public signature:(size_t __i) const +operator [] cpp_src/valarray_before.h /^ value_type operator[](size_t __i) const$/;" f class:std::_BinBase2 access:public signature:(size_t __i) const +operator [] cpp_src/valarray_before.h /^ value_type operator[](size_t __i) const$/;" f class:std::_FunBase access:public signature:(size_t __i) const +operator [] cpp_src/valarray_before.h /^ value_type operator[](size_t __i) const$/;" f class:std::_UnBase access:public signature:(size_t __i) const +operator ^ cpp_src/bitset /^ operator^(const bitset<_Nb>& __x, const bitset<_Nb>& __y)$/;" f namespace:std signature:(const bitset<_Nb>& __x, const bitset<_Nb>& __y) +operator ^ cpp_src/ios_base.h /^ operator^(_Ios_Fmtflags __a, _Ios_Fmtflags __b)$/;" f namespace:std signature:(_Ios_Fmtflags __a, _Ios_Fmtflags __b) +operator ^ cpp_src/ios_base.h /^ operator^(_Ios_Iostate __a, _Ios_Iostate __b)$/;" f namespace:std signature:(_Ios_Iostate __a, _Ios_Iostate __b) +operator ^ cpp_src/ios_base.h /^ operator^(_Ios_Openmode __a, _Ios_Openmode __b)$/;" f namespace:std signature:(_Ios_Openmode __a, _Ios_Openmode __b) +operator ^= cpp_src/bitset /^ operator^=(const bitset<_Nb>& __rhs)$/;" f class:std::bitset access:public signature:(const bitset<_Nb>& __rhs) +operator ^= cpp_src/gslice_array.h /^ void operator^=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator ^= cpp_src/gslice_array.h /^ void operator^=(const valarray<_Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const valarray<_Tp>&) const +operator ^= cpp_src/indirect_array.h /^ void operator^=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator ^= cpp_src/indirect_array.h /^ void operator^=(const valarray<_Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const valarray<_Tp>&) const +operator ^= cpp_src/ios_base.h /^ operator^=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b)$/;" f namespace:std signature:(_Ios_Fmtflags& __a, _Ios_Fmtflags __b) +operator ^= cpp_src/ios_base.h /^ operator^=(_Ios_Iostate& __a, _Ios_Iostate __b)$/;" f namespace:std signature:(_Ios_Iostate& __a, _Ios_Iostate __b) +operator ^= cpp_src/ios_base.h /^ operator^=(_Ios_Openmode& __a, _Ios_Openmode __b)$/;" f namespace:std signature:(_Ios_Openmode& __a, _Ios_Openmode __b) +operator ^= cpp_src/mask_array.h /^ void operator^=(const _Expr<_Dom,_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const _Expr<_Dom,_Tp>&) const +operator ^= cpp_src/mask_array.h /^ void operator^=(const valarray<_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const valarray<_Tp>&) const +operator ^= cpp_src/slice_array.h /^ void operator^=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::slice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator ^= cpp_src/slice_array.h /^ void operator^=(const valarray<_Tp>&) const;$/;" p class:std::slice_array access:public signature:(const valarray<_Tp>&) const +operator ^= cpp_src/valarray /^ valarray<_Tp>& operator^=(const _Expr<_Dom, _Tp>&);$/;" p class:std::valarray file: access:public signature:(const _Expr<_Dom, _Tp>&) +operator ^= cpp_src/valarray /^ valarray<_Tp>& operator^=(const _Tp&);$/;" p class:std::valarray file: access:public signature:(const _Tp&) +operator ^= cpp_src/valarray /^ valarray<_Tp>& operator^=(const valarray<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const valarray<_Tp>&) +operator auto_ptr<_Tp1> cpp_src/memory /^ operator auto_ptr<_Tp1>() throw()$/;" f class:std::auto_ptr access:public signature:() +operator auto_ptr_ref<_Tp1> cpp_src/memory /^ operator auto_ptr_ref<_Tp1>() throw()$/;" f class:std::auto_ptr access:public signature:() +operator bool cpp_src/bitset /^ operator bool() const$/;" f class:std::bitset::reference access:public signature:() const +operator bool cpp_src/istream /^ operator bool() const$/;" f class:std::basic_istream::sentry access:public signature:() const +operator bool cpp_src/ostream /^ operator bool() const$/;" f class:std::basic_ostream::sentry access:public signature:() const +operator bool cpp_src/stl_bvector.h /^ operator bool() const$/;" f struct:std::_Bit_reference access:public signature:() const +operator delete cpp_src/new /^inline void operator delete (void*, void*) throw() { }$/;" f signature:(void*, void*) +operator delete cpp_src/new /^void operator delete(void*) throw();$/;" p file: signature:(void*) +operator delete cpp_src/new /^void operator delete(void*, const std::nothrow_t&) throw();$/;" p file: signature:(void*, const std::nothrow_t&) +operator delete[] cpp_src/new /^inline void operator delete[](void*, void*) throw() { }$/;" f signature:(void*, void*) +operator delete[] cpp_src/new /^void operator delete[](void*) throw();$/;" p file: signature:(void*) +operator delete[] cpp_src/new /^void operator delete[](void*, const std::nothrow_t&) throw();$/;" p file: signature:(void*, const std::nothrow_t&) +operator new cpp_src/new /^inline void* operator new(std::size_t, void* __p) throw() { return __p; }$/;" f signature:(std::size_t, void* __p) +operator new cpp_src/new /^void* operator new(std::size_t) throw (std::bad_alloc);$/;" p file: signature:(std::size_t) +operator new cpp_src/new /^void* operator new(std::size_t, const std::nothrow_t&) throw();$/;" p file: signature:(std::size_t, const std::nothrow_t&) +operator new[] cpp_src/new /^inline void* operator new[](std::size_t, void* __p) throw() { return __p; }$/;" f signature:(std::size_t, void* __p) +operator new[] cpp_src/new /^void* operator new[](std::size_t) throw (std::bad_alloc);$/;" p file: signature:(std::size_t) +operator new[] cpp_src/new /^void* operator new[](std::size_t, const std::nothrow_t&) throw();$/;" p file: signature:(std::size_t, const std::nothrow_t&) +operator streamoff cpp_src/postypes.h /^ operator streamoff() const { return _M_off; }$/;" f class:std::fpos access:public signature:() const +operator void* cpp_src/basic_ios.h /^ operator void*() const$/;" f class:std::basic_ios access:public signature:() const +operator | cpp_src/bitset /^ operator|(const bitset<_Nb>& __x, const bitset<_Nb>& __y)$/;" f namespace:std signature:(const bitset<_Nb>& __x, const bitset<_Nb>& __y) +operator | cpp_src/ios_base.h /^ operator|(_Ios_Fmtflags __a, _Ios_Fmtflags __b)$/;" f namespace:std signature:(_Ios_Fmtflags __a, _Ios_Fmtflags __b) +operator | cpp_src/ios_base.h /^ operator|(_Ios_Iostate __a, _Ios_Iostate __b)$/;" f namespace:std signature:(_Ios_Iostate __a, _Ios_Iostate __b) +operator | cpp_src/ios_base.h /^ operator|(_Ios_Openmode __a, _Ios_Openmode __b)$/;" f namespace:std signature:(_Ios_Openmode __a, _Ios_Openmode __b) +operator |= cpp_src/bitset /^ operator|=(const bitset<_Nb>& __rhs)$/;" f class:std::bitset access:public signature:(const bitset<_Nb>& __rhs) +operator |= cpp_src/gslice_array.h /^ void operator|=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator |= cpp_src/gslice_array.h /^ void operator|=(const valarray<_Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const valarray<_Tp>&) const +operator |= cpp_src/indirect_array.h /^ void operator|=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator |= cpp_src/indirect_array.h /^ void operator|=(const valarray<_Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const valarray<_Tp>&) const +operator |= cpp_src/ios_base.h /^ operator|=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b)$/;" f namespace:std signature:(_Ios_Fmtflags& __a, _Ios_Fmtflags __b) +operator |= cpp_src/ios_base.h /^ operator|=(_Ios_Iostate& __a, _Ios_Iostate __b)$/;" f namespace:std signature:(_Ios_Iostate& __a, _Ios_Iostate __b) +operator |= cpp_src/ios_base.h /^ operator|=(_Ios_Openmode& __a, _Ios_Openmode __b)$/;" f namespace:std signature:(_Ios_Openmode& __a, _Ios_Openmode __b) +operator |= cpp_src/mask_array.h /^ void operator|=(const _Expr<_Dom,_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const _Expr<_Dom,_Tp>&) const +operator |= cpp_src/mask_array.h /^ void operator|=(const valarray<_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const valarray<_Tp>&) const +operator |= cpp_src/slice_array.h /^ void operator|=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::slice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +operator |= cpp_src/slice_array.h /^ void operator|=(const valarray<_Tp>&) const;$/;" p class:std::slice_array access:public signature:(const valarray<_Tp>&) const +operator |= cpp_src/valarray /^ valarray<_Tp>& operator|=(const _Expr<_Dom, _Tp>&);$/;" p class:std::valarray file: access:public signature:(const _Expr<_Dom, _Tp>&) +operator |= cpp_src/valarray /^ valarray<_Tp>& operator|=(const _Tp&);$/;" p class:std::valarray file: access:public signature:(const _Tp&) +operator |= cpp_src/valarray /^ valarray<_Tp>& operator|=(const valarray<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const valarray<_Tp>&) +operator ~ cpp_src/bitset /^ operator~() const$/;" f class:std::bitset::reference access:public signature:() const +operator ~ cpp_src/bitset /^ operator~() const$/;" f class:std::bitset access:public signature:() const +operator ~ cpp_src/ios_base.h /^ operator~(_Ios_Fmtflags __a)$/;" f namespace:std signature:(_Ios_Fmtflags __a) +operator ~ cpp_src/ios_base.h /^ operator~(_Ios_Iostate __a)$/;" f namespace:std signature:(_Ios_Iostate __a) +operator ~ cpp_src/ios_base.h /^ operator~(_Ios_Openmode __a)$/;" f namespace:std signature:(_Ios_Openmode __a) +operator ~ cpp_src/valarray /^ typename _UnaryOp<__bitwise_not>::_Rt operator~() const;$/;" p class:std::valarray file: access:public signature:() const +operator ~ cpp_src/valarray_after.h /^ operator~() const;$/;" p class:std::_Expr access:public signature:() const +ostream cpp_src/iosfwd /^ typedef basic_ostream ostream; \/\/\/< @isiosfwd$/;" t namespace:std file: +ostream_iterator cpp_src/stream_iterator.h /^ ostream_iterator(const ostream_iterator& __obj)$/;" f class:std::ostream_iterator access:public signature:(const ostream_iterator& __obj) +ostream_iterator cpp_src/stream_iterator.h /^ ostream_iterator(ostream_type& __s) : _M_stream(&__s), _M_string(0) {}$/;" f class:std::ostream_iterator access:public signature:(ostream_type& __s) +ostream_iterator cpp_src/stream_iterator.h /^ ostream_iterator(ostream_type& __s, const _CharT* __c)$/;" f class:std::ostream_iterator access:public signature:(ostream_type& __s, const _CharT* __c) +ostream_iterator cpp_src/stream_iterator.h /^ class ostream_iterator$/;" c namespace:std inherits:iterator +ostream_type cpp_src/stream_iterator.h /^ typedef basic_ostream<_CharT, _Traits> ostream_type;$/;" t class:std::ostream_iterator access:public +ostream_type cpp_src/streambuf_iterator.h /^ typedef basic_ostream<_CharT, _Traits> ostream_type;$/;" t class:std::ostreambuf_iterator access:public +ostreambuf_iterator cpp_src/streambuf_iterator.h /^ ostreambuf_iterator(ostream_type& __s) throw ()$/;" f class:std::ostreambuf_iterator access:public signature:(ostream_type& __s) +ostreambuf_iterator cpp_src/streambuf_iterator.h /^ ostreambuf_iterator(streambuf_type* __s) throw ()$/;" f class:std::ostreambuf_iterator access:public signature:(streambuf_type* __s) +ostreambuf_iterator cpp_src/streambuf_iterator.h /^ class ostreambuf_iterator$/;" c namespace:std inherits:iterator +ostringstream cpp_src/iosfwd /^ typedef basic_ostringstream ostringstream; \/\/\/< @isiosfwd$/;" t namespace:std file: +other cpp_src/allocator.h /^ { typedef allocator<_Tp1> other; };$/;" t struct:std::allocator::rebind access:public +out cpp_src/codecvt.h /^ out(state_type& __state, const intern_type* __from,$/;" f class:std::__codecvt_abstract_base access:public signature:(state_type& __state, const intern_type* __from, const intern_type* __from_end, const intern_type*& __from_next, extern_type* __to, extern_type* __to_end, extern_type*& __to_next) const +out cpp_src/ios_base.h /^ static const openmode out = _S_out;$/;" m class:std::ios_base access:public +out_of_range cpp_src/stdexcept /^ explicit out_of_range(const string& __arg);$/;" p class:std::out_of_range file: access:public signature:(const string& __arg) +out_of_range cpp_src/stdexcept /^ class out_of_range : public logic_error $/;" c namespace:std file: inherits:logic_error +output_iterator_tag cpp_src/stl_iterator_base_types.h /^ struct output_iterator_tag {};$/;" s namespace:std +overflow cpp_src/fstream /^ overflow(int_type __c = _Traits::eof());$/;" p class:std::basic_filebuf file: access:protected signature:(int_type __c = _Traits::eof()) +overflow cpp_src/fstream.tcc /^ overflow(int_type __c)$/;" f class:std::basic_filebuf signature:(int_type __c) +overflow cpp_src/sstream /^ overflow(int_type __c = traits_type::eof());$/;" p class:std::basic_stringbuf file: access:protected signature:(int_type __c = traits_type::eof()) +overflow cpp_src/sstream.tcc /^ overflow(int_type __c)$/;" f class:std::basic_stringbuf signature:(int_type __c) +overflow cpp_src/streambuf /^ overflow(int_type \/* __c *\/ = traits_type::eof())$/;" f class:std::basic_streambuf access:protected signature:(int_type = traits_type::eof()) +overflow_error cpp_src/stdexcept /^ explicit overflow_error(const string& __arg);$/;" p class:std::overflow_error file: access:public signature:(const string& __arg) +overflow_error cpp_src/stdexcept /^ class overflow_error : public runtime_error $/;" c namespace:std file: inherits:runtime_error +pair cpp_src/stl_pair.h /^ pair(const pair<_U1, _U2>& __p)$/;" f struct:std::pair access:public signature:(const pair<_U1, _U2>& __p) +pair cpp_src/stl_pair.h /^ pair()$/;" f struct:std::pair access:public signature:() +pair cpp_src/stl_pair.h /^ pair(const _T1& __a, const _T2& __b)$/;" f struct:std::pair access:public signature:(const _T1& __a, const _T2& __b) +pair cpp_src/stl_pair.h /^ struct pair$/;" s namespace:std +part cpp_src/locale_facets.h /^ enum part { none, space, symbol, sign, value };$/;" g class:std::money_base access:public +partial cpp_src/codecvt.h /^ partial,$/;" e enum:std::codecvt_base::result +partial_sort cpp_src/stl_algo.h /^ partial_sort(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) +partial_sort cpp_src/stl_algo.h /^ partial_sort(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, _Compare __comp) +partial_sort_copy cpp_src/stl_algo.h /^ partial_sort_copy(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) +partial_sort_copy cpp_src/stl_algo.h /^ partial_sort_copy(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) +partial_sum cpp_src/stl_numeric.h /^ partial_sum(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _OutputIterator __result) +partial_sum cpp_src/stl_numeric.h /^ partial_sum(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryOperation __binary_op) +partition cpp_src/stl_algo.h /^ partition(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) +pattern cpp_src/locale_facets.h /^ struct pattern { char field[4]; };$/;" s class:std::money_base access:public +pbackfail cpp_src/fstream /^ pbackfail(int_type __c = _Traits::eof());$/;" p class:std::basic_filebuf file: access:protected signature:(int_type __c = _Traits::eof()) +pbackfail cpp_src/fstream.tcc /^ pbackfail(int_type __i)$/;" f class:std::basic_filebuf signature:(int_type __i) +pbackfail cpp_src/sstream /^ pbackfail(int_type __c = traits_type::eof());$/;" p class:std::basic_stringbuf file: access:protected signature:(int_type __c = traits_type::eof()) +pbackfail cpp_src/sstream.tcc /^ pbackfail(int_type __c)$/;" f class:std::basic_stringbuf signature:(int_type __c) +pbackfail cpp_src/streambuf /^ pbackfail(int_type \/* __c *\/ = traits_type::eof())$/;" f class:std::basic_streambuf access:protected signature:(int_type = traits_type::eof()) +pbase cpp_src/streambuf /^ pbase() const { return _M_out_beg; }$/;" f class:std::basic_streambuf access:protected signature:() const +pbump cpp_src/streambuf /^ pbump(int __n) { _M_out_cur += __n; }$/;" f class:std::basic_streambuf access:protected signature:(int __n) +peek cpp_src/istream /^ peek();$/;" p class:std::basic_istream file: access:public signature:() +peek cpp_src/istream.tcc /^ peek(void)$/;" f class:std::basic_istream signature:(void) +perror cpp_src/cstdio 78;" d file: +plus cpp_src/stl_function.h /^ struct plus : public binary_function<_Tp, _Tp, _Tp>$/;" s namespace:std inherits:binary_function +pointer cpp_src/allocator.h /^ typedef _Tp* pointer;$/;" t class:std::allocator access:public +pointer cpp_src/allocator.h /^ typedef void* pointer;$/;" t class:std::allocator access:public +pointer cpp_src/basic_string.h /^ typedef typename _CharT_alloc_type::pointer pointer;$/;" t class:std::basic_string access:public +pointer cpp_src/stl_bvector.h /^ typedef _Bit_reference* pointer;$/;" t class:std::vector access:public +pointer cpp_src/stl_bvector.h /^ typedef _Bit_reference* pointer;$/;" t struct:std::_Bit_iterator access:public +pointer cpp_src/stl_bvector.h /^ typedef const bool* pointer;$/;" t struct:std::_Bit_const_iterator access:public +pointer cpp_src/stl_deque.h /^ typedef _Ptr pointer;$/;" t struct:std::_Deque_iterator access:public +pointer cpp_src/stl_deque.h /^ typedef typename _Tp_alloc_type::pointer pointer;$/;" t class:std::deque access:public +pointer cpp_src/stl_iterator.h /^ typedef typename iterator_traits<_Iterator>::pointer pointer;$/;" t class:std::reverse_iterator access:public +pointer cpp_src/stl_iterator.h /^ typedef typename iterator_traits<_Iterator>::pointer pointer;$/;" t class:__normal_iterator access:public +pointer cpp_src/stl_iterator_base_types.h /^ typedef _Pointer pointer;$/;" t struct:std::iterator access:public +pointer cpp_src/stl_iterator_base_types.h /^ typedef _Tp* pointer;$/;" t struct:std::iterator_traits access:public +pointer cpp_src/stl_iterator_base_types.h /^ typedef const _Tp* pointer;$/;" t struct:std::iterator_traits access:public +pointer cpp_src/stl_iterator_base_types.h /^ typedef typename _Iterator::pointer pointer;$/;" t struct:std::iterator_traits access:public +pointer cpp_src/stl_list.h /^ typedef _Tp* pointer;$/;" t struct:std::_List_iterator access:public +pointer cpp_src/stl_list.h /^ typedef const _Tp* pointer;$/;" t struct:std::_List_const_iterator access:public +pointer cpp_src/stl_list.h /^ typedef typename _Tp_alloc_type::pointer pointer;$/;" t class:std::list access:public +pointer cpp_src/stl_map.h /^ typedef typename _Pair_alloc_type::pointer pointer;$/;" t class:std::map access:public +pointer cpp_src/stl_multimap.h /^ typedef typename _Pair_alloc_type::pointer pointer;$/;" t class:std::multimap access:public +pointer cpp_src/stl_multiset.h /^ typedef typename _Key_alloc_type::pointer pointer;$/;" t class:std::multiset access:public +pointer cpp_src/stl_set.h /^ typedef typename _Key_alloc_type::pointer pointer;$/;" t class:std::set access:public +pointer cpp_src/stl_tempbuf.h /^ typedef value_type* pointer;$/;" t class:std::_Temporary_buffer access:public +pointer cpp_src/stl_tree.h /^ typedef _Tp* pointer;$/;" t struct:std::_Rb_tree_iterator access:public +pointer cpp_src/stl_tree.h /^ typedef const _Tp* pointer;$/;" t struct:std::_Rb_tree_const_iterator access:public +pointer cpp_src/stl_tree.h /^ typedef value_type* pointer;$/;" t class:std::_Rb_tree access:public +pointer cpp_src/stl_vector.h /^ typedef typename _Tp_alloc_type::pointer pointer;$/;" t class:std::vector access:public +pointer_to_binary_function cpp_src/stl_function.h /^ pointer_to_binary_function() {}$/;" f class:std::pointer_to_binary_function access:public signature:() +pointer_to_binary_function cpp_src/stl_function.h /^ pointer_to_binary_function(_Result (*__x)(_Arg1, _Arg2))$/;" f class:std::pointer_to_binary_function access:public signature:(_Result (__x)_Arg1, _Arg2)) +pointer_to_binary_function cpp_src/stl_function.h /^ class pointer_to_binary_function$/;" c namespace:std inherits:binary_function +pointer_to_unary_function cpp_src/stl_function.h /^ pointer_to_unary_function() {}$/;" f class:std::pointer_to_unary_function access:public signature:() +pointer_to_unary_function cpp_src/stl_function.h /^ pointer_to_unary_function(_Result (*__x)(_Arg))$/;" f class:std::pointer_to_unary_function access:public signature:(_Result (__x)_Arg)) +pointer_to_unary_function cpp_src/stl_function.h /^ class pointer_to_unary_function : public unary_function<_Arg, _Result>$/;" c namespace:std inherits:unary_function +polar cpp_src/complex /^ polar(const _Tp& __rho, const _Tp& __theta)$/;" f namespace:std signature:(const _Tp& __rho, const _Tp& __theta) +polar cpp_src/complex /^ template complex<_Tp> polar(const _Tp&, const _Tp& = 0);$/;" p namespace:std file: signature:(const _Tp&, const _Tp& = 0) +pop cpp_src/stl_queue.h /^ pop()$/;" f class:std::priority_queue access:public signature:() +pop cpp_src/stl_queue.h /^ pop()$/;" f class:std::queue access:public signature:() +pop cpp_src/stl_stack.h /^ pop()$/;" f class:std::stack access:public signature:() +pop_back cpp_src/stl_bvector.h /^ pop_back()$/;" f class:std::vector access:public signature:() +pop_back cpp_src/stl_deque.h /^ pop_back()$/;" f class:std::deque access:public signature:() +pop_back cpp_src/stl_list.h /^ pop_back()$/;" f class:std::list access:public signature:() +pop_back cpp_src/stl_vector.h /^ pop_back()$/;" f class:std::vector access:public signature:() +pop_front cpp_src/stl_deque.h /^ pop_front()$/;" f class:std::deque access:public signature:() +pop_front cpp_src/stl_list.h /^ pop_front()$/;" f class:std::list access:public signature:() +pop_heap cpp_src/stl_heap.h /^ pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last) +pop_heap cpp_src/stl_heap.h /^ pop_heap(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) +pos_format cpp_src/locale_facets.h /^ pos_format() const$/;" f class:std::moneypunct access:public signature:() const +pos_type cpp_src/basic_ios.h /^ typedef typename _Traits::pos_type pos_type;$/;" t class:std::basic_ios access:public +pos_type cpp_src/char_traits.h /^ typedef std::streampos pos_type;$/;" t struct:_Char_types access:public +pos_type cpp_src/char_traits.h /^ typedef typename _Char_types<_CharT>::pos_type pos_type;$/;" t struct:char_traits access:public +pos_type cpp_src/fstream /^ typedef typename traits_type::pos_type pos_type;$/;" t class:std::basic_filebuf file: access:public +pos_type cpp_src/fstream /^ typedef typename traits_type::pos_type pos_type;$/;" t class:std::basic_fstream file: access:public +pos_type cpp_src/fstream /^ typedef typename traits_type::pos_type pos_type;$/;" t class:std::basic_ifstream file: access:public +pos_type cpp_src/fstream /^ typedef typename traits_type::pos_type pos_type;$/;" t class:std::basic_ofstream file: access:public +pos_type cpp_src/istream /^ typedef typename _Traits::pos_type pos_type;$/;" t class:std::basic_iostream file: access:public +pos_type cpp_src/istream /^ typedef typename _Traits::pos_type pos_type;$/;" t class:std::basic_istream file: access:public +pos_type cpp_src/ostream /^ typedef typename _Traits::pos_type pos_type;$/;" t class:std::basic_ostream file: access:public +pos_type cpp_src/sstream /^ typedef typename traits_type::pos_type pos_type;$/;" t class:std::basic_istringstream file: access:public +pos_type cpp_src/sstream /^ typedef typename traits_type::pos_type pos_type;$/;" t class:std::basic_ostringstream file: access:public +pos_type cpp_src/sstream /^ typedef typename traits_type::pos_type pos_type;$/;" t class:std::basic_stringbuf file: access:public +pos_type cpp_src/sstream /^ typedef typename traits_type::pos_type pos_type;$/;" t class:std::basic_stringstream file: access:public +pos_type cpp_src/streambuf /^ typedef typename traits_type::pos_type pos_type;$/;" t class:std::basic_streambuf file: access:public +positive_sign cpp_src/locale_facets.h /^ positive_sign() const$/;" f class:std::moneypunct access:public signature:() const +pow cpp_src/cmath /^ pow(double __x, int __i)$/;" f namespace:std signature:(double __x, int __i) +pow cpp_src/cmath /^ pow(float __x, float __y)$/;" f namespace:std signature:(float __x, float __y) +pow cpp_src/cmath /^ pow(float __x, int __n)$/;" f namespace:std signature:(float __x, int __n) +pow cpp_src/cmath /^ pow(long double __x, int __n)$/;" f namespace:std signature:(long double __x, int __n) +pow cpp_src/cmath /^ pow(long double __x, long double __y)$/;" f namespace:std signature:(long double __x, long double __y) +pow cpp_src/cmath 75;" d file: +pow cpp_src/complex /^ pow(const _Tp& __x, const complex<_Tp>& __y)$/;" f namespace:std signature:(const _Tp& __x, const complex<_Tp>& __y) +pow cpp_src/complex /^ pow(const complex<_Tp>& __x, const _Tp& __y)$/;" f namespace:std signature:(const complex<_Tp>& __x, const _Tp& __y) +pow cpp_src/complex /^ pow(const complex<_Tp>& __x, const complex<_Tp>& __y)$/;" f namespace:std signature:(const complex<_Tp>& __x, const complex<_Tp>& __y) +pow cpp_src/complex /^ pow(const complex<_Tp>& __z, int __n)$/;" f namespace:std signature:(const complex<_Tp>& __z, int __n) +pow cpp_src/complex /^ template complex<_Tp> pow(const _Tp&, const complex<_Tp>&);$/;" p namespace:std file: signature:(const _Tp&, const complex<_Tp>&) +pow cpp_src/complex /^ template complex<_Tp> pow(const complex<_Tp>&, $/;" p namespace:std file: signature:(const complex<_Tp>&, const complex<_Tp>&) +pow cpp_src/complex /^ template complex<_Tp> pow(const complex<_Tp>&, const _Tp&);$/;" p namespace:std file: signature:(const complex<_Tp>&, const _Tp&) +pow cpp_src/complex /^ template complex<_Tp> pow(const complex<_Tp>&, int);$/;" p namespace:std file: signature:(const complex<_Tp>&, int) +pptr cpp_src/streambuf /^ pptr() const { return _M_out_cur; }$/;" f class:std::basic_streambuf access:protected signature:() const +precision cpp_src/ios_base.h /^ precision() const { return _M_precision; }$/;" f class:std::ios_base access:public signature:() const +precision cpp_src/ios_base.h /^ precision(streamsize __prec)$/;" f class:std::ios_base access:public signature:(streamsize __prec) +prev_permutation cpp_src/stl_algo.h /^ prev_permutation(_BidirectionalIterator __first,$/;" f namespace:std signature:(_BidirectionalIterator __first, _BidirectionalIterator __last) +prev_permutation cpp_src/stl_algo.h /^ prev_permutation(_BidirectionalIterator __first,$/;" f namespace:std signature:(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) +printf cpp_src/cstdio 79;" d file: +priority_queue cpp_src/stl_queue.h /^ priority_queue(_InputIterator __first, _InputIterator __last,$/;" f class:std::priority_queue access:public signature:(_InputIterator __first, _InputIterator __last, const _Compare& __x = _Compare(), const _Sequence& __s = _Sequence()) +priority_queue cpp_src/stl_queue.h /^ priority_queue(const _Compare& __x = _Compare(),$/;" f class:std::priority_queue access:public signature:(const _Compare& __x = _Compare(), const _Sequence& __s = _Sequence()) +priority_queue cpp_src/stl_queue.h /^ class priority_queue$/;" c namespace:std +ptr_fun cpp_src/stl_function.h /^ ptr_fun(_Result (*__x)(_Arg))$/;" f namespace:std signature:(_Result (__x)_Arg)) +ptr_fun cpp_src/stl_function.h /^ ptr_fun(_Result (*__x)(_Arg1, _Arg2))$/;" f namespace:std signature:(_Result (__x)_Arg1, _Arg2)) +pubimbue cpp_src/streambuf /^ pubimbue(const locale &__loc)$/;" f class:std::basic_streambuf access:public signature:(const locale &__loc) +pubseekoff cpp_src/streambuf /^ pubseekoff(off_type __off, ios_base::seekdir __way, $/;" f class:std::basic_streambuf access:public signature:(off_type __off, ios_base::seekdir __way, ios_base::openmode __mode = ios_base::in | ios_base::out) +pubseekpos cpp_src/streambuf /^ pubseekpos(pos_type __sp,$/;" f class:std::basic_streambuf access:public signature:(pos_type __sp, ios_base::openmode __mode = ios_base::in | ios_base::out) +pubsetbuf cpp_src/streambuf /^ pubsetbuf(char_type* __s, streamsize __n) $/;" f class:std::basic_streambuf access:public signature:(char_type* __s, streamsize __n) +pubsync cpp_src/streambuf /^ pubsync() { return this->sync(); }$/;" f class:std::basic_streambuf access:public signature:() +push cpp_src/stl_queue.h /^ push(const value_type& __x)$/;" f class:std::priority_queue access:public signature:(const value_type& __x) +push cpp_src/stl_queue.h /^ push(const value_type& __x)$/;" f class:std::queue access:public signature:(const value_type& __x) +push cpp_src/stl_stack.h /^ push(const value_type& __x)$/;" f class:std::stack access:public signature:(const value_type& __x) +push_back cpp_src/basic_string.h /^ push_back(_CharT __c)$/;" f class:std::basic_string access:public signature:(_CharT __c) +push_back cpp_src/stl_bvector.h /^ push_back(bool __x)$/;" f class:std::vector access:public signature:(bool __x) +push_back cpp_src/stl_deque.h /^ push_back(const value_type& __x)$/;" f class:std::deque access:public signature:(const value_type& __x) +push_back cpp_src/stl_list.h /^ push_back(const value_type& __x)$/;" f class:std::list access:public signature:(const value_type& __x) +push_back cpp_src/stl_vector.h /^ push_back(const value_type& __x)$/;" f class:std::vector access:public signature:(const value_type& __x) +push_front cpp_src/stl_deque.h /^ push_front(const value_type& __x)$/;" f class:std::deque access:public signature:(const value_type& __x) +push_front cpp_src/stl_list.h /^ push_front(const value_type& __x)$/;" f class:std::list access:public signature:(const value_type& __x) +push_heap cpp_src/stl_heap.h /^ push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last) +push_heap cpp_src/stl_heap.h /^ push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) +put cpp_src/locale_facets.h /^ put(iter_type __s, bool __intl, ios_base& __io,$/;" f class:std::money_put access:public signature:(iter_type __s, bool __intl, ios_base& __io, char_type __fill, const string_type& __digits) const +put cpp_src/locale_facets.h /^ put(iter_type __s, bool __intl, ios_base& __io,$/;" f class:std::money_put access:public signature:(iter_type __s, bool __intl, ios_base& __io, char_type __fill, long double __units) const +put cpp_src/locale_facets.h /^ put(iter_type __s, ios_base& __f, char_type __fill, bool __v) const$/;" f class:std::num_put access:public signature:(iter_type __s, ios_base& __f, char_type __fill, bool __v) const +put cpp_src/locale_facets.h /^ put(iter_type __s, ios_base& __f, char_type __fill, double __v) const$/;" f class:std::num_put access:public signature:(iter_type __s, ios_base& __f, char_type __fill, double __v) const +put cpp_src/locale_facets.h /^ put(iter_type __s, ios_base& __f, char_type __fill, long __v) const$/;" f class:std::num_put access:public signature:(iter_type __s, ios_base& __f, char_type __fill, long __v) const +put cpp_src/locale_facets.h /^ put(iter_type __s, ios_base& __f, char_type __fill, long long __v) const$/;" f class:std::num_put access:public signature:(iter_type __s, ios_base& __f, char_type __fill, long long __v) const +put cpp_src/locale_facets.h /^ put(iter_type __s, ios_base& __f, char_type __fill,$/;" f class:std::num_put access:public signature:(iter_type __s, ios_base& __f, char_type __fill, const void* __v) const +put cpp_src/locale_facets.h /^ put(iter_type __s, ios_base& __f, char_type __fill,$/;" f class:std::num_put access:public signature:(iter_type __s, ios_base& __f, char_type __fill, long double __v) const +put cpp_src/locale_facets.h /^ put(iter_type __s, ios_base& __f, char_type __fill,$/;" f class:std::num_put access:public signature:(iter_type __s, ios_base& __f, char_type __fill, unsigned long __v) const +put cpp_src/locale_facets.h /^ put(iter_type __s, ios_base& __f, char_type __fill,$/;" f class:std::num_put access:public signature:(iter_type __s, ios_base& __f, char_type __fill, unsigned long long __v) const +put cpp_src/locale_facets.h /^ put(iter_type __s, ios_base& __io, char_type __fill, const tm* __tm,$/;" p class:std::time_put access:public signature:(iter_type __s, ios_base& __io, char_type __fill, const tm* __tm, const _CharT* __beg, const _CharT* __end) const +put cpp_src/locale_facets.h /^ put(iter_type __s, ios_base& __io, char_type __fill,$/;" f class:std::time_put access:public signature:(iter_type __s, ios_base& __io, char_type __fill, const tm* __tm, char __format, char __mod = 0) const +put cpp_src/locale_facets.tcc /^ put(iter_type __s, ios_base& __io, char_type __fill, const tm* __tm,$/;" f class:std::time_put signature:(iter_type __s, ios_base& __io, char_type __fill, const tm* __tm, const _CharT* __beg, const _CharT* __end) const +put cpp_src/ostream /^ put(char_type __c);$/;" p class:std::basic_ostream file: access:public signature:(char_type __c) +put cpp_src/ostream.tcc /^ put(char_type __c)$/;" f class:std::basic_ostream signature:(char_type __c) +putback cpp_src/istream /^ putback(char_type __c);$/;" p class:std::basic_istream file: access:public signature:(char_type __c) +putback cpp_src/istream.tcc /^ putback(char_type __c)$/;" f class:std::basic_istream signature:(char_type __c) +putc cpp_src/cstdio 80;" d file: +putchar cpp_src/cstdio 81;" d file: +puts cpp_src/cstdio 82;" d file: +putwc cpp_src/cwchar 91;" d file: +putwchar cpp_src/cwchar 92;" d file: +pword cpp_src/ios_base.h /^ pword(int __ix)$/;" f class:std::ios_base access:public signature:(int __ix) +queue cpp_src/stl_queue.h /^ queue(const _Sequence& __c = _Sequence()) : c(__c) {}$/;" f class:std::queue access:public signature:(const _Sequence& __c = _Sequence()) +queue cpp_src/stl_queue.h /^ class queue$/;" c namespace:std +quiet_NaN cpp_src/limits /^ static _Tp quiet_NaN() throw() { return static_cast<_Tp>(0); }$/;" f struct:std::numeric_limits access:public signature:() +quiet_NaN cpp_src/limits /^ static bool quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +quiet_NaN cpp_src/limits /^ static char quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +quiet_NaN cpp_src/limits /^ static double quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +quiet_NaN cpp_src/limits /^ static float quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +quiet_NaN cpp_src/limits /^ static int quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +quiet_NaN cpp_src/limits /^ static long double quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +quiet_NaN cpp_src/limits /^ static long long quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +quiet_NaN cpp_src/limits /^ static long quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +quiet_NaN cpp_src/limits /^ static short quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +quiet_NaN cpp_src/limits /^ static signed char quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +quiet_NaN cpp_src/limits /^ static unsigned char quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +quiet_NaN cpp_src/limits /^ static unsigned int quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +quiet_NaN cpp_src/limits /^ static unsigned long long quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +quiet_NaN cpp_src/limits /^ static unsigned long quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +quiet_NaN cpp_src/limits /^ static unsigned short quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +quiet_NaN cpp_src/limits /^ static wchar_t quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +radix cpp_src/limits /^ static const int radix = 2;$/;" m struct:std::numeric_limits file: access:public +radix cpp_src/limits /^ static const int radix = __FLT_RADIX__;$/;" m struct:std::numeric_limits file: access:public +radix cpp_src/limits /^ static const int radix = 0;$/;" m struct:std::__numeric_limits_base file: access:public +raise cpp_src/csignal 54;" d file: +random_access_iterator_tag cpp_src/stl_iterator_base_types.h /^ struct random_access_iterator_tag : public bidirectional_iterator_tag {};$/;" s namespace:std inherits:bidirectional_iterator_tag +random_shuffle cpp_src/stl_algo.h /^ random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last)$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last) +random_shuffle cpp_src/stl_algo.h /^ random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomNumberGenerator& __rand) +range_error cpp_src/stdexcept /^ explicit range_error(const string& __arg);$/;" p class:std::range_error file: access:public signature:(const string& __arg) +range_error cpp_src/stdexcept /^ class range_error : public runtime_error $/;" c namespace:std file: inherits:runtime_error +raw_storage_iterator cpp_src/stl_raw_storage_iter.h /^ raw_storage_iterator(_ForwardIterator __x)$/;" f class:std::raw_storage_iterator access:public signature:(_ForwardIterator __x) +raw_storage_iterator cpp_src/stl_raw_storage_iter.h /^ class raw_storage_iterator$/;" c namespace:std inherits:iterator +rbegin cpp_src/basic_string.h /^ rbegin() const$/;" f class:std::basic_string access:public signature:() const +rbegin cpp_src/basic_string.h /^ rbegin()$/;" f class:std::basic_string access:public signature:() +rbegin cpp_src/stl_bvector.h /^ rbegin() const$/;" f class:std::vector access:public signature:() const +rbegin cpp_src/stl_bvector.h /^ rbegin()$/;" f class:std::vector access:public signature:() +rbegin cpp_src/stl_deque.h /^ rbegin() const$/;" f class:std::deque access:public signature:() const +rbegin cpp_src/stl_deque.h /^ rbegin()$/;" f class:std::deque access:public signature:() +rbegin cpp_src/stl_list.h /^ rbegin() const$/;" f class:std::list access:public signature:() const +rbegin cpp_src/stl_list.h /^ rbegin()$/;" f class:std::list access:public signature:() +rbegin cpp_src/stl_map.h /^ rbegin() const$/;" f class:std::map access:public signature:() const +rbegin cpp_src/stl_map.h /^ rbegin()$/;" f class:std::map access:public signature:() +rbegin cpp_src/stl_multimap.h /^ rbegin() const$/;" f class:std::multimap access:public signature:() const +rbegin cpp_src/stl_multimap.h /^ rbegin()$/;" f class:std::multimap access:public signature:() +rbegin cpp_src/stl_multiset.h /^ rbegin() const$/;" f class:std::multiset access:public signature:() const +rbegin cpp_src/stl_set.h /^ rbegin() const$/;" f class:std::set access:public signature:() const +rbegin cpp_src/stl_tree.h /^ rbegin() const$/;" f class:std::_Rb_tree access:public signature:() const +rbegin cpp_src/stl_tree.h /^ rbegin()$/;" f class:std::_Rb_tree access:public signature:() +rbegin cpp_src/stl_vector.h /^ rbegin() const$/;" f class:std::vector access:public signature:() const +rbegin cpp_src/stl_vector.h /^ rbegin()$/;" f class:std::vector access:public signature:() +rdbuf cpp_src/basic_ios.h /^ rdbuf() const$/;" f class:std::basic_ios access:public signature:() const +rdbuf cpp_src/basic_ios.h /^ rdbuf(basic_streambuf<_CharT, _Traits>* __sb);$/;" p class:std::basic_ios access:public signature:(basic_streambuf<_CharT, _Traits>* __sb) +rdbuf cpp_src/basic_ios.tcc /^ basic_ios<_CharT, _Traits>::rdbuf(basic_streambuf<_CharT, _Traits>* __sb)$/;" f class:std::basic_ios signature:(basic_streambuf<_CharT, _Traits>* __sb) +rdbuf cpp_src/fstream /^ rdbuf() const$/;" f class:std::basic_fstream access:public signature:() const +rdbuf cpp_src/fstream /^ rdbuf() const$/;" f class:std::basic_ifstream access:public signature:() const +rdbuf cpp_src/fstream /^ rdbuf() const$/;" f class:std::basic_ofstream access:public signature:() const +rdbuf cpp_src/sstream /^ rdbuf() const$/;" f class:std::basic_istringstream access:public signature:() const +rdbuf cpp_src/sstream /^ rdbuf() const$/;" f class:std::basic_ostringstream access:public signature:() const +rdbuf cpp_src/sstream /^ rdbuf() const$/;" f class:std::basic_stringstream access:public signature:() const +rdstate cpp_src/basic_ios.h /^ rdstate() const$/;" f class:std::basic_ios access:public signature:() const +read cpp_src/istream /^ read(char_type* __s, streamsize __n);$/;" p class:std::basic_istream file: access:public signature:(char_type* __s, streamsize __n) +read cpp_src/istream.tcc /^ read(char_type* __s, streamsize __n)$/;" f class:std::basic_istream signature:(char_type* __s, streamsize __n) +readsome cpp_src/istream /^ readsome(char_type* __s, streamsize __n);$/;" p class:std::basic_istream file: access:public signature:(char_type* __s, streamsize __n) +readsome cpp_src/istream.tcc /^ readsome(char_type* __s, streamsize __n)$/;" f class:std::basic_istream signature:(char_type* __s, streamsize __n) +real cpp_src/complex /^ _Tp& real(); $/;" p struct:std::complex file: access:public signature:() +real cpp_src/complex /^ const _Tp& real() const;$/;" p struct:std::complex file: access:public signature:() const +real cpp_src/complex /^ const double& real() const;$/;" p struct:std::complex file: access:public signature:() const +real cpp_src/complex /^ const float& real() const;$/;" p struct:std::complex file: access:public signature:() const +real cpp_src/complex /^ const long double& real() const;$/;" p struct:std::complex file: access:public signature:() const +real cpp_src/complex /^ double& real();$/;" p struct:std::complex file: access:public signature:() +real cpp_src/complex /^ float& real();$/;" p struct:std::complex file: access:public signature:() +real cpp_src/complex /^ long double& real();$/;" p struct:std::complex file: access:public signature:() +real cpp_src/complex /^ complex<_Tp>::real() const { return _M_real; }$/;" f class:std::complex signature:() const +real cpp_src/complex /^ complex<_Tp>::real() { return _M_real; }$/;" f class:std::complex signature:() +real cpp_src/complex /^ real(complex<_Tp>& __z)$/;" f namespace:std signature:(complex<_Tp>& __z) +real cpp_src/complex /^ real(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +real cpp_src/complex /^ complex::real() const$/;" f class:std::complex signature:() const +real cpp_src/complex /^ complex::real()$/;" f class:std::complex signature:() +real cpp_src/complex /^ complex::real() const$/;" f class:std::complex signature:() const +real cpp_src/complex /^ complex::real()$/;" f class:std::complex signature:() +real cpp_src/complex /^ complex::real() const$/;" f class:std::complex signature:() const +real cpp_src/complex /^ complex::real()$/;" f class:std::complex signature:() +rebind cpp_src/allocator.h /^ struct rebind$/;" s class:std::allocator access:public +reference cpp_src/allocator.h /^ typedef _Tp& reference;$/;" t class:std::allocator access:public +reference cpp_src/basic_string.h /^ typedef typename _CharT_alloc_type::reference reference;$/;" t class:std::basic_string access:public +reference cpp_src/bitset /^ reference();$/;" p class:std::bitset::reference file: access:private signature:() +reference cpp_src/bitset /^ reference(bitset& __b, size_t __pos)$/;" f class:std::bitset::reference access:public signature:(bitset& __b, size_t __pos) +reference cpp_src/bitset /^ class reference$/;" c class:std::bitset file: access:public +reference cpp_src/stl_bvector.h /^ typedef _Bit_reference reference;$/;" t class:std::vector access:public +reference cpp_src/stl_bvector.h /^ typedef _Bit_reference reference;$/;" t struct:std::_Bit_iterator access:public +reference cpp_src/stl_bvector.h /^ typedef bool reference;$/;" t struct:std::_Bit_const_iterator access:public +reference cpp_src/stl_deque.h /^ typedef _Ref reference;$/;" t struct:std::_Deque_iterator access:public +reference cpp_src/stl_deque.h /^ typedef typename _Tp_alloc_type::reference reference;$/;" t class:std::deque access:public +reference cpp_src/stl_iterator.h /^ typedef typename iterator_traits<_Iterator>::reference reference;$/;" t class:std::reverse_iterator access:public +reference cpp_src/stl_iterator.h /^ typedef typename iterator_traits<_Iterator>::reference reference;$/;" t class:__normal_iterator access:public +reference cpp_src/stl_iterator_base_types.h /^ typedef _Reference reference;$/;" t struct:std::iterator access:public +reference cpp_src/stl_iterator_base_types.h /^ typedef _Tp& reference;$/;" t struct:std::iterator_traits access:public +reference cpp_src/stl_iterator_base_types.h /^ typedef const _Tp& reference;$/;" t struct:std::iterator_traits access:public +reference cpp_src/stl_iterator_base_types.h /^ typedef typename _Iterator::reference reference;$/;" t struct:std::iterator_traits access:public +reference cpp_src/stl_list.h /^ typedef _Tp& reference;$/;" t struct:std::_List_iterator access:public +reference cpp_src/stl_list.h /^ typedef const _Tp& reference;$/;" t struct:std::_List_const_iterator access:public +reference cpp_src/stl_list.h /^ typedef typename _Tp_alloc_type::reference reference;$/;" t class:std::list access:public +reference cpp_src/stl_map.h /^ typedef typename _Pair_alloc_type::reference reference;$/;" t class:std::map access:public +reference cpp_src/stl_multimap.h /^ typedef typename _Pair_alloc_type::reference reference;$/;" t class:std::multimap access:public +reference cpp_src/stl_multiset.h /^ typedef typename _Key_alloc_type::reference reference;$/;" t class:std::multiset access:public +reference cpp_src/stl_queue.h /^ typedef typename _Sequence::reference reference;$/;" t class:std::priority_queue access:public +reference cpp_src/stl_queue.h /^ typedef typename _Sequence::reference reference;$/;" t class:std::queue access:public +reference cpp_src/stl_set.h /^ typedef typename _Key_alloc_type::reference reference;$/;" t class:std::set access:public +reference cpp_src/stl_stack.h /^ typedef typename _Sequence::reference reference;$/;" t class:std::stack access:public +reference cpp_src/stl_tree.h /^ typedef _Tp& reference;$/;" t struct:std::_Rb_tree_iterator access:public +reference cpp_src/stl_tree.h /^ typedef const _Tp& reference;$/;" t struct:std::_Rb_tree_const_iterator access:public +reference cpp_src/stl_tree.h /^ typedef value_type& reference;$/;" t class:std::_Rb_tree access:public +reference cpp_src/stl_vector.h /^ typedef typename _Tp_alloc_type::reference reference;$/;" t class:std::vector access:public +register_callback cpp_src/ios_base.h /^ register_callback(event_callback __fn, int __index);$/;" p class:std::ios_base access:public signature:(event_callback __fn, int __index) +rel_ops cpp_src/stl_relops.h /^ namespace rel_ops$/;" n namespace:std +release cpp_src/memory /^ release() throw()$/;" f class:std::auto_ptr access:public signature:() +remove cpp_src/cstdio 83;" d file: +remove cpp_src/list.tcc /^ remove(const value_type& __value)$/;" f class:std::list signature:(const value_type& __value) +remove cpp_src/stl_algo.h /^ remove(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) +remove cpp_src/stl_list.h /^ remove(const _Tp& __value);$/;" p class:std::list access:public signature:(const _Tp& __value) +remove_copy cpp_src/stl_algo.h /^ remove_copy(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value) +remove_copy_if cpp_src/stl_algo.h /^ remove_copy_if(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) +remove_if cpp_src/list.tcc /^ remove_if(_Predicate __pred)$/;" f class:std::list signature:(_Predicate __pred) +remove_if cpp_src/stl_algo.h /^ remove_if(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) +remove_if cpp_src/stl_list.h /^ remove_if(_Predicate);$/;" p class:std::list access:public signature:(_Predicate) +rename cpp_src/cstdio 84;" d file: +rend cpp_src/basic_string.h /^ rend() const$/;" f class:std::basic_string access:public signature:() const +rend cpp_src/basic_string.h /^ rend()$/;" f class:std::basic_string access:public signature:() +rend cpp_src/stl_bvector.h /^ rend() const$/;" f class:std::vector access:public signature:() const +rend cpp_src/stl_bvector.h /^ rend()$/;" f class:std::vector access:public signature:() +rend cpp_src/stl_deque.h /^ rend() const$/;" f class:std::deque access:public signature:() const +rend cpp_src/stl_deque.h /^ rend()$/;" f class:std::deque access:public signature:() +rend cpp_src/stl_list.h /^ rend() const$/;" f class:std::list access:public signature:() const +rend cpp_src/stl_list.h /^ rend()$/;" f class:std::list access:public signature:() +rend cpp_src/stl_map.h /^ rend() const$/;" f class:std::map access:public signature:() const +rend cpp_src/stl_map.h /^ rend()$/;" f class:std::map access:public signature:() +rend cpp_src/stl_multimap.h /^ rend() const$/;" f class:std::multimap access:public signature:() const +rend cpp_src/stl_multimap.h /^ rend()$/;" f class:std::multimap access:public signature:() +rend cpp_src/stl_multiset.h /^ rend() const$/;" f class:std::multiset access:public signature:() const +rend cpp_src/stl_set.h /^ rend() const$/;" f class:std::set access:public signature:() const +rend cpp_src/stl_tree.h /^ rend() const$/;" f class:std::_Rb_tree access:public signature:() const +rend cpp_src/stl_tree.h /^ rend()$/;" f class:std::_Rb_tree access:public signature:() +rend cpp_src/stl_vector.h /^ rend() const$/;" f class:std::vector access:public signature:() const +rend cpp_src/stl_vector.h /^ rend()$/;" f class:std::vector access:public signature:() +replace cpp_src/basic_string.h /^ replace(iterator __i1, iterator __i2,$/;" f class:std::basic_string access:public signature:(iterator __i1, iterator __i2, _InputIterator __k1, _InputIterator __k2) +replace cpp_src/basic_string.h /^ replace(iterator __i1, iterator __i2, _CharT* __k1, _CharT* __k2)$/;" f class:std::basic_string access:public signature:(iterator __i1, iterator __i2, _CharT* __k1, _CharT* __k2) +replace cpp_src/basic_string.h /^ replace(iterator __i1, iterator __i2, const _CharT* __s)$/;" f class:std::basic_string access:public signature:(iterator __i1, iterator __i2, const _CharT* __s) +replace cpp_src/basic_string.h /^ replace(iterator __i1, iterator __i2, const _CharT* __s, size_type __n)$/;" f class:std::basic_string access:public signature:(iterator __i1, iterator __i2, const _CharT* __s, size_type __n) +replace cpp_src/basic_string.h /^ replace(iterator __i1, iterator __i2, const basic_string& __str)$/;" f class:std::basic_string access:public signature:(iterator __i1, iterator __i2, const basic_string& __str) +replace cpp_src/basic_string.h /^ replace(iterator __i1, iterator __i2, iterator __k1, iterator __k2)$/;" f class:std::basic_string access:public signature:(iterator __i1, iterator __i2, iterator __k1, iterator __k2) +replace cpp_src/basic_string.h /^ replace(iterator __i1, iterator __i2, size_type __n, _CharT __c)$/;" f class:std::basic_string access:public signature:(iterator __i1, iterator __i2, size_type __n, _CharT __c) +replace cpp_src/basic_string.h /^ replace(iterator __i1, iterator __i2,$/;" f class:std::basic_string access:public signature:(iterator __i1, iterator __i2, const _CharT* __k1, const _CharT* __k2) +replace cpp_src/basic_string.h /^ replace(iterator __i1, iterator __i2,$/;" f class:std::basic_string access:public signature:(iterator __i1, iterator __i2, const_iterator __k1, const_iterator __k2) +replace cpp_src/basic_string.h /^ replace(size_type __pos, size_type __n, const basic_string& __str)$/;" f class:std::basic_string access:public signature:(size_type __pos, size_type __n, const basic_string& __str) +replace cpp_src/basic_string.h /^ replace(size_type __pos, size_type __n1, const _CharT* __s)$/;" f class:std::basic_string access:public signature:(size_type __pos, size_type __n1, const _CharT* __s) +replace cpp_src/basic_string.h /^ replace(size_type __pos, size_type __n1, const _CharT* __s,$/;" p class:std::basic_string access:public signature:(size_type __pos, size_type __n1, const _CharT* __s, size_type __n2) +replace cpp_src/basic_string.h /^ replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c)$/;" f class:std::basic_string access:public signature:(size_type __pos, size_type __n1, size_type __n2, _CharT __c) +replace cpp_src/basic_string.h /^ replace(size_type __pos1, size_type __n1, const basic_string& __str,$/;" f class:std::basic_string access:public signature:(size_type __pos1, size_type __n1, const basic_string& __str, size_type __pos2, size_type __n2) +replace cpp_src/basic_string.tcc /^ replace(size_type __pos, size_type __n1, const _CharT* __s,$/;" f class:std::basic_string signature:(size_type __pos, size_type __n1, const _CharT* __s, size_type __n2) +replace cpp_src/stl_algo.h /^ replace(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) +replace_copy cpp_src/stl_algo.h /^ replace_copy(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __old_value, const _Tp& __new_value) +replace_copy_if cpp_src/stl_algo.h /^ replace_copy_if(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred, const _Tp& __new_value) +replace_if cpp_src/stl_algo.h /^ replace_if(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) +requested_size cpp_src/stl_tempbuf.h /^ requested_size() const$/;" f class:std::_Temporary_buffer access:public signature:() const +reserve cpp_src/basic_string.h /^ reserve(size_type __res_arg = 0);$/;" p class:std::basic_string access:public signature:(size_type __res_arg = 0) +reserve cpp_src/basic_string.tcc /^ reserve(size_type __res)$/;" f class:std::basic_string signature:(size_type __res) +reserve cpp_src/stl_bvector.h /^ reserve(size_type __n)$/;" f class:std::vector access:public signature:(size_type __n) +reserve cpp_src/stl_vector.h /^ reserve(size_type __n);$/;" p class:std::vector access:public signature:(size_type __n) +reserve cpp_src/vector.tcc /^ reserve(size_type __n)$/;" f class:std::vector signature:(size_type __n) +reset cpp_src/bitset /^ reset()$/;" f class:std::bitset access:public signature:() +reset cpp_src/bitset /^ reset(size_t __position)$/;" f class:std::bitset access:public signature:(size_t __position) +reset cpp_src/bitset /^ reset(size_t)$/;" f class:std::bitset signature:(size_t) +reset cpp_src/memory /^ reset(element_type* __p = 0) throw()$/;" f class:std::auto_ptr access:public signature:(element_type* __p = 0) +resetiosflags cpp_src/iomanip /^ resetiosflags(ios_base::fmtflags __mask)$/;" f namespace:std signature:(ios_base::fmtflags __mask) +resize cpp_src/basic_string.h /^ resize(size_type __n)$/;" f class:std::basic_string access:public signature:(size_type __n) +resize cpp_src/basic_string.h /^ resize(size_type __n, _CharT __c);$/;" p class:std::basic_string access:public signature:(size_type __n, _CharT __c) +resize cpp_src/basic_string.tcc /^ resize(size_type __n, _CharT __c)$/;" f class:std::basic_string signature:(size_type __n, _CharT __c) +resize cpp_src/list.tcc /^ resize(size_type __new_size, value_type __x)$/;" f class:std::list signature:(size_type __new_size, value_type __x) +resize cpp_src/stl_bvector.h /^ resize(size_type __new_size, bool __x = bool())$/;" f class:std::vector access:public signature:(size_type __new_size, bool __x = bool()) +resize cpp_src/stl_deque.h /^ resize(size_type __new_size, value_type __x = value_type())$/;" f class:std::deque access:public signature:(size_type __new_size, value_type __x = value_type()) +resize cpp_src/stl_list.h /^ resize(size_type __new_size, value_type __x = value_type());$/;" p class:std::list access:public signature:(size_type __new_size, value_type __x = value_type()) +resize cpp_src/stl_vector.h /^ resize(size_type __new_size, value_type __x = value_type())$/;" f class:std::vector access:public signature:(size_type __new_size, value_type __x = value_type()) +resize cpp_src/valarray /^ void resize(size_t __size, _Tp __c = _Tp());$/;" p class:std::valarray file: access:public signature:(size_t __size, _Tp __c = _Tp()) +resize cpp_src/valarray /^ valarray<_Tp>::resize(size_t __n, _Tp __c)$/;" f class:std::valarray signature:(size_t __n, _Tp __c) +result cpp_src/codecvt.h /^ typedef codecvt_base::result result;$/;" t class:std::__codecvt_abstract_base access:public +result cpp_src/codecvt.h /^ typedef codecvt_base::result result;$/;" t class:std::codecvt access:public +result cpp_src/codecvt.h /^ enum result$/;" g class:std::codecvt_base access:public +result_type cpp_src/stl_function.h /^ typedef _Result result_type; \/\/\/< type of the return type$/;" t struct:std::binary_function access:public +result_type cpp_src/stl_function.h /^ typedef _Result result_type; \/\/\/< @c result_type is the return type$/;" t struct:std::unary_function access:public +result_type cpp_src/valarray_before.h /^ typedef _Tp result_type;$/;" t struct:std::__fun access:public +result_type cpp_src/valarray_before.h /^ typedef bool result_type;$/;" t struct:std::__fun access:public +return_temporary_buffer cpp_src/memory /^ return_temporary_buffer(_Tp* __p)$/;" f namespace:std signature:(_Tp* __p) +reverse cpp_src/stl_algo.h /^ reverse(_BidirectionalIterator __first, _BidirectionalIterator __last)$/;" f namespace:std signature:(_BidirectionalIterator __first, _BidirectionalIterator __last) +reverse cpp_src/stl_list.h /^ reverse()$/;" f class:std::list access:public signature:() +reverse cpp_src/stl_list.h /^ reverse();$/;" p struct:std::_List_node_base access:public signature:() +reverse_copy cpp_src/stl_algo.h /^ reverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last,$/;" f namespace:std signature:(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) +reverse_iterator cpp_src/basic_string.h /^ typedef std::reverse_iterator reverse_iterator;$/;" t class:std::basic_string access:public +reverse_iterator cpp_src/stl_bvector.h /^ typedef std::reverse_iterator reverse_iterator;$/;" t class:std::vector access:public +reverse_iterator cpp_src/stl_deque.h /^ typedef std::reverse_iterator reverse_iterator;$/;" t class:std::deque access:public +reverse_iterator cpp_src/stl_iterator.h /^ reverse_iterator(const reverse_iterator<_Iter>& __x)$/;" f class:std::reverse_iterator access:public signature:(const reverse_iterator<_Iter>& __x) +reverse_iterator cpp_src/stl_iterator.h /^ reverse_iterator() : current() { }$/;" f class:std::reverse_iterator access:public signature:() +reverse_iterator cpp_src/stl_iterator.h /^ reverse_iterator(const reverse_iterator& __x)$/;" f class:std::reverse_iterator access:public signature:(const reverse_iterator& __x) +reverse_iterator cpp_src/stl_iterator.h /^ reverse_iterator(iterator_type __x) : current(__x) { }$/;" f class:std::reverse_iterator access:public signature:(iterator_type __x) +reverse_iterator cpp_src/stl_iterator.h /^ class reverse_iterator$/;" c namespace:std inherits:iterator +reverse_iterator cpp_src/stl_list.h /^ typedef std::reverse_iterator reverse_iterator;$/;" t class:std::list access:public +reverse_iterator cpp_src/stl_map.h /^ typedef typename _Rep_type::reverse_iterator reverse_iterator;$/;" t class:std::map access:public +reverse_iterator cpp_src/stl_multimap.h /^ typedef typename _Rep_type::reverse_iterator reverse_iterator;$/;" t class:std::multimap access:public +reverse_iterator cpp_src/stl_multiset.h /^ typedef typename _Rep_type::const_reverse_iterator reverse_iterator;$/;" t class:std::multiset access:public +reverse_iterator cpp_src/stl_set.h /^ typedef typename _Rep_type::const_reverse_iterator reverse_iterator;$/;" t class:std::set access:public +reverse_iterator cpp_src/stl_tree.h /^ typedef std::reverse_iterator reverse_iterator;$/;" t class:std::_Rb_tree access:public +reverse_iterator cpp_src/stl_vector.h /^ typedef std::reverse_iterator reverse_iterator;$/;" t class:std::vector access:public +rewind cpp_src/cstdio 85;" d file: +rfind cpp_src/basic_string.h /^ rfind(_CharT __c, size_type __pos = npos) const;$/;" p class:std::basic_string access:public signature:(_CharT __c, size_type __pos = npos) const +rfind cpp_src/basic_string.h /^ rfind(const _CharT* __s, size_type __pos = npos) const$/;" f class:std::basic_string access:public signature:(const _CharT* __s, size_type __pos = npos) const +rfind cpp_src/basic_string.h /^ rfind(const _CharT* __s, size_type __pos, size_type __n) const;$/;" p class:std::basic_string access:public signature:(const _CharT* __s, size_type __pos, size_type __n) const +rfind cpp_src/basic_string.h /^ rfind(const basic_string& __str, size_type __pos = npos) const$/;" f class:std::basic_string access:public signature:(const basic_string& __str, size_type __pos = npos) const +rfind cpp_src/basic_string.tcc /^ rfind(_CharT __c, size_type __pos) const$/;" f class:std::basic_string signature:(_CharT __c, size_type __pos) const +rfind cpp_src/basic_string.tcc /^ rfind(const _CharT* __s, size_type __pos, size_type __n) const$/;" f class:std::basic_string signature:(const _CharT* __s, size_type __pos, size_type __n) const +right cpp_src/ios_base.h /^ static const fmtflags right = _S_right;$/;" m class:std::ios_base access:public +right cpp_src/ios_base.h /^ right(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +rotate cpp_src/stl_algo.h /^ rotate(_ForwardIterator __first, _ForwardIterator __middle,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) +rotate_copy cpp_src/stl_algo.h /^ rotate_copy(_ForwardIterator __first, _ForwardIterator __middle,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) +round_error cpp_src/limits /^ static _Tp round_error() throw() { return static_cast<_Tp>(0); }$/;" f struct:std::numeric_limits access:public signature:() +round_error cpp_src/limits /^ static bool round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +round_error cpp_src/limits /^ static char round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +round_error cpp_src/limits /^ static double round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +round_error cpp_src/limits /^ static float round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +round_error cpp_src/limits /^ static int round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +round_error cpp_src/limits /^ static long double round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +round_error cpp_src/limits /^ static long long round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +round_error cpp_src/limits /^ static long round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +round_error cpp_src/limits /^ static short round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +round_error cpp_src/limits /^ static signed char round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +round_error cpp_src/limits /^ static unsigned char round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +round_error cpp_src/limits /^ static unsigned int round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +round_error cpp_src/limits /^ static unsigned long long round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +round_error cpp_src/limits /^ static unsigned long round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +round_error cpp_src/limits /^ static unsigned short round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +round_error cpp_src/limits /^ static wchar_t round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +round_indeterminate cpp_src/limits /^ round_indeterminate = -1, \/\/\/< Self-explanatory.$/;" e enum:std::float_round_style file: +round_style cpp_src/limits /^ static const float_round_style round_style = round_to_nearest;$/;" m struct:std::numeric_limits file: access:public +round_style cpp_src/limits /^ static const float_round_style round_style = round_toward_zero;$/;" m struct:std::numeric_limits file: access:public +round_style cpp_src/limits /^ static const float_round_style round_style = round_toward_zero;$/;" m struct:std::__numeric_limits_base file: access:public +round_to_nearest cpp_src/limits /^ round_to_nearest = 1, \/\/\/< To the nearest representable value.$/;" e enum:std::float_round_style file: +round_toward_infinity cpp_src/limits /^ round_toward_infinity = 2, \/\/\/< Self-explanatory.$/;" e enum:std::float_round_style file: +round_toward_neg_infinity cpp_src/limits /^ round_toward_neg_infinity = 3 \/\/\/< Self-explanatory.$/;" e enum:std::float_round_style file: +round_toward_zero cpp_src/limits /^ round_toward_zero = 0, \/\/\/< Self-explanatory.$/;" e enum:std::float_round_style file: +runtime_error cpp_src/stdexcept /^ runtime_error(const string& __arg);$/;" p class:std::runtime_error file: access:public signature:(const string& __arg) +runtime_error cpp_src/stdexcept /^ class runtime_error : public exception $/;" c namespace:std file: inherits:exception +sbumpc cpp_src/streambuf /^ sbumpc()$/;" f class:std::basic_streambuf access:public signature:() +scan_is cpp_src/locale_facets.h /^ scan_is(mask __m, const char* __lo, const char* __hi) const;$/;" p class:std::ctype access:public signature:(mask __m, const char* __lo, const char* __hi) const +scan_is cpp_src/locale_facets.h /^ scan_is(mask __m, const char_type* __lo, const char_type* __hi) const$/;" f class:std::__ctype_abstract_base access:public signature:(mask __m, const char_type* __lo, const char_type* __hi) const +scan_not cpp_src/locale_facets.h /^ scan_not(mask __m, const char* __lo, const char* __hi) const;$/;" p class:std::ctype access:public signature:(mask __m, const char* __lo, const char* __hi) const +scan_not cpp_src/locale_facets.h /^ scan_not(mask __m, const char_type* __lo, const char_type* __hi) const$/;" f class:std::__ctype_abstract_base access:public signature:(mask __m, const char_type* __lo, const char_type* __hi) const +scanf cpp_src/cstdio 86;" d file: +scientific cpp_src/ios_base.h /^ static const fmtflags scientific = _S_scientific;$/;" m class:std::ios_base access:public +scientific cpp_src/ios_base.h /^ scientific(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +search cpp_src/stl_algo.h /^ search(_ForwardIterator1 __first1, _ForwardIterator1 __last1,$/;" f namespace:std signature:(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2) +search cpp_src/stl_algo.h /^ search(_ForwardIterator1 __first1, _ForwardIterator1 __last1,$/;" f namespace:std signature:(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __predicate) +search_n cpp_src/stl_algo.h /^ search_n(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _Integer __count, const _Tp& __val) +search_n cpp_src/stl_algo.h /^ search_n(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _Integer __count, const _Tp& __val, _BinaryPredicate __binary_pred) +second cpp_src/stl_pair.h /^ _T2 second; \/\/\/< @c second is a copy of the second object$/;" m struct:std::pair access:public +second_argument_type cpp_src/stl_function.h /^ typedef _Arg2 second_argument_type; \/\/\/< the type of the second argument$/;" t struct:std::binary_function access:public +second_type cpp_src/stl_pair.h /^ typedef _T2 second_type; \/\/\/< @c second_type is the second bound type$/;" t struct:std::pair access:public +seek_dir cpp_src/ios_base.h /^ typedef int seek_dir;$/;" t class:std::ios_base access:public +seekdir cpp_src/ios_base.h /^ typedef _Ios_Seekdir seekdir;$/;" t class:std::ios_base access:public +seekg cpp_src/istream /^ seekg(off_type, ios_base::seekdir);$/;" p class:std::basic_istream file: access:public signature:(off_type, ios_base::seekdir) +seekg cpp_src/istream /^ seekg(pos_type);$/;" p class:std::basic_istream file: access:public signature:(pos_type) +seekg cpp_src/istream.tcc /^ seekg(off_type __off, ios_base::seekdir __dir)$/;" f class:std::basic_istream signature:(off_type __off, ios_base::seekdir __dir) +seekg cpp_src/istream.tcc /^ seekg(pos_type __pos)$/;" f class:std::basic_istream signature:(pos_type __pos) +seekoff cpp_src/fstream /^ seekoff(off_type __off, ios_base::seekdir __way,$/;" p class:std::basic_filebuf file: access:protected signature:(off_type __off, ios_base::seekdir __way, ios_base::openmode __mode = ios_base::in | ios_base::out) +seekoff cpp_src/fstream.tcc /^ seekoff(off_type __off, ios_base::seekdir __way, ios_base::openmode)$/;" f class:std::basic_filebuf signature:(off_type __off, ios_base::seekdir __way, ios_base::openmode) +seekoff cpp_src/sstream /^ seekoff(off_type __off, ios_base::seekdir __way,$/;" p class:std::basic_stringbuf file: access:protected signature:(off_type __off, ios_base::seekdir __way, ios_base::openmode __mode = ios_base::in | ios_base::out) +seekoff cpp_src/sstream.tcc /^ seekoff(off_type __off, ios_base::seekdir __way, ios_base::openmode __mode)$/;" f class:std::basic_stringbuf signature:(off_type __off, ios_base::seekdir __way, ios_base::openmode __mode) +seekoff cpp_src/streambuf /^ seekoff(off_type, ios_base::seekdir,$/;" f class:std::basic_streambuf access:protected signature:(off_type, ios_base::seekdir, ios_base::openmode = ios_base::in | ios_base::out) +seekp cpp_src/ostream /^ seekp(off_type, ios_base::seekdir);$/;" p class:std::basic_ostream file: access:public signature:(off_type, ios_base::seekdir) +seekp cpp_src/ostream /^ seekp(pos_type);$/;" p class:std::basic_ostream file: access:public signature:(pos_type) +seekp cpp_src/ostream.tcc /^ seekp(off_type __off, ios_base::seekdir __dir)$/;" f class:std::basic_ostream signature:(off_type __off, ios_base::seekdir __dir) +seekp cpp_src/ostream.tcc /^ seekp(pos_type __pos)$/;" f class:std::basic_ostream signature:(pos_type __pos) +seekpos cpp_src/fstream /^ seekpos(pos_type __pos,$/;" p class:std::basic_filebuf file: access:protected signature:(pos_type __pos, ios_base::openmode __mode = ios_base::in | ios_base::out) +seekpos cpp_src/fstream.tcc /^ seekpos(pos_type __pos, ios_base::openmode)$/;" f class:std::basic_filebuf signature:(pos_type __pos, ios_base::openmode) +seekpos cpp_src/sstream /^ seekpos(pos_type __sp,$/;" p class:std::basic_stringbuf file: access:protected signature:(pos_type __sp, ios_base::openmode __mode = ios_base::in | ios_base::out) +seekpos cpp_src/sstream.tcc /^ seekpos(pos_type __sp, ios_base::openmode __mode)$/;" f class:std::basic_stringbuf signature:(pos_type __sp, ios_base::openmode __mode) +seekpos cpp_src/streambuf /^ seekpos(pos_type, $/;" f class:std::basic_streambuf access:protected signature:(pos_type, ios_base::openmode = ios_base::in | ios_base::out) +sentry cpp_src/istream /^ sentry(basic_istream<_CharT, _Traits>& __is, bool __noskipws = false);$/;" p class:std::basic_istream::sentry file: access:public signature:(basic_istream<_CharT, _Traits>& __is, bool __noskipws = false) +sentry cpp_src/istream /^ class basic_istream<_CharT, _Traits>::sentry$/;" c class:std::basic_istream file: +sentry cpp_src/istream.tcc /^ sentry(basic_istream<_CharT, _Traits>& __in, bool __noskip) : _M_ok(false)$/;" f class:std::basic_istream::sentry signature:(basic_istream<_CharT, _Traits>& __in, bool __noskip) +sentry cpp_src/ostream /^ sentry(basic_ostream<_CharT, _Traits>& __os);$/;" p class:std::basic_ostream::sentry file: access:public signature:(basic_ostream<_CharT, _Traits>& __os) +sentry cpp_src/ostream /^ class basic_ostream<_CharT, _Traits>::sentry$/;" c class:std::basic_ostream file: +sentry cpp_src/ostream.tcc /^ sentry(basic_ostream<_CharT, _Traits>& __os)$/;" f class:std::basic_ostream::sentry signature:(basic_ostream<_CharT, _Traits>& __os) +set cpp_src/bitset /^ set()$/;" f class:std::bitset access:public signature:() +set cpp_src/bitset /^ set(size_t __position, bool __val = true)$/;" f class:std::bitset access:public signature:(size_t __position, bool __val = true) +set cpp_src/bitset /^ set(size_t, bool)$/;" f class:std::bitset signature:(size_t, bool) +set cpp_src/stl_set.h /^ set(_InputIterator __first, _InputIterator __last)$/;" f class:std::set access:public signature:(_InputIterator __first, _InputIterator __last) +set cpp_src/stl_set.h /^ set(_InputIterator __first, _InputIterator __last,$/;" f class:std::set access:public signature:(_InputIterator __first, _InputIterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) +set cpp_src/stl_set.h /^ set()$/;" f class:std::set access:public signature:() +set cpp_src/stl_set.h /^ set(const _Compare& __comp,$/;" f class:std::set access:public signature:(const _Compare& __comp, const allocator_type& __a = allocator_type()) +set cpp_src/stl_set.h /^ set(const set<_Key,_Compare,_Alloc>& __x)$/;" f class:std::set access:public signature:(const set<_Key,_Compare,_Alloc>& __x) +set cpp_src/stl_set.h /^ class set$/;" c namespace:std +set_difference cpp_src/stl_algo.h /^ set_difference(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) +set_difference cpp_src/stl_algo.h /^ set_difference(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) +set_intersection cpp_src/stl_algo.h /^ set_intersection(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) +set_intersection cpp_src/stl_algo.h /^ set_intersection(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) +set_new_handler cpp_src/new /^ new_handler set_new_handler(new_handler) throw();$/;" p namespace:std file: signature:(new_handler) +set_symmetric_difference cpp_src/stl_algo.h /^ set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) +set_symmetric_difference cpp_src/stl_algo.h /^ set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) +set_terminate cpp_src/exception /^ terminate_handler set_terminate(terminate_handler) throw();$/;" p namespace:std file: signature:(terminate_handler) +set_unexpected cpp_src/exception /^ unexpected_handler set_unexpected(unexpected_handler) throw();$/;" p namespace:std file: signature:(unexpected_handler) +set_union cpp_src/stl_algo.h /^ set_union(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) +set_union cpp_src/stl_algo.h /^ set_union(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) +setbase cpp_src/iomanip /^ setbase(int __base)$/;" f namespace:std signature:(int __base) +setbuf cpp_src/cstdio 87;" d file: +setbuf cpp_src/fstream /^ setbuf(char_type* __s, streamsize __n);$/;" p class:std::basic_filebuf file: access:protected signature:(char_type* __s, streamsize __n) +setbuf cpp_src/fstream.tcc /^ setbuf(char_type* __s, streamsize __n)$/;" f class:std::basic_filebuf signature:(char_type* __s, streamsize __n) +setbuf cpp_src/sstream /^ setbuf(char_type* __s, streamsize __n)$/;" f class:std::basic_stringbuf access:protected signature:(char_type* __s, streamsize __n) +setbuf cpp_src/streambuf /^ setbuf(char_type*, streamsize)$/;" f class:std::basic_streambuf access:protected signature:(char_type*, streamsize) +setf cpp_src/ios_base.h /^ setf(fmtflags __fmtfl)$/;" f class:std::ios_base access:public signature:(fmtflags __fmtfl) +setf cpp_src/ios_base.h /^ setf(fmtflags __fmtfl, fmtflags __mask)$/;" f class:std::ios_base access:public signature:(fmtflags __fmtfl, fmtflags __mask) +setfill cpp_src/iomanip /^ setfill(_CharT __c)$/;" f namespace:std signature:(_CharT __c) +setg cpp_src/streambuf /^ setg(char_type* __gbeg, char_type* __gnext, char_type* __gend)$/;" f class:std::basic_streambuf access:protected signature:(char_type* __gbeg, char_type* __gnext, char_type* __gend) +setiosflags cpp_src/iomanip /^ setiosflags(ios_base::fmtflags __mask)$/;" f namespace:std signature:(ios_base::fmtflags __mask) +setjmp cpp_src/csetjmp 58;" d file: +setlocale cpp_src/clocale 54;" d file: +setp cpp_src/streambuf /^ setp(char_type* __pbeg, char_type* __pend)$/;" f class:std::basic_streambuf access:protected signature:(char_type* __pbeg, char_type* __pend) +setprecision cpp_src/iomanip /^ setprecision(int __n)$/;" f namespace:std signature:(int __n) +setstate cpp_src/basic_ios.h /^ setstate(iostate __state)$/;" f class:std::basic_ios access:public signature:(iostate __state) +setvbuf cpp_src/cstdio 88;" d file: +setw cpp_src/iomanip /^ setw(int __n)$/;" f namespace:std signature:(int __n) +sgetc cpp_src/streambuf /^ sgetc()$/;" f class:std::basic_streambuf access:public signature:() +sgetn cpp_src/streambuf /^ sgetn(char_type* __s, streamsize __n)$/;" f class:std::basic_streambuf access:public signature:(char_type* __s, streamsize __n) +shift cpp_src/valarray /^ valarray<_Tp> shift (int) const;$/;" p class:std::valarray file: access:public signature:(int) const +shift cpp_src/valarray /^ valarray<_Tp>::shift(int __n) const$/;" f class:std::valarray signature:(int __n) const +shift cpp_src/valarray_after.h /^ valarray shift(int) const;$/;" p class:std::_Expr access:public signature:(int) const +shift cpp_src/valarray_after.h /^ _Expr<_Clos, _Tp>::shift(int __n) const$/;" f class:std::_Expr signature:(int __n) const +showbase cpp_src/ios_base.h /^ static const fmtflags showbase = _S_showbase;$/;" m class:std::ios_base access:public +showbase cpp_src/ios_base.h /^ showbase(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +showmanyc cpp_src/fstream /^ showmanyc();$/;" p class:std::basic_filebuf file: access:protected signature:() +showmanyc cpp_src/fstream.tcc /^ showmanyc()$/;" f class:std::basic_filebuf signature:() +showmanyc cpp_src/sstream /^ showmanyc()$/;" f class:std::basic_stringbuf access:protected signature:() +showmanyc cpp_src/streambuf /^ showmanyc() { return 0; }$/;" f class:std::basic_streambuf access:protected signature:() +showpoint cpp_src/ios_base.h /^ static const fmtflags showpoint = _S_showpoint;$/;" m class:std::ios_base access:public +showpoint cpp_src/ios_base.h /^ showpoint(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +showpos cpp_src/ios_base.h /^ static const fmtflags showpos = _S_showpos;$/;" m class:std::ios_base access:public +showpos cpp_src/ios_base.h /^ showpos(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +sign cpp_src/locale_facets.h /^ enum part { none, space, symbol, sign, value };$/;" e enum:std::money_base::part +signaling_NaN cpp_src/limits /^ static _Tp signaling_NaN() throw() { return static_cast<_Tp>(0); }$/;" f struct:std::numeric_limits access:public signature:() +signaling_NaN cpp_src/limits /^ static bool signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +signaling_NaN cpp_src/limits /^ static char signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +signaling_NaN cpp_src/limits /^ static double signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +signaling_NaN cpp_src/limits /^ static float signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +signaling_NaN cpp_src/limits /^ static int signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +signaling_NaN cpp_src/limits /^ static long double signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +signaling_NaN cpp_src/limits /^ static long long signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +signaling_NaN cpp_src/limits /^ static long signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +signaling_NaN cpp_src/limits /^ static short signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +signaling_NaN cpp_src/limits /^ static signed char signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +signaling_NaN cpp_src/limits /^ static unsigned char signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +signaling_NaN cpp_src/limits /^ static unsigned int signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +signaling_NaN cpp_src/limits /^ static unsigned long long signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +signaling_NaN cpp_src/limits /^ static unsigned long signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +signaling_NaN cpp_src/limits /^ static unsigned short signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +signaling_NaN cpp_src/limits /^ static wchar_t signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +sin cpp_src/cmath /^ sin(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +sin cpp_src/cmath /^ sin(float __x)$/;" f namespace:std signature:(float __x) +sin cpp_src/cmath /^ sin(long double __x)$/;" f namespace:std signature:(long double __x) +sin cpp_src/cmath 76;" d file: +sin cpp_src/complex /^ sin(const complex<_Tp>& __z) { return __complex_sin(__z); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +sin cpp_src/complex /^ sin(const complex<_Tp>& __z) { return __complex_sin(__z.__rep()); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +sin cpp_src/complex /^ template complex<_Tp> sin(const complex<_Tp>&);$/;" p namespace:std file: signature:(const complex<_Tp>&) +sinh cpp_src/cmath /^ sinh(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +sinh cpp_src/cmath /^ sinh(float __x)$/;" f namespace:std signature:(float __x) +sinh cpp_src/cmath /^ sinh(long double __x)$/;" f namespace:std signature:(long double __x) +sinh cpp_src/cmath 77;" d file: +sinh cpp_src/complex /^ sinh(const complex<_Tp>& __z) { return __complex_sinh(__z); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +sinh cpp_src/complex /^ sinh(const complex<_Tp>& __z) { return __complex_sinh(__z.__rep()); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +sinh cpp_src/complex /^ template complex<_Tp> sinh(const complex<_Tp>&);$/;" p namespace:std file: signature:(const complex<_Tp>&) +size cpp_src/basic_string.h /^ size() const$/;" f class:std::basic_string access:public signature:() const +size cpp_src/bitset /^ size() const$/;" f class:std::bitset access:public signature:() const +size cpp_src/gslice.h /^ valarray size() const;$/;" p class:std::gslice access:public signature:() const +size cpp_src/gslice.h /^ gslice::size () const$/;" f class:std::gslice signature:() const +size cpp_src/slice_array.h /^ size_t size() const;$/;" p class:std::slice access:public signature:() const +size cpp_src/slice_array.h /^ slice::size() const$/;" f class:std::slice signature:() const +size cpp_src/stl_bvector.h /^ size() const$/;" f class:std::vector access:public signature:() const +size cpp_src/stl_deque.h /^ size() const$/;" f class:std::deque access:public signature:() const +size cpp_src/stl_list.h /^ size() const$/;" f class:std::list access:public signature:() const +size cpp_src/stl_map.h /^ size() const$/;" f class:std::map access:public signature:() const +size cpp_src/stl_multimap.h /^ size() const$/;" f class:std::multimap access:public signature:() const +size cpp_src/stl_multiset.h /^ size() const$/;" f class:std::multiset access:public signature:() const +size cpp_src/stl_queue.h /^ size() const$/;" f class:std::priority_queue access:public signature:() const +size cpp_src/stl_queue.h /^ size() const$/;" f class:std::queue access:public signature:() const +size cpp_src/stl_set.h /^ size() const$/;" f class:std::set access:public signature:() const +size cpp_src/stl_stack.h /^ size() const$/;" f class:std::stack access:public signature:() const +size cpp_src/stl_tempbuf.h /^ size() const$/;" f class:std::_Temporary_buffer access:public signature:() const +size cpp_src/stl_tree.h /^ size() const$/;" f class:std::_Rb_tree access:public signature:() const +size cpp_src/stl_vector.h /^ size() const$/;" f class:std::vector access:public signature:() const +size cpp_src/valarray /^ size_t size() const;$/;" p class:std::valarray file: access:public signature:() const +size cpp_src/valarray /^ valarray<_Tp>::size() const$/;" f class:std::valarray signature:() const +size cpp_src/valarray_after.h /^ size () const$/;" f class:std::_GBase access:public signature:() const +size cpp_src/valarray_after.h /^ size() const$/;" f class:std::_IBase access:public signature:() const +size cpp_src/valarray_after.h /^ size_t size() const;$/;" p class:std::_Expr access:public signature:() const +size cpp_src/valarray_after.h /^ _Expr<_Clos, _Tp>::size() const$/;" f class:std::_Expr signature:() const +size cpp_src/valarray_before.h /^ size() const$/;" f class:std::_SBase access:public signature:() const +size cpp_src/valarray_before.h /^ size_t size() const { return _M_expr.size ();}$/;" f class:std::_FunBase access:public signature:() const +size cpp_src/valarray_before.h /^ size_t size() const { return _M_expr.size(); }$/;" f class:std::_UnBase access:public signature:() const +size cpp_src/valarray_before.h /^ size_t size() const { return _M_expr1.size(); }$/;" f class:std::_BinBase access:public signature:() const +size cpp_src/valarray_before.h /^ size_t size() const { return _M_expr1.size(); }$/;" f class:std::_BinBase2 access:public signature:() const +size cpp_src/valarray_before.h /^ size_t size() const { return _M_expr2.size(); }$/;" f class:std::_BinBase1 access:public signature:() const +size_type cpp_src/allocator.h /^ typedef size_t size_type;$/;" t class:std::allocator access:public +size_type cpp_src/allocator.h /^ typedef size_t size_type;$/;" t class:std::allocator access:public +size_type cpp_src/basic_string.h /^ typedef typename _CharT_alloc_type::size_type size_type;$/;" t class:std::basic_string access:public +size_type cpp_src/stl_bvector.h /^ typedef size_t size_type;$/;" t class:std::vector access:public +size_type cpp_src/stl_deque.h /^ typedef size_t size_type;$/;" t class:std::deque access:public +size_type cpp_src/stl_deque.h /^ typedef size_t size_type;$/;" t struct:std::_Deque_iterator access:public +size_type cpp_src/stl_list.h /^ typedef size_t size_type;$/;" t class:std::list access:public +size_type cpp_src/stl_map.h /^ typedef typename _Rep_type::size_type size_type;$/;" t class:std::map access:public +size_type cpp_src/stl_multimap.h /^ typedef typename _Rep_type::size_type size_type;$/;" t class:std::multimap access:public +size_type cpp_src/stl_multiset.h /^ typedef typename _Rep_type::size_type size_type;$/;" t class:std::multiset access:public +size_type cpp_src/stl_queue.h /^ typedef typename _Sequence::size_type size_type;$/;" t class:std::priority_queue access:public +size_type cpp_src/stl_queue.h /^ typedef typename _Sequence::size_type size_type;$/;" t class:std::queue access:public +size_type cpp_src/stl_set.h /^ typedef typename _Rep_type::size_type size_type;$/;" t class:std::set access:public +size_type cpp_src/stl_stack.h /^ typedef typename _Sequence::size_type size_type;$/;" t class:std::stack access:public +size_type cpp_src/stl_tempbuf.h /^ typedef ptrdiff_t size_type;$/;" t class:std::_Temporary_buffer access:public +size_type cpp_src/stl_tree.h /^ typedef size_t size_type;$/;" t class:std::_Rb_tree access:public +size_type cpp_src/stl_vector.h /^ typedef size_t size_type;$/;" t class:std::vector access:public +skipws cpp_src/ios_base.h /^ static const fmtflags skipws = _S_skipws;$/;" m class:std::ios_base access:public +skipws cpp_src/ios_base.h /^ skipws(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +slice cpp_src/slice_array.h /^ slice();$/;" p class:std::slice access:public signature:() +slice cpp_src/slice_array.h /^ slice(size_t, size_t, size_t);$/;" p class:std::slice access:public signature:(size_t, size_t, size_t) +slice cpp_src/slice_array.h /^ class slice$/;" c namespace:std +slice cpp_src/slice_array.h /^ slice::slice() {}$/;" f class:std::slice signature:() +slice cpp_src/slice_array.h /^ slice::slice(size_t __o, size_t __d, size_t __s)$/;" f class:std::slice signature:(size_t __o, size_t __d, size_t __s) +slice_array cpp_src/slice_array.h /^ slice_array();$/;" p class:std::slice_array access:private signature:() +slice_array cpp_src/slice_array.h /^ slice_array(_Array<_Tp>, const slice&);$/;" p class:std::slice_array access:private signature:(_Array<_Tp>, const slice&) +slice_array cpp_src/slice_array.h /^ slice_array(const slice_array&);$/;" p class:std::slice_array access:public signature:(const slice_array&) +slice_array cpp_src/slice_array.h /^ class slice_array$/;" c namespace:std +slice_array cpp_src/slice_array.h /^ slice_array<_Tp>::slice_array(_Array<_Tp> __a, const slice& __s)$/;" f class:std::slice_array signature:(_Array<_Tp> __a, const slice& __s) +slice_array cpp_src/slice_array.h /^ slice_array<_Tp>::slice_array(const slice_array<_Tp>& a)$/;" f class:std::slice_array signature:(const slice_array<_Tp>& a) +snextc cpp_src/streambuf /^ snextc()$/;" f class:std::basic_streambuf access:public signature:() +snprintf cpp_src/cstdio /^ (snprintf)(char * restrict, size_t, const char * restrict, ...);$/;" p file: signature:(char * restrict, size_t, const char * restrict, ...) +snprintf cpp_src/cstdio 149;" d file: +sort cpp_src/list.tcc /^ sort(_StrictWeakOrdering __comp)$/;" f class:std::list signature:(_StrictWeakOrdering __comp) +sort cpp_src/list.tcc /^ sort()$/;" f class:std::list signature:() +sort cpp_src/stl_algo.h /^ sort(_RandomAccessIterator __first, _RandomAccessIterator __last)$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last) +sort cpp_src/stl_algo.h /^ sort(_RandomAccessIterator __first, _RandomAccessIterator __last,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) +sort cpp_src/stl_list.h /^ sort(_StrictWeakOrdering);$/;" p class:std::list access:public signature:(_StrictWeakOrdering) +sort cpp_src/stl_list.h /^ sort();$/;" p class:std::list access:public signature:() +sort_heap cpp_src/stl_heap.h /^ sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last) +sort_heap cpp_src/stl_heap.h /^ sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) +space cpp_src/locale_facets.h /^ enum part { none, space, symbol, sign, value };$/;" e enum:std::money_base::part +splice cpp_src/stl_list.h /^ splice(iterator __position, list& __x)$/;" f class:std::list access:public signature:(iterator __position, list& __x) +splice cpp_src/stl_list.h /^ splice(iterator __position, list& __x, iterator __first, iterator __last)$/;" f class:std::list access:public signature:(iterator __position, list& __x, iterator __first, iterator __last) +splice cpp_src/stl_list.h /^ splice(iterator __position, list& __x, iterator __i)$/;" f class:std::list access:public signature:(iterator __position, list& __x, iterator __i) +sprintf cpp_src/cstdio 89;" d file: +sputbackc cpp_src/streambuf /^ sputbackc(char_type __c)$/;" f class:std::basic_streambuf access:public signature:(char_type __c) +sputc cpp_src/streambuf /^ sputc(char_type __c)$/;" f class:std::basic_streambuf access:public signature:(char_type __c) +sputn cpp_src/streambuf /^ sputn(const char_type* __s, streamsize __n)$/;" f class:std::basic_streambuf access:public signature:(const char_type* __s, streamsize __n) +sqrt cpp_src/cmath /^ sqrt(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +sqrt cpp_src/cmath /^ sqrt(float __x)$/;" f namespace:std signature:(float __x) +sqrt cpp_src/cmath /^ sqrt(long double __x)$/;" f namespace:std signature:(long double __x) +sqrt cpp_src/cmath 78;" d file: +sqrt cpp_src/complex /^ sqrt(const complex<_Tp>& __z) { return __complex_sqrt(__z); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +sqrt cpp_src/complex /^ sqrt(const complex<_Tp>& __z) { return __complex_sqrt(__z.__rep()); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +sqrt cpp_src/complex /^ template complex<_Tp> sqrt(const complex<_Tp>&);$/;" p namespace:std file: signature:(const complex<_Tp>&) +sscanf cpp_src/cstdio 90;" d file: +stable_partition cpp_src/stl_algo.h /^ stable_partition(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) +stable_sort cpp_src/stl_algo.h /^ stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last)$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last) +stable_sort cpp_src/stl_algo.h /^ stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) +stack cpp_src/stl_stack.h /^ stack(const _Sequence& __c = _Sequence())$/;" f class:std::stack access:public signature:(const _Sequence& __c = _Sequence()) +stack cpp_src/stl_stack.h /^ class stack$/;" c namespace:std +start cpp_src/gslice.h /^ size_t start() const;$/;" p class:std::gslice access:public signature:() const +start cpp_src/gslice.h /^ gslice::start () const$/;" f class:std::gslice signature:() const +start cpp_src/slice_array.h /^ size_t start() const;$/;" p class:std::slice access:public signature:() const +start cpp_src/slice_array.h /^ slice::start() const$/;" f class:std::slice signature:() const +state cpp_src/postypes.h /^ state() const$/;" f class:std::fpos access:public signature:() const +state cpp_src/postypes.h /^ state(_StateT __st)$/;" f class:std::fpos access:public signature:(_StateT __st) +state_type cpp_src/char_traits.h /^ typedef std::mbstate_t state_type;$/;" t struct:_Char_types access:public +state_type cpp_src/char_traits.h /^ typedef typename _Char_types<_CharT>::state_type state_type;$/;" t struct:char_traits access:public +state_type cpp_src/codecvt.h /^ typedef _StateT state_type;$/;" t class:std::__codecvt_abstract_base access:public +state_type cpp_src/codecvt.h /^ typedef _StateT state_type;$/;" t class:std::codecvt access:public +state_type cpp_src/codecvt.h /^ typedef mbstate_t state_type;$/;" t class:std::codecvt access:public +std cpp_src/allocator.h /^namespace std {$/;" n +std cpp_src/basic_ios.h /^namespace std {$/;" n +std cpp_src/basic_ios.tcc /^namespace std {$/;" n file: +std cpp_src/basic_string.h /^namespace std {$/;" n +std cpp_src/basic_string.tcc /^namespace std {$/;" n file: +std cpp_src/bitset /^namespace std {$/;" n file: +std cpp_src/cctype /^namespace std {$/;" n file: +std cpp_src/clocale /^namespace std {$/;" n file: +std cpp_src/cmath /^namespace std {$/;" n file: +std cpp_src/cmath.tcc /^namespace std {$/;" n file: +std cpp_src/codecvt.h /^namespace std {$/;" n +std cpp_src/complex /^namespace std {$/;" n file: +std cpp_src/csetjmp /^namespace std {$/;" n file: +std cpp_src/csignal /^namespace std {$/;" n file: +std cpp_src/cstdarg /^namespace std {$/;" n file: +std cpp_src/cstddef /^namespace std {$/;" n file: +std cpp_src/cstdio /^namespace std {$/;" n file: +std cpp_src/cstdlib /^namespace std {$/;" n file: +std cpp_src/cstring /^namespace std {$/;" n file: +std cpp_src/ctime /^namespace std {$/;" n file: +std cpp_src/cwchar /^namespace std {$/;" n file: +std cpp_src/cwctype /^namespace std {$/;" n file: +std cpp_src/deque.tcc /^namespace std {$/;" n file: +std cpp_src/exception /^namespace std $/;" n file: +std cpp_src/fstream /^namespace std {$/;" n file: +std cpp_src/fstream.tcc /^namespace std {$/;" n file: +std cpp_src/functexcept.h /^namespace std {$/;" n +std cpp_src/gslice.h /^namespace std {$/;" n +std cpp_src/gslice_array.h /^namespace std {$/;" n +std cpp_src/indirect_array.h /^namespace std {$/;" n +std cpp_src/iomanip /^namespace std {$/;" n file: +std cpp_src/ios_base.h /^namespace std {$/;" n +std cpp_src/iosfwd /^namespace std {$/;" n file: +std cpp_src/iostream /^namespace std {$/;" n file: +std cpp_src/istream /^namespace std {$/;" n file: +std cpp_src/istream.tcc /^namespace std {$/;" n file: +std cpp_src/limits /^namespace std {$/;" n file: +std cpp_src/list.tcc /^namespace std {$/;" n file: +std cpp_src/locale_classes.h /^namespace std {$/;" n +std cpp_src/locale_facets.h /^namespace std {$/;" n +std cpp_src/locale_facets.tcc /^namespace std {$/;" n file: +std cpp_src/localefwd.h /^namespace std {$/;" n +std cpp_src/mask_array.h /^namespace std {$/;" n +std cpp_src/memory /^namespace std {$/;" n file: +std cpp_src/new /^namespace std $/;" n file: +std cpp_src/ostream /^namespace std {$/;" n file: +std cpp_src/ostream.tcc /^namespace std {$/;" n file: +std cpp_src/ostream_insert.h /^namespace std {$/;" n +std cpp_src/postypes.h /^namespace std {$/;" n +std cpp_src/slice_array.h /^namespace std {$/;" n +std cpp_src/sstream /^namespace std {$/;" n file: +std cpp_src/sstream.tcc /^namespace std {$/;" n file: +std cpp_src/stdexcept /^namespace std {$/;" n file: +std cpp_src/stl_algo.h /^namespace std {$/;" n +std cpp_src/stl_algobase.h /^namespace std {$/;" n +std cpp_src/stl_bvector.h /^namespace std {$/;" n +std cpp_src/stl_construct.h /^namespace std {$/;" n +std cpp_src/stl_deque.h /^namespace std {$/;" n +std cpp_src/stl_function.h /^namespace std {$/;" n +std cpp_src/stl_heap.h /^namespace std {$/;" n +std cpp_src/stl_iterator.h /^namespace std {$/;" n +std cpp_src/stl_iterator_base_funcs.h /^namespace std {$/;" n +std cpp_src/stl_iterator_base_types.h /^namespace std {$/;" n +std cpp_src/stl_list.h /^namespace std {$/;" n +std cpp_src/stl_map.h /^namespace std {$/;" n +std cpp_src/stl_multimap.h /^namespace std {$/;" n +std cpp_src/stl_multiset.h /^namespace std {$/;" n +std cpp_src/stl_numeric.h /^namespace std {$/;" n +std cpp_src/stl_pair.h /^namespace std {$/;" n +std cpp_src/stl_queue.h /^namespace std {$/;" n +std cpp_src/stl_raw_storage_iter.h /^namespace std {$/;" n +std cpp_src/stl_relops.h /^namespace std {$/;" n +std cpp_src/stl_set.h /^namespace std {$/;" n +std cpp_src/stl_stack.h /^namespace std {$/;" n +std cpp_src/stl_tempbuf.h /^namespace std {$/;" n +std cpp_src/stl_tree.h /^namespace std {$/;" n +std cpp_src/stl_uninitialized.h /^namespace std {$/;" n +std cpp_src/stl_vector.h /^namespace std {$/;" n +std cpp_src/stream_iterator.h /^namespace std {$/;" n +std cpp_src/streambuf /^namespace std {$/;" n file: +std cpp_src/streambuf.tcc /^namespace std {$/;" n file: +std cpp_src/streambuf_iterator.h /^namespace std {$/;" n +std cpp_src/stringfwd.h /^namespace std {$/;" n +std cpp_src/typeinfo /^namespace std $/;" n file: +std cpp_src/valarray /^namespace std {$/;" n file: +std cpp_src/valarray_after.h /^namespace std {$/;" n +std cpp_src/valarray_array.h /^namespace std {$/;" n +std cpp_src/valarray_array.tcc /^namespace std {$/;" n file: +std cpp_src/valarray_before.h /^namespace std {$/;" n +std cpp_src/vector.tcc /^namespace std {$/;" n file: +std::_Array cpp_src/valarray_array.h /^ struct _Array$/;" s namespace:std +std::_Array::_Array cpp_src/valarray_array.h /^ _Array(const _Tp* __restrict__, size_t);$/;" p struct:std::_Array access:public signature:(const _Tp* __restrict__, size_t) +std::_Array::_Array cpp_src/valarray_array.h /^ explicit _Array(_Tp* const __restrict__);$/;" p struct:std::_Array access:public signature:(_Tp* const __restrict__) +std::_Array::_Array cpp_src/valarray_array.h /^ explicit _Array(const valarray<_Tp>&);$/;" p struct:std::_Array access:public signature:(const valarray<_Tp>&) +std::_Array::_Array cpp_src/valarray_array.h /^ explicit _Array(size_t);$/;" p struct:std::_Array access:public signature:(size_t) +std::_Array::_Array cpp_src/valarray_array.h /^ _Array<_Tp>::_Array(_Tp* const __restrict__ __p)$/;" f class:std::_Array signature:(_Tp* const __restrict__ __p) +std::_Array::_Array cpp_src/valarray_array.h /^ _Array<_Tp>::_Array(const _Tp* __restrict__ __b, size_t __s)$/;" f class:std::_Array signature:(const _Tp* __restrict__ __b, size_t __s) +std::_Array::_Array cpp_src/valarray_array.h /^ _Array<_Tp>::_Array(const valarray<_Tp>& __v)$/;" f class:std::_Array signature:(const valarray<_Tp>& __v) +std::_Array::_Array cpp_src/valarray_array.h /^ _Array<_Tp>::_Array(size_t __n)$/;" f class:std::_Array signature:(size_t __n) +std::_Array::_M_data cpp_src/valarray_array.h /^ _Tp* const __restrict__ _M_data;$/;" m struct:std::_Array access:public +std::_Array::begin cpp_src/valarray_array.h /^ _Tp* begin() const;$/;" p struct:std::_Array access:public signature:() const +std::_Array::begin cpp_src/valarray_array.h /^ _Array<_Tp>::begin () const$/;" f class:std::_Array signature:() const +std::_Array_copier cpp_src/valarray_array.h /^ struct _Array_copier$/;" s namespace:std +std::_Array_copier cpp_src/valarray_array.h /^ struct _Array_copier<_Tp, true>$/;" s namespace:std +std::_Array_copier::_S_do_it cpp_src/valarray_array.h /^ _S_do_it(const _Tp* __restrict__ __a, size_t __n, _Tp* __restrict__ __b)$/;" f struct:std::_Array_copier access:public signature:(const _Tp* __restrict__ __a, size_t __n, _Tp* __restrict__ __b) +std::_Array_copy_ctor cpp_src/valarray_array.h /^ struct _Array_copy_ctor$/;" s namespace:std +std::_Array_copy_ctor cpp_src/valarray_array.h /^ struct _Array_copy_ctor<_Tp, true>$/;" s namespace:std +std::_Array_copy_ctor::_S_do_it cpp_src/valarray_array.h /^ _S_do_it(const _Tp* __restrict__ __b, const _Tp* __restrict__ __e,$/;" f struct:std::_Array_copy_ctor access:public signature:(const _Tp* __restrict__ __b, const _Tp* __restrict__ __e, _Tp* __restrict__ __o) +std::_Array_default_ctor cpp_src/valarray_array.h /^ struct _Array_default_ctor$/;" s namespace:std +std::_Array_default_ctor cpp_src/valarray_array.h /^ struct _Array_default_ctor<_Tp, true>$/;" s namespace:std +std::_Array_default_ctor::_S_do_it cpp_src/valarray_array.h /^ _S_do_it(_Tp* __restrict__ __b, _Tp* __restrict__ __e)$/;" f struct:std::_Array_default_ctor access:public signature:(_Tp* __restrict__ __b, _Tp* __restrict__ __e) +std::_Array_init_ctor cpp_src/valarray_array.h /^ struct _Array_init_ctor$/;" s namespace:std +std::_Array_init_ctor cpp_src/valarray_array.h /^ struct _Array_init_ctor<_Tp, true>$/;" s namespace:std +std::_Array_init_ctor::_S_do_it cpp_src/valarray_array.h /^ _S_do_it(_Tp* __restrict__ __b, _Tp* __restrict__ __e, const _Tp __t)$/;" f struct:std::_Array_init_ctor access:public signature:(_Tp* __restrict__ __b, _Tp* __restrict__ __e, const _Tp __t) +std::_Array_init_ctor::_S_do_it cpp_src/valarray_array.h /^ _S_do_it(_Tp* __restrict__ __b, _Tp* __restrict__ __e, const _Tp __t)$/;" f struct:std::_Array_init_ctor access:public signature:(_Tp* __restrict__ __b, _Tp* __restrict__ __e, const _Tp __t) +std::_Base_bitset cpp_src/bitset /^ struct _Base_bitset$/;" s namespace:std file: +std::_Base_bitset cpp_src/bitset /^ struct _Base_bitset<0>$/;" s namespace:std file: +std::_Base_bitset cpp_src/bitset /^ struct _Base_bitset<1>$/;" s namespace:std file: +std::_Base_bitset::_Base_bitset cpp_src/bitset /^ _Base_bitset()$/;" f struct:std::_Base_bitset access:public signature:() +std::_Base_bitset::_Base_bitset cpp_src/bitset /^ _Base_bitset(unsigned long __val)$/;" f struct:std::_Base_bitset access:public signature:(unsigned long __val) +std::_Base_bitset::_Base_bitset cpp_src/bitset /^ _Base_bitset(unsigned long)$/;" f struct:std::_Base_bitset access:public signature:(unsigned long) +std::_Base_bitset::_Base_bitset cpp_src/bitset /^ _Base_bitset(void)$/;" f struct:std::_Base_bitset access:public signature:(void) +std::_Base_bitset::_M_do_and cpp_src/bitset /^ _M_do_and(const _Base_bitset<0>&)$/;" f struct:std::_Base_bitset access:public signature:(const _Base_bitset<0>&) +std::_Base_bitset::_M_do_and cpp_src/bitset /^ _M_do_and(const _Base_bitset<1>& __x)$/;" f struct:std::_Base_bitset access:public signature:(const _Base_bitset<1>& __x) +std::_Base_bitset::_M_do_and cpp_src/bitset /^ _M_do_and(const _Base_bitset<_Nw>& __x)$/;" f struct:std::_Base_bitset access:public signature:(const _Base_bitset<_Nw>& __x) +std::_Base_bitset::_M_do_count cpp_src/bitset /^ _M_do_count() const$/;" f struct:std::_Base_bitset access:public signature:() const +std::_Base_bitset::_M_do_find_first cpp_src/bitset /^ _M_do_find_first(size_t __not_found) const$/;" f struct:std::_Base_bitset access:public signature:(size_t __not_found) const +std::_Base_bitset::_M_do_find_first cpp_src/bitset /^ _M_do_find_first(size_t __not_found) const;$/;" p struct:std::_Base_bitset file: access:public signature:(size_t __not_found) const +std::_Base_bitset::_M_do_find_first cpp_src/bitset /^ _M_do_find_first(size_t) const$/;" f struct:std::_Base_bitset access:public signature:(size_t) const +std::_Base_bitset::_M_do_find_first cpp_src/bitset /^ _Base_bitset<_Nw>::_M_do_find_first(size_t __not_found) const$/;" f class:std::_Base_bitset signature:(size_t __not_found) const +std::_Base_bitset::_M_do_find_next cpp_src/bitset /^ _M_do_find_next(size_t __prev, size_t __not_found) const$/;" f struct:std::_Base_bitset access:public signature:(size_t __prev, size_t __not_found) const +std::_Base_bitset::_M_do_find_next cpp_src/bitset /^ _M_do_find_next(size_t __prev, size_t __not_found) const;$/;" p struct:std::_Base_bitset file: access:public signature:(size_t __prev, size_t __not_found) const +std::_Base_bitset::_M_do_find_next cpp_src/bitset /^ _M_do_find_next(size_t, size_t) const$/;" f struct:std::_Base_bitset access:public signature:(size_t, size_t) const +std::_Base_bitset::_M_do_find_next cpp_src/bitset /^ _Base_bitset<_Nw>::_M_do_find_next(size_t __prev, size_t __not_found) const$/;" f class:std::_Base_bitset signature:(size_t __prev, size_t __not_found) const +std::_Base_bitset::_M_do_flip cpp_src/bitset /^ _M_do_flip()$/;" f struct:std::_Base_bitset access:public signature:() +std::_Base_bitset::_M_do_left_shift cpp_src/bitset /^ _M_do_left_shift(size_t __shift)$/;" f struct:std::_Base_bitset access:public signature:(size_t __shift) +std::_Base_bitset::_M_do_left_shift cpp_src/bitset /^ _M_do_left_shift(size_t __shift);$/;" p struct:std::_Base_bitset file: access:public signature:(size_t __shift) +std::_Base_bitset::_M_do_left_shift cpp_src/bitset /^ _M_do_left_shift(size_t)$/;" f struct:std::_Base_bitset access:public signature:(size_t) +std::_Base_bitset::_M_do_left_shift cpp_src/bitset /^ _Base_bitset<_Nw>::_M_do_left_shift(size_t __shift)$/;" f class:std::_Base_bitset signature:(size_t __shift) +std::_Base_bitset::_M_do_or cpp_src/bitset /^ _M_do_or(const _Base_bitset<0>&)$/;" f struct:std::_Base_bitset access:public signature:(const _Base_bitset<0>&) +std::_Base_bitset::_M_do_or cpp_src/bitset /^ _M_do_or(const _Base_bitset<1>& __x)$/;" f struct:std::_Base_bitset access:public signature:(const _Base_bitset<1>& __x) +std::_Base_bitset::_M_do_or cpp_src/bitset /^ _M_do_or(const _Base_bitset<_Nw>& __x)$/;" f struct:std::_Base_bitset access:public signature:(const _Base_bitset<_Nw>& __x) +std::_Base_bitset::_M_do_reset cpp_src/bitset /^ _M_do_reset()$/;" f struct:std::_Base_bitset access:public signature:() +std::_Base_bitset::_M_do_right_shift cpp_src/bitset /^ _M_do_right_shift(size_t __shift)$/;" f struct:std::_Base_bitset access:public signature:(size_t __shift) +std::_Base_bitset::_M_do_right_shift cpp_src/bitset /^ _M_do_right_shift(size_t __shift);$/;" p struct:std::_Base_bitset file: access:public signature:(size_t __shift) +std::_Base_bitset::_M_do_right_shift cpp_src/bitset /^ _M_do_right_shift(size_t)$/;" f struct:std::_Base_bitset access:public signature:(size_t) +std::_Base_bitset::_M_do_right_shift cpp_src/bitset /^ _Base_bitset<_Nw>::_M_do_right_shift(size_t __shift)$/;" f class:std::_Base_bitset signature:(size_t __shift) +std::_Base_bitset::_M_do_set cpp_src/bitset /^ _M_do_set()$/;" f struct:std::_Base_bitset access:public signature:() +std::_Base_bitset::_M_do_to_ulong cpp_src/bitset /^ _M_do_to_ulong() const$/;" f struct:std::_Base_bitset access:public signature:() const +std::_Base_bitset::_M_do_to_ulong cpp_src/bitset /^ _M_do_to_ulong() const;$/;" p struct:std::_Base_bitset file: access:public signature:() const +std::_Base_bitset::_M_do_to_ulong cpp_src/bitset /^ _Base_bitset<_Nw>::_M_do_to_ulong() const$/;" f class:std::_Base_bitset signature:() const +std::_Base_bitset::_M_do_xor cpp_src/bitset /^ _M_do_xor(const _Base_bitset<0>&)$/;" f struct:std::_Base_bitset access:public signature:(const _Base_bitset<0>&) +std::_Base_bitset::_M_do_xor cpp_src/bitset /^ _M_do_xor(const _Base_bitset<1>& __x)$/;" f struct:std::_Base_bitset access:public signature:(const _Base_bitset<1>& __x) +std::_Base_bitset::_M_do_xor cpp_src/bitset /^ _M_do_xor(const _Base_bitset<_Nw>& __x)$/;" f struct:std::_Base_bitset access:public signature:(const _Base_bitset<_Nw>& __x) +std::_Base_bitset::_M_getword cpp_src/bitset /^ _M_getword(size_t __pos) const$/;" f struct:std::_Base_bitset access:public signature:(size_t __pos) const +std::_Base_bitset::_M_getword cpp_src/bitset /^ _M_getword(size_t __pos)$/;" f struct:std::_Base_bitset access:public signature:(size_t __pos) +std::_Base_bitset::_M_getword cpp_src/bitset /^ _M_getword(size_t) const$/;" f struct:std::_Base_bitset access:public signature:(size_t) const +std::_Base_bitset::_M_getword cpp_src/bitset /^ _M_getword(size_t)$/;" f struct:std::_Base_bitset access:public signature:(size_t) +std::_Base_bitset::_M_hiword cpp_src/bitset /^ _M_hiword() const$/;" f struct:std::_Base_bitset access:public signature:() const +std::_Base_bitset::_M_hiword cpp_src/bitset /^ _M_hiword()$/;" f struct:std::_Base_bitset access:public signature:() +std::_Base_bitset::_M_is_any cpp_src/bitset /^ _M_is_any() const$/;" f struct:std::_Base_bitset access:public signature:() const +std::_Base_bitset::_M_is_equal cpp_src/bitset /^ _M_is_equal(const _Base_bitset<0>&) const$/;" f struct:std::_Base_bitset access:public signature:(const _Base_bitset<0>&) const +std::_Base_bitset::_M_is_equal cpp_src/bitset /^ _M_is_equal(const _Base_bitset<1>& __x) const$/;" f struct:std::_Base_bitset access:public signature:(const _Base_bitset<1>& __x) const +std::_Base_bitset::_M_is_equal cpp_src/bitset /^ _M_is_equal(const _Base_bitset<_Nw>& __x) const$/;" f struct:std::_Base_bitset access:public signature:(const _Base_bitset<_Nw>& __x) const +std::_Base_bitset::_M_w cpp_src/bitset /^ _WordT _M_w[_Nw];$/;" m struct:std::_Base_bitset file: access:public +std::_Base_bitset::_M_w cpp_src/bitset /^ _WordT _M_w;$/;" m struct:std::_Base_bitset file: access:public +std::_Base_bitset::_S_maskbit cpp_src/bitset /^ _S_maskbit(size_t __pos )$/;" f struct:std::_Base_bitset access:public signature:(size_t __pos ) +std::_Base_bitset::_S_whichbit cpp_src/bitset /^ _S_whichbit(size_t __pos )$/;" f struct:std::_Base_bitset access:public signature:(size_t __pos ) +std::_Base_bitset::_S_whichbyte cpp_src/bitset /^ _S_whichbyte(size_t __pos )$/;" f struct:std::_Base_bitset access:public signature:(size_t __pos ) +std::_Base_bitset::_S_whichword cpp_src/bitset /^ _S_whichword(size_t __pos )$/;" f struct:std::_Base_bitset access:public signature:(size_t __pos ) +std::_Base_bitset::_WordT cpp_src/bitset /^ typedef unsigned long _WordT;$/;" t struct:std::_Base_bitset file: access:public +std::_BinBase cpp_src/valarray_before.h /^ class _BinBase$/;" c namespace:std +std::_BinBase1 cpp_src/valarray_before.h /^ class _BinBase1$/;" c namespace:std +std::_BinBase1::_BinBase1 cpp_src/valarray_before.h /^ _BinBase1(const _Vt& __t, const _Clos& __e)$/;" f class:std::_BinBase1 access:public signature:(const _Vt& __t, const _Clos& __e) +std::_BinBase1::_M_expr1 cpp_src/valarray_before.h /^ const _Vt& _M_expr1;$/;" m class:std::_BinBase1 access:private +std::_BinBase1::_M_expr2 cpp_src/valarray_before.h /^ const _Clos& _M_expr2;$/;" m class:std::_BinBase1 access:private +std::_BinBase1::_Vt cpp_src/valarray_before.h /^ typedef typename _Clos::value_type _Vt;$/;" t class:std::_BinBase1 access:public +std::_BinBase1::operator [] cpp_src/valarray_before.h /^ value_type operator[](size_t __i) const$/;" f class:std::_BinBase1 access:public signature:(size_t __i) const +std::_BinBase1::size cpp_src/valarray_before.h /^ size_t size() const { return _M_expr2.size(); }$/;" f class:std::_BinBase1 access:public signature:() const +std::_BinBase1::value_type cpp_src/valarray_before.h /^ typedef typename __fun<_Oper, _Vt>::result_type value_type;$/;" t class:std::_BinBase1 access:public +std::_BinBase2 cpp_src/valarray_before.h /^ class _BinBase2$/;" c namespace:std +std::_BinBase2::_BinBase2 cpp_src/valarray_before.h /^ _BinBase2(const _Clos& __e, const _Vt& __t)$/;" f class:std::_BinBase2 access:public signature:(const _Clos& __e, const _Vt& __t) +std::_BinBase2::_M_expr1 cpp_src/valarray_before.h /^ const _Clos& _M_expr1;$/;" m class:std::_BinBase2 access:private +std::_BinBase2::_M_expr2 cpp_src/valarray_before.h /^ const _Vt& _M_expr2;$/;" m class:std::_BinBase2 access:private +std::_BinBase2::_Vt cpp_src/valarray_before.h /^ typedef typename _Clos::value_type _Vt;$/;" t class:std::_BinBase2 access:public +std::_BinBase2::operator [] cpp_src/valarray_before.h /^ value_type operator[](size_t __i) const$/;" f class:std::_BinBase2 access:public signature:(size_t __i) const +std::_BinBase2::size cpp_src/valarray_before.h /^ size_t size() const { return _M_expr1.size(); }$/;" f class:std::_BinBase2 access:public signature:() const +std::_BinBase2::value_type cpp_src/valarray_before.h /^ typedef typename __fun<_Oper, _Vt>::result_type value_type;$/;" t class:std::_BinBase2 access:public +std::_BinBase::_BinBase cpp_src/valarray_before.h /^ _BinBase(const _FirstArg& __e1, const _SecondArg& __e2)$/;" f class:std::_BinBase access:public signature:(const _FirstArg& __e1, const _SecondArg& __e2) +std::_BinBase::_M_expr1 cpp_src/valarray_before.h /^ const _FirstArg& _M_expr1;$/;" m class:std::_BinBase access:private +std::_BinBase::_M_expr2 cpp_src/valarray_before.h /^ const _SecondArg& _M_expr2;$/;" m class:std::_BinBase access:private +std::_BinBase::_Vt cpp_src/valarray_before.h /^ typedef typename _FirstArg::value_type _Vt;$/;" t class:std::_BinBase access:public +std::_BinBase::operator [] cpp_src/valarray_before.h /^ value_type operator[](size_t __i) const$/;" f class:std::_BinBase access:public signature:(size_t __i) const +std::_BinBase::size cpp_src/valarray_before.h /^ size_t size() const { return _M_expr1.size(); }$/;" f class:std::_BinBase access:public signature:() const +std::_BinBase::value_type cpp_src/valarray_before.h /^ typedef typename __fun<_Oper, _Vt>::result_type value_type;$/;" t class:std::_BinBase access:public +std::_BinClos cpp_src/valarray_before.h /^ struct _BinClos<_Oper, _Constant, _Expr, typename _Dom::value_type, _Dom>$/;" s namespace:std inherits:_BinBase1 +std::_BinClos cpp_src/valarray_before.h /^ struct _BinClos<_Oper, _Constant, _ValArray, _Tp, _Tp>$/;" s namespace:std inherits:_BinBase1 +std::_BinClos cpp_src/valarray_before.h /^ struct _BinClos<_Oper, _Expr, _Constant, _Dom, typename _Dom::value_type>$/;" s namespace:std inherits:_BinBase2 +std::_BinClos cpp_src/valarray_before.h /^ struct _BinClos<_Oper, _Expr, _Expr, _Dom1, _Dom2>$/;" s namespace:std inherits:_BinBase +std::_BinClos cpp_src/valarray_before.h /^ struct _BinClos<_Oper, _Expr, _ValArray, _Dom, typename _Dom::value_type>$/;" s namespace:std inherits:_BinBase +std::_BinClos cpp_src/valarray_before.h /^ struct _BinClos<_Oper, _ValArray, _Constant, _Tp, _Tp>$/;" s namespace:std inherits:_BinBase2 +std::_BinClos cpp_src/valarray_before.h /^ struct _BinClos<_Oper, _ValArray, _Expr, typename _Dom::value_type, _Dom>$/;" s namespace:std inherits:_BinBase +std::_BinClos cpp_src/valarray_before.h /^ struct _BinClos<_Oper,_ValArray, _ValArray, _Tp, _Tp>$/;" s namespace:std inherits:_BinBase +std::_BinClos::_Base cpp_src/valarray_before.h /^ typedef _BinBase1<_Oper, _Dom> _Base;$/;" t struct:std::_BinClos access:public +std::_BinClos::_Base cpp_src/valarray_before.h /^ typedef _BinBase1<_Oper, valarray<_Tp> > _Base;$/;" t struct:std::_BinClos access:public +std::_BinClos::_Base cpp_src/valarray_before.h /^ typedef _BinBase2<_Oper,_Dom> _Base;$/;" t struct:std::_BinClos access:public +std::_BinClos::_Base cpp_src/valarray_before.h /^ typedef _BinBase2<_Oper,valarray<_Tp> > _Base;$/;" t struct:std::_BinClos access:public +std::_BinClos::_Base cpp_src/valarray_before.h /^ typedef _BinBase<_Oper, _Dom1, _Dom2> _Base;$/;" t struct:std::_BinClos access:public +std::_BinClos::_Base cpp_src/valarray_before.h /^ typedef _BinBase<_Oper, valarray<_Tp>, _Dom> _Base;$/;" t struct:std::_BinClos access:public +std::_BinClos::_Base cpp_src/valarray_before.h /^ typedef _BinBase<_Oper, valarray<_Tp>, valarray<_Tp> > _Base;$/;" t struct:std::_BinClos access:public +std::_BinClos::_Base cpp_src/valarray_before.h /^ typedef _BinBase<_Oper,_Dom,valarray<_Tp> > _Base;$/;" t struct:std::_BinClos access:public +std::_BinClos::_BinClos cpp_src/valarray_before.h /^ _BinClos(const _Dom& __e1, const _Tp& __e2) : _Base(__e1, __e2) {}$/;" f struct:std::_BinClos access:public signature:(const _Dom& __e1, const _Tp& __e2) +std::_BinClos::_BinClos cpp_src/valarray_before.h /^ _BinClos(const _Dom& __e1, const valarray<_Tp>& __e2)$/;" f struct:std::_BinClos access:public signature:(const _Dom& __e1, const valarray<_Tp>& __e2) +std::_BinClos::_BinClos cpp_src/valarray_before.h /^ _BinClos(const _Dom1& __e1, const _Dom2& __e2) : _Base(__e1, __e2) {}$/;" f struct:std::_BinClos access:public signature:(const _Dom1& __e1, const _Dom2& __e2) +std::_BinClos::_BinClos cpp_src/valarray_before.h /^ _BinClos(const _Tp& __e1, const _Dom& __e2) : _Base(__e1, __e2) {}$/;" f struct:std::_BinClos access:public signature:(const _Tp& __e1, const _Dom& __e2) +std::_BinClos::_BinClos cpp_src/valarray_before.h /^ _BinClos(const _Tp& __t, const valarray<_Tp>& __v) : _Base(__t, __v) {}$/;" f struct:std::_BinClos access:public signature:(const _Tp& __t, const valarray<_Tp>& __v) +std::_BinClos::_BinClos cpp_src/valarray_before.h /^ _BinClos(const valarray<_Tp>& __e1, const _Dom& __e2)$/;" f struct:std::_BinClos access:public signature:(const valarray<_Tp>& __e1, const _Dom& __e2) +std::_BinClos::_BinClos cpp_src/valarray_before.h /^ _BinClos(const valarray<_Tp>& __v, const _Tp& __t) : _Base(__v, __t) {}$/;" f struct:std::_BinClos access:public signature:(const valarray<_Tp>& __v, const _Tp& __t) +std::_BinClos::_BinClos cpp_src/valarray_before.h /^ _BinClos(const valarray<_Tp>& __v, const valarray<_Tp>& __w)$/;" f struct:std::_BinClos access:public signature:(const valarray<_Tp>& __v, const valarray<_Tp>& __w) +std::_BinClos::_Tp cpp_src/valarray_before.h /^ typedef typename _Dom::value_type _Tp;$/;" t struct:std::_BinClos access:public +std::_BinClos::value_type cpp_src/valarray_before.h /^ typedef typename _Base::value_type value_type;$/;" t struct:std::_BinClos access:public +std::_Bit_const_iterator cpp_src/stl_bvector.h /^ struct _Bit_const_iterator : public _Bit_iterator_base$/;" s namespace:std inherits:_Bit_iterator_base +std::_Bit_const_iterator::_Bit_const_iterator cpp_src/stl_bvector.h /^ _Bit_const_iterator() : _Bit_iterator_base(0, 0) { }$/;" f struct:std::_Bit_const_iterator access:public signature:() +std::_Bit_const_iterator::_Bit_const_iterator cpp_src/stl_bvector.h /^ _Bit_const_iterator(_Bit_type * __x, unsigned int __y)$/;" f struct:std::_Bit_const_iterator access:public signature:(_Bit_type * __x, unsigned int __y) +std::_Bit_const_iterator::_Bit_const_iterator cpp_src/stl_bvector.h /^ _Bit_const_iterator(const _Bit_iterator& __x)$/;" f struct:std::_Bit_const_iterator access:public signature:(const _Bit_iterator& __x) +std::_Bit_const_iterator::const_iterator cpp_src/stl_bvector.h /^ typedef _Bit_const_iterator const_iterator;$/;" t struct:std::_Bit_const_iterator access:public +std::_Bit_const_iterator::const_reference cpp_src/stl_bvector.h /^ typedef bool const_reference;$/;" t struct:std::_Bit_const_iterator access:public +std::_Bit_const_iterator::operator * cpp_src/stl_bvector.h /^ operator*() const$/;" f struct:std::_Bit_const_iterator access:public signature:() const +std::_Bit_const_iterator::operator + cpp_src/stl_bvector.h /^ operator+(difference_type __i) const$/;" f struct:std::_Bit_const_iterator access:public signature:(difference_type __i) const +std::_Bit_const_iterator::operator ++ cpp_src/stl_bvector.h /^ operator++()$/;" f struct:std::_Bit_const_iterator access:public signature:() +std::_Bit_const_iterator::operator ++ cpp_src/stl_bvector.h /^ operator++(int)$/;" f struct:std::_Bit_const_iterator access:public signature:(int) +std::_Bit_const_iterator::operator += cpp_src/stl_bvector.h /^ operator+=(difference_type __i)$/;" f struct:std::_Bit_const_iterator access:public signature:(difference_type __i) +std::_Bit_const_iterator::operator - cpp_src/stl_bvector.h /^ operator-(difference_type __i) const$/;" f struct:std::_Bit_const_iterator access:public signature:(difference_type __i) const +std::_Bit_const_iterator::operator -- cpp_src/stl_bvector.h /^ operator--()$/;" f struct:std::_Bit_const_iterator access:public signature:() +std::_Bit_const_iterator::operator -- cpp_src/stl_bvector.h /^ operator--(int)$/;" f struct:std::_Bit_const_iterator access:public signature:(int) +std::_Bit_const_iterator::operator -= cpp_src/stl_bvector.h /^ operator-=(difference_type __i)$/;" f struct:std::_Bit_const_iterator access:public signature:(difference_type __i) +std::_Bit_const_iterator::operator [] cpp_src/stl_bvector.h /^ operator[](difference_type __i) const$/;" f struct:std::_Bit_const_iterator access:public signature:(difference_type __i) const +std::_Bit_const_iterator::pointer cpp_src/stl_bvector.h /^ typedef const bool* pointer;$/;" t struct:std::_Bit_const_iterator access:public +std::_Bit_const_iterator::reference cpp_src/stl_bvector.h /^ typedef bool reference;$/;" t struct:std::_Bit_const_iterator access:public +std::_Bit_iterator cpp_src/stl_bvector.h /^ struct _Bit_iterator : public _Bit_iterator_base$/;" s namespace:std inherits:_Bit_iterator_base +std::_Bit_iterator::_Bit_iterator cpp_src/stl_bvector.h /^ _Bit_iterator() : _Bit_iterator_base(0, 0) { }$/;" f struct:std::_Bit_iterator access:public signature:() +std::_Bit_iterator::_Bit_iterator cpp_src/stl_bvector.h /^ _Bit_iterator(_Bit_type * __x, unsigned int __y)$/;" f struct:std::_Bit_iterator access:public signature:(_Bit_type * __x, unsigned int __y) +std::_Bit_iterator::iterator cpp_src/stl_bvector.h /^ typedef _Bit_iterator iterator;$/;" t struct:std::_Bit_iterator access:public +std::_Bit_iterator::operator * cpp_src/stl_bvector.h /^ operator*() const$/;" f struct:std::_Bit_iterator access:public signature:() const +std::_Bit_iterator::operator + cpp_src/stl_bvector.h /^ operator+(difference_type __i) const$/;" f struct:std::_Bit_iterator access:public signature:(difference_type __i) const +std::_Bit_iterator::operator ++ cpp_src/stl_bvector.h /^ operator++()$/;" f struct:std::_Bit_iterator access:public signature:() +std::_Bit_iterator::operator ++ cpp_src/stl_bvector.h /^ operator++(int)$/;" f struct:std::_Bit_iterator access:public signature:(int) +std::_Bit_iterator::operator += cpp_src/stl_bvector.h /^ operator+=(difference_type __i)$/;" f struct:std::_Bit_iterator access:public signature:(difference_type __i) +std::_Bit_iterator::operator - cpp_src/stl_bvector.h /^ operator-(difference_type __i) const$/;" f struct:std::_Bit_iterator access:public signature:(difference_type __i) const +std::_Bit_iterator::operator -- cpp_src/stl_bvector.h /^ operator--()$/;" f struct:std::_Bit_iterator access:public signature:() +std::_Bit_iterator::operator -- cpp_src/stl_bvector.h /^ operator--(int)$/;" f struct:std::_Bit_iterator access:public signature:(int) +std::_Bit_iterator::operator -= cpp_src/stl_bvector.h /^ operator-=(difference_type __i)$/;" f struct:std::_Bit_iterator access:public signature:(difference_type __i) +std::_Bit_iterator::operator [] cpp_src/stl_bvector.h /^ operator[](difference_type __i) const$/;" f struct:std::_Bit_iterator access:public signature:(difference_type __i) const +std::_Bit_iterator::pointer cpp_src/stl_bvector.h /^ typedef _Bit_reference* pointer;$/;" t struct:std::_Bit_iterator access:public +std::_Bit_iterator::reference cpp_src/stl_bvector.h /^ typedef _Bit_reference reference;$/;" t struct:std::_Bit_iterator access:public +std::_Bit_iterator_base cpp_src/stl_bvector.h /^ struct _Bit_iterator_base$/;" s namespace:std inherits:std::iterator +std::_Bit_iterator_base::_Bit_iterator_base cpp_src/stl_bvector.h /^ _Bit_iterator_base(_Bit_type * __x, unsigned int __y)$/;" f struct:std::_Bit_iterator_base access:public signature:(_Bit_type * __x, unsigned int __y) +std::_Bit_iterator_base::_M_bump_down cpp_src/stl_bvector.h /^ _M_bump_down()$/;" f struct:std::_Bit_iterator_base access:public signature:() +std::_Bit_iterator_base::_M_bump_up cpp_src/stl_bvector.h /^ _M_bump_up()$/;" f struct:std::_Bit_iterator_base access:public signature:() +std::_Bit_iterator_base::_M_incr cpp_src/stl_bvector.h /^ _M_incr(ptrdiff_t __i)$/;" f struct:std::_Bit_iterator_base access:public signature:(ptrdiff_t __i) +std::_Bit_iterator_base::_M_offset cpp_src/stl_bvector.h /^ unsigned int _M_offset;$/;" m struct:std::_Bit_iterator_base access:public +std::_Bit_iterator_base::_M_p cpp_src/stl_bvector.h /^ _Bit_type * _M_p;$/;" m struct:std::_Bit_iterator_base access:public +std::_Bit_iterator_base::operator != cpp_src/stl_bvector.h /^ operator!=(const _Bit_iterator_base& __i) const$/;" f struct:std::_Bit_iterator_base access:public signature:(const _Bit_iterator_base& __i) const +std::_Bit_iterator_base::operator < cpp_src/stl_bvector.h /^ operator<(const _Bit_iterator_base& __i) const$/;" f struct:std::_Bit_iterator_base access:public signature:(const _Bit_iterator_base& __i) const +std::_Bit_iterator_base::operator <= cpp_src/stl_bvector.h /^ operator<=(const _Bit_iterator_base& __i) const$/;" f struct:std::_Bit_iterator_base access:public signature:(const _Bit_iterator_base& __i) const +std::_Bit_iterator_base::operator == cpp_src/stl_bvector.h /^ operator==(const _Bit_iterator_base& __i) const$/;" f struct:std::_Bit_iterator_base access:public signature:(const _Bit_iterator_base& __i) const +std::_Bit_iterator_base::operator > cpp_src/stl_bvector.h /^ operator>(const _Bit_iterator_base& __i) const$/;" f struct:std::_Bit_iterator_base access:public signature:(const _Bit_iterator_base& __i) const +std::_Bit_iterator_base::operator >= cpp_src/stl_bvector.h /^ operator>=(const _Bit_iterator_base& __i) const$/;" f struct:std::_Bit_iterator_base access:public signature:(const _Bit_iterator_base& __i) const +std::_Bit_reference cpp_src/stl_bvector.h /^ struct _Bit_reference$/;" s namespace:std +std::_Bit_reference::_Bit_reference cpp_src/stl_bvector.h /^ _Bit_reference() : _M_p(0), _M_mask(0) { }$/;" f struct:std::_Bit_reference access:public signature:() +std::_Bit_reference::_Bit_reference cpp_src/stl_bvector.h /^ _Bit_reference(_Bit_type * __x, _Bit_type __y)$/;" f struct:std::_Bit_reference access:public signature:(_Bit_type * __x, _Bit_type __y) +std::_Bit_reference::_M_mask cpp_src/stl_bvector.h /^ _Bit_type _M_mask;$/;" m struct:std::_Bit_reference access:public +std::_Bit_reference::_M_p cpp_src/stl_bvector.h /^ _Bit_type * _M_p;$/;" m struct:std::_Bit_reference access:public +std::_Bit_reference::flip cpp_src/stl_bvector.h /^ flip()$/;" f struct:std::_Bit_reference access:public signature:() +std::_Bit_reference::operator < cpp_src/stl_bvector.h /^ operator<(const _Bit_reference& __x) const$/;" f struct:std::_Bit_reference access:public signature:(const _Bit_reference& __x) const +std::_Bit_reference::operator = cpp_src/stl_bvector.h /^ operator=(bool __x)$/;" f struct:std::_Bit_reference access:public signature:(bool __x) +std::_Bit_reference::operator = cpp_src/stl_bvector.h /^ operator=(const _Bit_reference& __x)$/;" f struct:std::_Bit_reference access:public signature:(const _Bit_reference& __x) +std::_Bit_reference::operator == cpp_src/stl_bvector.h /^ operator==(const _Bit_reference& __x) const$/;" f struct:std::_Bit_reference access:public signature:(const _Bit_reference& __x) const +std::_Bit_reference::operator bool cpp_src/stl_bvector.h /^ operator bool() const$/;" f struct:std::_Bit_reference access:public signature:() const +std::_Bit_type cpp_src/stl_bvector.h /^ typedef unsigned long _Bit_type;$/;" t namespace:std +std::_Bvector_base cpp_src/stl_bvector.h /^ struct _Bvector_base$/;" s namespace:std +std::_Bvector_base::_Bit_alloc_type cpp_src/stl_bvector.h /^ _Bit_alloc_type;$/;" t struct:std::_Bvector_base access:public +std::_Bvector_base::_Bvector_base cpp_src/stl_bvector.h /^ _Bvector_base(const allocator_type& __a) : _M_impl(__a) { }$/;" f struct:std::_Bvector_base access:public signature:(const allocator_type& __a) +std::_Bvector_base::_Bvector_impl cpp_src/stl_bvector.h /^ struct _Bvector_impl$/;" s struct:std::_Bvector_base inherits:_Bit_alloc_type access:public +std::_Bvector_base::_Bvector_impl::_Bvector_impl cpp_src/stl_bvector.h /^ _Bvector_impl(const _Bit_alloc_type& __a)$/;" f struct:std::_Bvector_base::_Bvector_impl access:public signature:(const _Bit_alloc_type& __a) +std::_Bvector_base::_Bvector_impl::_M_end_of_storage cpp_src/stl_bvector.h /^ _Bit_type* _M_end_of_storage;$/;" m struct:std::_Bvector_base::_Bvector_impl access:public +std::_Bvector_base::_Bvector_impl::_M_finish cpp_src/stl_bvector.h /^ _Bit_iterator _M_finish;$/;" m struct:std::_Bvector_base::_Bvector_impl access:public +std::_Bvector_base::_Bvector_impl::_M_start cpp_src/stl_bvector.h /^ _Bit_iterator _M_start;$/;" m struct:std::_Bvector_base::_Bvector_impl access:public +std::_Bvector_base::_M_allocate cpp_src/stl_bvector.h /^ _M_allocate(size_t __n)$/;" f struct:std::_Bvector_base access:protected signature:(size_t __n) +std::_Bvector_base::_M_deallocate cpp_src/stl_bvector.h /^ _M_deallocate()$/;" f struct:std::_Bvector_base access:protected signature:() +std::_Bvector_base::_M_get_Bit_allocator cpp_src/stl_bvector.h /^ _M_get_Bit_allocator() const$/;" f struct:std::_Bvector_base access:public signature:() const +std::_Bvector_base::_M_get_Bit_allocator cpp_src/stl_bvector.h /^ _M_get_Bit_allocator()$/;" f struct:std::_Bvector_base access:public signature:() +std::_Bvector_base::_M_impl cpp_src/stl_bvector.h /^ _Bvector_impl _M_impl;$/;" m struct:std::_Bvector_base access:protected +std::_Bvector_base::allocator_type cpp_src/stl_bvector.h /^ typedef _Alloc allocator_type;$/;" t struct:std::_Bvector_base access:public +std::_Bvector_base::get_allocator cpp_src/stl_bvector.h /^ get_allocator() const$/;" f struct:std::_Bvector_base access:public signature:() const +std::_Bvector_base::~_Bvector_base cpp_src/stl_bvector.h /^ ~_Bvector_base()$/;" f struct:std::_Bvector_base access:public signature:() +std::_Construct cpp_src/stl_construct.h /^ _Construct(_T1* __p)$/;" f namespace:std signature:(_T1* __p) +std::_Construct cpp_src/stl_construct.h /^ _Construct(_T1* __p, const _T2& __value)$/;" f namespace:std signature:(_T1* __p, const _T2& __value) +std::_Deque_base cpp_src/stl_deque.h /^ class _Deque_base$/;" c namespace:std +std::_Deque_base::_Deque_base cpp_src/stl_deque.h /^ _Deque_base(const allocator_type& __a)$/;" f class:std::_Deque_base access:public signature:(const allocator_type& __a) +std::_Deque_base::_Deque_base cpp_src/stl_deque.h /^ _Deque_base(const allocator_type& __a, size_t __num_elements)$/;" f class:std::_Deque_base access:public signature:(const allocator_type& __a, size_t __num_elements) +std::_Deque_base::_Deque_impl cpp_src/stl_deque.h /^ struct _Deque_impl$/;" s class:std::_Deque_base inherits:_Tp_alloc_type access:protected +std::_Deque_base::_Deque_impl::_Deque_impl cpp_src/stl_deque.h /^ _Deque_impl(const _Tp_alloc_type& __a)$/;" f struct:std::_Deque_base::_Deque_impl access:public signature:(const _Tp_alloc_type& __a) +std::_Deque_base::_Deque_impl::_M_finish cpp_src/stl_deque.h /^ iterator _M_finish;$/;" m struct:std::_Deque_base::_Deque_impl access:public +std::_Deque_base::_Deque_impl::_M_map cpp_src/stl_deque.h /^ _Tp** _M_map;$/;" m struct:std::_Deque_base::_Deque_impl access:public +std::_Deque_base::_Deque_impl::_M_map_size cpp_src/stl_deque.h /^ size_t _M_map_size;$/;" m struct:std::_Deque_base::_Deque_impl access:public +std::_Deque_base::_Deque_impl::_M_start cpp_src/stl_deque.h /^ iterator _M_start;$/;" m struct:std::_Deque_base::_Deque_impl access:public +std::_Deque_base::_M_allocate_map cpp_src/stl_deque.h /^ _M_allocate_map(size_t __n)$/;" f class:std::_Deque_base access:protected signature:(size_t __n) +std::_Deque_base::_M_allocate_node cpp_src/stl_deque.h /^ _M_allocate_node()$/;" f class:std::_Deque_base access:protected signature:() +std::_Deque_base::_M_create_nodes cpp_src/stl_deque.h /^ void _M_create_nodes(_Tp** __nstart, _Tp** __nfinish);$/;" p class:std::_Deque_base access:protected signature:(_Tp** __nstart, _Tp** __nfinish) +std::_Deque_base::_M_create_nodes cpp_src/stl_deque.h /^ _M_create_nodes(_Tp** __nstart, _Tp** __nfinish)$/;" f class:std::_Deque_base signature:(_Tp** __nstart, _Tp** __nfinish) +std::_Deque_base::_M_deallocate_map cpp_src/stl_deque.h /^ _M_deallocate_map(_Tp** __p, size_t __n)$/;" f class:std::_Deque_base access:protected signature:(_Tp** __p, size_t __n) +std::_Deque_base::_M_deallocate_node cpp_src/stl_deque.h /^ _M_deallocate_node(_Tp* __p)$/;" f class:std::_Deque_base access:protected signature:(_Tp* __p) +std::_Deque_base::_M_destroy_nodes cpp_src/stl_deque.h /^ void _M_destroy_nodes(_Tp** __nstart, _Tp** __nfinish);$/;" p class:std::_Deque_base access:protected signature:(_Tp** __nstart, _Tp** __nfinish) +std::_Deque_base::_M_destroy_nodes cpp_src/stl_deque.h /^ _M_destroy_nodes(_Tp** __nstart, _Tp** __nfinish)$/;" f class:std::_Deque_base signature:(_Tp** __nstart, _Tp** __nfinish) +std::_Deque_base::_M_get_Tp_allocator cpp_src/stl_deque.h /^ _M_get_Tp_allocator() const$/;" f class:std::_Deque_base access:protected signature:() const +std::_Deque_base::_M_get_Tp_allocator cpp_src/stl_deque.h /^ _M_get_Tp_allocator()$/;" f class:std::_Deque_base access:protected signature:() +std::_Deque_base::_M_get_map_allocator cpp_src/stl_deque.h /^ _M_get_map_allocator() const$/;" f class:std::_Deque_base access:protected signature:() const +std::_Deque_base::_M_impl cpp_src/stl_deque.h /^ _Deque_impl _M_impl;$/;" m class:std::_Deque_base access:protected +std::_Deque_base::_M_initialize_map cpp_src/stl_deque.h /^ void _M_initialize_map(size_t);$/;" p class:std::_Deque_base access:protected signature:(size_t) +std::_Deque_base::_M_initialize_map cpp_src/stl_deque.h /^ _M_initialize_map(size_t __num_elements)$/;" f class:std::_Deque_base signature:(size_t __num_elements) +std::_Deque_base::_Map_alloc_type cpp_src/stl_deque.h /^ typedef typename _Alloc::template rebind<_Tp*>::other _Map_alloc_type;$/;" t class:std::_Deque_base access:protected +std::_Deque_base::_S_initial_map_size cpp_src/stl_deque.h /^ enum { _S_initial_map_size = 8 };$/;" e enum:std::_Deque_base::__anon3 +std::_Deque_base::_Tp_alloc_type cpp_src/stl_deque.h /^ typedef typename _Alloc::template rebind<_Tp>::other _Tp_alloc_type;$/;" t class:std::_Deque_base access:protected +std::_Deque_base::allocator_type cpp_src/stl_deque.h /^ typedef _Alloc allocator_type;$/;" t class:std::_Deque_base access:public +std::_Deque_base::const_iterator cpp_src/stl_deque.h /^ typedef _Deque_iterator<_Tp, const _Tp&, const _Tp*> const_iterator;$/;" t class:std::_Deque_base access:public +std::_Deque_base::get_allocator cpp_src/stl_deque.h /^ get_allocator() const$/;" f class:std::_Deque_base access:public signature:() const +std::_Deque_base::iterator cpp_src/stl_deque.h /^ typedef _Deque_iterator<_Tp, _Tp&, _Tp*> iterator;$/;" t class:std::_Deque_base access:public +std::_Deque_base::~_Deque_base cpp_src/stl_deque.h /^ ~_Deque_base();$/;" p class:std::_Deque_base access:public signature:() +std::_Deque_base::~_Deque_base cpp_src/stl_deque.h /^ ~_Deque_base()$/;" f class:std::_Deque_base signature:() +std::_Deque_iterator cpp_src/stl_deque.h /^ struct _Deque_iterator$/;" s namespace:std +std::_Deque_iterator::_Deque_iterator cpp_src/stl_deque.h /^ _Deque_iterator() : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) {}$/;" f struct:std::_Deque_iterator access:public signature:() +std::_Deque_iterator::_Deque_iterator cpp_src/stl_deque.h /^ _Deque_iterator(_Tp* __x, _Map_pointer __y)$/;" f struct:std::_Deque_iterator access:public signature:(_Tp* __x, _Map_pointer __y) +std::_Deque_iterator::_Deque_iterator cpp_src/stl_deque.h /^ _Deque_iterator(const iterator& __x)$/;" f struct:std::_Deque_iterator access:public signature:(const iterator& __x) +std::_Deque_iterator::_M_cur cpp_src/stl_deque.h /^ _Tp* _M_cur;$/;" m struct:std::_Deque_iterator access:public +std::_Deque_iterator::_M_first cpp_src/stl_deque.h /^ _Tp* _M_first;$/;" m struct:std::_Deque_iterator access:public +std::_Deque_iterator::_M_last cpp_src/stl_deque.h /^ _Tp* _M_last;$/;" m struct:std::_Deque_iterator access:public +std::_Deque_iterator::_M_node cpp_src/stl_deque.h /^ _Map_pointer _M_node;$/;" m struct:std::_Deque_iterator access:public +std::_Deque_iterator::_M_set_node cpp_src/stl_deque.h /^ _M_set_node(_Map_pointer __new_node)$/;" f struct:std::_Deque_iterator access:public signature:(_Map_pointer __new_node) +std::_Deque_iterator::_Map_pointer cpp_src/stl_deque.h /^ typedef _Tp** _Map_pointer;$/;" t struct:std::_Deque_iterator access:public +std::_Deque_iterator::_S_buffer_size cpp_src/stl_deque.h /^ static size_t _S_buffer_size()$/;" f struct:std::_Deque_iterator access:public signature:() +std::_Deque_iterator::_Self cpp_src/stl_deque.h /^ typedef _Deque_iterator _Self;$/;" t struct:std::_Deque_iterator access:public +std::_Deque_iterator::const_iterator cpp_src/stl_deque.h /^ typedef _Deque_iterator<_Tp, const _Tp&, const _Tp*> const_iterator;$/;" t struct:std::_Deque_iterator access:public +std::_Deque_iterator::difference_type cpp_src/stl_deque.h /^ typedef ptrdiff_t difference_type;$/;" t struct:std::_Deque_iterator access:public +std::_Deque_iterator::iterator cpp_src/stl_deque.h /^ typedef _Deque_iterator<_Tp, _Tp&, _Tp*> iterator;$/;" t struct:std::_Deque_iterator access:public +std::_Deque_iterator::iterator_category cpp_src/stl_deque.h /^ typedef std::random_access_iterator_tag iterator_category;$/;" t struct:std::_Deque_iterator access:public +std::_Deque_iterator::operator * cpp_src/stl_deque.h /^ operator*() const$/;" f struct:std::_Deque_iterator access:public signature:() const +std::_Deque_iterator::operator + cpp_src/stl_deque.h /^ operator+(difference_type __n) const$/;" f struct:std::_Deque_iterator access:public signature:(difference_type __n) const +std::_Deque_iterator::operator ++ cpp_src/stl_deque.h /^ operator++()$/;" f struct:std::_Deque_iterator access:public signature:() +std::_Deque_iterator::operator ++ cpp_src/stl_deque.h /^ operator++(int)$/;" f struct:std::_Deque_iterator access:public signature:(int) +std::_Deque_iterator::operator += cpp_src/stl_deque.h /^ operator+=(difference_type __n)$/;" f struct:std::_Deque_iterator access:public signature:(difference_type __n) +std::_Deque_iterator::operator - cpp_src/stl_deque.h /^ operator-(difference_type __n) const$/;" f struct:std::_Deque_iterator access:public signature:(difference_type __n) const +std::_Deque_iterator::operator -- cpp_src/stl_deque.h /^ operator--()$/;" f struct:std::_Deque_iterator access:public signature:() +std::_Deque_iterator::operator -- cpp_src/stl_deque.h /^ operator--(int)$/;" f struct:std::_Deque_iterator access:public signature:(int) +std::_Deque_iterator::operator -= cpp_src/stl_deque.h /^ operator-=(difference_type __n)$/;" f struct:std::_Deque_iterator access:public signature:(difference_type __n) +std::_Deque_iterator::operator -> cpp_src/stl_deque.h /^ operator->() const$/;" f struct:std::_Deque_iterator access:public signature:() const +std::_Deque_iterator::operator [] cpp_src/stl_deque.h /^ operator[](difference_type __n) const$/;" f struct:std::_Deque_iterator access:public signature:(difference_type __n) const +std::_Deque_iterator::pointer cpp_src/stl_deque.h /^ typedef _Ptr pointer;$/;" t struct:std::_Deque_iterator access:public +std::_Deque_iterator::reference cpp_src/stl_deque.h /^ typedef _Ref reference;$/;" t struct:std::_Deque_iterator access:public +std::_Deque_iterator::size_type cpp_src/stl_deque.h /^ typedef size_t size_type;$/;" t struct:std::_Deque_iterator access:public +std::_Deque_iterator::value_type cpp_src/stl_deque.h /^ typedef _Tp value_type;$/;" t struct:std::_Deque_iterator access:public +std::_Destroy cpp_src/stl_construct.h /^ _Destroy(_ForwardIterator __first, _ForwardIterator __last)$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last) +std::_Destroy cpp_src/stl_construct.h /^ _Destroy(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _Allocator __alloc) +std::_Destroy cpp_src/stl_construct.h /^ _Destroy(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, allocator<_Tp>) +std::_Destroy cpp_src/stl_construct.h /^ _Destroy(_Tp* __pointer)$/;" f namespace:std signature:(_Tp* __pointer) +std::_Expr cpp_src/valarray_after.h /^ class _Expr$/;" c namespace:std +std::_Expr::_Expr cpp_src/valarray_after.h /^ _Expr(const _Clos&);$/;" p class:std::_Expr access:public signature:(const _Clos&) +std::_Expr::_Expr cpp_src/valarray_after.h /^ _Expr<_Clos, _Tp>::_Expr(const _Clos& __c) : _M_closure(__c) {}$/;" f class:std::_Expr signature:(const _Clos& __c) +std::_Expr::_M_closure cpp_src/valarray_after.h /^ const _Clos _M_closure;$/;" m class:std::_Expr access:private +std::_Expr::__f cpp_src/valarray_after.h /^ _Expr<_Clos, _Tp>::apply(_Tp __f(_Tp)) const$/;" f class:std::_Expr signature:(_Tp) const +std::_Expr::__f cpp_src/valarray_after.h /^ _Expr<_Clos, _Tp>::apply(_Tp __f(const _Tp&)) const$/;" f class:std::_Expr signature:(const _Tp&) const +std::_Expr::apply cpp_src/valarray_after.h /^ valarray apply(value_type (*)(const value_type&)) const;$/;" p class:std::_Expr access:public signature:(value_type ()const value_type&)) const +std::_Expr::apply cpp_src/valarray_after.h /^ valarray apply(value_type (*)(value_type)) const;$/;" p class:std::_Expr access:public signature:(value_type ()value_type)) const +std::_Expr::cshift cpp_src/valarray_after.h /^ valarray cshift(int) const;$/;" p class:std::_Expr access:public signature:(int) const +std::_Expr::cshift cpp_src/valarray_after.h /^ _Expr<_Clos, _Tp>::cshift(int __n) const$/;" f class:std::_Expr signature:(int __n) const +std::_Expr::max cpp_src/valarray_after.h /^ value_type max() const;$/;" p class:std::_Expr access:public signature:() const +std::_Expr::max cpp_src/valarray_after.h /^ _Expr<_Clos, _Tp>::max() const$/;" f class:std::_Expr signature:() const +std::_Expr::min cpp_src/valarray_after.h /^ value_type min() const;$/;" p class:std::_Expr access:public signature:() const +std::_Expr::min cpp_src/valarray_after.h /^ _Expr<_Clos, _Tp>::min() const$/;" f class:std::_Expr signature:() const +std::_Expr::operator ! cpp_src/valarray_after.h /^ operator!() const;$/;" p class:std::_Expr access:public signature:() const +std::_Expr::operator ! cpp_src/valarray_after.h /^ _Expr<_Dom, _Tp>::operator!() const$/;" f class:std::_Expr signature:() const +std::_Expr::operator () cpp_src/valarray_after.h /^ const _Clos& operator()() const;$/;" p class:std::_Expr access:public signature:() const +std::_Expr::operator () cpp_src/valarray_after.h /^ _Expr<_Clos, _Tp>::operator()() const$/;" f class:std::_Expr signature:() const +std::_Expr::operator + cpp_src/valarray_after.h /^ operator+() const;$/;" p class:std::_Expr access:public signature:() const +std::_Expr::operator - cpp_src/valarray_after.h /^ operator-() const;$/;" p class:std::_Expr access:public signature:() const +std::_Expr::operator [] cpp_src/valarray_after.h /^ valarray operator[](const gslice&) const;$/;" p class:std::_Expr access:public signature:(const gslice&) const +std::_Expr::operator [] cpp_src/valarray_after.h /^ valarray operator[](const valarray&) const;$/;" p class:std::_Expr access:public signature:(const valarray&) const +std::_Expr::operator [] cpp_src/valarray_after.h /^ valarray operator[](const valarray&) const;$/;" p class:std::_Expr access:public signature:(const valarray&) const +std::_Expr::operator [] cpp_src/valarray_after.h /^ valarray operator[](slice) const;$/;" p class:std::_Expr access:public signature:(slice) const +std::_Expr::operator [] cpp_src/valarray_after.h /^ value_type operator[](size_t) const;$/;" p class:std::_Expr access:public signature:(size_t) const +std::_Expr::operator [] cpp_src/valarray_after.h /^ _Expr<_Clos, _Tp>::operator[](const gslice& __gs) const$/;" f class:std::_Expr signature:(const gslice& __gs) const +std::_Expr::operator [] cpp_src/valarray_after.h /^ _Expr<_Clos, _Tp>::operator[](const valarray& __m) const$/;" f class:std::_Expr signature:(const valarray& __m) const +std::_Expr::operator [] cpp_src/valarray_after.h /^ _Expr<_Clos, _Tp>::operator[](const valarray& __i) const$/;" f class:std::_Expr signature:(const valarray& __i) const +std::_Expr::operator [] cpp_src/valarray_after.h /^ _Expr<_Clos, _Tp>::operator[](size_t __i) const$/;" f class:std::_Expr signature:(size_t __i) const +std::_Expr::operator [] cpp_src/valarray_after.h /^ _Expr<_Clos, _Tp>::operator[](slice __s) const$/;" f class:std::_Expr signature:(slice __s) const +std::_Expr::operator ~ cpp_src/valarray_after.h /^ operator~() const;$/;" p class:std::_Expr access:public signature:() const +std::_Expr::shift cpp_src/valarray_after.h /^ valarray shift(int) const;$/;" p class:std::_Expr access:public signature:(int) const +std::_Expr::shift cpp_src/valarray_after.h /^ _Expr<_Clos, _Tp>::shift(int __n) const$/;" f class:std::_Expr signature:(int __n) const +std::_Expr::size cpp_src/valarray_after.h /^ size_t size() const;$/;" p class:std::_Expr access:public signature:() const +std::_Expr::size cpp_src/valarray_after.h /^ _Expr<_Clos, _Tp>::size() const$/;" f class:std::_Expr signature:() const +std::_Expr::sum cpp_src/valarray_after.h /^ value_type sum() const;$/;" p class:std::_Expr access:public signature:() const +std::_Expr::sum cpp_src/valarray_after.h /^ _Expr<_Clos, _Tp>::sum() const$/;" f class:std::_Expr signature:() const +std::_Expr::value_type cpp_src/valarray_after.h /^ typedef _Tp value_type;$/;" t class:std::_Expr access:public +std::_FunBase cpp_src/valarray_before.h /^ class _FunBase$/;" c namespace:std +std::_FunBase::_FunBase cpp_src/valarray_before.h /^ _FunBase(const _Dom& __e, value_type __f(_Arg))$/;" f class:std::_FunBase access:public signature:(const _Dom& __e, value_type __f(_Arg)) +std::_FunBase::_M_expr cpp_src/valarray_before.h /^ const _Dom& _M_expr;$/;" m class:std::_FunBase access:private +std::_FunBase::_M_func cpp_src/valarray_before.h /^ value_type (*_M_func)(_Arg);$/;" m class:std::_FunBase access:private +std::_FunBase::operator [] cpp_src/valarray_before.h /^ value_type operator[](size_t __i) const$/;" f class:std::_FunBase access:public signature:(size_t __i) const +std::_FunBase::size cpp_src/valarray_before.h /^ size_t size() const { return _M_expr.size ();}$/;" f class:std::_FunBase access:public signature:() const +std::_FunBase::value_type cpp_src/valarray_before.h /^ typedef typename _Dom::value_type value_type;$/;" t class:std::_FunBase access:public +std::_GBase cpp_src/valarray_after.h /^ class _GBase$/;" c namespace:std +std::_GBase cpp_src/valarray_after.h /^ class _GBase<_Array<_Tp> >$/;" c namespace:std +std::_GBase::_GBase cpp_src/valarray_after.h /^ _GBase (_Array<_Tp> __a, const valarray& __i)$/;" f class:std::_GBase access:public signature:(_Array<_Tp> __a, const valarray& __i) +std::_GBase::_GBase cpp_src/valarray_after.h /^ _GBase (const _Dom& __e, const valarray& __i)$/;" f class:std::_GBase access:public signature:(const _Dom& __e, const valarray& __i) +std::_GBase::_M_array cpp_src/valarray_after.h /^ const _Array<_Tp> _M_array;$/;" m class:std::_GBase access:private +std::_GBase::_M_expr cpp_src/valarray_after.h /^ const _Dom& _M_expr;$/;" m class:std::_GBase access:private +std::_GBase::_M_index cpp_src/valarray_after.h /^ const valarray& _M_index;$/;" m class:std::_GBase access:private +std::_GBase::operator [] cpp_src/valarray_after.h /^ operator[] (size_t __i) const$/;" f class:std::_GBase access:public signature:(size_t __i) const +std::_GBase::size cpp_src/valarray_after.h /^ size () const$/;" f class:std::_GBase access:public signature:() const +std::_GBase::value_type cpp_src/valarray_after.h /^ typedef _Tp value_type;$/;" t class:std::_GBase access:public +std::_GBase::value_type cpp_src/valarray_after.h /^ typedef typename _Dom::value_type value_type;$/;" t class:std::_GBase access:public +std::_GClos cpp_src/valarray_after.h /^ struct _GClos<_Expr, _Dom>$/;" s namespace:std inherits:_GBase +std::_GClos cpp_src/valarray_after.h /^ struct _GClos<_ValArray, _Tp>$/;" s namespace:std inherits:_GBase +std::_GClos::_Base cpp_src/valarray_after.h /^ typedef _GBase<_Array<_Tp> > _Base;$/;" t struct:std::_GClos access:public +std::_GClos::_Base cpp_src/valarray_after.h /^ typedef _GBase<_Dom> _Base;$/;" t struct:std::_GClos access:public +std::_GClos::_GClos cpp_src/valarray_after.h /^ _GClos (_Array<_Tp> __a, const valarray& __i)$/;" f struct:std::_GClos access:public signature:(_Array<_Tp> __a, const valarray& __i) +std::_GClos::_GClos cpp_src/valarray_after.h /^ _GClos (const _Dom& __e, const valarray& __i)$/;" f struct:std::_GClos access:public signature:(const _Dom& __e, const valarray& __i) +std::_GClos::value_type cpp_src/valarray_after.h /^ typedef typename _Base::value_type value_type;$/;" t struct:std::_GClos access:public +std::_IBase cpp_src/valarray_after.h /^ class _IBase$/;" c namespace:std +std::_IBase::_IBase cpp_src/valarray_after.h /^ _IBase (const _Dom& __e, const valarray& __i)$/;" f class:std::_IBase access:public signature:(const _Dom& __e, const valarray& __i) +std::_IBase::_M_expr cpp_src/valarray_after.h /^ const _Dom& _M_expr;$/;" m class:std::_IBase access:private +std::_IBase::_M_index cpp_src/valarray_after.h /^ const valarray& _M_index;$/;" m class:std::_IBase access:private +std::_IBase::operator [] cpp_src/valarray_after.h /^ operator[] (size_t __i) const$/;" f class:std::_IBase access:public signature:(size_t __i) const +std::_IBase::size cpp_src/valarray_after.h /^ size() const$/;" f class:std::_IBase access:public signature:() const +std::_IBase::value_type cpp_src/valarray_after.h /^ typedef typename _Dom::value_type value_type;$/;" t class:std::_IBase access:public +std::_IClos cpp_src/valarray_after.h /^ struct _IClos<_Expr, _Dom>$/;" s namespace:std inherits:_IBase +std::_IClos cpp_src/valarray_after.h /^ struct _IClos<_ValArray, _Tp>$/;" s namespace:std inherits:_IBase +std::_IClos::_Base cpp_src/valarray_after.h /^ typedef _IBase<_Dom> _Base;$/;" t struct:std::_IClos access:public +std::_IClos::_Base cpp_src/valarray_after.h /^ typedef _IBase > _Base;$/;" t struct:std::_IClos access:public +std::_IClos::_IClos cpp_src/valarray_after.h /^ _IClos (const _Dom& __e, const valarray& __i)$/;" f struct:std::_IClos access:public signature:(const _Dom& __e, const valarray& __i) +std::_IClos::_IClos cpp_src/valarray_after.h /^ _IClos (const valarray<_Tp>& __a, const valarray& __i)$/;" f struct:std::_IClos access:public signature:(const valarray<_Tp>& __a, const valarray& __i) +std::_IClos::value_type cpp_src/valarray_after.h /^ typedef _Tp value_type;$/;" t struct:std::_IClos access:public +std::_IClos::value_type cpp_src/valarray_after.h /^ typedef typename _Base::value_type value_type;$/;" t struct:std::_IClos access:public +std::_Identity cpp_src/stl_function.h /^ struct _Identity : public unary_function<_Tp,_Tp>$/;" s namespace:std inherits:unary_function +std::_Identity::operator () cpp_src/stl_function.h /^ operator()(_Tp& __x) const$/;" f struct:std::_Identity access:public signature:(_Tp& __x) const +std::_Identity::operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x) const$/;" f struct:std::_Identity access:public signature:(const _Tp& __x) const +std::_Ios_Fmtflags cpp_src/ios_base.h /^ enum _Ios_Fmtflags $/;" g namespace:std +std::_Ios_Iostate cpp_src/ios_base.h /^ enum _Ios_Iostate$/;" g namespace:std +std::_Ios_Openmode cpp_src/ios_base.h /^ enum _Ios_Openmode $/;" g namespace:std +std::_Ios_Seekdir cpp_src/ios_base.h /^ enum _Ios_Seekdir $/;" g namespace:std +std::_List_base cpp_src/stl_list.h /^ class _List_base$/;" c namespace:std +std::_List_base::_List_base cpp_src/stl_list.h /^ _List_base(const allocator_type& __a)$/;" f class:std::_List_base access:public signature:(const allocator_type& __a) +std::_List_base::_List_impl cpp_src/stl_list.h /^ struct _List_impl $/;" s class:std::_List_base inherits:_Node_alloc_type access:protected +std::_List_base::_List_impl::_List_impl cpp_src/stl_list.h /^ _List_impl(const _Node_alloc_type& __a)$/;" f struct:std::_List_base::_List_impl access:public signature:(const _Node_alloc_type& __a) +std::_List_base::_List_impl::_M_node cpp_src/stl_list.h /^ _List_node_base _M_node;$/;" m struct:std::_List_base::_List_impl access:public +std::_List_base::_M_clear cpp_src/list.tcc /^ _M_clear()$/;" f class:std::_List_base signature:() +std::_List_base::_M_clear cpp_src/stl_list.h /^ _M_clear();$/;" p class:std::_List_base access:public signature:() +std::_List_base::_M_get_Node_allocator cpp_src/stl_list.h /^ _M_get_Node_allocator() const$/;" f class:std::_List_base access:public signature:() const +std::_List_base::_M_get_Node_allocator cpp_src/stl_list.h /^ _M_get_Node_allocator()$/;" f class:std::_List_base access:public signature:() +std::_List_base::_M_get_Tp_allocator cpp_src/stl_list.h /^ _M_get_Tp_allocator() const$/;" f class:std::_List_base access:public signature:() const +std::_List_base::_M_get_node cpp_src/stl_list.h /^ _M_get_node()$/;" f class:std::_List_base access:protected signature:() +std::_List_base::_M_impl cpp_src/stl_list.h /^ _List_impl _M_impl;$/;" m class:std::_List_base access:protected +std::_List_base::_M_init cpp_src/stl_list.h /^ _M_init()$/;" f class:std::_List_base access:public signature:() +std::_List_base::_M_put_node cpp_src/stl_list.h /^ _M_put_node(_List_node<_Tp>* __p)$/;" f class:std::_List_base access:protected signature:(_List_node<_Tp>* __p) +std::_List_base::_Node_alloc_type cpp_src/stl_list.h /^ _Node_alloc_type;$/;" t class:std::_List_base access:protected +std::_List_base::_Tp_alloc_type cpp_src/stl_list.h /^ typedef typename _Alloc::template rebind<_Tp>::other _Tp_alloc_type;$/;" t class:std::_List_base access:protected +std::_List_base::allocator_type cpp_src/stl_list.h /^ typedef _Alloc allocator_type;$/;" t class:std::_List_base access:public +std::_List_base::get_allocator cpp_src/stl_list.h /^ get_allocator() const$/;" f class:std::_List_base access:public signature:() const +std::_List_base::~_List_base cpp_src/stl_list.h /^ ~_List_base()$/;" f class:std::_List_base access:public signature:() +std::_List_const_iterator cpp_src/stl_list.h /^ struct _List_const_iterator$/;" s namespace:std +std::_List_const_iterator::_List_const_iterator cpp_src/stl_list.h /^ _List_const_iterator()$/;" f struct:std::_List_const_iterator access:public signature:() +std::_List_const_iterator::_List_const_iterator cpp_src/stl_list.h /^ _List_const_iterator(const _List_node_base* __x)$/;" f struct:std::_List_const_iterator access:public signature:(const _List_node_base* __x) +std::_List_const_iterator::_List_const_iterator cpp_src/stl_list.h /^ _List_const_iterator(const iterator& __x)$/;" f struct:std::_List_const_iterator access:public signature:(const iterator& __x) +std::_List_const_iterator::_M_node cpp_src/stl_list.h /^ const _List_node_base* _M_node;$/;" m struct:std::_List_const_iterator access:public +std::_List_const_iterator::_Node cpp_src/stl_list.h /^ typedef const _List_node<_Tp> _Node;$/;" t struct:std::_List_const_iterator access:public +std::_List_const_iterator::_Self cpp_src/stl_list.h /^ typedef _List_const_iterator<_Tp> _Self;$/;" t struct:std::_List_const_iterator access:public +std::_List_const_iterator::difference_type cpp_src/stl_list.h /^ typedef ptrdiff_t difference_type;$/;" t struct:std::_List_const_iterator access:public +std::_List_const_iterator::iterator cpp_src/stl_list.h /^ typedef _List_iterator<_Tp> iterator;$/;" t struct:std::_List_const_iterator access:public +std::_List_const_iterator::iterator_category cpp_src/stl_list.h /^ typedef std::bidirectional_iterator_tag iterator_category;$/;" t struct:std::_List_const_iterator access:public +std::_List_const_iterator::operator != cpp_src/stl_list.h /^ operator!=(const _Self& __x) const$/;" f struct:std::_List_const_iterator access:public signature:(const _Self& __x) const +std::_List_const_iterator::operator * cpp_src/stl_list.h /^ operator*() const$/;" f struct:std::_List_const_iterator access:public signature:() const +std::_List_const_iterator::operator ++ cpp_src/stl_list.h /^ operator++()$/;" f struct:std::_List_const_iterator access:public signature:() +std::_List_const_iterator::operator ++ cpp_src/stl_list.h /^ operator++(int)$/;" f struct:std::_List_const_iterator access:public signature:(int) +std::_List_const_iterator::operator -- cpp_src/stl_list.h /^ operator--()$/;" f struct:std::_List_const_iterator access:public signature:() +std::_List_const_iterator::operator -- cpp_src/stl_list.h /^ operator--(int)$/;" f struct:std::_List_const_iterator access:public signature:(int) +std::_List_const_iterator::operator -> cpp_src/stl_list.h /^ operator->() const$/;" f struct:std::_List_const_iterator access:public signature:() const +std::_List_const_iterator::operator == cpp_src/stl_list.h /^ operator==(const _Self& __x) const$/;" f struct:std::_List_const_iterator access:public signature:(const _Self& __x) const +std::_List_const_iterator::pointer cpp_src/stl_list.h /^ typedef const _Tp* pointer;$/;" t struct:std::_List_const_iterator access:public +std::_List_const_iterator::reference cpp_src/stl_list.h /^ typedef const _Tp& reference;$/;" t struct:std::_List_const_iterator access:public +std::_List_const_iterator::value_type cpp_src/stl_list.h /^ typedef _Tp value_type;$/;" t struct:std::_List_const_iterator access:public +std::_List_iterator cpp_src/stl_list.h /^ struct _List_iterator$/;" s namespace:std +std::_List_iterator::_List_iterator cpp_src/stl_list.h /^ _List_iterator()$/;" f struct:std::_List_iterator access:public signature:() +std::_List_iterator::_List_iterator cpp_src/stl_list.h /^ _List_iterator(_List_node_base* __x)$/;" f struct:std::_List_iterator access:public signature:(_List_node_base* __x) +std::_List_iterator::_M_node cpp_src/stl_list.h /^ _List_node_base* _M_node;$/;" m struct:std::_List_iterator access:public +std::_List_iterator::_Node cpp_src/stl_list.h /^ typedef _List_node<_Tp> _Node;$/;" t struct:std::_List_iterator access:public +std::_List_iterator::_Self cpp_src/stl_list.h /^ typedef _List_iterator<_Tp> _Self;$/;" t struct:std::_List_iterator access:public +std::_List_iterator::difference_type cpp_src/stl_list.h /^ typedef ptrdiff_t difference_type;$/;" t struct:std::_List_iterator access:public +std::_List_iterator::iterator_category cpp_src/stl_list.h /^ typedef std::bidirectional_iterator_tag iterator_category;$/;" t struct:std::_List_iterator access:public +std::_List_iterator::operator != cpp_src/stl_list.h /^ operator!=(const _Self& __x) const$/;" f struct:std::_List_iterator access:public signature:(const _Self& __x) const +std::_List_iterator::operator * cpp_src/stl_list.h /^ operator*() const$/;" f struct:std::_List_iterator access:public signature:() const +std::_List_iterator::operator ++ cpp_src/stl_list.h /^ operator++()$/;" f struct:std::_List_iterator access:public signature:() +std::_List_iterator::operator ++ cpp_src/stl_list.h /^ operator++(int)$/;" f struct:std::_List_iterator access:public signature:(int) +std::_List_iterator::operator -- cpp_src/stl_list.h /^ operator--()$/;" f struct:std::_List_iterator access:public signature:() +std::_List_iterator::operator -- cpp_src/stl_list.h /^ operator--(int)$/;" f struct:std::_List_iterator access:public signature:(int) +std::_List_iterator::operator -> cpp_src/stl_list.h /^ operator->() const$/;" f struct:std::_List_iterator access:public signature:() const +std::_List_iterator::operator == cpp_src/stl_list.h /^ operator==(const _Self& __x) const$/;" f struct:std::_List_iterator access:public signature:(const _Self& __x) const +std::_List_iterator::pointer cpp_src/stl_list.h /^ typedef _Tp* pointer;$/;" t struct:std::_List_iterator access:public +std::_List_iterator::reference cpp_src/stl_list.h /^ typedef _Tp& reference;$/;" t struct:std::_List_iterator access:public +std::_List_iterator::value_type cpp_src/stl_list.h /^ typedef _Tp value_type;$/;" t struct:std::_List_iterator access:public +std::_List_node cpp_src/stl_list.h /^ struct _List_node : public _List_node_base$/;" s namespace:std inherits:_List_node_base +std::_List_node::_M_data cpp_src/stl_list.h /^ _Tp _M_data; \/\/\/< User's data.$/;" m struct:std::_List_node access:public +std::_List_node_base cpp_src/stl_list.h /^ struct _List_node_base$/;" s namespace:std +std::_List_node_base::_M_next cpp_src/stl_list.h /^ _List_node_base* _M_next; \/\/\/< Self-explanatory$/;" m struct:std::_List_node_base access:public +std::_List_node_base::_M_prev cpp_src/stl_list.h /^ _List_node_base* _M_prev; \/\/\/< Self-explanatory$/;" m struct:std::_List_node_base access:public +std::_List_node_base::hook cpp_src/stl_list.h /^ hook(_List_node_base * const __position);$/;" p struct:std::_List_node_base access:public signature:(_List_node_base * const __position) +std::_List_node_base::reverse cpp_src/stl_list.h /^ reverse();$/;" p struct:std::_List_node_base access:public signature:() +std::_List_node_base::swap cpp_src/stl_list.h /^ swap(_List_node_base& __x, _List_node_base& __y);$/;" p struct:std::_List_node_base access:public signature:(_List_node_base& __x, _List_node_base& __y) +std::_List_node_base::transfer cpp_src/stl_list.h /^ transfer(_List_node_base * const __first,$/;" p struct:std::_List_node_base access:public signature:(_List_node_base * const __first, _List_node_base * const __last) +std::_List_node_base::unhook cpp_src/stl_list.h /^ unhook();$/;" p struct:std::_List_node_base access:public signature:() +std::_Norm_helper cpp_src/complex /^ struct _Norm_helper$/;" s namespace:std file: +std::_Norm_helper cpp_src/complex /^ struct _Norm_helper$/;" s namespace:std file: +std::_Norm_helper::_S_do_it cpp_src/complex /^ static inline _Tp _S_do_it(const complex<_Tp>& __z)$/;" f struct:std::_Norm_helper access:public signature:(const complex<_Tp>& __z) +std::_Rb_tree cpp_src/stl_tree.h /^ class _Rb_tree$/;" c namespace:std +std::_Rb_tree::_Base_ptr cpp_src/stl_tree.h /^ typedef _Rb_tree_node_base* _Base_ptr;$/;" t class:std::_Rb_tree access:protected +std::_Rb_tree::_Const_Base_ptr cpp_src/stl_tree.h /^ typedef const _Rb_tree_node_base* _Const_Base_ptr;$/;" t class:std::_Rb_tree access:protected +std::_Rb_tree::_Const_Link_type cpp_src/stl_tree.h /^ typedef const _Rb_tree_node* _Const_Link_type;$/;" t class:std::_Rb_tree access:public +std::_Rb_tree::_Link_type cpp_src/stl_tree.h /^ typedef _Rb_tree_node* _Link_type;$/;" t class:std::_Rb_tree access:public +std::_Rb_tree::_M_begin cpp_src/stl_tree.h /^ _M_begin() const$/;" f class:std::_Rb_tree access:protected signature:() const +std::_Rb_tree::_M_begin cpp_src/stl_tree.h /^ _M_begin()$/;" f class:std::_Rb_tree access:protected signature:() +std::_Rb_tree::_M_clone_node cpp_src/stl_tree.h /^ _M_clone_node(_Const_Link_type __x)$/;" f class:std::_Rb_tree access:protected signature:(_Const_Link_type __x) +std::_Rb_tree::_M_copy cpp_src/stl_tree.h /^ _M_copy(_Const_Link_type __x, _Link_type __p);$/;" p class:std::_Rb_tree access:private signature:(_Const_Link_type __x, _Link_type __p) +std::_Rb_tree::_M_copy cpp_src/stl_tree.h /^ _M_copy(_Const_Link_type __x, _Link_type __p)$/;" f class:std::_Rb_tree signature:(_Const_Link_type __x, _Link_type __p) +std::_Rb_tree::_M_create_node cpp_src/stl_tree.h /^ _M_create_node(const value_type& __x)$/;" f class:std::_Rb_tree access:protected signature:(const value_type& __x) +std::_Rb_tree::_M_destroy_node cpp_src/stl_tree.h /^ _M_destroy_node(_Link_type __p)$/;" f class:std::_Rb_tree access:protected signature:(_Link_type __p) +std::_Rb_tree::_M_end cpp_src/stl_tree.h /^ _M_end() const$/;" f class:std::_Rb_tree access:protected signature:() const +std::_Rb_tree::_M_end cpp_src/stl_tree.h /^ _M_end()$/;" f class:std::_Rb_tree access:protected signature:() +std::_Rb_tree::_M_erase cpp_src/stl_tree.h /^ _M_erase(_Link_type __x);$/;" p class:std::_Rb_tree access:private signature:(_Link_type __x) +std::_Rb_tree::_M_erase cpp_src/stl_tree.h /^ _M_erase(_Link_type __x)$/;" f class:std::_Rb_tree signature:(_Link_type __x) +std::_Rb_tree::_M_get_Node_allocator cpp_src/stl_tree.h /^ _M_get_Node_allocator() const$/;" f class:std::_Rb_tree access:public signature:() const +std::_Rb_tree::_M_get_Node_allocator cpp_src/stl_tree.h /^ _M_get_Node_allocator()$/;" f class:std::_Rb_tree access:public signature:() +std::_Rb_tree::_M_get_node cpp_src/stl_tree.h /^ _M_get_node()$/;" f class:std::_Rb_tree access:protected signature:() +std::_Rb_tree::_M_impl cpp_src/stl_tree.h /^ _Rb_tree_impl<_Compare> _M_impl;$/;" m class:std::_Rb_tree access:protected +std::_Rb_tree::_M_insert cpp_src/stl_tree.h /^ _M_insert(_Base_ptr __x, _Base_ptr __y, const value_type& __v);$/;" p class:std::_Rb_tree access:private signature:(_Base_ptr __x, _Base_ptr __y, const value_type& __v) +std::_Rb_tree::_M_insert cpp_src/stl_tree.h /^ _M_insert(_Const_Base_ptr __x, _Const_Base_ptr __y,$/;" p class:std::_Rb_tree access:private signature:(_Const_Base_ptr __x, _Const_Base_ptr __y, const value_type& __v) +std::_Rb_tree::_M_insert cpp_src/stl_tree.h /^ _M_insert(_Base_ptr __x, _Base_ptr __p, const _Val& __v)$/;" f class:std::_Rb_tree signature:(_Base_ptr __x, _Base_ptr __p, const _Val& __v) +std::_Rb_tree::_M_insert cpp_src/stl_tree.h /^ _M_insert(_Const_Base_ptr __x, _Const_Base_ptr __p, const _Val& __v)$/;" f class:std::_Rb_tree signature:(_Const_Base_ptr __x, _Const_Base_ptr __p, const _Val& __v) +std::_Rb_tree::_M_insert_equal cpp_src/stl_tree.h /^ _M_insert_equal(_InputIterator __first, _InputIterator __last);$/;" p class:std::_Rb_tree access:public signature:(_InputIterator __first, _InputIterator __last) +std::_Rb_tree::_M_insert_equal cpp_src/stl_tree.h /^ _M_insert_equal(_II __first, _II __last)$/;" f class:std::_Rb_tree signature:(_II __first, _II __last) +std::_Rb_tree::_M_insert_equal cpp_src/stl_tree.h /^ _M_insert_equal(const value_type& __x);$/;" p class:std::_Rb_tree access:public signature:(const value_type& __x) +std::_Rb_tree::_M_insert_equal cpp_src/stl_tree.h /^ _M_insert_equal(const_iterator __position, const value_type& __x);$/;" p class:std::_Rb_tree access:public signature:(const_iterator __position, const value_type& __x) +std::_Rb_tree::_M_insert_equal cpp_src/stl_tree.h /^ _M_insert_equal(iterator __position, const value_type& __x);$/;" p class:std::_Rb_tree access:public signature:(iterator __position, const value_type& __x) +std::_Rb_tree::_M_insert_equal cpp_src/stl_tree.h /^ _M_insert_equal(const _Val& __v)$/;" f class:std::_Rb_tree signature:(const _Val& __v) +std::_Rb_tree::_M_insert_equal cpp_src/stl_tree.h /^ _M_insert_equal(const_iterator __position, const _Val& __v)$/;" f class:std::_Rb_tree signature:(const_iterator __position, const _Val& __v) +std::_Rb_tree::_M_insert_equal cpp_src/stl_tree.h /^ _M_insert_equal(iterator __position, const _Val& __v)$/;" f class:std::_Rb_tree signature:(iterator __position, const _Val& __v) +std::_Rb_tree::_M_insert_equal_lower cpp_src/stl_tree.h /^ _M_insert_equal_lower(const value_type& __x);$/;" p class:std::_Rb_tree access:public signature:(const value_type& __x) +std::_Rb_tree::_M_insert_equal_lower cpp_src/stl_tree.h /^ _M_insert_equal_lower(const _Val& __v)$/;" f class:std::_Rb_tree signature:(const _Val& __v) +std::_Rb_tree::_M_insert_lower cpp_src/stl_tree.h /^ _M_insert_lower(_Base_ptr __x, _Base_ptr __y, const value_type& __v);$/;" p class:std::_Rb_tree access:private signature:(_Base_ptr __x, _Base_ptr __y, const value_type& __v) +std::_Rb_tree::_M_insert_lower cpp_src/stl_tree.h /^ _M_insert_lower(_Base_ptr __x, _Base_ptr __p, const _Val& __v)$/;" f class:std::_Rb_tree signature:(_Base_ptr __x, _Base_ptr __p, const _Val& __v) +std::_Rb_tree::_M_insert_unique cpp_src/stl_tree.h /^ _M_insert_unique(_InputIterator __first, _InputIterator __last);$/;" p class:std::_Rb_tree access:public signature:(_InputIterator __first, _InputIterator __last) +std::_Rb_tree::_M_insert_unique cpp_src/stl_tree.h /^ _M_insert_unique(_II __first, _II __last)$/;" f class:std::_Rb_tree signature:(_II __first, _II __last) +std::_Rb_tree::_M_insert_unique cpp_src/stl_tree.h /^ _M_insert_unique(const value_type& __x);$/;" p class:std::_Rb_tree access:public signature:(const value_type& __x) +std::_Rb_tree::_M_insert_unique cpp_src/stl_tree.h /^ _M_insert_unique(const_iterator __position, const value_type& __x);$/;" p class:std::_Rb_tree access:public signature:(const_iterator __position, const value_type& __x) +std::_Rb_tree::_M_insert_unique cpp_src/stl_tree.h /^ _M_insert_unique(iterator __position, const value_type& __x);$/;" p class:std::_Rb_tree access:public signature:(iterator __position, const value_type& __x) +std::_Rb_tree::_M_insert_unique cpp_src/stl_tree.h /^ _M_insert_unique(const _Val& __v)$/;" f class:std::_Rb_tree signature:(const _Val& __v) +std::_Rb_tree::_M_insert_unique cpp_src/stl_tree.h /^ _M_insert_unique(const_iterator __position, const _Val& __v)$/;" f class:std::_Rb_tree signature:(const_iterator __position, const _Val& __v) +std::_Rb_tree::_M_insert_unique cpp_src/stl_tree.h /^ _M_insert_unique(iterator __position, const _Val& __v)$/;" f class:std::_Rb_tree signature:(iterator __position, const _Val& __v) +std::_Rb_tree::_M_leftmost cpp_src/stl_tree.h /^ _M_leftmost() const$/;" f class:std::_Rb_tree access:protected signature:() const +std::_Rb_tree::_M_leftmost cpp_src/stl_tree.h /^ _M_leftmost()$/;" f class:std::_Rb_tree access:protected signature:() +std::_Rb_tree::_M_put_node cpp_src/stl_tree.h /^ _M_put_node(_Rb_tree_node* __p)$/;" f class:std::_Rb_tree access:protected signature:(_Rb_tree_node* __p) +std::_Rb_tree::_M_rightmost cpp_src/stl_tree.h /^ _M_rightmost() const$/;" f class:std::_Rb_tree access:protected signature:() const +std::_Rb_tree::_M_rightmost cpp_src/stl_tree.h /^ _M_rightmost()$/;" f class:std::_Rb_tree access:protected signature:() +std::_Rb_tree::_M_root cpp_src/stl_tree.h /^ _M_root() const$/;" f class:std::_Rb_tree access:protected signature:() const +std::_Rb_tree::_M_root cpp_src/stl_tree.h /^ _M_root()$/;" f class:std::_Rb_tree access:protected signature:() +std::_Rb_tree::_Node_allocator cpp_src/stl_tree.h /^ _Node_allocator;$/;" t class:std::_Rb_tree access:private +std::_Rb_tree::_Rb_tree cpp_src/stl_tree.h /^ _Rb_tree()$/;" f class:std::_Rb_tree access:public signature:() +std::_Rb_tree::_Rb_tree cpp_src/stl_tree.h /^ _Rb_tree(const _Compare& __comp)$/;" f class:std::_Rb_tree access:public signature:(const _Compare& __comp) +std::_Rb_tree::_Rb_tree cpp_src/stl_tree.h /^ _Rb_tree(const _Compare& __comp, const allocator_type& __a)$/;" f class:std::_Rb_tree access:public signature:(const _Compare& __comp, const allocator_type& __a) +std::_Rb_tree::_Rb_tree cpp_src/stl_tree.h /^ _Rb_tree(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x)$/;" f class:std::_Rb_tree access:public signature:(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x) +std::_Rb_tree::_Rb_tree_impl cpp_src/stl_tree.h /^ struct _Rb_tree_impl : public _Node_allocator$/;" s class:std::_Rb_tree inherits:_Node_allocator access:protected +std::_Rb_tree::_Rb_tree_impl cpp_src/stl_tree.h /^ struct _Rb_tree_impl<_Key_compare, true> : public _Node_allocator $/;" s class:std::_Rb_tree inherits:_Node_allocator access:protected +std::_Rb_tree::_Rb_tree_impl::_M_header cpp_src/stl_tree.h /^ _Rb_tree_node_base _M_header;$/;" m struct:std::_Rb_tree::_Rb_tree_impl access:public +std::_Rb_tree::_Rb_tree_impl::_M_key_compare cpp_src/stl_tree.h /^ _Key_compare _M_key_compare;$/;" m struct:std::_Rb_tree::_Rb_tree_impl access:public +std::_Rb_tree::_Rb_tree_impl::_M_key_compare cpp_src/stl_tree.h /^ _Key_compare _M_key_compare;$/;" m struct:std::_Rb_tree::_Rb_tree_impl access:public +std::_Rb_tree::_Rb_tree_impl::_M_node_count cpp_src/stl_tree.h /^ size_type _M_node_count; \/\/ Keeps track of size of tree.$/;" m struct:std::_Rb_tree::_Rb_tree_impl access:public +std::_Rb_tree::_Rb_tree_impl::_Rb_tree_impl cpp_src/stl_tree.h /^ _Rb_tree_impl(const _Node_allocator& __a = _Node_allocator(),$/;" f struct:std::_Rb_tree::_Rb_tree_impl access:public signature:(const _Node_allocator& __a = _Node_allocator(), const _Key_compare& __comp = _Key_compare()) +std::_Rb_tree::_Rb_tree_node cpp_src/stl_tree.h /^ typedef _Rb_tree_node<_Val> _Rb_tree_node;$/;" t class:std::_Rb_tree access:protected +std::_Rb_tree::_S_key cpp_src/stl_tree.h /^ _S_key(_Const_Base_ptr __x)$/;" f class:std::_Rb_tree access:protected signature:(_Const_Base_ptr __x) +std::_Rb_tree::_S_key cpp_src/stl_tree.h /^ _S_key(_Const_Link_type __x)$/;" f class:std::_Rb_tree access:protected signature:(_Const_Link_type __x) +std::_Rb_tree::_S_left cpp_src/stl_tree.h /^ _S_left(_Base_ptr __x)$/;" f class:std::_Rb_tree access:protected signature:(_Base_ptr __x) +std::_Rb_tree::_S_left cpp_src/stl_tree.h /^ _S_left(_Const_Base_ptr __x)$/;" f class:std::_Rb_tree access:protected signature:(_Const_Base_ptr __x) +std::_Rb_tree::_S_maximum cpp_src/stl_tree.h /^ _S_maximum(_Base_ptr __x)$/;" f class:std::_Rb_tree access:protected signature:(_Base_ptr __x) +std::_Rb_tree::_S_maximum cpp_src/stl_tree.h /^ _S_maximum(_Const_Base_ptr __x)$/;" f class:std::_Rb_tree access:protected signature:(_Const_Base_ptr __x) +std::_Rb_tree::_S_minimum cpp_src/stl_tree.h /^ _S_minimum(_Base_ptr __x)$/;" f class:std::_Rb_tree access:protected signature:(_Base_ptr __x) +std::_Rb_tree::_S_minimum cpp_src/stl_tree.h /^ _S_minimum(_Const_Base_ptr __x)$/;" f class:std::_Rb_tree access:protected signature:(_Const_Base_ptr __x) +std::_Rb_tree::_S_right cpp_src/stl_tree.h /^ _S_right(_Base_ptr __x)$/;" f class:std::_Rb_tree access:protected signature:(_Base_ptr __x) +std::_Rb_tree::_S_right cpp_src/stl_tree.h /^ _S_right(_Const_Base_ptr __x)$/;" f class:std::_Rb_tree access:protected signature:(_Const_Base_ptr __x) +std::_Rb_tree::_S_value cpp_src/stl_tree.h /^ _S_value(_Const_Base_ptr __x)$/;" f class:std::_Rb_tree access:protected signature:(_Const_Base_ptr __x) +std::_Rb_tree::_S_value cpp_src/stl_tree.h /^ _S_value(_Const_Link_type __x)$/;" f class:std::_Rb_tree access:protected signature:(_Const_Link_type __x) +std::_Rb_tree::__rb_verify cpp_src/stl_tree.h /^ __rb_verify() const;$/;" p class:std::_Rb_tree access:public signature:() const +std::_Rb_tree::__rb_verify cpp_src/stl_tree.h /^ _Rb_tree<_Key,_Val,_KeyOfValue,_Compare,_Alloc>::__rb_verify() const$/;" f class:std::_Rb_tree signature:() const +std::_Rb_tree::allocator_type cpp_src/stl_tree.h /^ typedef _Alloc allocator_type;$/;" t class:std::_Rb_tree access:public +std::_Rb_tree::begin cpp_src/stl_tree.h /^ begin() const$/;" f class:std::_Rb_tree access:public signature:() const +std::_Rb_tree::begin cpp_src/stl_tree.h /^ begin()$/;" f class:std::_Rb_tree access:public signature:() +std::_Rb_tree::clear cpp_src/stl_tree.h /^ clear()$/;" f class:std::_Rb_tree access:public signature:() +std::_Rb_tree::const_iterator cpp_src/stl_tree.h /^ typedef _Rb_tree_const_iterator const_iterator;$/;" t class:std::_Rb_tree access:public +std::_Rb_tree::const_pointer cpp_src/stl_tree.h /^ typedef const value_type* const_pointer;$/;" t class:std::_Rb_tree access:public +std::_Rb_tree::const_reference cpp_src/stl_tree.h /^ typedef const value_type& const_reference;$/;" t class:std::_Rb_tree access:public +std::_Rb_tree::const_reverse_iterator cpp_src/stl_tree.h /^ typedef std::reverse_iterator const_reverse_iterator;$/;" t class:std::_Rb_tree access:public +std::_Rb_tree::count cpp_src/stl_tree.h /^ count(const key_type& __x) const;$/;" p class:std::_Rb_tree access:public signature:(const key_type& __x) const +std::_Rb_tree::count cpp_src/stl_tree.h /^ count(const _Key& __k) const$/;" f class:std::_Rb_tree signature:(const _Key& __k) const +std::_Rb_tree::difference_type cpp_src/stl_tree.h /^ typedef ptrdiff_t difference_type;$/;" t class:std::_Rb_tree access:public +std::_Rb_tree::empty cpp_src/stl_tree.h /^ empty() const$/;" f class:std::_Rb_tree access:public signature:() const +std::_Rb_tree::end cpp_src/stl_tree.h /^ end() const$/;" f class:std::_Rb_tree access:public signature:() const +std::_Rb_tree::end cpp_src/stl_tree.h /^ end()$/;" f class:std::_Rb_tree access:public signature:() +std::_Rb_tree::equal_range cpp_src/stl_tree.h /^ equal_range(const key_type& __x) const;$/;" p class:std::_Rb_tree access:public signature:(const key_type& __x) const +std::_Rb_tree::equal_range cpp_src/stl_tree.h /^ equal_range(const key_type& __x);$/;" p class:std::_Rb_tree access:public signature:(const key_type& __x) +std::_Rb_tree::equal_range cpp_src/stl_tree.h /^ equal_range(const _Key& __k) const$/;" f class:std::_Rb_tree signature:(const _Key& __k) const +std::_Rb_tree::equal_range cpp_src/stl_tree.h /^ equal_range(const _Key& __k)$/;" f class:std::_Rb_tree signature:(const _Key& __k) +std::_Rb_tree::erase cpp_src/stl_tree.h /^ erase(const key_type& __x);$/;" p class:std::_Rb_tree access:public signature:(const key_type& __x) +std::_Rb_tree::erase cpp_src/stl_tree.h /^ erase(const key_type* __first, const key_type* __last);$/;" p class:std::_Rb_tree access:public signature:(const key_type* __first, const key_type* __last) +std::_Rb_tree::erase cpp_src/stl_tree.h /^ erase(const_iterator __first, const_iterator __last);$/;" p class:std::_Rb_tree access:public signature:(const_iterator __first, const_iterator __last) +std::_Rb_tree::erase cpp_src/stl_tree.h /^ erase(const_iterator __position);$/;" p class:std::_Rb_tree access:public signature:(const_iterator __position) +std::_Rb_tree::erase cpp_src/stl_tree.h /^ erase(iterator __first, iterator __last);$/;" p class:std::_Rb_tree access:public signature:(iterator __first, iterator __last) +std::_Rb_tree::erase cpp_src/stl_tree.h /^ erase(iterator __position);$/;" p class:std::_Rb_tree access:public signature:(iterator __position) +std::_Rb_tree::erase cpp_src/stl_tree.h /^ erase(const _Key& __x)$/;" f class:std::_Rb_tree signature:(const _Key& __x) +std::_Rb_tree::erase cpp_src/stl_tree.h /^ erase(const _Key* __first, const _Key* __last)$/;" f class:std::_Rb_tree signature:(const _Key* __first, const _Key* __last) +std::_Rb_tree::erase cpp_src/stl_tree.h /^ erase(const_iterator __first, const_iterator __last)$/;" f class:std::_Rb_tree signature:(const_iterator __first, const_iterator __last) +std::_Rb_tree::erase cpp_src/stl_tree.h /^ erase(const_iterator __position)$/;" f class:std::_Rb_tree signature:(const_iterator __position) +std::_Rb_tree::erase cpp_src/stl_tree.h /^ erase(iterator __first, iterator __last)$/;" f class:std::_Rb_tree signature:(iterator __first, iterator __last) +std::_Rb_tree::erase cpp_src/stl_tree.h /^ erase(iterator __position)$/;" f class:std::_Rb_tree signature:(iterator __position) +std::_Rb_tree::find cpp_src/stl_tree.h /^ find(const key_type& __x) const;$/;" p class:std::_Rb_tree access:public signature:(const key_type& __x) const +std::_Rb_tree::find cpp_src/stl_tree.h /^ find(const key_type& __x);$/;" p class:std::_Rb_tree access:public signature:(const key_type& __x) +std::_Rb_tree::find cpp_src/stl_tree.h /^ find(const _Key& __k) const$/;" f class:std::_Rb_tree signature:(const _Key& __k) const +std::_Rb_tree::find cpp_src/stl_tree.h /^ find(const _Key& __k)$/;" f class:std::_Rb_tree signature:(const _Key& __k) +std::_Rb_tree::get_allocator cpp_src/stl_tree.h /^ get_allocator() const$/;" f class:std::_Rb_tree access:public signature:() const +std::_Rb_tree::iterator cpp_src/stl_tree.h /^ typedef _Rb_tree_iterator iterator;$/;" t class:std::_Rb_tree access:public +std::_Rb_tree::key_comp cpp_src/stl_tree.h /^ key_comp() const$/;" f class:std::_Rb_tree access:public signature:() const +std::_Rb_tree::key_type cpp_src/stl_tree.h /^ typedef _Key key_type;$/;" t class:std::_Rb_tree access:public +std::_Rb_tree::lower_bound cpp_src/stl_tree.h /^ lower_bound(const key_type& __x) const;$/;" p class:std::_Rb_tree access:public signature:(const key_type& __x) const +std::_Rb_tree::lower_bound cpp_src/stl_tree.h /^ lower_bound(const key_type& __x);$/;" p class:std::_Rb_tree access:public signature:(const key_type& __x) +std::_Rb_tree::lower_bound cpp_src/stl_tree.h /^ lower_bound(const _Key& __k) const$/;" f class:std::_Rb_tree signature:(const _Key& __k) const +std::_Rb_tree::lower_bound cpp_src/stl_tree.h /^ lower_bound(const _Key& __k)$/;" f class:std::_Rb_tree signature:(const _Key& __k) +std::_Rb_tree::max_size cpp_src/stl_tree.h /^ max_size() const$/;" f class:std::_Rb_tree access:public signature:() const +std::_Rb_tree::operator = cpp_src/stl_tree.h /^ operator=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x);$/;" p class:std::_Rb_tree access:public signature:(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x) +std::_Rb_tree::operator = cpp_src/stl_tree.h /^ operator=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x)$/;" f class:std::_Rb_tree signature:(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x) +std::_Rb_tree::pointer cpp_src/stl_tree.h /^ typedef value_type* pointer;$/;" t class:std::_Rb_tree access:public +std::_Rb_tree::rbegin cpp_src/stl_tree.h /^ rbegin() const$/;" f class:std::_Rb_tree access:public signature:() const +std::_Rb_tree::rbegin cpp_src/stl_tree.h /^ rbegin()$/;" f class:std::_Rb_tree access:public signature:() +std::_Rb_tree::reference cpp_src/stl_tree.h /^ typedef value_type& reference;$/;" t class:std::_Rb_tree access:public +std::_Rb_tree::rend cpp_src/stl_tree.h /^ rend() const$/;" f class:std::_Rb_tree access:public signature:() const +std::_Rb_tree::rend cpp_src/stl_tree.h /^ rend()$/;" f class:std::_Rb_tree access:public signature:() +std::_Rb_tree::reverse_iterator cpp_src/stl_tree.h /^ typedef std::reverse_iterator reverse_iterator;$/;" t class:std::_Rb_tree access:public +std::_Rb_tree::size cpp_src/stl_tree.h /^ size() const$/;" f class:std::_Rb_tree access:public signature:() const +std::_Rb_tree::size_type cpp_src/stl_tree.h /^ typedef size_t size_type;$/;" t class:std::_Rb_tree access:public +std::_Rb_tree::swap cpp_src/stl_tree.h /^ swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __t);$/;" p class:std::_Rb_tree access:public signature:(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __t) +std::_Rb_tree::swap cpp_src/stl_tree.h /^ swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __t)$/;" f class:std::_Rb_tree signature:(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __t) +std::_Rb_tree::upper_bound cpp_src/stl_tree.h /^ upper_bound(const key_type& __x) const;$/;" p class:std::_Rb_tree access:public signature:(const key_type& __x) const +std::_Rb_tree::upper_bound cpp_src/stl_tree.h /^ upper_bound(const key_type& __x);$/;" p class:std::_Rb_tree access:public signature:(const key_type& __x) +std::_Rb_tree::upper_bound cpp_src/stl_tree.h /^ upper_bound(const _Key& __k) const$/;" f class:std::_Rb_tree signature:(const _Key& __k) const +std::_Rb_tree::upper_bound cpp_src/stl_tree.h /^ upper_bound(const _Key& __k)$/;" f class:std::_Rb_tree signature:(const _Key& __k) +std::_Rb_tree::value_type cpp_src/stl_tree.h /^ typedef _Val value_type;$/;" t class:std::_Rb_tree access:public +std::_Rb_tree::~_Rb_tree cpp_src/stl_tree.h /^ ~_Rb_tree()$/;" f class:std::_Rb_tree access:public signature:() +std::_Rb_tree_black_count cpp_src/stl_tree.h /^ _Rb_tree_black_count(const _Rb_tree_node_base* __node,$/;" p namespace:std signature:(const _Rb_tree_node_base* __node, const _Rb_tree_node_base* __root) +std::_Rb_tree_color cpp_src/stl_tree.h /^ enum _Rb_tree_color { _S_red = false, _S_black = true };$/;" g namespace:std +std::_Rb_tree_const_iterator cpp_src/stl_tree.h /^ struct _Rb_tree_const_iterator$/;" s namespace:std +std::_Rb_tree_const_iterator::_Base_ptr cpp_src/stl_tree.h /^ typedef _Rb_tree_node_base::_Const_Base_ptr _Base_ptr;$/;" t struct:std::_Rb_tree_const_iterator access:public +std::_Rb_tree_const_iterator::_Link_type cpp_src/stl_tree.h /^ typedef const _Rb_tree_node<_Tp>* _Link_type;$/;" t struct:std::_Rb_tree_const_iterator access:public +std::_Rb_tree_const_iterator::_M_node cpp_src/stl_tree.h /^ _Base_ptr _M_node;$/;" m struct:std::_Rb_tree_const_iterator access:public +std::_Rb_tree_const_iterator::_Rb_tree_const_iterator cpp_src/stl_tree.h /^ _Rb_tree_const_iterator()$/;" f struct:std::_Rb_tree_const_iterator access:public signature:() +std::_Rb_tree_const_iterator::_Rb_tree_const_iterator cpp_src/stl_tree.h /^ _Rb_tree_const_iterator(_Link_type __x)$/;" f struct:std::_Rb_tree_const_iterator access:public signature:(_Link_type __x) +std::_Rb_tree_const_iterator::_Rb_tree_const_iterator cpp_src/stl_tree.h /^ _Rb_tree_const_iterator(const iterator& __it)$/;" f struct:std::_Rb_tree_const_iterator access:public signature:(const iterator& __it) +std::_Rb_tree_const_iterator::_Self cpp_src/stl_tree.h /^ typedef _Rb_tree_const_iterator<_Tp> _Self;$/;" t struct:std::_Rb_tree_const_iterator access:public +std::_Rb_tree_const_iterator::difference_type cpp_src/stl_tree.h /^ typedef ptrdiff_t difference_type;$/;" t struct:std::_Rb_tree_const_iterator access:public +std::_Rb_tree_const_iterator::iterator cpp_src/stl_tree.h /^ typedef _Rb_tree_iterator<_Tp> iterator;$/;" t struct:std::_Rb_tree_const_iterator access:public +std::_Rb_tree_const_iterator::iterator_category cpp_src/stl_tree.h /^ typedef bidirectional_iterator_tag iterator_category;$/;" t struct:std::_Rb_tree_const_iterator access:public +std::_Rb_tree_const_iterator::operator != cpp_src/stl_tree.h /^ operator!=(const _Self& __x) const$/;" f struct:std::_Rb_tree_const_iterator access:public signature:(const _Self& __x) const +std::_Rb_tree_const_iterator::operator * cpp_src/stl_tree.h /^ operator*() const$/;" f struct:std::_Rb_tree_const_iterator access:public signature:() const +std::_Rb_tree_const_iterator::operator ++ cpp_src/stl_tree.h /^ operator++()$/;" f struct:std::_Rb_tree_const_iterator access:public signature:() +std::_Rb_tree_const_iterator::operator ++ cpp_src/stl_tree.h /^ operator++(int)$/;" f struct:std::_Rb_tree_const_iterator access:public signature:(int) +std::_Rb_tree_const_iterator::operator -- cpp_src/stl_tree.h /^ operator--()$/;" f struct:std::_Rb_tree_const_iterator access:public signature:() +std::_Rb_tree_const_iterator::operator -- cpp_src/stl_tree.h /^ operator--(int)$/;" f struct:std::_Rb_tree_const_iterator access:public signature:(int) +std::_Rb_tree_const_iterator::operator -> cpp_src/stl_tree.h /^ operator->() const$/;" f struct:std::_Rb_tree_const_iterator access:public signature:() const +std::_Rb_tree_const_iterator::operator == cpp_src/stl_tree.h /^ operator==(const _Self& __x) const$/;" f struct:std::_Rb_tree_const_iterator access:public signature:(const _Self& __x) const +std::_Rb_tree_const_iterator::pointer cpp_src/stl_tree.h /^ typedef const _Tp* pointer;$/;" t struct:std::_Rb_tree_const_iterator access:public +std::_Rb_tree_const_iterator::reference cpp_src/stl_tree.h /^ typedef const _Tp& reference;$/;" t struct:std::_Rb_tree_const_iterator access:public +std::_Rb_tree_const_iterator::value_type cpp_src/stl_tree.h /^ typedef _Tp value_type;$/;" t struct:std::_Rb_tree_const_iterator access:public +std::_Rb_tree_decrement cpp_src/stl_tree.h /^ _Rb_tree_decrement(_Rb_tree_node_base* __x);$/;" p namespace:std signature:(_Rb_tree_node_base* __x) +std::_Rb_tree_decrement cpp_src/stl_tree.h /^ _Rb_tree_decrement(const _Rb_tree_node_base* __x);$/;" p namespace:std signature:(const _Rb_tree_node_base* __x) +std::_Rb_tree_increment cpp_src/stl_tree.h /^ _Rb_tree_increment(_Rb_tree_node_base* __x);$/;" p namespace:std signature:(_Rb_tree_node_base* __x) +std::_Rb_tree_increment cpp_src/stl_tree.h /^ _Rb_tree_increment(const _Rb_tree_node_base* __x);$/;" p namespace:std signature:(const _Rb_tree_node_base* __x) +std::_Rb_tree_insert_and_rebalance cpp_src/stl_tree.h /^ _Rb_tree_insert_and_rebalance(const bool __insert_left,$/;" p namespace:std signature:(const bool __insert_left, _Rb_tree_node_base* __x, _Rb_tree_node_base* __p, _Rb_tree_node_base& __header) +std::_Rb_tree_iterator cpp_src/stl_tree.h /^ struct _Rb_tree_iterator$/;" s namespace:std +std::_Rb_tree_iterator::_Base_ptr cpp_src/stl_tree.h /^ typedef _Rb_tree_node_base::_Base_ptr _Base_ptr;$/;" t struct:std::_Rb_tree_iterator access:public +std::_Rb_tree_iterator::_Link_type cpp_src/stl_tree.h /^ typedef _Rb_tree_node<_Tp>* _Link_type;$/;" t struct:std::_Rb_tree_iterator access:public +std::_Rb_tree_iterator::_M_node cpp_src/stl_tree.h /^ _Base_ptr _M_node;$/;" m struct:std::_Rb_tree_iterator access:public +std::_Rb_tree_iterator::_Rb_tree_iterator cpp_src/stl_tree.h /^ _Rb_tree_iterator()$/;" f struct:std::_Rb_tree_iterator access:public signature:() +std::_Rb_tree_iterator::_Rb_tree_iterator cpp_src/stl_tree.h /^ _Rb_tree_iterator(_Link_type __x)$/;" f struct:std::_Rb_tree_iterator access:public signature:(_Link_type __x) +std::_Rb_tree_iterator::_Self cpp_src/stl_tree.h /^ typedef _Rb_tree_iterator<_Tp> _Self;$/;" t struct:std::_Rb_tree_iterator access:public +std::_Rb_tree_iterator::difference_type cpp_src/stl_tree.h /^ typedef ptrdiff_t difference_type;$/;" t struct:std::_Rb_tree_iterator access:public +std::_Rb_tree_iterator::iterator_category cpp_src/stl_tree.h /^ typedef bidirectional_iterator_tag iterator_category;$/;" t struct:std::_Rb_tree_iterator access:public +std::_Rb_tree_iterator::operator != cpp_src/stl_tree.h /^ operator!=(const _Self& __x) const$/;" f struct:std::_Rb_tree_iterator access:public signature:(const _Self& __x) const +std::_Rb_tree_iterator::operator * cpp_src/stl_tree.h /^ operator*() const$/;" f struct:std::_Rb_tree_iterator access:public signature:() const +std::_Rb_tree_iterator::operator ++ cpp_src/stl_tree.h /^ operator++()$/;" f struct:std::_Rb_tree_iterator access:public signature:() +std::_Rb_tree_iterator::operator ++ cpp_src/stl_tree.h /^ operator++(int)$/;" f struct:std::_Rb_tree_iterator access:public signature:(int) +std::_Rb_tree_iterator::operator -- cpp_src/stl_tree.h /^ operator--()$/;" f struct:std::_Rb_tree_iterator access:public signature:() +std::_Rb_tree_iterator::operator -- cpp_src/stl_tree.h /^ operator--(int)$/;" f struct:std::_Rb_tree_iterator access:public signature:(int) +std::_Rb_tree_iterator::operator -> cpp_src/stl_tree.h /^ operator->() const$/;" f struct:std::_Rb_tree_iterator access:public signature:() const +std::_Rb_tree_iterator::operator == cpp_src/stl_tree.h /^ operator==(const _Self& __x) const$/;" f struct:std::_Rb_tree_iterator access:public signature:(const _Self& __x) const +std::_Rb_tree_iterator::pointer cpp_src/stl_tree.h /^ typedef _Tp* pointer;$/;" t struct:std::_Rb_tree_iterator access:public +std::_Rb_tree_iterator::reference cpp_src/stl_tree.h /^ typedef _Tp& reference;$/;" t struct:std::_Rb_tree_iterator access:public +std::_Rb_tree_iterator::value_type cpp_src/stl_tree.h /^ typedef _Tp value_type;$/;" t struct:std::_Rb_tree_iterator access:public +std::_Rb_tree_node cpp_src/stl_tree.h /^ struct _Rb_tree_node : public _Rb_tree_node_base$/;" s namespace:std inherits:_Rb_tree_node_base +std::_Rb_tree_node::_Link_type cpp_src/stl_tree.h /^ typedef _Rb_tree_node<_Val>* _Link_type;$/;" t struct:std::_Rb_tree_node access:public +std::_Rb_tree_node::_M_value_field cpp_src/stl_tree.h /^ _Val _M_value_field;$/;" m struct:std::_Rb_tree_node access:public +std::_Rb_tree_node_base cpp_src/stl_tree.h /^ struct _Rb_tree_node_base$/;" s namespace:std +std::_Rb_tree_node_base::_Base_ptr cpp_src/stl_tree.h /^ typedef _Rb_tree_node_base* _Base_ptr;$/;" t struct:std::_Rb_tree_node_base access:public +std::_Rb_tree_node_base::_Const_Base_ptr cpp_src/stl_tree.h /^ typedef const _Rb_tree_node_base* _Const_Base_ptr;$/;" t struct:std::_Rb_tree_node_base access:public +std::_Rb_tree_node_base::_M_color cpp_src/stl_tree.h /^ _Rb_tree_color _M_color;$/;" m struct:std::_Rb_tree_node_base access:public +std::_Rb_tree_node_base::_M_left cpp_src/stl_tree.h /^ _Base_ptr _M_left;$/;" m struct:std::_Rb_tree_node_base access:public +std::_Rb_tree_node_base::_M_parent cpp_src/stl_tree.h /^ _Base_ptr _M_parent;$/;" m struct:std::_Rb_tree_node_base access:public +std::_Rb_tree_node_base::_M_right cpp_src/stl_tree.h /^ _Base_ptr _M_right;$/;" m struct:std::_Rb_tree_node_base access:public +std::_Rb_tree_node_base::_S_maximum cpp_src/stl_tree.h /^ _S_maximum(_Base_ptr __x)$/;" f struct:std::_Rb_tree_node_base access:public signature:(_Base_ptr __x) +std::_Rb_tree_node_base::_S_maximum cpp_src/stl_tree.h /^ _S_maximum(_Const_Base_ptr __x)$/;" f struct:std::_Rb_tree_node_base access:public signature:(_Const_Base_ptr __x) +std::_Rb_tree_node_base::_S_minimum cpp_src/stl_tree.h /^ _S_minimum(_Base_ptr __x)$/;" f struct:std::_Rb_tree_node_base access:public signature:(_Base_ptr __x) +std::_Rb_tree_node_base::_S_minimum cpp_src/stl_tree.h /^ _S_minimum(_Const_Base_ptr __x)$/;" f struct:std::_Rb_tree_node_base access:public signature:(_Const_Base_ptr __x) +std::_Rb_tree_rebalance_for_erase cpp_src/stl_tree.h /^ _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* const __z,$/;" p namespace:std signature:(_Rb_tree_node_base* const __z, _Rb_tree_node_base& __header) +std::_Rb_tree_rotate_left cpp_src/stl_tree.h /^ _Rb_tree_rotate_left(_Rb_tree_node_base* const __x,$/;" p namespace:std signature:(_Rb_tree_node_base* const __x, _Rb_tree_node_base*& __root) +std::_Rb_tree_rotate_right cpp_src/stl_tree.h /^ _Rb_tree_rotate_right(_Rb_tree_node_base* const __x,$/;" p namespace:std signature:(_Rb_tree_node_base* const __x, _Rb_tree_node_base*& __root) +std::_RefFunClos cpp_src/valarray_before.h /^ struct _RefFunClos<_Expr, _Dom>$/;" s namespace:std inherits:_FunBase +std::_RefFunClos cpp_src/valarray_before.h /^ struct _RefFunClos<_ValArray, _Tp>$/;" s namespace:std inherits:_FunBase +std::_RefFunClos::_Base cpp_src/valarray_before.h /^ typedef _FunBase<_Dom, const typename _Dom::value_type&> _Base;$/;" t struct:std::_RefFunClos access:public +std::_RefFunClos::_Base cpp_src/valarray_before.h /^ typedef _FunBase, const _Tp&> _Base;$/;" t struct:std::_RefFunClos access:public +std::_RefFunClos::_RefFunClos cpp_src/valarray_before.h /^ _RefFunClos(const _Dom& __e, _Tp __f(const _Tp&))$/;" f struct:std::_RefFunClos access:public signature:(const _Dom& __e, _Tp __f(const _Tp&)) +std::_RefFunClos::_RefFunClos cpp_src/valarray_before.h /^ _RefFunClos(const valarray<_Tp>& __v, _Tp __f(const _Tp&))$/;" f struct:std::_RefFunClos access:public signature:(const valarray<_Tp>& __v, _Tp __f(const _Tp&)) +std::_RefFunClos::_Tp cpp_src/valarray_before.h /^ typedef value_type _Tp;$/;" t struct:std::_RefFunClos access:public +std::_RefFunClos::value_type cpp_src/valarray_before.h /^ typedef _Tp value_type;$/;" t struct:std::_RefFunClos access:public +std::_RefFunClos::value_type cpp_src/valarray_before.h /^ typedef typename _Base::value_type value_type;$/;" t struct:std::_RefFunClos access:public +std::_Resetiosflags cpp_src/iomanip /^ struct _Resetiosflags { ios_base::fmtflags _M_mask; };$/;" s namespace:std file: +std::_Resetiosflags::_M_mask cpp_src/iomanip /^ struct _Resetiosflags { ios_base::fmtflags _M_mask; };$/;" m struct:std::_Resetiosflags file: access:public +std::_Ret cpp_src/stl_function.h /^ mem_fun(_Ret (_Tp::*__f)() const)$/;" f namespace:std signature:(_Tp::*__f) const +std::_Ret cpp_src/stl_function.h /^ mem_fun(_Ret (_Tp::*__f)())$/;" f namespace:std signature:(_Tp::*__f) +std::_Ret cpp_src/stl_function.h /^ mem_fun(_Ret (_Tp::*__f)(_Arg) const)$/;" f namespace:std signature:(_Tp::*__f) const +std::_Ret cpp_src/stl_function.h /^ mem_fun(_Ret (_Tp::*__f)(_Arg))$/;" f namespace:std signature:(_Tp::*__f) +std::_Ret cpp_src/stl_function.h /^ mem_fun_ref(_Ret (_Tp::*__f)() const)$/;" f namespace:std signature:(_Tp::*__f) const +std::_Ret cpp_src/stl_function.h /^ mem_fun_ref(_Ret (_Tp::*__f)())$/;" f namespace:std signature:(_Tp::*__f) +std::_Ret cpp_src/stl_function.h /^ mem_fun_ref(_Ret (_Tp::*__f)(_Arg) const)$/;" f namespace:std signature:(_Tp::*__f) const +std::_Ret cpp_src/stl_function.h /^ mem_fun_ref(_Ret (_Tp::*__f)(_Arg))$/;" f namespace:std signature:(_Tp::*__f) +std::_SBase cpp_src/valarray_before.h /^ class _SBase$/;" c namespace:std +std::_SBase cpp_src/valarray_before.h /^ class _SBase<_Array<_Tp> >$/;" c namespace:std +std::_SBase::_M_array cpp_src/valarray_before.h /^ const _Array<_Tp> _M_array;$/;" m class:std::_SBase access:private +std::_SBase::_M_expr cpp_src/valarray_before.h /^ const _Dom& _M_expr;$/;" m class:std::_SBase access:private +std::_SBase::_M_size cpp_src/valarray_before.h /^ const size_t _M_size;$/;" m class:std::_SBase access:private +std::_SBase::_M_slice cpp_src/valarray_before.h /^ const slice& _M_slice;$/;" m class:std::_SBase access:private +std::_SBase::_M_stride cpp_src/valarray_before.h /^ const size_t _M_stride;$/;" m class:std::_SBase access:private +std::_SBase::_SBase cpp_src/valarray_before.h /^ _SBase (_Array<_Tp> __a, const slice& __s)$/;" f class:std::_SBase access:public signature:(_Array<_Tp> __a, const slice& __s) +std::_SBase::_SBase cpp_src/valarray_before.h /^ _SBase (const _Dom& __e, const slice& __s)$/;" f class:std::_SBase access:public signature:(const _Dom& __e, const slice& __s) +std::_SBase::operator [] cpp_src/valarray_before.h /^ operator[] (size_t __i) const$/;" f class:std::_SBase access:public signature:(size_t __i) const +std::_SBase::size cpp_src/valarray_before.h /^ size() const$/;" f class:std::_SBase access:public signature:() const +std::_SBase::value_type cpp_src/valarray_before.h /^ typedef _Tp value_type;$/;" t class:std::_SBase access:public +std::_SBase::value_type cpp_src/valarray_before.h /^ typedef typename _Dom::value_type value_type;$/;" t class:std::_SBase access:public +std::_SClos cpp_src/valarray_before.h /^ struct _SClos<_Expr, _Dom>$/;" s namespace:std inherits:_SBase +std::_SClos cpp_src/valarray_before.h /^ struct _SClos<_ValArray, _Tp>$/;" s namespace:std inherits:_SBase +std::_SClos::_Base cpp_src/valarray_before.h /^ typedef _SBase<_Array<_Tp> > _Base;$/;" t struct:std::_SClos access:public +std::_SClos::_Base cpp_src/valarray_before.h /^ typedef _SBase<_Dom> _Base;$/;" t struct:std::_SClos access:public +std::_SClos::_SClos cpp_src/valarray_before.h /^ _SClos (_Array<_Tp> __a, const slice& __s) : _Base (__a, __s) {}$/;" f struct:std::_SClos access:public signature:(_Array<_Tp> __a, const slice& __s) +std::_SClos::_SClos cpp_src/valarray_before.h /^ _SClos (const _Dom& __e, const slice& __s) : _Base (__e, __s) {}$/;" f struct:std::_SClos access:public signature:(const _Dom& __e, const slice& __s) +std::_SClos::value_type cpp_src/valarray_before.h /^ typedef _Tp value_type;$/;" t struct:std::_SClos access:public +std::_SClos::value_type cpp_src/valarray_before.h /^ typedef typename _Base::value_type value_type;$/;" t struct:std::_SClos access:public +std::_S_adjustfield cpp_src/ios_base.h /^ _S_adjustfield = _S_left | _S_right | _S_internal,$/;" e enum:std::_Ios_Fmtflags +std::_S_app cpp_src/ios_base.h /^ _S_app = 1L << 0,$/;" e enum:std::_Ios_Openmode +std::_S_ate cpp_src/ios_base.h /^ _S_ate = 1L << 1,$/;" e enum:std::_Ios_Openmode +std::_S_badbit cpp_src/ios_base.h /^ _S_badbit = 1L << 0,$/;" e enum:std::_Ios_Iostate +std::_S_basefield cpp_src/ios_base.h /^ _S_basefield = _S_dec | _S_oct | _S_hex,$/;" e enum:std::_Ios_Fmtflags +std::_S_beg cpp_src/ios_base.h /^ _S_beg = 0,$/;" e enum:std::_Ios_Seekdir +std::_S_bin cpp_src/ios_base.h /^ _S_bin = 1L << 2,$/;" e enum:std::_Ios_Openmode +std::_S_black cpp_src/stl_tree.h /^ enum _Rb_tree_color { _S_red = false, _S_black = true };$/;" e enum:std::_Rb_tree_color +std::_S_boolalpha cpp_src/ios_base.h /^ _S_boolalpha = 1L << 0,$/;" e enum:std::_Ios_Fmtflags +std::_S_chunk_size cpp_src/stl_algo.h /^ enum { _S_chunk_size = 7 };$/;" e enum:std::__anon11 +std::_S_cur cpp_src/ios_base.h /^ _S_cur = SEEK_CUR,$/;" e enum:std::_Ios_Seekdir +std::_S_dec cpp_src/ios_base.h /^ _S_dec = 1L << 1,$/;" e enum:std::_Ios_Fmtflags +std::_S_end cpp_src/ios_base.h /^ _S_end = SEEK_END,$/;" e enum:std::_Ios_Seekdir +std::_S_eofbit cpp_src/ios_base.h /^ _S_eofbit = 1L << 1,$/;" e enum:std::_Ios_Iostate +std::_S_failbit cpp_src/ios_base.h /^ _S_failbit = 1L << 2,$/;" e enum:std::_Ios_Iostate +std::_S_fixed cpp_src/ios_base.h /^ _S_fixed = 1L << 2,$/;" e enum:std::_Ios_Fmtflags +std::_S_floatfield cpp_src/ios_base.h /^ _S_floatfield = _S_scientific | _S_fixed,$/;" e enum:std::_Ios_Fmtflags +std::_S_goodbit cpp_src/ios_base.h /^ _S_goodbit = 0,$/;" e enum:std::_Ios_Iostate +std::_S_hex cpp_src/ios_base.h /^ _S_hex = 1L << 3,$/;" e enum:std::_Ios_Fmtflags +std::_S_in cpp_src/ios_base.h /^ _S_in = 1L << 3,$/;" e enum:std::_Ios_Openmode +std::_S_internal cpp_src/ios_base.h /^ _S_internal = 1L << 4,$/;" e enum:std::_Ios_Fmtflags +std::_S_ios_fmtflags_end cpp_src/ios_base.h /^ _S_ios_fmtflags_end = 1L << 16 $/;" e enum:std::_Ios_Fmtflags +std::_S_ios_iostate_end cpp_src/ios_base.h /^ _S_ios_iostate_end = 1L << 16 $/;" e enum:std::_Ios_Iostate +std::_S_ios_openmode_end cpp_src/ios_base.h /^ _S_ios_openmode_end = 1L << 16 $/;" e enum:std::_Ios_Openmode +std::_S_ios_seekdir_end cpp_src/ios_base.h /^ _S_ios_seekdir_end = 1L << 16 $/;" e enum:std::_Ios_Seekdir +std::_S_left cpp_src/ios_base.h /^ _S_left = 1L << 5,$/;" e enum:std::_Ios_Fmtflags +std::_S_oct cpp_src/ios_base.h /^ _S_oct = 1L << 6,$/;" e enum:std::_Ios_Fmtflags +std::_S_out cpp_src/ios_base.h /^ _S_out = 1L << 4,$/;" e enum:std::_Ios_Openmode +std::_S_red cpp_src/stl_tree.h /^ enum _Rb_tree_color { _S_red = false, _S_black = true };$/;" e enum:std::_Rb_tree_color +std::_S_right cpp_src/ios_base.h /^ _S_right = 1L << 7,$/;" e enum:std::_Ios_Fmtflags +std::_S_scientific cpp_src/ios_base.h /^ _S_scientific = 1L << 8,$/;" e enum:std::_Ios_Fmtflags +std::_S_showbase cpp_src/ios_base.h /^ _S_showbase = 1L << 9,$/;" e enum:std::_Ios_Fmtflags +std::_S_showpoint cpp_src/ios_base.h /^ _S_showpoint = 1L << 10,$/;" e enum:std::_Ios_Fmtflags +std::_S_showpos cpp_src/ios_base.h /^ _S_showpos = 1L << 11,$/;" e enum:std::_Ios_Fmtflags +std::_S_skipws cpp_src/ios_base.h /^ _S_skipws = 1L << 12,$/;" e enum:std::_Ios_Fmtflags +std::_S_threshold cpp_src/stl_algo.h /^ enum { _S_threshold = 16 };$/;" e enum:std::__anon10 +std::_S_trunc cpp_src/ios_base.h /^ _S_trunc = 1L << 5,$/;" e enum:std::_Ios_Openmode +std::_S_unitbuf cpp_src/ios_base.h /^ _S_unitbuf = 1L << 13,$/;" e enum:std::_Ios_Fmtflags +std::_S_uppercase cpp_src/ios_base.h /^ _S_uppercase = 1L << 14,$/;" e enum:std::_Ios_Fmtflags +std::_S_word_bit cpp_src/stl_bvector.h /^ enum { _S_word_bit = int(CHAR_BIT * sizeof(_Bit_type)) };$/;" e enum:std::__anon6 +std::_Sanitize cpp_src/bitset /^ struct _Sanitize$/;" s namespace:std file: +std::_Sanitize cpp_src/bitset /^ struct _Sanitize<0>$/;" s namespace:std file: +std::_Sanitize::_S_do_sanitize cpp_src/bitset /^ static void _S_do_sanitize(unsigned long& __val)$/;" f struct:std::_Sanitize access:public signature:(unsigned long& __val) +std::_Sanitize::_S_do_sanitize cpp_src/bitset /^ { static void _S_do_sanitize(unsigned long) {} };$/;" f struct:std::_Sanitize access:public signature:(unsigned long) +std::_Select1st cpp_src/stl_function.h /^ struct _Select1st : public unary_function<_Pair,$/;" s namespace:std inherits:unary_function +std::_Select1st::operator () cpp_src/stl_function.h /^ operator()(_Pair& __x) const$/;" f struct:std::_Select1st access:public signature:(_Pair& __x) const +std::_Select1st::operator () cpp_src/stl_function.h /^ operator()(const _Pair& __x) const$/;" f struct:std::_Select1st access:public signature:(const _Pair& __x) const +std::_Select2nd cpp_src/stl_function.h /^ struct _Select2nd : public unary_function<_Pair,$/;" s namespace:std inherits:unary_function +std::_Select2nd::operator () cpp_src/stl_function.h /^ operator()(_Pair& __x) const$/;" f struct:std::_Select2nd access:public signature:(_Pair& __x) const +std::_Select2nd::operator () cpp_src/stl_function.h /^ operator()(const _Pair& __x) const$/;" f struct:std::_Select2nd access:public signature:(const _Pair& __x) const +std::_Setbase cpp_src/iomanip /^ struct _Setbase { int _M_base; };$/;" s namespace:std file: +std::_Setbase::_M_base cpp_src/iomanip /^ struct _Setbase { int _M_base; };$/;" m struct:std::_Setbase file: access:public +std::_Setfill cpp_src/iomanip /^ struct _Setfill { _CharT _M_c; };$/;" s namespace:std file: +std::_Setfill::_M_c cpp_src/iomanip /^ struct _Setfill { _CharT _M_c; };$/;" m struct:std::_Setfill file: access:public +std::_Setiosflags cpp_src/iomanip /^ struct _Setiosflags { ios_base::fmtflags _M_mask; };$/;" s namespace:std file: +std::_Setiosflags::_M_mask cpp_src/iomanip /^ struct _Setiosflags { ios_base::fmtflags _M_mask; };$/;" m struct:std::_Setiosflags file: access:public +std::_Setprecision cpp_src/iomanip /^ struct _Setprecision { int _M_n; };$/;" s namespace:std file: +std::_Setprecision::_M_n cpp_src/iomanip /^ struct _Setprecision { int _M_n; };$/;" m struct:std::_Setprecision file: access:public +std::_Setw cpp_src/iomanip /^ struct _Setw { int _M_n; };$/;" s namespace:std file: +std::_Setw::_M_n cpp_src/iomanip /^ struct _Setw { int _M_n; };$/;" m struct:std::_Setw file: access:public +std::_Temporary_buffer cpp_src/stl_tempbuf.h /^ class _Temporary_buffer$/;" c namespace:std +std::_Temporary_buffer::_M_buffer cpp_src/stl_tempbuf.h /^ pointer _M_buffer;$/;" m class:std::_Temporary_buffer access:protected +std::_Temporary_buffer::_M_initialize_buffer cpp_src/stl_tempbuf.h /^ _M_initialize_buffer(const _Tp& __val, __false_type)$/;" f class:std::_Temporary_buffer access:protected signature:(const _Tp& __val, __false_type) +std::_Temporary_buffer::_M_initialize_buffer cpp_src/stl_tempbuf.h /^ _M_initialize_buffer(const _Tp&, __true_type) { }$/;" f class:std::_Temporary_buffer access:protected signature:(const _Tp&, __true_type) +std::_Temporary_buffer::_M_len cpp_src/stl_tempbuf.h /^ size_type _M_len;$/;" m class:std::_Temporary_buffer access:protected +std::_Temporary_buffer::_M_original_len cpp_src/stl_tempbuf.h /^ size_type _M_original_len;$/;" m class:std::_Temporary_buffer access:protected +std::_Temporary_buffer::_Temporary_buffer cpp_src/stl_tempbuf.h /^ _Temporary_buffer(_ForwardIterator __first, _ForwardIterator __last);$/;" p class:std::_Temporary_buffer access:public signature:(_ForwardIterator __first, _ForwardIterator __last) +std::_Temporary_buffer::_Temporary_buffer cpp_src/stl_tempbuf.h /^ _Temporary_buffer(const _Temporary_buffer&);$/;" p class:std::_Temporary_buffer access:private signature:(const _Temporary_buffer&) +std::_Temporary_buffer::_Temporary_buffer cpp_src/stl_tempbuf.h /^ _Temporary_buffer(_ForwardIterator __first, _ForwardIterator __last)$/;" f class:std::_Temporary_buffer signature:(_ForwardIterator __first, _ForwardIterator __last) +std::_Temporary_buffer::begin cpp_src/stl_tempbuf.h /^ begin()$/;" f class:std::_Temporary_buffer access:public signature:() +std::_Temporary_buffer::end cpp_src/stl_tempbuf.h /^ end()$/;" f class:std::_Temporary_buffer access:public signature:() +std::_Temporary_buffer::iterator cpp_src/stl_tempbuf.h /^ typedef pointer iterator;$/;" t class:std::_Temporary_buffer access:public +std::_Temporary_buffer::operator = cpp_src/stl_tempbuf.h /^ operator=(const _Temporary_buffer&);$/;" p class:std::_Temporary_buffer access:private signature:(const _Temporary_buffer&) +std::_Temporary_buffer::pointer cpp_src/stl_tempbuf.h /^ typedef value_type* pointer;$/;" t class:std::_Temporary_buffer access:public +std::_Temporary_buffer::requested_size cpp_src/stl_tempbuf.h /^ requested_size() const$/;" f class:std::_Temporary_buffer access:public signature:() const +std::_Temporary_buffer::size cpp_src/stl_tempbuf.h /^ size() const$/;" f class:std::_Temporary_buffer access:public signature:() const +std::_Temporary_buffer::size_type cpp_src/stl_tempbuf.h /^ typedef ptrdiff_t size_type;$/;" t class:std::_Temporary_buffer access:public +std::_Temporary_buffer::value_type cpp_src/stl_tempbuf.h /^ typedef _Tp value_type;$/;" t class:std::_Temporary_buffer access:public +std::_Temporary_buffer::~_Temporary_buffer cpp_src/stl_tempbuf.h /^ ~_Temporary_buffer()$/;" f class:std::_Temporary_buffer access:public signature:() +std::_UnBase cpp_src/valarray_before.h /^ class _UnBase$/;" c namespace:std +std::_UnBase::_M_expr cpp_src/valarray_before.h /^ const _Arg& _M_expr;$/;" m class:std::_UnBase access:private +std::_UnBase::_UnBase cpp_src/valarray_before.h /^ _UnBase(const _Arg& __e) : _M_expr(__e) {}$/;" f class:std::_UnBase access:public signature:(const _Arg& __e) +std::_UnBase::_Vt cpp_src/valarray_before.h /^ typedef typename _Arg::value_type _Vt;$/;" t class:std::_UnBase access:public +std::_UnBase::operator [] cpp_src/valarray_before.h /^ value_type operator[](size_t __i) const$/;" f class:std::_UnBase access:public signature:(size_t __i) const +std::_UnBase::size cpp_src/valarray_before.h /^ size_t size() const { return _M_expr.size(); }$/;" f class:std::_UnBase access:public signature:() const +std::_UnBase::value_type cpp_src/valarray_before.h /^ typedef typename __fun<_Oper, _Vt>::result_type value_type;$/;" t class:std::_UnBase access:public +std::_UnClos cpp_src/valarray_before.h /^ struct _UnClos<_Oper, _Expr, _Dom>$/;" s namespace:std inherits:_UnBase +std::_UnClos cpp_src/valarray_before.h /^ struct _UnClos<_Oper, _ValArray, _Tp>$/;" s namespace:std inherits:_UnBase +std::_UnClos::_Arg cpp_src/valarray_before.h /^ typedef _Dom _Arg;$/;" t struct:std::_UnClos access:public +std::_UnClos::_Arg cpp_src/valarray_before.h /^ typedef valarray<_Tp> _Arg;$/;" t struct:std::_UnClos access:public +std::_UnClos::_Base cpp_src/valarray_before.h /^ typedef _UnBase<_Oper, _Dom> _Base;$/;" t struct:std::_UnClos access:public +std::_UnClos::_Base cpp_src/valarray_before.h /^ typedef _UnBase<_Oper, valarray<_Tp> > _Base;$/;" t struct:std::_UnClos access:public +std::_UnClos::_UnClos cpp_src/valarray_before.h /^ _UnClos(const _Arg& __e) : _Base(__e) {}$/;" f struct:std::_UnClos access:public signature:(const _Arg& __e) +std::_UnClos::value_type cpp_src/valarray_before.h /^ typedef typename _Base::value_type value_type;$/;" t struct:std::_UnClos access:public +std::_ValFunClos cpp_src/valarray_before.h /^ struct _ValFunClos<_Expr,_Dom> : _FunBase<_Dom, typename _Dom::value_type>$/;" s namespace:std inherits:_FunBase +std::_ValFunClos cpp_src/valarray_before.h /^ struct _ValFunClos<_ValArray,_Tp> : _FunBase, _Tp>$/;" s namespace:std inherits:_FunBase +std::_ValFunClos::_Base cpp_src/valarray_before.h /^ typedef _FunBase<_Dom, typename _Dom::value_type> _Base;$/;" t struct:std::_ValFunClos access:public +std::_ValFunClos::_Base cpp_src/valarray_before.h /^ typedef _FunBase, _Tp> _Base;$/;" t struct:std::_ValFunClos access:public +std::_ValFunClos::_Tp cpp_src/valarray_before.h /^ typedef value_type _Tp;$/;" t struct:std::_ValFunClos access:public +std::_ValFunClos::_ValFunClos cpp_src/valarray_before.h /^ _ValFunClos(const _Dom& __e, _Tp __f(_Tp)) : _Base(__e, __f) {}$/;" f struct:std::_ValFunClos access:public signature:(const _Dom& __e, _Tp __f(_Tp)) +std::_ValFunClos::_ValFunClos cpp_src/valarray_before.h /^ _ValFunClos(const valarray<_Tp>& __v, _Tp __f(_Tp)) : _Base(__v, __f) {}$/;" f struct:std::_ValFunClos access:public signature:(const valarray<_Tp>& __v, _Tp __f(_Tp)) +std::_ValFunClos::value_type cpp_src/valarray_before.h /^ typedef _Tp value_type;$/;" t struct:std::_ValFunClos access:public +std::_ValFunClos::value_type cpp_src/valarray_before.h /^ typedef typename _Base::value_type value_type;$/;" t struct:std::_ValFunClos access:public +std::_Vector_base cpp_src/stl_vector.h /^ struct _Vector_base$/;" s namespace:std +std::_Vector_base::_M_allocate cpp_src/stl_vector.h /^ _M_allocate(size_t __n)$/;" f struct:std::_Vector_base access:public signature:(size_t __n) +std::_Vector_base::_M_deallocate cpp_src/stl_vector.h /^ _M_deallocate(_Tp* __p, size_t __n)$/;" f struct:std::_Vector_base access:public signature:(_Tp* __p, size_t __n) +std::_Vector_base::_M_get_Tp_allocator cpp_src/stl_vector.h /^ _M_get_Tp_allocator() const$/;" f struct:std::_Vector_base access:public signature:() const +std::_Vector_base::_M_get_Tp_allocator cpp_src/stl_vector.h /^ _M_get_Tp_allocator()$/;" f struct:std::_Vector_base access:public signature:() +std::_Vector_base::_M_impl cpp_src/stl_vector.h /^ _Vector_impl _M_impl;$/;" m struct:std::_Vector_base access:public +std::_Vector_base::_Tp_alloc_type cpp_src/stl_vector.h /^ typedef typename _Alloc::template rebind<_Tp>::other _Tp_alloc_type;$/;" t struct:std::_Vector_base access:public +std::_Vector_base::_Vector_base cpp_src/stl_vector.h /^ _Vector_base(const allocator_type& __a)$/;" f struct:std::_Vector_base access:public signature:(const allocator_type& __a) +std::_Vector_base::_Vector_base cpp_src/stl_vector.h /^ _Vector_base(size_t __n, const allocator_type& __a)$/;" f struct:std::_Vector_base access:public signature:(size_t __n, const allocator_type& __a) +std::_Vector_base::_Vector_impl cpp_src/stl_vector.h /^ struct _Vector_impl $/;" s struct:std::_Vector_base inherits:_Tp_alloc_type access:public +std::_Vector_base::_Vector_impl::_M_end_of_storage cpp_src/stl_vector.h /^ _Tp* _M_end_of_storage;$/;" m struct:std::_Vector_base::_Vector_impl access:public +std::_Vector_base::_Vector_impl::_M_finish cpp_src/stl_vector.h /^ _Tp* _M_finish;$/;" m struct:std::_Vector_base::_Vector_impl access:public +std::_Vector_base::_Vector_impl::_M_start cpp_src/stl_vector.h /^ _Tp* _M_start;$/;" m struct:std::_Vector_base::_Vector_impl access:public +std::_Vector_base::_Vector_impl::_Vector_impl cpp_src/stl_vector.h /^ _Vector_impl(_Tp_alloc_type const& __a)$/;" f struct:std::_Vector_base::_Vector_impl access:public signature:(_Tp_alloc_type const& __a) +std::_Vector_base::allocator_type cpp_src/stl_vector.h /^ typedef _Alloc allocator_type;$/;" t struct:std::_Vector_base access:public +std::_Vector_base::get_allocator cpp_src/stl_vector.h /^ get_allocator() const$/;" f struct:std::_Vector_base access:public signature:() const +std::_Vector_base::~_Vector_base cpp_src/stl_vector.h /^ ~_Vector_base()$/;" f struct:std::_Vector_base access:public signature:() +std::__abs cpp_src/valarray_before.h /^ struct __abs$/;" s namespace:std +std::__abs::operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__abs access:public signature:(const _Tp& __t) const +std::__acos cpp_src/valarray_before.h /^ struct __acos$/;" s namespace:std +std::__acos::operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__acos access:public signature:(const _Tp& __t) const +std::__add_grouping cpp_src/locale_facets.h /^ __add_grouping(_CharT* __s, _CharT __sep,$/;" p namespace:std signature:(_CharT* __s, _CharT __sep, const char* __gbeg, size_t __gsize, const _CharT* __first, const _CharT* __last) +std::__add_grouping cpp_src/locale_facets.tcc /^ __add_grouping(_CharT* __s, _CharT __sep,$/;" f namespace:std signature:(_CharT* __s, _CharT __sep, const char* __gbeg, size_t __gsize, const _CharT* __first, const _CharT* __last) +std::__adjust_heap cpp_src/stl_heap.h /^ __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,$/;" f namespace:std signature:(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __value) +std::__adjust_heap cpp_src/stl_heap.h /^ __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,$/;" f namespace:std signature:(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __value, _Compare __comp) +std::__advance cpp_src/stl_iterator_base_funcs.h /^ __advance(_BidirectionalIterator& __i, _Distance __n,$/;" f namespace:std signature:(_BidirectionalIterator& __i, _Distance __n, bidirectional_iterator_tag) +std::__advance cpp_src/stl_iterator_base_funcs.h /^ __advance(_InputIterator& __i, _Distance __n, input_iterator_tag)$/;" f namespace:std signature:(_InputIterator& __i, _Distance __n, input_iterator_tag) +std::__advance cpp_src/stl_iterator_base_funcs.h /^ __advance(_RandomAccessIterator& __i, _Distance __n,$/;" f namespace:std signature:(_RandomAccessIterator& __i, _Distance __n, random_access_iterator_tag) +std::__alloc_swap cpp_src/allocator.h /^ struct __alloc_swap$/;" s namespace:std +std::__alloc_swap cpp_src/allocator.h /^ struct __alloc_swap<_Alloc, false>$/;" s namespace:std +std::__alloc_swap::_S_do_it cpp_src/allocator.h /^ _S_do_it(_Alloc& __one, _Alloc& __two)$/;" f struct:std::__alloc_swap access:public signature:(_Alloc& __one, _Alloc& __two) +std::__alloc_swap::_S_do_it cpp_src/allocator.h /^ { static void _S_do_it(_Alloc&, _Alloc&) { } };$/;" f struct:std::__alloc_swap access:public signature:(_Alloc&, _Alloc&) +std::__asin cpp_src/valarray_before.h /^ struct __asin$/;" s namespace:std +std::__asin::operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__asin access:public signature:(const _Tp& __t) const +std::__atan cpp_src/valarray_before.h /^ struct __atan$/;" s namespace:std +std::__atan2 cpp_src/valarray_before.h /^ struct __atan2$/;" s namespace:std +std::__atan2::operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__atan2 access:public signature:(const _Tp& __x, const _Tp& __y) const +std::__atan::operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__atan access:public signature:(const _Tp& __t) const +std::__bitwise_and cpp_src/valarray_before.h /^ struct __bitwise_and$/;" s namespace:std +std::__bitwise_and::operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__bitwise_and access:public signature:(const _Tp& __x, const _Tp& __y) const +std::__bitwise_not cpp_src/valarray_before.h /^ struct __bitwise_not$/;" s namespace:std +std::__bitwise_not::operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__bitwise_not access:public signature:(const _Tp& __t) const +std::__bitwise_or cpp_src/valarray_before.h /^ struct __bitwise_or$/;" s namespace:std +std::__bitwise_or::operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__bitwise_or access:public signature:(const _Tp& __x, const _Tp& __y) const +std::__bitwise_xor cpp_src/valarray_before.h /^ struct __bitwise_xor$/;" s namespace:std +std::__bitwise_xor::operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__bitwise_xor access:public signature:(const _Tp& __x, const _Tp& __y) const +std::__check_facet cpp_src/localefwd.h /^ __check_facet(const _Facet* __f)$/;" f namespace:std signature:(const _Facet* __f) +std::__chunk_insertion_sort cpp_src/stl_algo.h /^ __chunk_insertion_sort(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Distance __chunk_size) +std::__chunk_insertion_sort cpp_src/stl_algo.h /^ __chunk_insertion_sort(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Distance __chunk_size, _Compare __comp) +std::__cmath_power cpp_src/cmath /^ template _Tp __cmath_power(_Tp, unsigned int);$/;" p namespace:std file: signature:(_Tp, unsigned int) +std::__cmath_power cpp_src/cmath.tcc /^ __cmath_power(_Tp __x, unsigned int __n)$/;" f namespace:std signature:(_Tp __x, unsigned int __n) +std::__codecvt_abstract_base cpp_src/codecvt.h /^ class __codecvt_abstract_base$/;" c namespace:std inherits:locale::facet,codecvt_base +std::__codecvt_abstract_base::__codecvt_abstract_base cpp_src/codecvt.h /^ __codecvt_abstract_base(size_t __refs = 0) : locale::facet(__refs) { }$/;" f class:std::__codecvt_abstract_base access:protected signature:(size_t __refs = 0) +std::__codecvt_abstract_base::always_noconv cpp_src/codecvt.h /^ always_noconv() const throw()$/;" f class:std::__codecvt_abstract_base access:public signature:() const +std::__codecvt_abstract_base::do_always_noconv cpp_src/codecvt.h /^ do_always_noconv() const throw() = 0;$/;" p class:std::__codecvt_abstract_base access:protected signature:() const +std::__codecvt_abstract_base::do_encoding cpp_src/codecvt.h /^ do_encoding() const throw() = 0;$/;" p class:std::__codecvt_abstract_base access:protected signature:() const +std::__codecvt_abstract_base::do_in cpp_src/codecvt.h /^ do_in(state_type& __state, const extern_type* __from,$/;" p class:std::__codecvt_abstract_base access:protected signature:(state_type& __state, const extern_type* __from, const extern_type* __from_end, const extern_type*& __from_next, intern_type* __to, intern_type* __to_end, intern_type*& __to_next) const +std::__codecvt_abstract_base::do_length cpp_src/codecvt.h /^ do_length(state_type&, const extern_type* __from,$/;" p class:std::__codecvt_abstract_base access:protected signature:(state_type&, const extern_type* __from, const extern_type* __end, size_t __max) const +std::__codecvt_abstract_base::do_max_length cpp_src/codecvt.h /^ do_max_length() const throw() = 0;$/;" p class:std::__codecvt_abstract_base access:protected signature:() const +std::__codecvt_abstract_base::do_out cpp_src/codecvt.h /^ do_out(state_type& __state, const intern_type* __from,$/;" p class:std::__codecvt_abstract_base access:protected signature:(state_type& __state, const intern_type* __from, const intern_type* __from_end, const intern_type*& __from_next, extern_type* __to, extern_type* __to_end, extern_type*& __to_next) const +std::__codecvt_abstract_base::do_unshift cpp_src/codecvt.h /^ do_unshift(state_type& __state, extern_type* __to,$/;" p class:std::__codecvt_abstract_base access:protected signature:(state_type& __state, extern_type* __to, extern_type* __to_end, extern_type*& __to_next) const +std::__codecvt_abstract_base::encoding cpp_src/codecvt.h /^ encoding() const throw()$/;" f class:std::__codecvt_abstract_base access:public signature:() const +std::__codecvt_abstract_base::extern_type cpp_src/codecvt.h /^ typedef _ExternT extern_type;$/;" t class:std::__codecvt_abstract_base access:public +std::__codecvt_abstract_base::in cpp_src/codecvt.h /^ in(state_type& __state, const extern_type* __from,$/;" f class:std::__codecvt_abstract_base access:public signature:(state_type& __state, const extern_type* __from, const extern_type* __from_end, const extern_type*& __from_next, intern_type* __to, intern_type* __to_end, intern_type*& __to_next) const +std::__codecvt_abstract_base::intern_type cpp_src/codecvt.h /^ typedef _InternT intern_type;$/;" t class:std::__codecvt_abstract_base access:public +std::__codecvt_abstract_base::length cpp_src/codecvt.h /^ length(state_type& __state, const extern_type* __from,$/;" f class:std::__codecvt_abstract_base access:public signature:(state_type& __state, const extern_type* __from, const extern_type* __end, size_t __max) const +std::__codecvt_abstract_base::max_length cpp_src/codecvt.h /^ max_length() const throw()$/;" f class:std::__codecvt_abstract_base access:public signature:() const +std::__codecvt_abstract_base::out cpp_src/codecvt.h /^ out(state_type& __state, const intern_type* __from,$/;" f class:std::__codecvt_abstract_base access:public signature:(state_type& __state, const intern_type* __from, const intern_type* __from_end, const intern_type*& __from_next, extern_type* __to, extern_type* __to_end, extern_type*& __to_next) const +std::__codecvt_abstract_base::result cpp_src/codecvt.h /^ typedef codecvt_base::result result;$/;" t class:std::__codecvt_abstract_base access:public +std::__codecvt_abstract_base::state_type cpp_src/codecvt.h /^ typedef _StateT state_type;$/;" t class:std::__codecvt_abstract_base access:public +std::__codecvt_abstract_base::unshift cpp_src/codecvt.h /^ unshift(state_type& __state, extern_type* __to, extern_type* __to_end,$/;" f class:std::__codecvt_abstract_base access:public signature:(state_type& __state, extern_type* __to, extern_type* __to_end, extern_type*& __to_next) const +std::__codecvt_abstract_base::~__codecvt_abstract_base cpp_src/codecvt.h /^ ~__codecvt_abstract_base() { }$/;" f class:std::__codecvt_abstract_base access:protected signature:() +std::__complex_abs cpp_src/complex /^ __complex_abs(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::__complex_abs cpp_src/complex /^ __complex_abs(__complex__ double __z) { return __builtin_cabs(__z); }$/;" f namespace:std signature:(__complex__ double __z) +std::__complex_abs cpp_src/complex /^ __complex_abs(__complex__ float __z) { return __builtin_cabsf(__z); }$/;" f namespace:std signature:(__complex__ float __z) +std::__complex_abs cpp_src/complex /^ __complex_abs(const __complex__ long double& __z)$/;" f namespace:std signature:(const __complex__ long double& __z) +std::__complex_arg cpp_src/complex /^ __complex_arg(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::__complex_arg cpp_src/complex /^ __complex_arg(__complex__ double __z) { return __builtin_carg(__z); }$/;" f namespace:std signature:(__complex__ double __z) +std::__complex_arg cpp_src/complex /^ __complex_arg(__complex__ float __z) { return __builtin_cargf(__z); }$/;" f namespace:std signature:(__complex__ float __z) +std::__complex_arg cpp_src/complex /^ __complex_arg(const __complex__ long double& __z)$/;" f namespace:std signature:(const __complex__ long double& __z) +std::__complex_cos cpp_src/complex /^ __complex_cos(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::__complex_cos cpp_src/complex /^ __complex_cos(__complex__ double __z) { return __builtin_ccos(__z); }$/;" f namespace:std signature:(__complex__ double __z) +std::__complex_cos cpp_src/complex /^ __complex_cos(__complex__ float __z) { return __builtin_ccosf(__z); }$/;" f namespace:std signature:(__complex__ float __z) +std::__complex_cos cpp_src/complex /^ __complex_cos(const __complex__ long double& __z)$/;" f namespace:std signature:(const __complex__ long double& __z) +std::__complex_cosh cpp_src/complex /^ __complex_cosh(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::__complex_cosh cpp_src/complex /^ __complex_cosh(__complex__ double __z) { return __builtin_ccosh(__z); }$/;" f namespace:std signature:(__complex__ double __z) +std::__complex_cosh cpp_src/complex /^ __complex_cosh(__complex__ float __z) { return __builtin_ccoshf(__z); }$/;" f namespace:std signature:(__complex__ float __z) +std::__complex_cosh cpp_src/complex /^ __complex_cosh(const __complex__ long double& __z)$/;" f namespace:std signature:(const __complex__ long double& __z) +std::__complex_exp cpp_src/complex /^ __complex_exp(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::__complex_exp cpp_src/complex /^ __complex_exp(__complex__ double __z) { return __builtin_cexp(__z); }$/;" f namespace:std signature:(__complex__ double __z) +std::__complex_exp cpp_src/complex /^ __complex_exp(__complex__ float __z) { return __builtin_cexpf(__z); }$/;" f namespace:std signature:(__complex__ float __z) +std::__complex_exp cpp_src/complex /^ __complex_exp(const __complex__ long double& __z)$/;" f namespace:std signature:(const __complex__ long double& __z) +std::__complex_log cpp_src/complex /^ __complex_log(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::__complex_log cpp_src/complex /^ __complex_log(__complex__ double __z) { return __builtin_clog(__z); }$/;" f namespace:std signature:(__complex__ double __z) +std::__complex_log cpp_src/complex /^ __complex_log(__complex__ float __z) { return __builtin_clogf(__z); }$/;" f namespace:std signature:(__complex__ float __z) +std::__complex_log cpp_src/complex /^ __complex_log(const __complex__ long double& __z)$/;" f namespace:std signature:(const __complex__ long double& __z) +std::__complex_pow cpp_src/complex /^ __complex_pow(const complex<_Tp>& __x, const complex<_Tp>& __y)$/;" f namespace:std signature:(const complex<_Tp>& __x, const complex<_Tp>& __y) +std::__complex_pow cpp_src/complex /^ __complex_pow(__complex__ double __x, __complex__ double __y)$/;" f namespace:std signature:(__complex__ double __x, __complex__ double __y) +std::__complex_pow cpp_src/complex /^ __complex_pow(__complex__ float __x, __complex__ float __y)$/;" f namespace:std signature:(__complex__ float __x, __complex__ float __y) +std::__complex_pow cpp_src/complex /^ __complex_pow(const __complex__ long double& __x,$/;" f namespace:std signature:(const __complex__ long double& __x, const __complex__ long double& __y) +std::__complex_sin cpp_src/complex /^ __complex_sin(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::__complex_sin cpp_src/complex /^ __complex_sin(__complex__ double __z) { return __builtin_csin(__z); }$/;" f namespace:std signature:(__complex__ double __z) +std::__complex_sin cpp_src/complex /^ __complex_sin(__complex__ float __z) { return __builtin_csinf(__z); }$/;" f namespace:std signature:(__complex__ float __z) +std::__complex_sin cpp_src/complex /^ __complex_sin(const __complex__ long double& __z)$/;" f namespace:std signature:(const __complex__ long double& __z) +std::__complex_sinh cpp_src/complex /^ __complex_sinh(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::__complex_sinh cpp_src/complex /^ __complex_sinh(__complex__ double __z) { return __builtin_csinh(__z); } $/;" f namespace:std signature:(__complex__ double __z) +std::__complex_sinh cpp_src/complex /^ __complex_sinh(__complex__ float __z) { return __builtin_csinhf(__z); } $/;" f namespace:std signature:(__complex__ float __z) +std::__complex_sinh cpp_src/complex /^ __complex_sinh(const __complex__ long double& __z)$/;" f namespace:std signature:(const __complex__ long double& __z) +std::__complex_sqrt cpp_src/complex /^ __complex_sqrt(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::__complex_sqrt cpp_src/complex /^ __complex_sqrt(__complex__ double __z) { return __builtin_csqrt(__z); }$/;" f namespace:std signature:(__complex__ double __z) +std::__complex_sqrt cpp_src/complex /^ __complex_sqrt(__complex__ float __z) { return __builtin_csqrtf(__z); }$/;" f namespace:std signature:(__complex__ float __z) +std::__complex_sqrt cpp_src/complex /^ __complex_sqrt(const __complex__ long double& __z)$/;" f namespace:std signature:(const __complex__ long double& __z) +std::__complex_tan cpp_src/complex /^ __complex_tan(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::__complex_tan cpp_src/complex /^ __complex_tan(__complex__ double __z) { return __builtin_ctan(__z); }$/;" f namespace:std signature:(__complex__ double __z) +std::__complex_tan cpp_src/complex /^ __complex_tan(__complex__ float __z) { return __builtin_ctanf(__z); }$/;" f namespace:std signature:(__complex__ float __z) +std::__complex_tan cpp_src/complex /^ __complex_tan(const __complex__ long double& __z)$/;" f namespace:std signature:(const __complex__ long double& __z) +std::__complex_tanh cpp_src/complex /^ __complex_tanh(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::__complex_tanh cpp_src/complex /^ __complex_tanh(__complex__ double __z) { return __builtin_ctanh(__z); }$/;" f namespace:std signature:(__complex__ double __z) +std::__complex_tanh cpp_src/complex /^ __complex_tanh(__complex__ float __z) { return __builtin_ctanhf(__z); }$/;" f namespace:std signature:(__complex__ float __z) +std::__complex_tanh cpp_src/complex /^ __complex_tanh(const __complex__ long double& __z)$/;" f namespace:std signature:(const __complex__ long double& __z) +std::__convert_to_v cpp_src/locale_facets.h /^ __convert_to_v(const char* __in, _Tv& __out, ios_base::iostate& __err,$/;" p namespace:std signature:(const char* __in, _Tv& __out, ios_base::iostate& __err, const __c_locale& __cloc) +std::__convert_to_v cpp_src/locale_facets.h /^ __convert_to_v(const char*, double&, ios_base::iostate&,$/;" p namespace:std signature:(const char*, double&, ios_base::iostate&, const __c_locale&) +std::__convert_to_v cpp_src/locale_facets.h /^ __convert_to_v(const char*, float&, ios_base::iostate&,$/;" p namespace:std signature:(const char*, float&, ios_base::iostate&, const __c_locale&) +std::__convert_to_v cpp_src/locale_facets.h /^ __convert_to_v(const char*, long double&, ios_base::iostate&,$/;" p namespace:std signature:(const char*, long double&, ios_base::iostate&, const __c_locale&) +std::__copy cpp_src/stl_algobase.h /^ struct __copy$/;" s namespace:std +std::__copy cpp_src/stl_algobase.h /^ struct __copy<_BoolType, random_access_iterator_tag>$/;" s namespace:std +std::__copy cpp_src/stl_algobase.h /^ struct __copy$/;" s namespace:std +std::__copy::copy cpp_src/stl_algobase.h /^ copy(_II __first, _II __last, _OI __result)$/;" f struct:std::__copy access:public signature:(_II __first, _II __last, _OI __result) +std::__copy::copy cpp_src/stl_algobase.h /^ copy(const _Tp* __first, const _Tp* __last, _Tp* __result)$/;" f struct:std::__copy access:public signature:(const _Tp* __first, const _Tp* __last, _Tp* __result) +std::__copy_aux cpp_src/stl_algobase.h /^ __copy_aux(_CharT*, _CharT*, ostreambuf_iterator<_CharT>);$/;" p namespace:std signature:(_CharT*, _CharT*, ostreambuf_iterator<_CharT>) +std::__copy_aux cpp_src/stl_algobase.h /^ __copy_aux(_II __first, _II __last, _OI __result)$/;" f namespace:std signature:(_II __first, _II __last, _OI __result) +std::__copy_aux cpp_src/stl_algobase.h /^ __copy_aux(const _CharT*, const _CharT*, ostreambuf_iterator<_CharT>);$/;" p namespace:std signature:(const _CharT*, const _CharT*, ostreambuf_iterator<_CharT>) +std::__copy_aux cpp_src/stl_algobase.h /^ __copy_aux(istreambuf_iterator<_CharT>, istreambuf_iterator<_CharT>,$/;" p namespace:std signature:(istreambuf_iterator<_CharT>, istreambuf_iterator<_CharT>, _CharT*) +std::__copy_aux cpp_src/streambuf_iterator.h /^ __copy_aux(_CharT* __first, _CharT* __last,$/;" f namespace:std signature:(_CharT* __first, _CharT* __last, ostreambuf_iterator<_CharT> __result) +std::__copy_aux cpp_src/streambuf_iterator.h /^ __copy_aux(const _CharT* __first, const _CharT* __last,$/;" f namespace:std signature:(const _CharT* __first, const _CharT* __last, ostreambuf_iterator<_CharT> __result) +std::__copy_aux cpp_src/streambuf_iterator.h /^ __copy_aux(istreambuf_iterator<_CharT> __first,$/;" f namespace:std signature:(istreambuf_iterator<_CharT> __first, istreambuf_iterator<_CharT> __last, _CharT* __result) +std::__copy_backward cpp_src/stl_algobase.h /^ struct __copy_backward$/;" s namespace:std +std::__copy_backward cpp_src/stl_algobase.h /^ struct __copy_backward<_BoolType, random_access_iterator_tag>$/;" s namespace:std +std::__copy_backward cpp_src/stl_algobase.h /^ struct __copy_backward$/;" s namespace:std +std::__copy_backward::__copy_b cpp_src/stl_algobase.h /^ __copy_b(_BI1 __first, _BI1 __last, _BI2 __result)$/;" f struct:std::__copy_backward access:public signature:(_BI1 __first, _BI1 __last, _BI2 __result) +std::__copy_backward::__copy_b cpp_src/stl_algobase.h /^ __copy_b(const _Tp* __first, const _Tp* __last, _Tp* __result)$/;" f struct:std::__copy_backward access:public signature:(const _Tp* __first, const _Tp* __last, _Tp* __result) +std::__copy_backward_aux cpp_src/stl_algobase.h /^ __copy_backward_aux(_BI1 __first, _BI1 __last, _BI2 __result)$/;" f namespace:std signature:(_BI1 __first, _BI1 __last, _BI2 __result) +std::__copy_backward_normal cpp_src/stl_algobase.h /^ struct __copy_backward_normal$/;" s namespace:std +std::__copy_backward_normal cpp_src/stl_algobase.h /^ struct __copy_backward_normal$/;" s namespace:std +std::__copy_backward_normal cpp_src/stl_algobase.h /^ struct __copy_backward_normal$/;" s namespace:std +std::__copy_backward_normal cpp_src/stl_algobase.h /^ struct __copy_backward_normal$/;" s namespace:std +std::__copy_backward_normal::__copy_b_n cpp_src/stl_algobase.h /^ __copy_b_n(_BI1 __first, _BI1 __last, _BI2 __result)$/;" f struct:std::__copy_backward_normal access:public signature:(_BI1 __first, _BI1 __last, _BI2 __result) +std::__copy_normal cpp_src/stl_algobase.h /^ struct __copy_normal$/;" s namespace:std +std::__copy_normal cpp_src/stl_algobase.h /^ struct __copy_normal$/;" s namespace:std +std::__copy_normal cpp_src/stl_algobase.h /^ struct __copy_normal$/;" s namespace:std +std::__copy_normal cpp_src/stl_algobase.h /^ struct __copy_normal$/;" s namespace:std +std::__copy_normal::__copy_n cpp_src/stl_algobase.h /^ __copy_n(_II __first, _II __last, _OI __result)$/;" f struct:std::__copy_normal access:public signature:(_II __first, _II __last, _OI __result) +std::__copy_streambufs cpp_src/streambuf.tcc /^ __copy_streambufs(basic_streambuf<_CharT, _Traits>* __sbin,$/;" f namespace:std signature:(basic_streambuf<_CharT, _Traits>* __sbin, basic_streambuf<_CharT, _Traits>* __sbout) +std::__copy_streambufs cpp_src/streambuf.tcc /^ __copy_streambufs(basic_streambuf*,$/;" p namespace:std file: signature:(basic_streambuf*, basic_streambuf*) +std::__copy_streambufs cpp_src/streambuf.tcc /^ __copy_streambufs(basic_streambuf*,$/;" p namespace:std file: signature:(basic_streambuf*, basic_streambuf*) +std::__copy_streambufs_eof cpp_src/streambuf /^ __copy_streambufs_eof(basic_streambuf<_CharT, _Traits>*,$/;" p namespace:std file: signature:(basic_streambuf<_CharT, _Traits>*, basic_streambuf<_CharT, _Traits>*, bool&) +std::__copy_streambufs_eof cpp_src/streambuf /^ __copy_streambufs_eof(basic_streambuf* __sbin,$/;" p namespace:std file: signature:(basic_streambuf* __sbin, basic_streambuf* __sbout, bool& __ineof) +std::__copy_streambufs_eof cpp_src/streambuf /^ __copy_streambufs_eof(basic_streambuf* __sbin,$/;" p namespace:std file: signature:(basic_streambuf* __sbin, basic_streambuf* __sbout, bool& __ineof) +std::__copy_streambufs_eof cpp_src/streambuf.tcc /^ __copy_streambufs_eof(basic_streambuf<_CharT, _Traits>* __sbin,$/;" f namespace:std signature:(basic_streambuf<_CharT, _Traits>* __sbin, basic_streambuf<_CharT, _Traits>* __sbout, bool& __ineof) +std::__copy_streambufs_eof cpp_src/streambuf.tcc /^ __copy_streambufs_eof(basic_streambuf*,$/;" p namespace:std file: signature:(basic_streambuf*, basic_streambuf*, bool&) +std::__copy_streambufs_eof cpp_src/streambuf.tcc /^ __copy_streambufs_eof(basic_streambuf*,$/;" p namespace:std file: signature:(basic_streambuf*, basic_streambuf*, bool&) +std::__cos cpp_src/valarray_before.h /^ struct __cos$/;" s namespace:std +std::__cos::operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__cos access:public signature:(const _Tp& __t) const +std::__cosh cpp_src/valarray_before.h /^ struct __cosh$/;" s namespace:std +std::__cosh::operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__cosh access:public signature:(const _Tp& __t) const +std::__ctype_abstract_base cpp_src/locale_facets.h /^ class __ctype_abstract_base : public locale::facet, public ctype_base$/;" c namespace:std inherits:locale::facet,ctype_base +std::__ctype_abstract_base::__ctype_abstract_base cpp_src/locale_facets.h /^ __ctype_abstract_base(size_t __refs = 0): facet(__refs) { }$/;" f class:std::__ctype_abstract_base access:protected signature:(size_t __refs = 0) +std::__ctype_abstract_base::char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::__ctype_abstract_base access:public +std::__ctype_abstract_base::do_is cpp_src/locale_facets.h /^ do_is(const char_type* __lo, const char_type* __hi,$/;" p class:std::__ctype_abstract_base access:protected signature:(const char_type* __lo, const char_type* __hi, mask* __vec) const +std::__ctype_abstract_base::do_is cpp_src/locale_facets.h /^ do_is(mask __m, char_type __c) const = 0;$/;" p class:std::__ctype_abstract_base access:protected signature:(mask __m, char_type __c) const +std::__ctype_abstract_base::do_narrow cpp_src/locale_facets.h /^ do_narrow(char_type, char __dfault) const = 0;$/;" p class:std::__ctype_abstract_base access:protected signature:(char_type, char __dfault) const +std::__ctype_abstract_base::do_narrow cpp_src/locale_facets.h /^ do_narrow(const char_type* __lo, const char_type* __hi,$/;" p class:std::__ctype_abstract_base access:protected signature:(const char_type* __lo, const char_type* __hi, char __dfault, char* __dest) const +std::__ctype_abstract_base::do_scan_is cpp_src/locale_facets.h /^ do_scan_is(mask __m, const char_type* __lo,$/;" p class:std::__ctype_abstract_base access:protected signature:(mask __m, const char_type* __lo, const char_type* __hi) const +std::__ctype_abstract_base::do_scan_not cpp_src/locale_facets.h /^ do_scan_not(mask __m, const char_type* __lo,$/;" p class:std::__ctype_abstract_base access:protected signature:(mask __m, const char_type* __lo, const char_type* __hi) const +std::__ctype_abstract_base::do_tolower cpp_src/locale_facets.h /^ do_tolower(char_type) const = 0;$/;" p class:std::__ctype_abstract_base access:protected signature:(char_type) const +std::__ctype_abstract_base::do_tolower cpp_src/locale_facets.h /^ do_tolower(char_type* __lo, const char_type* __hi) const = 0;$/;" p class:std::__ctype_abstract_base access:protected signature:(char_type* __lo, const char_type* __hi) const +std::__ctype_abstract_base::do_toupper cpp_src/locale_facets.h /^ do_toupper(char_type) const = 0;$/;" p class:std::__ctype_abstract_base access:protected signature:(char_type) const +std::__ctype_abstract_base::do_toupper cpp_src/locale_facets.h /^ do_toupper(char_type* __lo, const char_type* __hi) const = 0;$/;" p class:std::__ctype_abstract_base access:protected signature:(char_type* __lo, const char_type* __hi) const +std::__ctype_abstract_base::do_widen cpp_src/locale_facets.h /^ do_widen(char) const = 0;$/;" p class:std::__ctype_abstract_base access:protected signature:(char) const +std::__ctype_abstract_base::do_widen cpp_src/locale_facets.h /^ do_widen(const char* __lo, const char* __hi,$/;" p class:std::__ctype_abstract_base access:protected signature:(const char* __lo, const char* __hi, char_type* __dest) const +std::__ctype_abstract_base::is cpp_src/locale_facets.h /^ is(const char_type *__lo, const char_type *__hi, mask *__vec) const$/;" f class:std::__ctype_abstract_base access:public signature:(const char_type *__lo, const char_type *__hi, mask *__vec) const +std::__ctype_abstract_base::is cpp_src/locale_facets.h /^ is(mask __m, char_type __c) const$/;" f class:std::__ctype_abstract_base access:public signature:(mask __m, char_type __c) const +std::__ctype_abstract_base::narrow cpp_src/locale_facets.h /^ narrow(char_type __c, char __dfault) const$/;" f class:std::__ctype_abstract_base access:public signature:(char_type __c, char __dfault) const +std::__ctype_abstract_base::narrow cpp_src/locale_facets.h /^ narrow(const char_type* __lo, const char_type* __hi,$/;" f class:std::__ctype_abstract_base access:public signature:(const char_type* __lo, const char_type* __hi, char __dfault, char *__to) const +std::__ctype_abstract_base::scan_is cpp_src/locale_facets.h /^ scan_is(mask __m, const char_type* __lo, const char_type* __hi) const$/;" f class:std::__ctype_abstract_base access:public signature:(mask __m, const char_type* __lo, const char_type* __hi) const +std::__ctype_abstract_base::scan_not cpp_src/locale_facets.h /^ scan_not(mask __m, const char_type* __lo, const char_type* __hi) const$/;" f class:std::__ctype_abstract_base access:public signature:(mask __m, const char_type* __lo, const char_type* __hi) const +std::__ctype_abstract_base::tolower cpp_src/locale_facets.h /^ tolower(char_type __c) const$/;" f class:std::__ctype_abstract_base access:public signature:(char_type __c) const +std::__ctype_abstract_base::tolower cpp_src/locale_facets.h /^ tolower(char_type* __lo, const char_type* __hi) const$/;" f class:std::__ctype_abstract_base access:public signature:(char_type* __lo, const char_type* __hi) const +std::__ctype_abstract_base::toupper cpp_src/locale_facets.h /^ toupper(char_type *__lo, const char_type* __hi) const$/;" f class:std::__ctype_abstract_base access:public signature:(char_type *__lo, const char_type* __hi) const +std::__ctype_abstract_base::toupper cpp_src/locale_facets.h /^ toupper(char_type __c) const$/;" f class:std::__ctype_abstract_base access:public signature:(char_type __c) const +std::__ctype_abstract_base::widen cpp_src/locale_facets.h /^ widen(char __c) const$/;" f class:std::__ctype_abstract_base access:public signature:(char __c) const +std::__ctype_abstract_base::widen cpp_src/locale_facets.h /^ widen(const char* __lo, const char* __hi, char_type* __to) const$/;" f class:std::__ctype_abstract_base access:public signature:(const char* __lo, const char* __hi, char_type* __to) const +std::__ctype_abstract_base::~__ctype_abstract_base cpp_src/locale_facets.h /^ ~__ctype_abstract_base() { }$/;" f class:std::__ctype_abstract_base access:protected signature:() +std::__deque_buf_size cpp_src/stl_deque.h /^ __deque_buf_size(size_t __size)$/;" f namespace:std signature:(size_t __size) +std::__destroy_aux cpp_src/stl_construct.h /^ __destroy_aux(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, __false_type) +std::__destroy_aux cpp_src/stl_construct.h /^ __destroy_aux(_ForwardIterator, _ForwardIterator, __true_type)$/;" f namespace:std signature:(_ForwardIterator, _ForwardIterator, __true_type) +std::__distance cpp_src/stl_iterator_base_funcs.h /^ __distance(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, input_iterator_tag) +std::__distance cpp_src/stl_iterator_base_funcs.h /^ __distance(_RandomAccessIterator __first, _RandomAccessIterator __last,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) +std::__divides cpp_src/valarray_before.h /^ struct __divides$/;" s namespace:std +std::__divides::operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__divides access:public signature:(const _Tp& __x, const _Tp& __y) const +std::__equal_to cpp_src/valarray_before.h /^ struct __equal_to$/;" s namespace:std +std::__equal_to::operator () cpp_src/valarray_before.h /^ bool operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__equal_to access:public signature:(const _Tp& __x, const _Tp& __y) const +std::__exp cpp_src/valarray_before.h /^ struct __exp$/;" s namespace:std +std::__exp::operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__exp access:public signature:(const _Tp& __t) const +std::__fill cpp_src/stl_algobase.h /^ struct __fill$/;" s namespace:std +std::__fill cpp_src/stl_algobase.h /^ struct __fill$/;" s namespace:std +std::__fill::fill cpp_src/stl_algobase.h /^ fill(_ForwardIterator __first, _ForwardIterator __last,$/;" f struct:std::__fill access:public signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) +std::__fill_bvector cpp_src/stl_bvector.h /^ __fill_bvector(_Bit_iterator __first, _Bit_iterator __last, bool __x)$/;" f namespace:std signature:(_Bit_iterator __first, _Bit_iterator __last, bool __x) +std::__fill_n cpp_src/stl_algobase.h /^ struct __fill_n$/;" s namespace:std +std::__fill_n cpp_src/stl_algobase.h /^ struct __fill_n$/;" s namespace:std +std::__fill_n::fill_n cpp_src/stl_algobase.h /^ fill_n(_OutputIterator __first, _Size __n, const _Tp& __value)$/;" f struct:std::__fill_n access:public signature:(_OutputIterator __first, _Size __n, const _Tp& __value) +std::__final_insertion_sort cpp_src/stl_algo.h /^ __final_insertion_sort(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last) +std::__final_insertion_sort cpp_src/stl_algo.h /^ __final_insertion_sort(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) +std::__find cpp_src/stl_algo.h /^ __find(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, const _Tp& __val, input_iterator_tag) +std::__find cpp_src/stl_algo.h /^ __find(_RandomAccessIterator __first, _RandomAccessIterator __last,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __val, random_access_iterator_tag) +std::__find_end cpp_src/stl_algo.h /^ __find_end(_BidirectionalIterator1 __first1,$/;" f namespace:std signature:(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, bidirectional_iterator_tag, bidirectional_iterator_tag) +std::__find_end cpp_src/stl_algo.h /^ __find_end(_BidirectionalIterator1 __first1,$/;" f namespace:std signature:(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, bidirectional_iterator_tag, bidirectional_iterator_tag, _BinaryPredicate __comp) +std::__find_end cpp_src/stl_algo.h /^ __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,$/;" f namespace:std signature:(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, forward_iterator_tag, forward_iterator_tag) +std::__find_end cpp_src/stl_algo.h /^ __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,$/;" f namespace:std signature:(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, forward_iterator_tag, forward_iterator_tag, _BinaryPredicate __comp) +std::__find_if cpp_src/stl_algo.h /^ __find_if(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _Predicate __pred, input_iterator_tag) +std::__find_if cpp_src/stl_algo.h /^ __find_if(_RandomAccessIterator __first, _RandomAccessIterator __last,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Predicate __pred, random_access_iterator_tag) +std::__fun cpp_src/valarray_before.h /^ struct __fun$/;" s namespace:std +std::__fun cpp_src/valarray_before.h /^ struct __fun<__equal_to, _Tp>$/;" s namespace:std +std::__fun cpp_src/valarray_before.h /^ struct __fun<__greater, _Tp>$/;" s namespace:std +std::__fun cpp_src/valarray_before.h /^ struct __fun<__greater_equal, _Tp>$/;" s namespace:std +std::__fun cpp_src/valarray_before.h /^ struct __fun<__less, _Tp>$/;" s namespace:std +std::__fun cpp_src/valarray_before.h /^ struct __fun<__less_equal, _Tp>$/;" s namespace:std +std::__fun cpp_src/valarray_before.h /^ struct __fun<__logical_and, _Tp>$/;" s namespace:std +std::__fun cpp_src/valarray_before.h /^ struct __fun<__logical_not, _Tp>$/;" s namespace:std +std::__fun cpp_src/valarray_before.h /^ struct __fun<__logical_or, _Tp>$/;" s namespace:std +std::__fun cpp_src/valarray_before.h /^ struct __fun<__not_equal_to, _Tp>$/;" s namespace:std +std::__fun::result_type cpp_src/valarray_before.h /^ typedef _Tp result_type;$/;" t struct:std::__fun access:public +std::__fun::result_type cpp_src/valarray_before.h /^ typedef bool result_type;$/;" t struct:std::__fun access:public +std::__gcd cpp_src/stl_algo.h /^ __gcd(_EuclideanRingElement __m, _EuclideanRingElement __n)$/;" f namespace:std signature:(_EuclideanRingElement __m, _EuclideanRingElement __n) +std::__get_temporary_buffer cpp_src/memory /^ __get_temporary_buffer(ptrdiff_t __len, _Tp*)$/;" f namespace:std signature:(ptrdiff_t __len, _Tp*) +std::__greater cpp_src/valarray_before.h /^ struct __greater$/;" s namespace:std +std::__greater::operator () cpp_src/valarray_before.h /^ bool operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__greater access:public signature:(const _Tp& __x, const _Tp& __y) const +std::__greater_equal cpp_src/valarray_before.h /^ struct __greater_equal$/;" s namespace:std +std::__greater_equal::operator () cpp_src/valarray_before.h /^ bool operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__greater_equal access:public signature:(const _Tp& __x, const _Tp& __y) const +std::__heap_select cpp_src/stl_algo.h /^ __heap_select(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) +std::__heap_select cpp_src/stl_algo.h /^ __heap_select(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, _Compare __comp) +std::__inplace_stable_partition cpp_src/stl_algo.h /^ __inplace_stable_partition(_ForwardIterator __first,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, _Distance __len) +std::__inplace_stable_sort cpp_src/stl_algo.h /^ __inplace_stable_sort(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last) +std::__inplace_stable_sort cpp_src/stl_algo.h /^ __inplace_stable_sort(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) +std::__insertion_sort cpp_src/stl_algo.h /^ __insertion_sort(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last) +std::__insertion_sort cpp_src/stl_algo.h /^ __insertion_sort(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) +std::__int_to_char cpp_src/locale_facets.tcc /^ __int_to_char(_CharT* __bufend, _ValueT __v, const _CharT* __lit,$/;" f namespace:std signature:(_CharT* __bufend, _ValueT __v, const _CharT* __lit, ios_base::fmtflags __flags, bool __dec) +std::__introselect cpp_src/stl_algo.h /^ __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Size __depth_limit) +std::__introselect cpp_src/stl_algo.h /^ __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Size __depth_limit, _Compare __comp) +std::__introsort_loop cpp_src/stl_algo.h /^ __introsort_loop(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Size __depth_limit) +std::__introsort_loop cpp_src/stl_algo.h /^ __introsort_loop(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Size __depth_limit, _Compare __comp) +std::__ioinit cpp_src/iostream /^ static ios_base::Init __ioinit;$/;" m namespace:std file: +std::__is_heap cpp_src/stl_heap.h /^ __is_heap(_RandomAccessIterator __first, _Distance __n)$/;" f namespace:std signature:(_RandomAccessIterator __first, _Distance __n) +std::__is_heap cpp_src/stl_heap.h /^ __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last) +std::__is_heap cpp_src/stl_heap.h /^ __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _StrictWeakOrdering __comp) +std::__is_heap cpp_src/stl_heap.h /^ __is_heap(_RandomAccessIterator __first, _StrictWeakOrdering __comp,$/;" f namespace:std signature:(_RandomAccessIterator __first, _StrictWeakOrdering __comp, _Distance __n) +std::__is_null_pointer cpp_src/basic_string.tcc /^ __is_null_pointer(_Type)$/;" f namespace:std signature:(_Type) +std::__is_null_pointer cpp_src/basic_string.tcc /^ __is_null_pointer(_Type* __ptr)$/;" f namespace:std signature:(_Type* __ptr) +std::__iter_swap cpp_src/stl_algobase.h /^ struct __iter_swap$/;" s namespace:std +std::__iter_swap cpp_src/stl_algobase.h /^ struct __iter_swap$/;" s namespace:std +std::__iter_swap::iter_swap cpp_src/stl_algobase.h /^ iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)$/;" f struct:std::__iter_swap access:public signature:(_ForwardIterator1 __a, _ForwardIterator2 __b) +std::__iterator_category cpp_src/stl_iterator_base_types.h /^ __iterator_category(const _Iter&)$/;" f namespace:std signature:(const _Iter&) +std::__less cpp_src/valarray_before.h /^ struct __less$/;" s namespace:std +std::__less::operator () cpp_src/valarray_before.h /^ bool operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__less access:public signature:(const _Tp& __x, const _Tp& __y) const +std::__less_equal cpp_src/valarray_before.h /^ struct __less_equal$/;" s namespace:std +std::__less_equal::operator () cpp_src/valarray_before.h /^ bool operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__less_equal access:public signature:(const _Tp& __x, const _Tp& __y) const +std::__lg cpp_src/stl_algo.h /^ __lg(_Size __n)$/;" f namespace:std signature:(_Size __n) +std::__log cpp_src/valarray_before.h /^ struct __log$/;" s namespace:std +std::__log10 cpp_src/valarray_before.h /^ struct __log10$/;" s namespace:std +std::__log10::operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__log10 access:public signature:(const _Tp& __t) const +std::__log::operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__log access:public signature:(const _Tp& __t) const +std::__logical_and cpp_src/valarray_before.h /^ struct __logical_and$/;" s namespace:std +std::__logical_and::operator () cpp_src/valarray_before.h /^ bool operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__logical_and access:public signature:(const _Tp& __x, const _Tp& __y) const +std::__logical_not cpp_src/valarray_before.h /^ struct __logical_not$/;" s namespace:std +std::__logical_not::operator () cpp_src/valarray_before.h /^ bool operator()(const _Tp& __x) const { return !__x; }$/;" f struct:std::__logical_not access:public signature:(const _Tp& __x) const +std::__logical_or cpp_src/valarray_before.h /^ struct __logical_or$/;" s namespace:std +std::__logical_or::operator () cpp_src/valarray_before.h /^ bool operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__logical_or access:public signature:(const _Tp& __x, const _Tp& __y) const +std::__median cpp_src/stl_algo.h /^ __median(const _Tp& __a, const _Tp& __b, const _Tp& __c)$/;" f namespace:std signature:(const _Tp& __a, const _Tp& __b, const _Tp& __c) +std::__median cpp_src/stl_algo.h /^ __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp)$/;" f namespace:std signature:(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp) +std::__merge_adaptive cpp_src/stl_algo.h /^ __merge_adaptive(_BidirectionalIterator __first,$/;" f namespace:std signature:(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2, _Pointer __buffer, _Distance __buffer_size) +std::__merge_adaptive cpp_src/stl_algo.h /^ __merge_adaptive(_BidirectionalIterator __first,$/;" f namespace:std signature:(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2, _Pointer __buffer, _Distance __buffer_size, _Compare __comp) +std::__merge_backward cpp_src/stl_algo.h /^ __merge_backward(_BidirectionalIterator1 __first1,$/;" f namespace:std signature:(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BidirectionalIterator3 __result) +std::__merge_backward cpp_src/stl_algo.h /^ __merge_backward(_BidirectionalIterator1 __first1,$/;" f namespace:std signature:(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BidirectionalIterator3 __result, _Compare __comp) +std::__merge_sort_loop cpp_src/stl_algo.h /^ __merge_sort_loop(_RandomAccessIterator1 __first,$/;" f namespace:std signature:(_RandomAccessIterator1 __first, _RandomAccessIterator1 __last, _RandomAccessIterator2 __result, _Distance __step_size) +std::__merge_sort_loop cpp_src/stl_algo.h /^ __merge_sort_loop(_RandomAccessIterator1 __first,$/;" f namespace:std signature:(_RandomAccessIterator1 __first, _RandomAccessIterator1 __last, _RandomAccessIterator2 __result, _Distance __step_size, _Compare __comp) +std::__merge_sort_with_buffer cpp_src/stl_algo.h /^ __merge_sort_with_buffer(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Pointer __buffer) +std::__merge_sort_with_buffer cpp_src/stl_algo.h /^ __merge_sort_with_buffer(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Pointer __buffer, _Compare __comp) +std::__merge_without_buffer cpp_src/stl_algo.h /^ __merge_without_buffer(_BidirectionalIterator __first,$/;" f namespace:std signature:(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2) +std::__merge_without_buffer cpp_src/stl_algo.h /^ __merge_without_buffer(_BidirectionalIterator __first,$/;" f namespace:std signature:(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2, _Compare __comp) +std::__minus cpp_src/valarray_before.h /^ struct __minus$/;" s namespace:std +std::__minus::operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__minus access:public signature:(const _Tp& __x, const _Tp& __y) const +std::__modulus cpp_src/valarray_before.h /^ struct __modulus$/;" s namespace:std +std::__modulus::operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__modulus access:public signature:(const _Tp& __x, const _Tp& __y) const +std::__moneypunct_cache cpp_src/locale_facets.h /^ struct __moneypunct_cache : public locale::facet$/;" s namespace:std inherits:locale::facet +std::__moneypunct_cache::_M_allocated cpp_src/locale_facets.h /^ bool _M_allocated;$/;" m struct:std::__moneypunct_cache access:public +std::__moneypunct_cache::_M_atoms cpp_src/locale_facets.h /^ _CharT _M_atoms[money_base::_S_end];$/;" m struct:std::__moneypunct_cache access:public +std::__moneypunct_cache::_M_cache cpp_src/locale_facets.h /^ _M_cache(const locale& __loc);$/;" p struct:std::__moneypunct_cache access:public signature:(const locale& __loc) +std::__moneypunct_cache::_M_cache cpp_src/locale_facets.tcc /^ __moneypunct_cache<_CharT, _Intl>::_M_cache(const locale& __loc)$/;" f class:std::__moneypunct_cache signature:(const locale& __loc) +std::__moneypunct_cache::_M_curr_symbol cpp_src/locale_facets.h /^ const _CharT* _M_curr_symbol;$/;" m struct:std::__moneypunct_cache access:public +std::__moneypunct_cache::_M_curr_symbol_size cpp_src/locale_facets.h /^ size_t _M_curr_symbol_size;$/;" m struct:std::__moneypunct_cache access:public +std::__moneypunct_cache::_M_decimal_point cpp_src/locale_facets.h /^ _CharT _M_decimal_point;$/;" m struct:std::__moneypunct_cache access:public +std::__moneypunct_cache::_M_frac_digits cpp_src/locale_facets.h /^ int _M_frac_digits;$/;" m struct:std::__moneypunct_cache access:public +std::__moneypunct_cache::_M_grouping cpp_src/locale_facets.h /^ const char* _M_grouping;$/;" m struct:std::__moneypunct_cache access:public +std::__moneypunct_cache::_M_grouping_size cpp_src/locale_facets.h /^ size_t _M_grouping_size;$/;" m struct:std::__moneypunct_cache access:public +std::__moneypunct_cache::_M_neg_format cpp_src/locale_facets.h /^ money_base::pattern _M_neg_format;$/;" m struct:std::__moneypunct_cache access:public +std::__moneypunct_cache::_M_negative_sign cpp_src/locale_facets.h /^ const _CharT* _M_negative_sign;$/;" m struct:std::__moneypunct_cache access:public +std::__moneypunct_cache::_M_negative_sign_size cpp_src/locale_facets.h /^ size_t _M_negative_sign_size;$/;" m struct:std::__moneypunct_cache access:public +std::__moneypunct_cache::_M_pos_format cpp_src/locale_facets.h /^ money_base::pattern _M_pos_format;$/;" m struct:std::__moneypunct_cache access:public +std::__moneypunct_cache::_M_positive_sign cpp_src/locale_facets.h /^ const _CharT* _M_positive_sign;$/;" m struct:std::__moneypunct_cache access:public +std::__moneypunct_cache::_M_positive_sign_size cpp_src/locale_facets.h /^ size_t _M_positive_sign_size;$/;" m struct:std::__moneypunct_cache access:public +std::__moneypunct_cache::_M_thousands_sep cpp_src/locale_facets.h /^ _CharT _M_thousands_sep;$/;" m struct:std::__moneypunct_cache access:public +std::__moneypunct_cache::_M_use_grouping cpp_src/locale_facets.h /^ bool _M_use_grouping;$/;" m struct:std::__moneypunct_cache access:public +std::__moneypunct_cache::__moneypunct_cache cpp_src/locale_facets.h /^ __moneypunct_cache(const __moneypunct_cache&);$/;" p struct:std::__moneypunct_cache access:private signature:(const __moneypunct_cache&) +std::__moneypunct_cache::__moneypunct_cache cpp_src/locale_facets.h /^ __moneypunct_cache(size_t __refs = 0) : facet(__refs),$/;" f struct:std::__moneypunct_cache access:public signature:(size_t __refs = 0) +std::__moneypunct_cache::operator = cpp_src/locale_facets.h /^ operator=(const __moneypunct_cache&);$/;" p struct:std::__moneypunct_cache access:private signature:(const __moneypunct_cache&) +std::__moneypunct_cache::~__moneypunct_cache cpp_src/locale_facets.h /^ ~__moneypunct_cache();$/;" p struct:std::__moneypunct_cache access:public signature:() +std::__moneypunct_cache::~__moneypunct_cache cpp_src/locale_facets.h /^ __moneypunct_cache<_CharT, _Intl>::~__moneypunct_cache()$/;" f class:std::__moneypunct_cache signature:() +std::__multiplies cpp_src/valarray_before.h /^ struct __multiplies$/;" s namespace:std +std::__multiplies::operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__multiplies access:public signature:(const _Tp& __x, const _Tp& __y) const +std::__negate cpp_src/valarray_before.h /^ struct __negate$/;" s namespace:std +std::__negate::operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__negate access:public signature:(const _Tp& __t) const +std::__not_equal_to cpp_src/valarray_before.h /^ struct __not_equal_to$/;" s namespace:std +std::__not_equal_to::operator () cpp_src/valarray_before.h /^ bool operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__not_equal_to access:public signature:(const _Tp& __x, const _Tp& __y) const +std::__num_base cpp_src/locale_facets.h /^ class __num_base$/;" c namespace:std +std::__num_base::_S_atoms_in cpp_src/locale_facets.h /^ static const char* _S_atoms_in;$/;" m class:std::__num_base access:public +std::__num_base::_S_atoms_out cpp_src/locale_facets.h /^ static const char* _S_atoms_out;$/;" m class:std::__num_base access:public +std::__num_base::_S_format_float cpp_src/locale_facets.h /^ _S_format_float(const ios_base& __io, char* __fptr, char __mod);$/;" p class:std::__num_base access:public signature:(const ios_base& __io, char* __fptr, char __mod) +std::__num_base::_S_iE cpp_src/locale_facets.h /^ _S_iE = _S_izero + 20,$/;" e enum:std::__num_base::__anon8 +std::__num_base::_S_iX cpp_src/locale_facets.h /^ _S_iX,$/;" e enum:std::__num_base::__anon8 +std::__num_base::_S_ie cpp_src/locale_facets.h /^ _S_ie = _S_izero + 14,$/;" e enum:std::__num_base::__anon8 +std::__num_base::_S_iend cpp_src/locale_facets.h /^ _S_iend = 26$/;" e enum:std::__num_base::__anon8 +std::__num_base::_S_iminus cpp_src/locale_facets.h /^ _S_iminus,$/;" e enum:std::__num_base::__anon8 +std::__num_base::_S_iplus cpp_src/locale_facets.h /^ _S_iplus,$/;" e enum:std::__num_base::__anon8 +std::__num_base::_S_ix cpp_src/locale_facets.h /^ _S_ix,$/;" e enum:std::__num_base::__anon8 +std::__num_base::_S_izero cpp_src/locale_facets.h /^ _S_izero,$/;" e enum:std::__num_base::__anon8 +std::__num_base::_S_oE cpp_src/locale_facets.h /^ _S_oE = _S_oudigits + 14, \/\/ For scientific notation, 'E'$/;" e enum:std::__num_base::__anon7 +std::__num_base::_S_oX cpp_src/locale_facets.h /^ _S_oX,$/;" e enum:std::__num_base::__anon7 +std::__num_base::_S_odigits cpp_src/locale_facets.h /^ _S_odigits,$/;" e enum:std::__num_base::__anon7 +std::__num_base::_S_odigits_end cpp_src/locale_facets.h /^ _S_odigits_end = _S_odigits + 16,$/;" e enum:std::__num_base::__anon7 +std::__num_base::_S_oe cpp_src/locale_facets.h /^ _S_oe = _S_odigits + 14, \/\/ For scientific notation, 'e'$/;" e enum:std::__num_base::__anon7 +std::__num_base::_S_oend cpp_src/locale_facets.h /^ _S_oend = _S_oudigits_end$/;" e enum:std::__num_base::__anon7 +std::__num_base::_S_ominus cpp_src/locale_facets.h /^ _S_ominus,$/;" e enum:std::__num_base::__anon7 +std::__num_base::_S_oplus cpp_src/locale_facets.h /^ _S_oplus,$/;" e enum:std::__num_base::__anon7 +std::__num_base::_S_oudigits cpp_src/locale_facets.h /^ _S_oudigits = _S_odigits_end,$/;" e enum:std::__num_base::__anon7 +std::__num_base::_S_oudigits_end cpp_src/locale_facets.h /^ _S_oudigits_end = _S_oudigits + 16,$/;" e enum:std::__num_base::__anon7 +std::__num_base::_S_ox cpp_src/locale_facets.h /^ _S_ox,$/;" e enum:std::__num_base::__anon7 +std::__numeric_limits_base cpp_src/limits /^ struct __numeric_limits_base$/;" s namespace:std file: +std::__numeric_limits_base::digits cpp_src/limits /^ static const int digits = 0;$/;" m struct:std::__numeric_limits_base file: access:public +std::__numeric_limits_base::digits10 cpp_src/limits /^ static const int digits10 = 0;$/;" m struct:std::__numeric_limits_base file: access:public +std::__numeric_limits_base::has_denorm cpp_src/limits /^ static const float_denorm_style has_denorm = denorm_absent;$/;" m struct:std::__numeric_limits_base file: access:public +std::__numeric_limits_base::has_denorm_loss cpp_src/limits /^ static const bool has_denorm_loss = false;$/;" m struct:std::__numeric_limits_base file: access:public +std::__numeric_limits_base::has_infinity cpp_src/limits /^ static const bool has_infinity = false;$/;" m struct:std::__numeric_limits_base file: access:public +std::__numeric_limits_base::has_quiet_NaN cpp_src/limits /^ static const bool has_quiet_NaN = false;$/;" m struct:std::__numeric_limits_base file: access:public +std::__numeric_limits_base::has_signaling_NaN cpp_src/limits /^ static const bool has_signaling_NaN = false;$/;" m struct:std::__numeric_limits_base file: access:public +std::__numeric_limits_base::is_bounded cpp_src/limits /^ static const bool is_bounded = false;$/;" m struct:std::__numeric_limits_base file: access:public +std::__numeric_limits_base::is_exact cpp_src/limits /^ static const bool is_exact = false;$/;" m struct:std::__numeric_limits_base file: access:public +std::__numeric_limits_base::is_iec559 cpp_src/limits /^ static const bool is_iec559 = false;$/;" m struct:std::__numeric_limits_base file: access:public +std::__numeric_limits_base::is_integer cpp_src/limits /^ static const bool is_integer = false;$/;" m struct:std::__numeric_limits_base file: access:public +std::__numeric_limits_base::is_modulo cpp_src/limits /^ static const bool is_modulo = false;$/;" m struct:std::__numeric_limits_base file: access:public +std::__numeric_limits_base::is_signed cpp_src/limits /^ static const bool is_signed = false;$/;" m struct:std::__numeric_limits_base file: access:public +std::__numeric_limits_base::is_specialized cpp_src/limits /^ static const bool is_specialized = false;$/;" m struct:std::__numeric_limits_base file: access:public +std::__numeric_limits_base::max_exponent cpp_src/limits /^ static const int max_exponent = 0;$/;" m struct:std::__numeric_limits_base file: access:public +std::__numeric_limits_base::max_exponent10 cpp_src/limits /^ static const int max_exponent10 = 0;$/;" m struct:std::__numeric_limits_base file: access:public +std::__numeric_limits_base::min_exponent cpp_src/limits /^ static const int min_exponent = 0;$/;" m struct:std::__numeric_limits_base file: access:public +std::__numeric_limits_base::min_exponent10 cpp_src/limits /^ static const int min_exponent10 = 0;$/;" m struct:std::__numeric_limits_base file: access:public +std::__numeric_limits_base::radix cpp_src/limits /^ static const int radix = 0;$/;" m struct:std::__numeric_limits_base file: access:public +std::__numeric_limits_base::round_style cpp_src/limits /^ static const float_round_style round_style = round_toward_zero;$/;" m struct:std::__numeric_limits_base file: access:public +std::__numeric_limits_base::tinyness_before cpp_src/limits /^ static const bool tinyness_before = false;$/;" m struct:std::__numeric_limits_base file: access:public +std::__numeric_limits_base::traps cpp_src/limits /^ static const bool traps = false;$/;" m struct:std::__numeric_limits_base file: access:public +std::__numpunct_cache cpp_src/locale_facets.h /^ struct __numpunct_cache : public locale::facet$/;" s namespace:std inherits:locale::facet +std::__numpunct_cache::_M_allocated cpp_src/locale_facets.h /^ bool _M_allocated;$/;" m struct:std::__numpunct_cache access:public +std::__numpunct_cache::_M_atoms_in cpp_src/locale_facets.h /^ _CharT _M_atoms_in[__num_base::_S_iend];$/;" m struct:std::__numpunct_cache access:public +std::__numpunct_cache::_M_atoms_out cpp_src/locale_facets.h /^ _CharT _M_atoms_out[__num_base::_S_oend];$/;" m struct:std::__numpunct_cache access:public +std::__numpunct_cache::_M_cache cpp_src/locale_facets.h /^ _M_cache(const locale& __loc);$/;" p struct:std::__numpunct_cache access:public signature:(const locale& __loc) +std::__numpunct_cache::_M_cache cpp_src/locale_facets.tcc /^ __numpunct_cache<_CharT>::_M_cache(const locale& __loc)$/;" f class:std::__numpunct_cache signature:(const locale& __loc) +std::__numpunct_cache::_M_decimal_point cpp_src/locale_facets.h /^ _CharT _M_decimal_point;$/;" m struct:std::__numpunct_cache access:public +std::__numpunct_cache::_M_falsename cpp_src/locale_facets.h /^ const _CharT* _M_falsename;$/;" m struct:std::__numpunct_cache access:public +std::__numpunct_cache::_M_falsename_size cpp_src/locale_facets.h /^ size_t _M_falsename_size;$/;" m struct:std::__numpunct_cache access:public +std::__numpunct_cache::_M_grouping cpp_src/locale_facets.h /^ const char* _M_grouping;$/;" m struct:std::__numpunct_cache access:public +std::__numpunct_cache::_M_grouping_size cpp_src/locale_facets.h /^ size_t _M_grouping_size;$/;" m struct:std::__numpunct_cache access:public +std::__numpunct_cache::_M_thousands_sep cpp_src/locale_facets.h /^ _CharT _M_thousands_sep;$/;" m struct:std::__numpunct_cache access:public +std::__numpunct_cache::_M_truename cpp_src/locale_facets.h /^ const _CharT* _M_truename;$/;" m struct:std::__numpunct_cache access:public +std::__numpunct_cache::_M_truename_size cpp_src/locale_facets.h /^ size_t _M_truename_size;$/;" m struct:std::__numpunct_cache access:public +std::__numpunct_cache::_M_use_grouping cpp_src/locale_facets.h /^ bool _M_use_grouping;$/;" m struct:std::__numpunct_cache access:public +std::__numpunct_cache::__numpunct_cache cpp_src/locale_facets.h /^ __numpunct_cache(const __numpunct_cache&);$/;" p struct:std::__numpunct_cache access:private signature:(const __numpunct_cache&) +std::__numpunct_cache::__numpunct_cache cpp_src/locale_facets.h /^ __numpunct_cache(size_t __refs = 0) : facet(__refs),$/;" f struct:std::__numpunct_cache access:public signature:(size_t __refs = 0) +std::__numpunct_cache::operator = cpp_src/locale_facets.h /^ operator=(const __numpunct_cache&);$/;" p struct:std::__numpunct_cache access:private signature:(const __numpunct_cache&) +std::__numpunct_cache::~__numpunct_cache cpp_src/locale_facets.h /^ ~__numpunct_cache();$/;" p struct:std::__numpunct_cache access:public signature:() +std::__numpunct_cache::~__numpunct_cache cpp_src/locale_facets.h /^ __numpunct_cache<_CharT>::~__numpunct_cache()$/;" f class:std::__numpunct_cache signature:() +std::__ostream_fill cpp_src/ostream_insert.h /^ __ostream_fill(basic_ostream<_CharT, _Traits>& __out, streamsize __n)$/;" f namespace:std signature:(basic_ostream<_CharT, _Traits>& __out, streamsize __n) +std::__ostream_insert cpp_src/ostream_insert.h /^ __ostream_insert(basic_ostream<_CharT, _Traits>& __out,$/;" f namespace:std signature:(basic_ostream<_CharT, _Traits>& __out, const _CharT* __s, streamsize __n) +std::__ostream_insert cpp_src/ostream_insert.h /^ extern template ostream& __ostream_insert(ostream&, const char*, streamsize);$/;" p namespace:std signature:(ostream&, const char*, streamsize) +std::__ostream_insert cpp_src/ostream_insert.h /^ extern template wostream& __ostream_insert(wostream&, const wchar_t*,$/;" p namespace:std signature:(wostream&, const wchar_t*, streamsize) +std::__ostream_write cpp_src/ostream_insert.h /^ __ostream_write(basic_ostream<_CharT, _Traits>& __out,$/;" f namespace:std signature:(basic_ostream<_CharT, _Traits>& __out, const _CharT* __s, streamsize __n) +std::__pad cpp_src/locale_facets.h /^ struct __pad$/;" s namespace:std +std::__pad::_S_pad cpp_src/locale_facets.h /^ _S_pad(ios_base& __io, _CharT __fill, _CharT* __news,$/;" p struct:std::__pad access:public signature:(ios_base& __io, _CharT __fill, _CharT* __news, const _CharT* __olds, const streamsize __newlen, const streamsize __oldlen, const bool __num) +std::__pad::_S_pad cpp_src/locale_facets.tcc /^ __pad<_CharT, _Traits>::_S_pad(ios_base& __io, _CharT __fill,$/;" f class:std::__pad signature:(ios_base& __io, _CharT __fill, _CharT* __news, const _CharT* __olds, const streamsize __newlen, const streamsize __oldlen, const bool __num) +std::__partition cpp_src/stl_algo.h /^ __partition(_BidirectionalIterator __first, _BidirectionalIterator __last,$/;" f namespace:std signature:(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, bidirectional_iterator_tag) +std::__partition cpp_src/stl_algo.h /^ __partition(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) +std::__plus cpp_src/valarray_before.h /^ struct __plus$/;" s namespace:std +std::__plus::operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__plus access:public signature:(const _Tp& __x, const _Tp& __y) const +std::__pop_heap cpp_src/stl_heap.h /^ __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __result, _Tp __value) +std::__pop_heap cpp_src/stl_heap.h /^ __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __result, _Tp __value, _Compare __comp) +std::__pow cpp_src/valarray_before.h /^ struct __pow$/;" s namespace:std +std::__pow::operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__pow access:public signature:(const _Tp& __x, const _Tp& __y) const +std::__pow_helper cpp_src/cmath /^ __pow_helper(_Tp __x, int __n)$/;" f namespace:std signature:(_Tp __x, int __n) +std::__push_heap cpp_src/stl_heap.h /^ __push_heap(_RandomAccessIterator __first, _Distance __holeIndex,$/;" f namespace:std signature:(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __topIndex, _Tp __value, _Compare __comp) +std::__push_heap cpp_src/stl_heap.h /^ __push_heap(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __topIndex, _Tp __value) +std::__reverse cpp_src/stl_algo.h /^ __reverse(_BidirectionalIterator __first, _BidirectionalIterator __last,$/;" f namespace:std signature:(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) +std::__reverse cpp_src/stl_algo.h /^ __reverse(_RandomAccessIterator __first, _RandomAccessIterator __last,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) +std::__rotate cpp_src/stl_algo.h /^ __rotate(_BidirectionalIterator __first,$/;" f namespace:std signature:(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, bidirectional_iterator_tag) +std::__rotate cpp_src/stl_algo.h /^ __rotate(_ForwardIterator __first,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, forward_iterator_tag) +std::__rotate cpp_src/stl_algo.h /^ __rotate(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, random_access_iterator_tag) +std::__rotate_adaptive cpp_src/stl_algo.h /^ __rotate_adaptive(_BidirectionalIterator1 __first,$/;" f namespace:std signature:(_BidirectionalIterator1 __first, _BidirectionalIterator1 __middle, _BidirectionalIterator1 __last, _Distance __len1, _Distance __len2, _BidirectionalIterator2 __buffer, _Distance __buffer_size) +std::__search_n cpp_src/stl_algo.h /^ __search_n(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _Integer __count, const _Tp& __val, _BinaryPredicate __binary_pred, std::forward_iterator_tag) +std::__search_n cpp_src/stl_algo.h /^ __search_n(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _Integer __count, const _Tp& __val, std::forward_iterator_tag) +std::__search_n cpp_src/stl_algo.h /^ __search_n(_RandomAccessIter __first, _RandomAccessIter __last,$/;" f namespace:std signature:(_RandomAccessIter __first, _RandomAccessIter __last, _Integer __count, const _Tp& __val, _BinaryPredicate __binary_pred, std::random_access_iterator_tag) +std::__search_n cpp_src/stl_algo.h /^ __search_n(_RandomAccessIter __first, _RandomAccessIter __last,$/;" f namespace:std signature:(_RandomAccessIter __first, _RandomAccessIter __last, _Integer __count, const _Tp& __val, std::random_access_iterator_tag) +std::__shift_left cpp_src/valarray_before.h /^ struct __shift_left$/;" s namespace:std +std::__shift_left::operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__shift_left access:public signature:(const _Tp& __x, const _Tp& __y) const +std::__shift_right cpp_src/valarray_before.h /^ struct __shift_right$/;" s namespace:std +std::__shift_right::operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::__shift_right access:public signature:(const _Tp& __x, const _Tp& __y) const +std::__sin cpp_src/valarray_before.h /^ struct __sin$/;" s namespace:std +std::__sin::operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__sin access:public signature:(const _Tp& __t) const +std::__sinh cpp_src/valarray_before.h /^ struct __sinh$/;" s namespace:std +std::__sinh::operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__sinh access:public signature:(const _Tp& __t) const +std::__sqrt cpp_src/valarray_before.h /^ struct __sqrt$/;" s namespace:std +std::__sqrt::operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__sqrt access:public signature:(const _Tp& __t) const +std::__stable_partition_adaptive cpp_src/stl_algo.h /^ __stable_partition_adaptive(_ForwardIterator __first,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, _Distance __len, _Pointer __buffer, _Distance __buffer_size) +std::__stable_sort_adaptive cpp_src/stl_algo.h /^ __stable_sort_adaptive(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Pointer __buffer, _Distance __buffer_size) +std::__stable_sort_adaptive cpp_src/stl_algo.h /^ __stable_sort_adaptive(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Pointer __buffer, _Distance __buffer_size, _Compare __comp) +std::__tan cpp_src/valarray_before.h /^ struct __tan$/;" s namespace:std +std::__tan::operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__tan access:public signature:(const _Tp& __t) const +std::__tanh cpp_src/valarray_before.h /^ struct __tanh$/;" s namespace:std +std::__tanh::operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__tanh access:public signature:(const _Tp& __t) const +std::__throw_bad_alloc cpp_src/functexcept.h /^ __throw_bad_alloc(void) __attribute__((__noreturn__));$/;" p namespace:std signature:(void) +std::__throw_bad_cast cpp_src/functexcept.h /^ __throw_bad_cast(void) __attribute__((__noreturn__));$/;" p namespace:std signature:(void) +std::__throw_bad_exception cpp_src/functexcept.h /^ __throw_bad_exception(void) __attribute__((__noreturn__));$/;" p namespace:std signature:(void) +std::__throw_bad_typeid cpp_src/functexcept.h /^ __throw_bad_typeid(void) __attribute__((__noreturn__));$/;" p namespace:std signature:(void) +std::__throw_domain_error cpp_src/functexcept.h /^ __throw_domain_error(const char*) __attribute__((__noreturn__));$/;" p namespace:std signature:(const char*) +std::__throw_invalid_argument cpp_src/functexcept.h /^ __throw_invalid_argument(const char*) __attribute__((__noreturn__));$/;" p namespace:std signature:(const char*) +std::__throw_ios_failure cpp_src/functexcept.h /^ __throw_ios_failure(const char*) __attribute__((__noreturn__));$/;" p namespace:std signature:(const char*) +std::__throw_length_error cpp_src/functexcept.h /^ __throw_length_error(const char*) __attribute__((__noreturn__));$/;" p namespace:std signature:(const char*) +std::__throw_logic_error cpp_src/functexcept.h /^ __throw_logic_error(const char*) __attribute__((__noreturn__));$/;" p namespace:std signature:(const char*) +std::__throw_out_of_range cpp_src/functexcept.h /^ __throw_out_of_range(const char*) __attribute__((__noreturn__));$/;" p namespace:std signature:(const char*) +std::__throw_overflow_error cpp_src/functexcept.h /^ __throw_overflow_error(const char*) __attribute__((__noreturn__));$/;" p namespace:std signature:(const char*) +std::__throw_range_error cpp_src/functexcept.h /^ __throw_range_error(const char*) __attribute__((__noreturn__));$/;" p namespace:std signature:(const char*) +std::__throw_runtime_error cpp_src/functexcept.h /^ __throw_runtime_error(const char*) __attribute__((__noreturn__));$/;" p namespace:std signature:(const char*) +std::__throw_underflow_error cpp_src/functexcept.h /^ __throw_underflow_error(const char*) __attribute__((__noreturn__));$/;" p namespace:std signature:(const char*) +std::__timepunct cpp_src/locale_facets.h /^ class __timepunct : public locale::facet$/;" c namespace:std inherits:locale::facet +std::__timepunct::_M_am_pm cpp_src/locale_facets.h /^ _M_am_pm(const _CharT** __ampm) const$/;" f class:std::__timepunct access:public signature:(const _CharT** __ampm) const +std::__timepunct::_M_am_pm_format cpp_src/locale_facets.h /^ _M_am_pm_format(const _CharT* __ampm) const$/;" f class:std::__timepunct access:public signature:(const _CharT* __ampm) const +std::__timepunct::_M_c_locale_timepunct cpp_src/locale_facets.h /^ __c_locale _M_c_locale_timepunct;$/;" m class:std::__timepunct access:protected +std::__timepunct::_M_data cpp_src/locale_facets.h /^ __cache_type* _M_data;$/;" m class:std::__timepunct access:protected +std::__timepunct::_M_date_formats cpp_src/locale_facets.h /^ _M_date_formats(const _CharT** __date) const$/;" f class:std::__timepunct access:public signature:(const _CharT** __date) const +std::__timepunct::_M_date_time_formats cpp_src/locale_facets.h /^ _M_date_time_formats(const _CharT** __dt) const$/;" f class:std::__timepunct access:public signature:(const _CharT** __dt) const +std::__timepunct::_M_days cpp_src/locale_facets.h /^ _M_days(const _CharT** __days) const$/;" f class:std::__timepunct access:public signature:(const _CharT** __days) const +std::__timepunct::_M_days_abbreviated cpp_src/locale_facets.h /^ _M_days_abbreviated(const _CharT** __days) const$/;" f class:std::__timepunct access:public signature:(const _CharT** __days) const +std::__timepunct::_M_initialize_timepunct cpp_src/locale_facets.h /^ _M_initialize_timepunct(__c_locale __cloc = NULL);$/;" p class:std::__timepunct access:protected signature:(__c_locale __cloc = NULL) +std::__timepunct::_M_initialize_timepunct cpp_src/locale_facets.h /^ __timepunct::_M_initialize_timepunct(__c_locale __cloc);$/;" p class:std::__timepunct signature:(__c_locale __cloc) +std::__timepunct::_M_initialize_timepunct cpp_src/locale_facets.h /^ __timepunct::_M_initialize_timepunct(__c_locale __cloc);$/;" p class:std::__timepunct signature:(__c_locale __cloc) +std::__timepunct::_M_months cpp_src/locale_facets.h /^ _M_months(const _CharT** __months) const$/;" f class:std::__timepunct access:public signature:(const _CharT** __months) const +std::__timepunct::_M_months_abbreviated cpp_src/locale_facets.h /^ _M_months_abbreviated(const _CharT** __months) const$/;" f class:std::__timepunct access:public signature:(const _CharT** __months) const +std::__timepunct::_M_name_timepunct cpp_src/locale_facets.h /^ const char* _M_name_timepunct;$/;" m class:std::__timepunct access:protected +std::__timepunct::_M_put cpp_src/locale_facets.h /^ _M_put(_CharT* __s, size_t __maxlen, const _CharT* __format,$/;" p class:std::__timepunct access:public signature:(_CharT* __s, size_t __maxlen, const _CharT* __format, const tm* __tm) const +std::__timepunct::_M_put cpp_src/locale_facets.h /^ __timepunct::_M_put(char*, size_t, const char*, const tm*) const;$/;" p class:std::__timepunct signature:(char*, size_t, const char*, const tm*) const +std::__timepunct::_M_put cpp_src/locale_facets.h /^ __timepunct::_M_put(wchar_t*, size_t, const wchar_t*,$/;" p class:std::__timepunct signature:(wchar_t*, size_t, const wchar_t*, const tm*) const +std::__timepunct::_M_time_formats cpp_src/locale_facets.h /^ _M_time_formats(const _CharT** __time) const$/;" f class:std::__timepunct access:public signature:(const _CharT** __time) const +std::__timepunct::__cache_type cpp_src/locale_facets.h /^ typedef __timepunct_cache<_CharT> __cache_type;$/;" t class:std::__timepunct access:public +std::__timepunct::__char_type cpp_src/locale_facets.h /^ typedef _CharT __char_type;$/;" t class:std::__timepunct access:public +std::__timepunct::__string_type cpp_src/locale_facets.h /^ typedef basic_string<_CharT> __string_type;$/;" t class:std::__timepunct access:public +std::__timepunct::__timepunct cpp_src/locale_facets.h /^ __timepunct(__c_locale __cloc, const char* __s, size_t __refs = 0);$/;" p class:std::__timepunct access:public signature:(__c_locale __cloc, const char* __s, size_t __refs = 0) +std::__timepunct::__timepunct cpp_src/locale_facets.h /^ __timepunct(__cache_type* __cache, size_t __refs = 0);$/;" p class:std::__timepunct access:public signature:(__cache_type* __cache, size_t __refs = 0) +std::__timepunct::__timepunct cpp_src/locale_facets.h /^ __timepunct(size_t __refs = 0);$/;" p class:std::__timepunct access:public signature:(size_t __refs = 0) +std::__timepunct::id cpp_src/locale_facets.h /^ static locale::id id;$/;" m class:std::__timepunct access:public +std::__timepunct::id cpp_src/locale_facets.h /^ locale::id __timepunct<_CharT>::id;$/;" m class:std::__timepunct +std::__timepunct::~__timepunct cpp_src/locale_facets.h /^ ~__timepunct();$/;" p class:std::__timepunct access:protected signature:() +std::__timepunct_cache cpp_src/locale_facets.h /^ struct __timepunct_cache : public locale::facet$/;" s namespace:std inherits:locale::facet +std::__timepunct_cache::_M_aday1 cpp_src/locale_facets.h /^ const _CharT* _M_aday1;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_aday2 cpp_src/locale_facets.h /^ const _CharT* _M_aday2;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_aday3 cpp_src/locale_facets.h /^ const _CharT* _M_aday3;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_aday4 cpp_src/locale_facets.h /^ const _CharT* _M_aday4;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_aday5 cpp_src/locale_facets.h /^ const _CharT* _M_aday5;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_aday6 cpp_src/locale_facets.h /^ const _CharT* _M_aday6;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_aday7 cpp_src/locale_facets.h /^ const _CharT* _M_aday7;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_allocated cpp_src/locale_facets.h /^ bool _M_allocated;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_am cpp_src/locale_facets.h /^ const _CharT* _M_am;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_am_pm_format cpp_src/locale_facets.h /^ const _CharT* _M_am_pm_format;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_amonth01 cpp_src/locale_facets.h /^ const _CharT* _M_amonth01;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_amonth02 cpp_src/locale_facets.h /^ const _CharT* _M_amonth02;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_amonth03 cpp_src/locale_facets.h /^ const _CharT* _M_amonth03;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_amonth04 cpp_src/locale_facets.h /^ const _CharT* _M_amonth04;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_amonth05 cpp_src/locale_facets.h /^ const _CharT* _M_amonth05;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_amonth06 cpp_src/locale_facets.h /^ const _CharT* _M_amonth06;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_amonth07 cpp_src/locale_facets.h /^ const _CharT* _M_amonth07;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_amonth08 cpp_src/locale_facets.h /^ const _CharT* _M_amonth08;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_amonth09 cpp_src/locale_facets.h /^ const _CharT* _M_amonth09;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_amonth10 cpp_src/locale_facets.h /^ const _CharT* _M_amonth10;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_amonth11 cpp_src/locale_facets.h /^ const _CharT* _M_amonth11;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_amonth12 cpp_src/locale_facets.h /^ const _CharT* _M_amonth12;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_cache cpp_src/locale_facets.h /^ _M_cache(const locale& __loc);$/;" p struct:std::__timepunct_cache access:public signature:(const locale& __loc) +std::__timepunct_cache::_M_date_era_format cpp_src/locale_facets.h /^ const _CharT* _M_date_era_format;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_date_format cpp_src/locale_facets.h /^ const _CharT* _M_date_format;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_date_time_era_format cpp_src/locale_facets.h /^ const _CharT* _M_date_time_era_format;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_date_time_format cpp_src/locale_facets.h /^ const _CharT* _M_date_time_format;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_day1 cpp_src/locale_facets.h /^ const _CharT* _M_day1;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_day2 cpp_src/locale_facets.h /^ const _CharT* _M_day2;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_day3 cpp_src/locale_facets.h /^ const _CharT* _M_day3;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_day4 cpp_src/locale_facets.h /^ const _CharT* _M_day4;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_day5 cpp_src/locale_facets.h /^ const _CharT* _M_day5;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_day6 cpp_src/locale_facets.h /^ const _CharT* _M_day6;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_day7 cpp_src/locale_facets.h /^ const _CharT* _M_day7;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_month01 cpp_src/locale_facets.h /^ const _CharT* _M_month01;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_month02 cpp_src/locale_facets.h /^ const _CharT* _M_month02;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_month03 cpp_src/locale_facets.h /^ const _CharT* _M_month03;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_month04 cpp_src/locale_facets.h /^ const _CharT* _M_month04;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_month05 cpp_src/locale_facets.h /^ const _CharT* _M_month05;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_month06 cpp_src/locale_facets.h /^ const _CharT* _M_month06;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_month07 cpp_src/locale_facets.h /^ const _CharT* _M_month07;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_month08 cpp_src/locale_facets.h /^ const _CharT* _M_month08;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_month09 cpp_src/locale_facets.h /^ const _CharT* _M_month09;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_month10 cpp_src/locale_facets.h /^ const _CharT* _M_month10;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_month11 cpp_src/locale_facets.h /^ const _CharT* _M_month11;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_month12 cpp_src/locale_facets.h /^ const _CharT* _M_month12;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_pm cpp_src/locale_facets.h /^ const _CharT* _M_pm;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_time_era_format cpp_src/locale_facets.h /^ const _CharT* _M_time_era_format;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_M_time_format cpp_src/locale_facets.h /^ const _CharT* _M_time_format;$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_S_timezones cpp_src/locale_facets.h /^ static const _CharT* _S_timezones[14];$/;" m struct:std::__timepunct_cache access:public +std::__timepunct_cache::_S_timezones cpp_src/locale_facets.h /^ __timepunct_cache::_S_timezones[14];$/;" m class:std::__timepunct_cache +std::__timepunct_cache::_S_timezones cpp_src/locale_facets.h /^ __timepunct_cache::_S_timezones[14];$/;" m class:std::__timepunct_cache +std::__timepunct_cache::_S_timezones cpp_src/locale_facets.h /^ const _CharT* __timepunct_cache<_CharT>::_S_timezones[14];$/;" m class:std::__timepunct_cache +std::__timepunct_cache::__timepunct_cache cpp_src/locale_facets.h /^ __timepunct_cache(const __timepunct_cache&);$/;" p struct:std::__timepunct_cache access:private signature:(const __timepunct_cache&) +std::__timepunct_cache::__timepunct_cache cpp_src/locale_facets.h /^ __timepunct_cache(size_t __refs = 0) : facet(__refs),$/;" f struct:std::__timepunct_cache access:public signature:(size_t __refs = 0) +std::__timepunct_cache::operator = cpp_src/locale_facets.h /^ operator=(const __timepunct_cache&);$/;" p struct:std::__timepunct_cache access:private signature:(const __timepunct_cache&) +std::__timepunct_cache::~__timepunct_cache cpp_src/locale_facets.h /^ ~__timepunct_cache();$/;" p struct:std::__timepunct_cache access:public signature:() +std::__timepunct_cache::~__timepunct_cache cpp_src/locale_facets.h /^ __timepunct_cache<_CharT>::~__timepunct_cache()$/;" f class:std::__timepunct_cache signature:() +std::__unary_plus cpp_src/valarray_before.h /^ struct __unary_plus$/;" s namespace:std +std::__unary_plus::operator () cpp_src/valarray_before.h /^ _Tp operator()(const _Tp& __t) const$/;" f struct:std::__unary_plus access:public signature:(const _Tp& __t) const +std::__unguarded_insertion_sort cpp_src/stl_algo.h /^ __unguarded_insertion_sort(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last) +std::__unguarded_insertion_sort cpp_src/stl_algo.h /^ __unguarded_insertion_sort(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) +std::__unguarded_linear_insert cpp_src/stl_algo.h /^ __unguarded_linear_insert(_RandomAccessIterator __last, _Tp __val)$/;" f namespace:std signature:(_RandomAccessIterator __last, _Tp __val) +std::__unguarded_linear_insert cpp_src/stl_algo.h /^ __unguarded_linear_insert(_RandomAccessIterator __last, _Tp __val,$/;" f namespace:std signature:(_RandomAccessIterator __last, _Tp __val, _Compare __comp) +std::__unguarded_partition cpp_src/stl_algo.h /^ __unguarded_partition(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Tp __pivot) +std::__unguarded_partition cpp_src/stl_algo.h /^ __unguarded_partition(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Tp __pivot, _Compare __comp) +std::__uninitialized_copy_a cpp_src/stl_uninitialized.h /^ __uninitialized_copy_a(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _Allocator __alloc) +std::__uninitialized_copy_a cpp_src/stl_uninitialized.h /^ __uninitialized_copy_a(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, allocator<_Tp>) +std::__uninitialized_copy_aux cpp_src/stl_uninitialized.h /^ __uninitialized_copy_aux(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, __false_type) +std::__uninitialized_copy_aux cpp_src/stl_uninitialized.h /^ __uninitialized_copy_aux(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, __true_type) +std::__uninitialized_copy_copy cpp_src/stl_uninitialized.h /^ __uninitialized_copy_copy(_InputIterator1 __first1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _ForwardIterator __result, _Allocator __alloc) +std::__uninitialized_copy_fill cpp_src/stl_uninitialized.h /^ __uninitialized_copy_fill(_InputIterator __first1, _InputIterator __last1,$/;" f namespace:std signature:(_InputIterator __first1, _InputIterator __last1, _ForwardIterator __first2, _ForwardIterator __last2, const _Tp& __x, _Allocator __alloc) +std::__uninitialized_fill_a cpp_src/stl_uninitialized.h /^ __uninitialized_fill_a(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x, _Allocator __alloc) +std::__uninitialized_fill_a cpp_src/stl_uninitialized.h /^ __uninitialized_fill_a(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x, allocator<_Tp2>) +std::__uninitialized_fill_aux cpp_src/stl_uninitialized.h /^ __uninitialized_fill_aux(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x, __false_type) +std::__uninitialized_fill_aux cpp_src/stl_uninitialized.h /^ __uninitialized_fill_aux(_ForwardIterator __first,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x, __true_type) +std::__uninitialized_fill_copy cpp_src/stl_uninitialized.h /^ __uninitialized_fill_copy(_ForwardIterator __result, _ForwardIterator __mid,$/;" f namespace:std signature:(_ForwardIterator __result, _ForwardIterator __mid, const _Tp& __x, _InputIterator __first, _InputIterator __last, _Allocator __alloc) +std::__uninitialized_fill_n_a cpp_src/stl_uninitialized.h /^ __uninitialized_fill_n_a(_ForwardIterator __first, _Size __n, $/;" f namespace:std signature:(_ForwardIterator __first, _Size __n, const _Tp& __x, _Allocator __alloc) +std::__uninitialized_fill_n_a cpp_src/stl_uninitialized.h /^ __uninitialized_fill_n_a(_ForwardIterator __first, _Size __n, $/;" f namespace:std signature:(_ForwardIterator __first, _Size __n, const _Tp& __x, allocator<_Tp2>) +std::__uninitialized_fill_n_aux cpp_src/stl_uninitialized.h /^ __uninitialized_fill_n_aux(_ForwardIterator __first, _Size __n,$/;" f namespace:std signature:(_ForwardIterator __first, _Size __n, const _Tp& __x, __false_type) +std::__uninitialized_fill_n_aux cpp_src/stl_uninitialized.h /^ __uninitialized_fill_n_aux(_ForwardIterator __first, _Size __n,$/;" f namespace:std signature:(_ForwardIterator __first, _Size __n, const _Tp& __x, __true_type) +std::__unique_copy cpp_src/stl_algo.h /^ __unique_copy(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __binary_pred, forward_iterator_tag, output_iterator_tag) +std::__unique_copy cpp_src/stl_algo.h /^ __unique_copy(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, forward_iterator_tag, output_iterator_tag) +std::__unique_copy cpp_src/stl_algo.h /^ __unique_copy(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __binary_pred, input_iterator_tag, forward_iterator_tag) +std::__unique_copy cpp_src/stl_algo.h /^ __unique_copy(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, input_iterator_tag, forward_iterator_tag) +std::__unique_copy cpp_src/stl_algo.h /^ __unique_copy(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __binary_pred, input_iterator_tag, output_iterator_tag) +std::__unique_copy cpp_src/stl_algo.h /^ __unique_copy(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _OutputIterator __result, input_iterator_tag, output_iterator_tag) +std::__use_cache cpp_src/locale_facets.tcc /^ struct __use_cache$/;" s namespace:std file: +std::__use_cache cpp_src/locale_facets.tcc /^ struct __use_cache<__moneypunct_cache<_CharT, _Intl> >$/;" s namespace:std file: +std::__use_cache cpp_src/locale_facets.tcc /^ struct __use_cache<__numpunct_cache<_CharT> >$/;" s namespace:std file: +std::__use_cache::operator () cpp_src/locale_facets.tcc /^ operator() (const locale& __loc) const$/;" f struct:std::__use_cache access:public signature:(const locale& __loc) const +std::__use_cache::operator () cpp_src/locale_facets.tcc /^ operator() (const locale& __loc) const;$/;" p struct:std::__use_cache file: access:public signature:(const locale& __loc) const +std::__valarray_copy cpp_src/valarray_array.h /^ __valarray_copy(_Array<_Tp> __a, _Array<_Tp> __b, size_t __n, size_t __s)$/;" f namespace:std signature:(_Array<_Tp> __a, _Array<_Tp> __b, size_t __n, size_t __s) +std::__valarray_copy cpp_src/valarray_array.h /^ __valarray_copy(_Array<_Tp> __a, _Array __i,$/;" f namespace:std signature:(_Array<_Tp> __a, _Array __i, _Array<_Tp> __b, size_t __n) +std::__valarray_copy cpp_src/valarray_array.h /^ __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b)$/;" f namespace:std signature:(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b) +std::__valarray_copy cpp_src/valarray_array.h /^ __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b,$/;" f namespace:std signature:(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b, _Array __i) +std::__valarray_copy cpp_src/valarray_array.h /^ __valarray_copy(_Array<_Tp> __a, size_t __n, size_t __s, _Array<_Tp> __b)$/;" f namespace:std signature:(_Array<_Tp> __a, size_t __n, size_t __s, _Array<_Tp> __b) +std::__valarray_copy cpp_src/valarray_array.h /^ __valarray_copy(_Array<_Tp> __a, size_t __n, size_t __s1,$/;" f namespace:std signature:(_Array<_Tp> __a, size_t __n, size_t __s1, _Array<_Tp> __b, size_t __s2) +std::__valarray_copy cpp_src/valarray_array.h /^ __valarray_copy(_Array<_Tp> __src, size_t __n, _Array __i,$/;" f namespace:std signature:(_Array<_Tp> __src, size_t __n, _Array __i, _Array<_Tp> __dst, _Array __j) +std::__valarray_copy cpp_src/valarray_array.h /^ __valarray_copy(const _Tp* __restrict__ __a, _Tp* __restrict__ __b,$/;" f namespace:std signature:(const _Tp* __restrict__ __a, _Tp* __restrict__ __b, size_t __n, size_t __s) +std::__valarray_copy cpp_src/valarray_array.h /^ __valarray_copy(const _Tp* __restrict__ __a, size_t __n, size_t __s,$/;" f namespace:std signature:(const _Tp* __restrict__ __a, size_t __n, size_t __s, _Tp* __restrict__ __b) +std::__valarray_copy cpp_src/valarray_array.h /^ __valarray_copy(const _Tp* __restrict__ __a, size_t __n,$/;" f namespace:std signature:(const _Tp* __restrict__ __a, size_t __n, _Tp* __restrict__ __b) +std::__valarray_copy cpp_src/valarray_array.h /^ __valarray_copy(const _Tp* __restrict__ __a, size_t __n,$/;" f namespace:std signature:(const _Tp* __restrict__ __a, size_t __n, _Tp* __restrict__ __b, const size_t* __restrict__ __i) +std::__valarray_copy cpp_src/valarray_array.h /^ __valarray_copy(const _Tp* __restrict__ __a,$/;" f namespace:std signature:(const _Tp* __restrict__ __a, const size_t* __restrict__ __i, _Tp* __restrict__ __b, size_t __n) +std::__valarray_copy cpp_src/valarray_array.h /^ __valarray_copy(const _Tp* __restrict__ __src, size_t __n, size_t __s1,$/;" f namespace:std signature:(const _Tp* __restrict__ __src, size_t __n, size_t __s1, _Tp* __restrict__ __dst, size_t __s2) +std::__valarray_copy cpp_src/valarray_array.h /^ __valarray_copy(const _Tp* __restrict__ __src, size_t __n,$/;" f namespace:std signature:(const _Tp* __restrict__ __src, size_t __n, const size_t* __restrict__ __i, _Tp* __restrict__ __dst, const size_t* __restrict__ __j) +std::__valarray_copy cpp_src/valarray_array.tcc /^ __valarray_copy(_Array<_Tp> __a, _Array __m, _Array<_Tp> __b,$/;" f namespace:std signature:(_Array<_Tp> __a, _Array __m, _Array<_Tp> __b, size_t __n) +std::__valarray_copy cpp_src/valarray_array.tcc /^ __valarray_copy(_Array<_Tp> __a, _Array __m, size_t __n,$/;" f namespace:std signature:(_Array<_Tp> __a, _Array __m, size_t __n, _Array<_Tp> __b, _Array __k) +std::__valarray_copy cpp_src/valarray_array.tcc /^ __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b,$/;" f namespace:std signature:(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b, _Array __m) +std::__valarray_copy cpp_src/valarray_array.tcc /^ __valarray_copy(_Array<_Tp> __e, _Array __f,$/;" f namespace:std signature:(_Array<_Tp> __e, _Array __f, size_t __n, _Array<_Tp> __a, _Array __i) +std::__valarray_copy cpp_src/valarray_array.tcc /^ __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n, _Array<_Tp> __a)$/;" f namespace:std signature:(const _Expr<_Dom, _Tp>& __e, size_t __n, _Array<_Tp> __a) +std::__valarray_copy cpp_src/valarray_array.tcc /^ __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n,$/;" f namespace:std signature:(const _Expr<_Dom, _Tp>& __e, size_t __n, _Array<_Tp> __a, _Array __m) +std::__valarray_copy cpp_src/valarray_array.tcc /^ __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n,$/;" f namespace:std signature:(const _Expr<_Dom, _Tp>& __e, size_t __n, _Array<_Tp> __a, _Array __i) +std::__valarray_copy cpp_src/valarray_array.tcc /^ __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n,$/;" f namespace:std signature:(const _Expr<_Dom, _Tp>& __e, size_t __n, _Array<_Tp> __a, size_t __s) +std::__valarray_copy_construct cpp_src/valarray_array.h /^ __valarray_copy_construct (const _Tp* __restrict__ __a, size_t __n,$/;" f namespace:std signature:(const _Tp* __restrict__ __a, size_t __n, size_t __s, _Tp* __restrict__ __o) +std::__valarray_copy_construct cpp_src/valarray_array.h /^ __valarray_copy_construct (const _Tp* __restrict__ __a,$/;" f namespace:std signature:(const _Tp* __restrict__ __a, const size_t* __restrict__ __i, _Tp* __restrict__ __o, size_t __n) +std::__valarray_copy_construct cpp_src/valarray_array.h /^ __valarray_copy_construct(_Array<_Tp> __a, _Array __i,$/;" f namespace:std signature:(_Array<_Tp> __a, _Array __i, _Array<_Tp> __b, size_t __n) +std::__valarray_copy_construct cpp_src/valarray_array.h /^ __valarray_copy_construct(_Array<_Tp> __a, size_t __n, size_t __s,$/;" f namespace:std signature:(_Array<_Tp> __a, size_t __n, size_t __s, _Array<_Tp> __b) +std::__valarray_copy_construct cpp_src/valarray_array.h /^ __valarray_copy_construct(const _Tp* __restrict__ __b,$/;" f namespace:std signature:(const _Tp* __restrict__ __b, const _Tp* __restrict__ __e, _Tp* __restrict__ __o) +std::__valarray_copy_construct cpp_src/valarray_array.tcc /^ __valarray_copy_construct(_Array<_Tp> __a, _Array __m,$/;" f namespace:std signature:(_Array<_Tp> __a, _Array __m, _Array<_Tp> __b, size_t __n) +std::__valarray_copy_construct cpp_src/valarray_array.tcc /^ __valarray_copy_construct(const _Expr<_Dom, _Tp>& __e, size_t __n,$/;" f namespace:std signature:(const _Expr<_Dom, _Tp>& __e, size_t __n, _Array<_Tp> __a) +std::__valarray_default_construct cpp_src/valarray_array.h /^ __valarray_default_construct(_Tp* __restrict__ __b, _Tp* __restrict__ __e)$/;" f namespace:std signature:(_Tp* __restrict__ __b, _Tp* __restrict__ __e) +std::__valarray_destroy_elements cpp_src/valarray_array.h /^ __valarray_destroy_elements(_Tp* __restrict__ __b, _Tp* __restrict__ __e)$/;" f namespace:std signature:(_Tp* __restrict__ __b, _Tp* __restrict__ __e) +std::__valarray_fill cpp_src/valarray_array.h /^ __valarray_fill (_Array<_Tp> __a, size_t __n, const _Tp& __t)$/;" f namespace:std signature:(_Array<_Tp> __a, size_t __n, const _Tp& __t) +std::__valarray_fill cpp_src/valarray_array.h /^ __valarray_fill(_Array<_Tp> __a, _Array __i,$/;" f namespace:std signature:(_Array<_Tp> __a, _Array __i, size_t __n, const _Tp& __t) +std::__valarray_fill cpp_src/valarray_array.h /^ __valarray_fill(_Array<_Tp> __a, size_t __n, size_t __s, const _Tp& __t)$/;" f namespace:std signature:(_Array<_Tp> __a, size_t __n, size_t __s, const _Tp& __t) +std::__valarray_fill cpp_src/valarray_array.h /^ __valarray_fill(_Tp* __restrict__ __a, const size_t* __restrict__ __i,$/;" f namespace:std signature:(_Tp* __restrict__ __a, const size_t* __restrict__ __i, size_t __n, const _Tp& __t) +std::__valarray_fill cpp_src/valarray_array.h /^ __valarray_fill(_Tp* __restrict__ __a, size_t __n, const _Tp& __t)$/;" f namespace:std signature:(_Tp* __restrict__ __a, size_t __n, const _Tp& __t) +std::__valarray_fill cpp_src/valarray_array.h /^ __valarray_fill(_Tp* __restrict__ __a, size_t __n,$/;" f namespace:std signature:(_Tp* __restrict__ __a, size_t __n, size_t __s, const _Tp& __t) +std::__valarray_fill cpp_src/valarray_array.tcc /^ __valarray_fill(_Array<_Tp> __a, size_t __n, _Array __m,$/;" f namespace:std signature:(_Array<_Tp> __a, size_t __n, _Array __m, const _Tp& __t) +std::__valarray_fill_construct cpp_src/valarray_array.h /^ __valarray_fill_construct(_Tp* __restrict__ __b, _Tp* __restrict__ __e,$/;" f namespace:std signature:(_Tp* __restrict__ __b, _Tp* __restrict__ __e, const _Tp __t) +std::__valarray_get_memory cpp_src/valarray_array.h /^ __valarray_get_memory(size_t __n)$/;" f namespace:std signature:(size_t __n) +std::__valarray_get_storage cpp_src/valarray_array.h /^ __valarray_get_storage(size_t __n)$/;" f namespace:std signature:(size_t __n) +std::__valarray_max cpp_src/valarray_array.h /^ __valarray_max(const _Ta& __a)$/;" f namespace:std signature:(const _Ta& __a) +std::__valarray_min cpp_src/valarray_array.h /^ __valarray_min(const _Ta& __a)$/;" f namespace:std signature:(const _Ta& __a) +std::__valarray_product cpp_src/valarray_array.h /^ __valarray_product(const _Tp* __restrict__ __f,$/;" f namespace:std signature:(const _Tp* __restrict__ __f, const _Tp* __restrict__ __l) +std::__valarray_release_memory cpp_src/valarray_array.h /^ __valarray_release_memory(void* __p)$/;" f namespace:std signature:(void* __p) +std::__valarray_sum cpp_src/valarray_array.h /^ __valarray_sum(const _Tp* __restrict__ __f, const _Tp* __restrict__ __l)$/;" f namespace:std signature:(const _Tp* __restrict__ __f, const _Tp* __restrict__ __l) +std::__verify_grouping cpp_src/locale_facets.tcc /^ __verify_grouping(const char* __grouping, size_t __grouping_size,$/;" f namespace:std signature:(const char* __grouping, size_t __grouping_size, const string& __grouping_tmp) +std::__verify_grouping cpp_src/locale_facets.tcc /^ __verify_grouping(const char* __grouping, size_t __grouping_size,$/;" p namespace:std file: signature:(const char* __grouping, size_t __grouping_size, const string& __grouping_tmp) +std::__write cpp_src/locale_facets.h /^ __write(_OutIter __s, const _CharT* __ws, int __len)$/;" f namespace:std signature:(_OutIter __s, const _CharT* __ws, int __len) +std::__write cpp_src/locale_facets.h /^ __write(ostreambuf_iterator<_CharT> __s, const _CharT* __ws, int __len)$/;" f namespace:std signature:(ostreambuf_iterator<_CharT> __s, const _CharT* __ws, int __len) +std::abort cpp_src/cstdlib /^ extern "C" void abort(void);$/;" p namespace:std file: signature:(void) +std::abs cpp_src/cmath /^ abs(double __x)$/;" f namespace:std signature:(double __x) +std::abs cpp_src/cmath /^ abs(float __x)$/;" f namespace:std signature:(float __x) +std::abs cpp_src/cmath /^ abs(long double __x)$/;" f namespace:std signature:(long double __x) +std::abs cpp_src/complex /^ abs(const complex<_Tp>& __z) { return __complex_abs(__z); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::abs cpp_src/complex /^ abs(const complex<_Tp>& __z) { return __complex_abs(__z.__rep()); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::abs cpp_src/complex /^ template _Tp abs(const complex<_Tp>&);$/;" p namespace:std file: signature:(const complex<_Tp>&) +std::accumulate cpp_src/stl_numeric.h /^ accumulate(_InputIterator __first, _InputIterator __last, _Tp __init)$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _Tp __init) +std::accumulate cpp_src/stl_numeric.h /^ accumulate(_InputIterator __first, _InputIterator __last, _Tp __init,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _Tp __init, _BinaryOperation __binary_op) +std::acos cpp_src/cmath /^ acos(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +std::acos cpp_src/cmath /^ acos(float __x)$/;" f namespace:std signature:(float __x) +std::acos cpp_src/cmath /^ acos(long double __x)$/;" f namespace:std signature:(long double __x) +std::adjacent_difference cpp_src/stl_numeric.h /^ adjacent_difference(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryOperation __binary_op) +std::adjacent_difference cpp_src/stl_numeric.h /^ adjacent_difference(_InputIterator __first,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _OutputIterator __result) +std::adjacent_find cpp_src/stl_algo.h /^ adjacent_find(_ForwardIterator __first, _ForwardIterator __last)$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last) +std::adjacent_find cpp_src/stl_algo.h /^ adjacent_find(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __binary_pred) +std::advance cpp_src/stl_iterator_base_funcs.h /^ advance(_InputIterator& __i, _Distance __n)$/;" f namespace:std signature:(_InputIterator& __i, _Distance __n) +std::allocator cpp_src/allocator.h /^ class allocator: public __glibcxx_base_allocator<_Tp>$/;" c namespace:std inherits:__glibcxx_base_allocator +std::allocator cpp_src/allocator.h /^ class allocator$/;" c namespace:std +std::allocator::allocator cpp_src/allocator.h /^ allocator(const allocator<_Tp1>&) throw() { }$/;" f class:std::allocator access:public signature:(const allocator<_Tp1>&) +std::allocator::allocator cpp_src/allocator.h /^ allocator() throw() { }$/;" f class:std::allocator access:public signature:() +std::allocator::allocator cpp_src/allocator.h /^ allocator(const allocator& __a) throw()$/;" f class:std::allocator access:public signature:(const allocator& __a) +std::allocator::const_pointer cpp_src/allocator.h /^ typedef const _Tp* const_pointer;$/;" t class:std::allocator access:public +std::allocator::const_pointer cpp_src/allocator.h /^ typedef const void* const_pointer;$/;" t class:std::allocator access:public +std::allocator::const_reference cpp_src/allocator.h /^ typedef const _Tp& const_reference;$/;" t class:std::allocator access:public +std::allocator::difference_type cpp_src/allocator.h /^ typedef ptrdiff_t difference_type;$/;" t class:std::allocator access:public +std::allocator::difference_type cpp_src/allocator.h /^ typedef ptrdiff_t difference_type;$/;" t class:std::allocator access:public +std::allocator::pointer cpp_src/allocator.h /^ typedef _Tp* pointer;$/;" t class:std::allocator access:public +std::allocator::pointer cpp_src/allocator.h /^ typedef void* pointer;$/;" t class:std::allocator access:public +std::allocator::rebind cpp_src/allocator.h /^ struct rebind$/;" s class:std::allocator access:public +std::allocator::rebind::other cpp_src/allocator.h /^ { typedef allocator<_Tp1> other; };$/;" t struct:std::allocator::rebind access:public +std::allocator::reference cpp_src/allocator.h /^ typedef _Tp& reference;$/;" t class:std::allocator access:public +std::allocator::size_type cpp_src/allocator.h /^ typedef size_t size_type;$/;" t class:std::allocator access:public +std::allocator::size_type cpp_src/allocator.h /^ typedef size_t size_type;$/;" t class:std::allocator access:public +std::allocator::value_type cpp_src/allocator.h /^ typedef _Tp value_type;$/;" t class:std::allocator access:public +std::allocator::value_type cpp_src/allocator.h /^ typedef void value_type;$/;" t class:std::allocator access:public +std::allocator::~allocator cpp_src/allocator.h /^ ~allocator() throw() { }$/;" f class:std::allocator access:public signature:() +std::arg cpp_src/complex /^ arg(const complex<_Tp>& __z) { return __complex_arg(__z); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::arg cpp_src/complex /^ arg(const complex<_Tp>& __z) { return __complex_arg(__z.__rep()); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::arg cpp_src/complex /^ template _Tp arg(const complex<_Tp>&);$/;" p namespace:std file: signature:(const complex<_Tp>&) +std::asin cpp_src/cmath /^ asin(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +std::asin cpp_src/cmath /^ asin(float __x)$/;" f namespace:std signature:(float __x) +std::asin cpp_src/cmath /^ asin(long double __x)$/;" f namespace:std signature:(long double __x) +std::atan cpp_src/cmath /^ atan(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +std::atan cpp_src/cmath /^ atan(float __x)$/;" f namespace:std signature:(float __x) +std::atan cpp_src/cmath /^ atan(long double __x)$/;" f namespace:std signature:(long double __x) +std::atan2 cpp_src/cmath /^ atan2(_Tp __y, _Up __x)$/;" f namespace:std signature:(_Tp __y, _Up __x) +std::atan2 cpp_src/cmath /^ atan2(float __y, float __x)$/;" f namespace:std signature:(float __y, float __x) +std::atan2 cpp_src/cmath /^ atan2(long double __y, long double __x)$/;" f namespace:std signature:(long double __y, long double __x) +std::atexit cpp_src/cstdlib /^ extern "C" int atexit(void (*)());$/;" p namespace:std file: signature:(void (*)()) +std::auto_ptr cpp_src/memory /^ class auto_ptr$/;" c namespace:std file: +std::auto_ptr::_M_ptr cpp_src/memory /^ _Tp* _M_ptr;$/;" m class:std::auto_ptr file: access:private +std::auto_ptr::auto_ptr cpp_src/memory /^ auto_ptr(auto_ptr<_Tp1>& __a) throw() : _M_ptr(__a.release()) { }$/;" f class:std::auto_ptr access:public signature:(auto_ptr<_Tp1>& __a) +std::auto_ptr::auto_ptr cpp_src/memory /^ auto_ptr(auto_ptr& __a) throw() : _M_ptr(__a.release()) { }$/;" f class:std::auto_ptr access:public signature:(auto_ptr& __a) +std::auto_ptr::auto_ptr cpp_src/memory /^ auto_ptr(auto_ptr_ref __ref) throw()$/;" f class:std::auto_ptr access:public signature:(auto_ptr_ref __ref) +std::auto_ptr::auto_ptr cpp_src/memory /^ auto_ptr(element_type* __p = 0) throw() : _M_ptr(__p) { }$/;" f class:std::auto_ptr access:public signature:(element_type* __p = 0) +std::auto_ptr::element_type cpp_src/memory /^ typedef _Tp element_type;$/;" t class:std::auto_ptr file: access:public +std::auto_ptr::get cpp_src/memory /^ get() const throw() { return _M_ptr; }$/;" f class:std::auto_ptr access:public signature:() const +std::auto_ptr::operator * cpp_src/memory /^ operator*() const throw() $/;" f class:std::auto_ptr access:public signature:() const +std::auto_ptr::operator -> cpp_src/memory /^ operator->() const throw() $/;" f class:std::auto_ptr access:public signature:() const +std::auto_ptr::operator = cpp_src/memory /^ operator=(auto_ptr<_Tp1>& __a) throw()$/;" f class:std::auto_ptr access:public signature:(auto_ptr<_Tp1>& __a) +std::auto_ptr::operator = cpp_src/memory /^ operator=(auto_ptr& __a) throw()$/;" f class:std::auto_ptr access:public signature:(auto_ptr& __a) +std::auto_ptr::operator = cpp_src/memory /^ operator=(auto_ptr_ref __ref) throw()$/;" f class:std::auto_ptr access:public signature:(auto_ptr_ref __ref) +std::auto_ptr::operator auto_ptr<_Tp1> cpp_src/memory /^ operator auto_ptr<_Tp1>() throw()$/;" f class:std::auto_ptr access:public signature:() +std::auto_ptr::operator auto_ptr_ref<_Tp1> cpp_src/memory /^ operator auto_ptr_ref<_Tp1>() throw()$/;" f class:std::auto_ptr access:public signature:() +std::auto_ptr::release cpp_src/memory /^ release() throw()$/;" f class:std::auto_ptr access:public signature:() +std::auto_ptr::reset cpp_src/memory /^ reset(element_type* __p = 0) throw()$/;" f class:std::auto_ptr access:public signature:(element_type* __p = 0) +std::auto_ptr::~auto_ptr cpp_src/memory /^ ~auto_ptr() { delete _M_ptr; }$/;" f class:std::auto_ptr access:public signature:() +std::auto_ptr_ref cpp_src/memory /^ struct auto_ptr_ref$/;" s namespace:std file: +std::auto_ptr_ref::_M_ptr cpp_src/memory /^ _Tp1* _M_ptr;$/;" m struct:std::auto_ptr_ref file: access:public +std::auto_ptr_ref::auto_ptr_ref cpp_src/memory /^ auto_ptr_ref(_Tp1* __p): _M_ptr(__p) { }$/;" f struct:std::auto_ptr_ref access:public signature:(_Tp1* __p) +std::back_insert_iterator cpp_src/stl_iterator.h /^ class back_insert_iterator$/;" c namespace:std inherits:iterator +std::back_insert_iterator::back_insert_iterator cpp_src/stl_iterator.h /^ back_insert_iterator(_Container& __x) : container(&__x) { }$/;" f class:std::back_insert_iterator access:public signature:(_Container& __x) +std::back_insert_iterator::container cpp_src/stl_iterator.h /^ _Container* container;$/;" m class:std::back_insert_iterator access:protected +std::back_insert_iterator::container_type cpp_src/stl_iterator.h /^ typedef _Container container_type;$/;" t class:std::back_insert_iterator access:public +std::back_insert_iterator::operator * cpp_src/stl_iterator.h /^ operator*()$/;" f class:std::back_insert_iterator access:public signature:() +std::back_insert_iterator::operator ++ cpp_src/stl_iterator.h /^ operator++()$/;" f class:std::back_insert_iterator access:public signature:() +std::back_insert_iterator::operator ++ cpp_src/stl_iterator.h /^ operator++(int)$/;" f class:std::back_insert_iterator access:public signature:(int) +std::back_insert_iterator::operator = cpp_src/stl_iterator.h /^ operator=(typename _Container::const_reference __value)$/;" f class:std::back_insert_iterator access:public signature:(typename _Container::const_reference __value) +std::back_inserter cpp_src/stl_iterator.h /^ back_inserter(_Container& __x)$/;" f namespace:std signature:(_Container& __x) +std::bad_alloc cpp_src/new /^ class bad_alloc : public exception $/;" c namespace:std file: inherits:exception +std::bad_alloc::bad_alloc cpp_src/new /^ bad_alloc() throw() { }$/;" f class:std::bad_alloc access:public signature:() +std::bad_alloc::what cpp_src/new /^ virtual const char* what() const throw();$/;" p class:std::bad_alloc file: access:public signature:() const +std::bad_alloc::~bad_alloc cpp_src/new /^ virtual ~bad_alloc() throw();$/;" p class:std::bad_alloc file: access:public signature:() +std::bad_cast cpp_src/typeinfo /^ class bad_cast : public exception $/;" c namespace:std file: inherits:exception +std::bad_cast::bad_cast cpp_src/typeinfo /^ bad_cast() throw() { }$/;" f class:std::bad_cast access:public signature:() +std::bad_cast::what cpp_src/typeinfo /^ virtual const char* what() const throw();$/;" p class:std::bad_cast file: access:public signature:() const +std::bad_cast::~bad_cast cpp_src/typeinfo /^ virtual ~bad_cast() throw();$/;" p class:std::bad_cast file: access:public signature:() +std::bad_exception cpp_src/exception /^ class bad_exception : public exception $/;" c namespace:std file: inherits:exception +std::bad_exception::bad_exception cpp_src/exception /^ bad_exception() throw() { }$/;" f class:std::bad_exception access:public signature:() +std::bad_exception::what cpp_src/exception /^ virtual const char* what() const throw();$/;" p class:std::bad_exception file: access:public signature:() const +std::bad_exception::~bad_exception cpp_src/exception /^ virtual ~bad_exception() throw();$/;" p class:std::bad_exception file: access:public signature:() +std::bad_typeid cpp_src/typeinfo /^ class bad_typeid : public exception $/;" c namespace:std file: inherits:exception +std::bad_typeid::bad_typeid cpp_src/typeinfo /^ bad_typeid () throw() { }$/;" f class:std::bad_typeid access:public signature:() +std::bad_typeid::what cpp_src/typeinfo /^ virtual const char* what() const throw();$/;" p class:std::bad_typeid file: access:public signature:() const +std::bad_typeid::~bad_typeid cpp_src/typeinfo /^ virtual ~bad_typeid() throw();$/;" p class:std::bad_typeid file: access:public signature:() +std::basic_filebuf cpp_src/fstream /^ class basic_filebuf : public basic_streambuf<_CharT, _Traits>$/;" c namespace:std file: inherits:basic_streambuf +std::basic_filebuf::_M_allocate_internal_buffer cpp_src/fstream /^ _M_allocate_internal_buffer();$/;" p class:std::basic_filebuf file: access:protected signature:() +std::basic_filebuf::_M_allocate_internal_buffer cpp_src/fstream.tcc /^ _M_allocate_internal_buffer()$/;" f class:std::basic_filebuf signature:() +std::basic_filebuf::_M_buf cpp_src/fstream /^ char_type* _M_buf; $/;" m class:std::basic_filebuf file: access:protected +std::basic_filebuf::_M_buf_allocated cpp_src/fstream /^ bool _M_buf_allocated;$/;" m class:std::basic_filebuf file: access:protected +std::basic_filebuf::_M_buf_size cpp_src/fstream /^ size_t _M_buf_size;$/;" m class:std::basic_filebuf file: access:protected +std::basic_filebuf::_M_codecvt cpp_src/fstream /^ const __codecvt_type* _M_codecvt;$/;" m class:std::basic_filebuf file: access:protected +std::basic_filebuf::_M_convert_to_external cpp_src/fstream /^ _M_convert_to_external(char_type*, streamsize);$/;" p class:std::basic_filebuf file: access:protected signature:(char_type*, streamsize) +std::basic_filebuf::_M_convert_to_external cpp_src/fstream.tcc /^ _M_convert_to_external(_CharT* __ibuf, streamsize __ilen)$/;" f class:std::basic_filebuf signature:(_CharT* __ibuf, streamsize __ilen) +std::basic_filebuf::_M_create_pback cpp_src/fstream /^ _M_create_pback()$/;" f class:std::basic_filebuf access:protected signature:() +std::basic_filebuf::_M_destroy_internal_buffer cpp_src/fstream /^ _M_destroy_internal_buffer() throw();$/;" p class:std::basic_filebuf file: access:protected signature:() +std::basic_filebuf::_M_destroy_internal_buffer cpp_src/fstream.tcc /^ _M_destroy_internal_buffer() throw()$/;" f class:std::basic_filebuf signature:() +std::basic_filebuf::_M_destroy_pback cpp_src/fstream /^ _M_destroy_pback() throw()$/;" f class:std::basic_filebuf access:protected signature:() +std::basic_filebuf::_M_ext_buf cpp_src/fstream /^ char* _M_ext_buf;$/;" m class:std::basic_filebuf file: access:protected +std::basic_filebuf::_M_ext_buf_size cpp_src/fstream /^ streamsize _M_ext_buf_size;$/;" m class:std::basic_filebuf file: access:protected +std::basic_filebuf::_M_ext_end cpp_src/fstream /^ char* _M_ext_end;$/;" m class:std::basic_filebuf file: access:protected +std::basic_filebuf::_M_ext_next cpp_src/fstream /^ const char* _M_ext_next;$/;" m class:std::basic_filebuf file: access:protected +std::basic_filebuf::_M_file cpp_src/fstream /^ __file_type _M_file;$/;" m class:std::basic_filebuf file: access:protected +std::basic_filebuf::_M_lock cpp_src/fstream /^ __c_lock _M_lock;$/;" m class:std::basic_filebuf file: access:protected +std::basic_filebuf::_M_mode cpp_src/fstream /^ ios_base::openmode _M_mode;$/;" m class:std::basic_filebuf file: access:protected +std::basic_filebuf::_M_pback cpp_src/fstream /^ char_type _M_pback; $/;" m class:std::basic_filebuf file: access:protected +std::basic_filebuf::_M_pback_cur_save cpp_src/fstream /^ char_type* _M_pback_cur_save;$/;" m class:std::basic_filebuf file: access:protected +std::basic_filebuf::_M_pback_end_save cpp_src/fstream /^ char_type* _M_pback_end_save;$/;" m class:std::basic_filebuf file: access:protected +std::basic_filebuf::_M_pback_init cpp_src/fstream /^ bool _M_pback_init; $/;" m class:std::basic_filebuf file: access:protected +std::basic_filebuf::_M_reading cpp_src/fstream /^ bool _M_reading;$/;" m class:std::basic_filebuf file: access:protected +std::basic_filebuf::_M_seek cpp_src/fstream /^ _M_seek(off_type __off, ios_base::seekdir __way, __state_type __state);$/;" p class:std::basic_filebuf file: access:protected signature:(off_type __off, ios_base::seekdir __way, __state_type __state) +std::basic_filebuf::_M_seek cpp_src/fstream.tcc /^ _M_seek(off_type __off, ios_base::seekdir __way, __state_type __state)$/;" f class:std::basic_filebuf signature:(off_type __off, ios_base::seekdir __way, __state_type __state) +std::basic_filebuf::_M_set_buffer cpp_src/fstream /^ _M_set_buffer(streamsize __off)$/;" f class:std::basic_filebuf access:protected signature:(streamsize __off) +std::basic_filebuf::_M_state_beg cpp_src/fstream /^ __state_type _M_state_beg;$/;" m class:std::basic_filebuf file: access:protected +std::basic_filebuf::_M_state_cur cpp_src/fstream /^ __state_type _M_state_cur;$/;" m class:std::basic_filebuf file: access:protected +std::basic_filebuf::_M_state_last cpp_src/fstream /^ __state_type _M_state_last;$/;" m class:std::basic_filebuf file: access:protected +std::basic_filebuf::_M_terminate_output cpp_src/fstream /^ _M_terminate_output();$/;" p class:std::basic_filebuf file: access:protected signature:() +std::basic_filebuf::_M_terminate_output cpp_src/fstream.tcc /^ _M_terminate_output()$/;" f class:std::basic_filebuf signature:() +std::basic_filebuf::_M_writing cpp_src/fstream /^ bool _M_writing;$/;" m class:std::basic_filebuf file: access:protected +std::basic_filebuf::__codecvt_type cpp_src/fstream /^ typedef codecvt __codecvt_type;$/;" t class:std::basic_filebuf file: access:public +std::basic_filebuf::__file_type cpp_src/fstream /^ typedef __basic_file __file_type;$/;" t class:std::basic_filebuf file: access:public +std::basic_filebuf::__filebuf_type cpp_src/fstream /^ typedef basic_filebuf __filebuf_type;$/;" t class:std::basic_filebuf file: access:public +std::basic_filebuf::__state_type cpp_src/fstream /^ typedef typename traits_type::state_type __state_type;$/;" t class:std::basic_filebuf file: access:public +std::basic_filebuf::__streambuf_type cpp_src/fstream /^ typedef basic_streambuf __streambuf_type;$/;" t class:std::basic_filebuf file: access:public +std::basic_filebuf::basic_filebuf cpp_src/fstream /^ basic_filebuf();$/;" p class:std::basic_filebuf file: access:public signature:() +std::basic_filebuf::basic_filebuf cpp_src/fstream.tcc /^ basic_filebuf() : __streambuf_type(), _M_lock(), _M_file(&_M_lock),$/;" f class:std::basic_filebuf signature:() +std::basic_filebuf::char_type cpp_src/fstream /^ typedef _CharT char_type;$/;" t class:std::basic_filebuf file: access:public +std::basic_filebuf::close cpp_src/fstream /^ close() throw();$/;" p class:std::basic_filebuf file: access:public signature:() +std::basic_filebuf::close cpp_src/fstream.tcc /^ close() throw()$/;" f class:std::basic_filebuf signature:() +std::basic_filebuf::imbue cpp_src/fstream /^ imbue(const locale& __loc);$/;" p class:std::basic_filebuf file: access:protected signature:(const locale& __loc) +std::basic_filebuf::imbue cpp_src/fstream.tcc /^ imbue(const locale& __loc)$/;" f class:std::basic_filebuf signature:(const locale& __loc) +std::basic_filebuf::int_type cpp_src/fstream /^ typedef typename traits_type::int_type int_type;$/;" t class:std::basic_filebuf file: access:public +std::basic_filebuf::is_open cpp_src/fstream /^ is_open() const throw()$/;" f class:std::basic_filebuf access:public signature:() const +std::basic_filebuf::off_type cpp_src/fstream /^ typedef typename traits_type::off_type off_type;$/;" t class:std::basic_filebuf file: access:public +std::basic_filebuf::open cpp_src/fstream /^ open(const char* __s, ios_base::openmode __mode);$/;" p class:std::basic_filebuf file: access:public signature:(const char* __s, ios_base::openmode __mode) +std::basic_filebuf::open cpp_src/fstream.tcc /^ open(const char* __s, ios_base::openmode __mode)$/;" f class:std::basic_filebuf signature:(const char* __s, ios_base::openmode __mode) +std::basic_filebuf::overflow cpp_src/fstream /^ overflow(int_type __c = _Traits::eof());$/;" p class:std::basic_filebuf file: access:protected signature:(int_type __c = _Traits::eof()) +std::basic_filebuf::overflow cpp_src/fstream.tcc /^ overflow(int_type __c)$/;" f class:std::basic_filebuf signature:(int_type __c) +std::basic_filebuf::pbackfail cpp_src/fstream /^ pbackfail(int_type __c = _Traits::eof());$/;" p class:std::basic_filebuf file: access:protected signature:(int_type __c = _Traits::eof()) +std::basic_filebuf::pbackfail cpp_src/fstream.tcc /^ pbackfail(int_type __i)$/;" f class:std::basic_filebuf signature:(int_type __i) +std::basic_filebuf::pos_type cpp_src/fstream /^ typedef typename traits_type::pos_type pos_type;$/;" t class:std::basic_filebuf file: access:public +std::basic_filebuf::seekoff cpp_src/fstream /^ seekoff(off_type __off, ios_base::seekdir __way,$/;" p class:std::basic_filebuf file: access:protected signature:(off_type __off, ios_base::seekdir __way, ios_base::openmode __mode = ios_base::in | ios_base::out) +std::basic_filebuf::seekoff cpp_src/fstream.tcc /^ seekoff(off_type __off, ios_base::seekdir __way, ios_base::openmode)$/;" f class:std::basic_filebuf signature:(off_type __off, ios_base::seekdir __way, ios_base::openmode) +std::basic_filebuf::seekpos cpp_src/fstream /^ seekpos(pos_type __pos,$/;" p class:std::basic_filebuf file: access:protected signature:(pos_type __pos, ios_base::openmode __mode = ios_base::in | ios_base::out) +std::basic_filebuf::seekpos cpp_src/fstream.tcc /^ seekpos(pos_type __pos, ios_base::openmode)$/;" f class:std::basic_filebuf signature:(pos_type __pos, ios_base::openmode) +std::basic_filebuf::setbuf cpp_src/fstream /^ setbuf(char_type* __s, streamsize __n);$/;" p class:std::basic_filebuf file: access:protected signature:(char_type* __s, streamsize __n) +std::basic_filebuf::setbuf cpp_src/fstream.tcc /^ setbuf(char_type* __s, streamsize __n)$/;" f class:std::basic_filebuf signature:(char_type* __s, streamsize __n) +std::basic_filebuf::showmanyc cpp_src/fstream /^ showmanyc();$/;" p class:std::basic_filebuf file: access:protected signature:() +std::basic_filebuf::showmanyc cpp_src/fstream.tcc /^ showmanyc()$/;" f class:std::basic_filebuf signature:() +std::basic_filebuf::sync cpp_src/fstream /^ sync();$/;" p class:std::basic_filebuf file: access:protected signature:() +std::basic_filebuf::sync cpp_src/fstream.tcc /^ sync()$/;" f class:std::basic_filebuf signature:() +std::basic_filebuf::traits_type cpp_src/fstream /^ typedef _Traits traits_type;$/;" t class:std::basic_filebuf file: access:public +std::basic_filebuf::underflow cpp_src/fstream /^ underflow();$/;" p class:std::basic_filebuf file: access:protected signature:() +std::basic_filebuf::underflow cpp_src/fstream.tcc /^ underflow()$/;" f class:std::basic_filebuf signature:() +std::basic_filebuf::xsgetn cpp_src/fstream /^ xsgetn(char_type* __s, streamsize __n);$/;" p class:std::basic_filebuf file: access:protected signature:(char_type* __s, streamsize __n) +std::basic_filebuf::xsgetn cpp_src/fstream.tcc /^ xsgetn(_CharT* __s, streamsize __n)$/;" f class:std::basic_filebuf signature:(_CharT* __s, streamsize __n) +std::basic_filebuf::xsputn cpp_src/fstream /^ xsputn(const char_type* __s, streamsize __n);$/;" p class:std::basic_filebuf file: access:protected signature:(const char_type* __s, streamsize __n) +std::basic_filebuf::xsputn cpp_src/fstream.tcc /^ xsputn(const _CharT* __s, streamsize __n)$/;" f class:std::basic_filebuf signature:(const _CharT* __s, streamsize __n) +std::basic_filebuf::~basic_filebuf cpp_src/fstream /^ ~basic_filebuf()$/;" f class:std::basic_filebuf access:public signature:() +std::basic_fstream cpp_src/fstream /^ class basic_fstream : public basic_iostream<_CharT, _Traits>$/;" c namespace:std file: inherits:basic_iostream +std::basic_fstream::_M_filebuf cpp_src/fstream /^ __filebuf_type _M_filebuf;$/;" m class:std::basic_fstream file: access:private +std::basic_fstream::__filebuf_type cpp_src/fstream /^ typedef basic_filebuf __filebuf_type;$/;" t class:std::basic_fstream file: access:public +std::basic_fstream::__ios_type cpp_src/fstream /^ typedef basic_ios __ios_type;$/;" t class:std::basic_fstream file: access:public +std::basic_fstream::__iostream_type cpp_src/fstream /^ typedef basic_iostream __iostream_type;$/;" t class:std::basic_fstream file: access:public +std::basic_fstream::basic_fstream cpp_src/fstream /^ basic_fstream()$/;" f class:std::basic_fstream access:public signature:() +std::basic_fstream::basic_fstream cpp_src/fstream /^ basic_fstream(const char* __s,$/;" f class:std::basic_fstream access:public signature:(const char* __s, ios_base::openmode __mode = ios_base::in | ios_base::out) +std::basic_fstream::char_type cpp_src/fstream /^ typedef _CharT char_type;$/;" t class:std::basic_fstream file: access:public +std::basic_fstream::close cpp_src/fstream /^ close()$/;" f class:std::basic_fstream access:public signature:() +std::basic_fstream::int_type cpp_src/fstream /^ typedef typename traits_type::int_type int_type;$/;" t class:std::basic_fstream file: access:public +std::basic_fstream::is_open cpp_src/fstream /^ is_open() const$/;" f class:std::basic_fstream access:public signature:() const +std::basic_fstream::is_open cpp_src/fstream /^ is_open()$/;" f class:std::basic_fstream access:public signature:() +std::basic_fstream::off_type cpp_src/fstream /^ typedef typename traits_type::off_type off_type;$/;" t class:std::basic_fstream file: access:public +std::basic_fstream::open cpp_src/fstream /^ open(const char* __s,$/;" f class:std::basic_fstream access:public signature:(const char* __s, ios_base::openmode __mode = ios_base::in | ios_base::out) +std::basic_fstream::pos_type cpp_src/fstream /^ typedef typename traits_type::pos_type pos_type;$/;" t class:std::basic_fstream file: access:public +std::basic_fstream::rdbuf cpp_src/fstream /^ rdbuf() const$/;" f class:std::basic_fstream access:public signature:() const +std::basic_fstream::traits_type cpp_src/fstream /^ typedef _Traits traits_type;$/;" t class:std::basic_fstream file: access:public +std::basic_fstream::~basic_fstream cpp_src/fstream /^ ~basic_fstream()$/;" f class:std::basic_fstream access:public signature:() +std::basic_ifstream cpp_src/fstream /^ class basic_ifstream : public basic_istream<_CharT, _Traits>$/;" c namespace:std file: inherits:basic_istream +std::basic_ifstream::_M_filebuf cpp_src/fstream /^ __filebuf_type _M_filebuf;$/;" m class:std::basic_ifstream file: access:private +std::basic_ifstream::__filebuf_type cpp_src/fstream /^ typedef basic_filebuf __filebuf_type;$/;" t class:std::basic_ifstream file: access:public +std::basic_ifstream::__istream_type cpp_src/fstream /^ typedef basic_istream __istream_type;$/;" t class:std::basic_ifstream file: access:public +std::basic_ifstream::basic_ifstream cpp_src/fstream /^ basic_ifstream() : __istream_type(), _M_filebuf()$/;" f class:std::basic_ifstream access:public signature:() +std::basic_ifstream::basic_ifstream cpp_src/fstream /^ basic_ifstream(const char* __s, ios_base::openmode __mode = ios_base::in)$/;" f class:std::basic_ifstream access:public signature:(const char* __s, ios_base::openmode __mode = ios_base::in) +std::basic_ifstream::char_type cpp_src/fstream /^ typedef _CharT char_type;$/;" t class:std::basic_ifstream file: access:public +std::basic_ifstream::close cpp_src/fstream /^ close()$/;" f class:std::basic_ifstream access:public signature:() +std::basic_ifstream::int_type cpp_src/fstream /^ typedef typename traits_type::int_type int_type;$/;" t class:std::basic_ifstream file: access:public +std::basic_ifstream::is_open cpp_src/fstream /^ is_open() const$/;" f class:std::basic_ifstream access:public signature:() const +std::basic_ifstream::is_open cpp_src/fstream /^ is_open()$/;" f class:std::basic_ifstream access:public signature:() +std::basic_ifstream::off_type cpp_src/fstream /^ typedef typename traits_type::off_type off_type;$/;" t class:std::basic_ifstream file: access:public +std::basic_ifstream::open cpp_src/fstream /^ open(const char* __s, ios_base::openmode __mode = ios_base::in)$/;" f class:std::basic_ifstream access:public signature:(const char* __s, ios_base::openmode __mode = ios_base::in) +std::basic_ifstream::pos_type cpp_src/fstream /^ typedef typename traits_type::pos_type pos_type;$/;" t class:std::basic_ifstream file: access:public +std::basic_ifstream::rdbuf cpp_src/fstream /^ rdbuf() const$/;" f class:std::basic_ifstream access:public signature:() const +std::basic_ifstream::traits_type cpp_src/fstream /^ typedef _Traits traits_type;$/;" t class:std::basic_ifstream file: access:public +std::basic_ifstream::~basic_ifstream cpp_src/fstream /^ ~basic_ifstream()$/;" f class:std::basic_ifstream access:public signature:() +std::basic_ios cpp_src/basic_ios.h /^ class basic_ios : public ios_base$/;" c namespace:std inherits:ios_base +std::basic_ios::_M_cache_locale cpp_src/basic_ios.h /^ _M_cache_locale(const locale& __loc);$/;" p class:std::basic_ios access:protected signature:(const locale& __loc) +std::basic_ios::_M_cache_locale cpp_src/basic_ios.tcc /^ basic_ios<_CharT, _Traits>::_M_cache_locale(const locale& __loc)$/;" f class:std::basic_ios signature:(const locale& __loc) +std::basic_ios::_M_ctype cpp_src/basic_ios.h /^ const __ctype_type* _M_ctype;$/;" m class:std::basic_ios access:protected +std::basic_ios::_M_fill cpp_src/basic_ios.h /^ mutable char_type _M_fill;$/;" m class:std::basic_ios access:protected +std::basic_ios::_M_fill_init cpp_src/basic_ios.h /^ mutable bool _M_fill_init;$/;" m class:std::basic_ios access:protected +std::basic_ios::_M_num_get cpp_src/basic_ios.h /^ const __num_get_type* _M_num_get;$/;" m class:std::basic_ios access:protected +std::basic_ios::_M_num_put cpp_src/basic_ios.h /^ const __num_put_type* _M_num_put;$/;" m class:std::basic_ios access:protected +std::basic_ios::_M_setstate cpp_src/basic_ios.h /^ _M_setstate(iostate __state)$/;" f class:std::basic_ios access:public signature:(iostate __state) +std::basic_ios::_M_streambuf cpp_src/basic_ios.h /^ basic_streambuf<_CharT, _Traits>* _M_streambuf;$/;" m class:std::basic_ios access:protected +std::basic_ios::_M_tie cpp_src/basic_ios.h /^ basic_ostream<_CharT, _Traits>* _M_tie;$/;" m class:std::basic_ios access:protected +std::basic_ios::__ctype_type cpp_src/basic_ios.h /^ typedef ctype<_CharT> __ctype_type;$/;" t class:std::basic_ios access:public +std::basic_ios::__num_get_type cpp_src/basic_ios.h /^ __num_get_type;$/;" t class:std::basic_ios access:public +std::basic_ios::__num_put_type cpp_src/basic_ios.h /^ __num_put_type;$/;" t class:std::basic_ios access:public +std::basic_ios::bad cpp_src/basic_ios.h /^ bad() const$/;" f class:std::basic_ios access:public signature:() const +std::basic_ios::basic_ios cpp_src/basic_ios.h /^ basic_ios()$/;" f class:std::basic_ios access:protected signature:() +std::basic_ios::basic_ios cpp_src/basic_ios.h /^ basic_ios(basic_streambuf<_CharT, _Traits>* __sb)$/;" f class:std::basic_ios access:public signature:(basic_streambuf<_CharT, _Traits>* __sb) +std::basic_ios::char_type cpp_src/basic_ios.h /^ typedef _CharT char_type;$/;" t class:std::basic_ios access:public +std::basic_ios::clear cpp_src/basic_ios.h /^ clear(iostate __state = goodbit);$/;" p class:std::basic_ios access:public signature:(iostate __state = goodbit) +std::basic_ios::clear cpp_src/basic_ios.tcc /^ basic_ios<_CharT, _Traits>::clear(iostate __state)$/;" f class:std::basic_ios signature:(iostate __state) +std::basic_ios::copyfmt cpp_src/basic_ios.h /^ copyfmt(const basic_ios& __rhs);$/;" p class:std::basic_ios access:public signature:(const basic_ios& __rhs) +std::basic_ios::copyfmt cpp_src/basic_ios.tcc /^ basic_ios<_CharT, _Traits>::copyfmt(const basic_ios& __rhs)$/;" f class:std::basic_ios signature:(const basic_ios& __rhs) +std::basic_ios::eof cpp_src/basic_ios.h /^ eof() const$/;" f class:std::basic_ios access:public signature:() const +std::basic_ios::exceptions cpp_src/basic_ios.h /^ exceptions() const$/;" f class:std::basic_ios access:public signature:() const +std::basic_ios::exceptions cpp_src/basic_ios.h /^ exceptions(iostate __except)$/;" f class:std::basic_ios access:public signature:(iostate __except) +std::basic_ios::fail cpp_src/basic_ios.h /^ fail() const$/;" f class:std::basic_ios access:public signature:() const +std::basic_ios::fill cpp_src/basic_ios.h /^ fill() const$/;" f class:std::basic_ios access:public signature:() const +std::basic_ios::fill cpp_src/basic_ios.h /^ fill(char_type __ch)$/;" f class:std::basic_ios access:public signature:(char_type __ch) +std::basic_ios::good cpp_src/basic_ios.h /^ good() const$/;" f class:std::basic_ios access:public signature:() const +std::basic_ios::imbue cpp_src/basic_ios.h /^ imbue(const locale& __loc);$/;" p class:std::basic_ios access:public signature:(const locale& __loc) +std::basic_ios::imbue cpp_src/basic_ios.tcc /^ basic_ios<_CharT, _Traits>::imbue(const locale& __loc)$/;" f class:std::basic_ios signature:(const locale& __loc) +std::basic_ios::init cpp_src/basic_ios.h /^ init(basic_streambuf<_CharT, _Traits>* __sb);$/;" p class:std::basic_ios access:protected signature:(basic_streambuf<_CharT, _Traits>* __sb) +std::basic_ios::init cpp_src/basic_ios.tcc /^ basic_ios<_CharT, _Traits>::init(basic_streambuf<_CharT, _Traits>* __sb)$/;" f class:std::basic_ios signature:(basic_streambuf<_CharT, _Traits>* __sb) +std::basic_ios::int_type cpp_src/basic_ios.h /^ typedef typename _Traits::int_type int_type;$/;" t class:std::basic_ios access:public +std::basic_ios::narrow cpp_src/basic_ios.h /^ narrow(char_type __c, char __dfault) const;$/;" p class:std::basic_ios access:public signature:(char_type __c, char __dfault) const +std::basic_ios::narrow cpp_src/basic_ios.tcc /^ basic_ios<_CharT, _Traits>::narrow(char_type __c, char __dfault) const$/;" f class:std::basic_ios signature:(char_type __c, char __dfault) const +std::basic_ios::off_type cpp_src/basic_ios.h /^ typedef typename _Traits::off_type off_type;$/;" t class:std::basic_ios access:public +std::basic_ios::operator ! cpp_src/basic_ios.h /^ operator!() const$/;" f class:std::basic_ios access:public signature:() const +std::basic_ios::operator void* cpp_src/basic_ios.h /^ operator void*() const$/;" f class:std::basic_ios access:public signature:() const +std::basic_ios::pos_type cpp_src/basic_ios.h /^ typedef typename _Traits::pos_type pos_type;$/;" t class:std::basic_ios access:public +std::basic_ios::rdbuf cpp_src/basic_ios.h /^ rdbuf() const$/;" f class:std::basic_ios access:public signature:() const +std::basic_ios::rdbuf cpp_src/basic_ios.h /^ rdbuf(basic_streambuf<_CharT, _Traits>* __sb);$/;" p class:std::basic_ios access:public signature:(basic_streambuf<_CharT, _Traits>* __sb) +std::basic_ios::rdbuf cpp_src/basic_ios.tcc /^ basic_ios<_CharT, _Traits>::rdbuf(basic_streambuf<_CharT, _Traits>* __sb)$/;" f class:std::basic_ios signature:(basic_streambuf<_CharT, _Traits>* __sb) +std::basic_ios::rdstate cpp_src/basic_ios.h /^ rdstate() const$/;" f class:std::basic_ios access:public signature:() const +std::basic_ios::setstate cpp_src/basic_ios.h /^ setstate(iostate __state)$/;" f class:std::basic_ios access:public signature:(iostate __state) +std::basic_ios::tie cpp_src/basic_ios.h /^ tie() const$/;" f class:std::basic_ios access:public signature:() const +std::basic_ios::tie cpp_src/basic_ios.h /^ tie(basic_ostream<_CharT, _Traits>* __tiestr)$/;" f class:std::basic_ios access:public signature:(basic_ostream<_CharT, _Traits>* __tiestr) +std::basic_ios::traits_type cpp_src/basic_ios.h /^ typedef _Traits traits_type;$/;" t class:std::basic_ios access:public +std::basic_ios::widen cpp_src/basic_ios.h /^ widen(char __c) const;$/;" p class:std::basic_ios access:public signature:(char __c) const +std::basic_ios::widen cpp_src/basic_ios.tcc /^ basic_ios<_CharT, _Traits>::widen(char __c) const$/;" f class:std::basic_ios signature:(char __c) const +std::basic_ios::~basic_ios cpp_src/basic_ios.h /^ ~basic_ios() { }$/;" f class:std::basic_ios access:public signature:() +std::basic_iostream cpp_src/istream /^ class basic_iostream$/;" c namespace:std file: inherits:basic_istream,basic_ostream +std::basic_iostream::__istream_type cpp_src/istream /^ typedef basic_istream<_CharT, _Traits> __istream_type;$/;" t class:std::basic_iostream file: access:public +std::basic_iostream::__ostream_type cpp_src/istream /^ typedef basic_ostream<_CharT, _Traits> __ostream_type;$/;" t class:std::basic_iostream file: access:public +std::basic_iostream::basic_iostream cpp_src/istream /^ basic_iostream() : __istream_type(), __ostream_type()$/;" f class:std::basic_iostream access:protected signature:() +std::basic_iostream::basic_iostream cpp_src/istream /^ basic_iostream(basic_streambuf<_CharT, _Traits>* __sb)$/;" f class:std::basic_iostream access:public signature:(basic_streambuf<_CharT, _Traits>* __sb) +std::basic_iostream::char_type cpp_src/istream /^ typedef _CharT char_type;$/;" t class:std::basic_iostream file: access:public +std::basic_iostream::int_type cpp_src/istream /^ typedef typename _Traits::int_type int_type;$/;" t class:std::basic_iostream file: access:public +std::basic_iostream::off_type cpp_src/istream /^ typedef typename _Traits::off_type off_type;$/;" t class:std::basic_iostream file: access:public +std::basic_iostream::pos_type cpp_src/istream /^ typedef typename _Traits::pos_type pos_type;$/;" t class:std::basic_iostream file: access:public +std::basic_iostream::traits_type cpp_src/istream /^ typedef _Traits traits_type;$/;" t class:std::basic_iostream file: access:public +std::basic_iostream::~basic_iostream cpp_src/istream /^ ~basic_iostream() { }$/;" f class:std::basic_iostream access:public signature:() +std::basic_istream cpp_src/istream /^ class basic_istream : virtual public basic_ios<_CharT, _Traits>$/;" c namespace:std file: inherits:basic_ios +std::basic_istream::_M_extract cpp_src/istream /^ _M_extract(_ValueT& __v);$/;" p class:std::basic_istream file: access:protected signature:(_ValueT& __v) +std::basic_istream::_M_extract cpp_src/istream.tcc /^ _M_extract(_ValueT& __v)$/;" f class:std::basic_istream signature:(_ValueT& __v) +std::basic_istream::_M_gcount cpp_src/istream /^ streamsize _M_gcount;$/;" m class:std::basic_istream file: access:protected +std::basic_istream::__ctype_type cpp_src/istream /^ typedef ctype<_CharT> __ctype_type;$/;" t class:std::basic_istream file: access:public +std::basic_istream::__ios_type cpp_src/istream /^ typedef basic_ios<_CharT, _Traits> __ios_type;$/;" t class:std::basic_istream file: access:public +std::basic_istream::__istream_type cpp_src/istream /^ typedef basic_istream<_CharT, _Traits> __istream_type;$/;" t class:std::basic_istream file: access:public +std::basic_istream::__num_get_type cpp_src/istream /^ __num_get_type;$/;" t class:std::basic_istream file: access:public +std::basic_istream::__pf cpp_src/istream /^ operator>>(__ios_type& (*__pf)(__ios_type&))$/;" f class:std::basic_istream access:public signature:(__ios_type&) +std::basic_istream::__pf cpp_src/istream /^ operator>>(__istream_type& (*__pf)(__istream_type&))$/;" f class:std::basic_istream access:public signature:(__istream_type&) +std::basic_istream::__pf cpp_src/istream /^ operator>>(ios_base& (*__pf)(ios_base&))$/;" f class:std::basic_istream access:public signature:(ios_base&) +std::basic_istream::__streambuf_type cpp_src/istream /^ typedef basic_streambuf<_CharT, _Traits> __streambuf_type;$/;" t class:std::basic_istream file: access:public +std::basic_istream::basic_istream cpp_src/istream /^ basic_istream(): _M_gcount(streamsize(0)) { }$/;" f class:std::basic_istream access:protected signature:() +std::basic_istream::basic_istream cpp_src/istream /^ basic_istream(__streambuf_type* __sb): _M_gcount(streamsize(0))$/;" f class:std::basic_istream access:public signature:(__streambuf_type* __sb) +std::basic_istream::char_type cpp_src/istream /^ typedef _CharT char_type;$/;" t class:std::basic_istream file: access:public +std::basic_istream::gcount cpp_src/istream /^ gcount() const $/;" f class:std::basic_istream access:public signature:() const +std::basic_istream::get cpp_src/istream /^ get();$/;" p class:std::basic_istream file: access:public signature:() +std::basic_istream::get cpp_src/istream /^ get(__streambuf_type& __sb)$/;" f class:std::basic_istream access:public signature:(__streambuf_type& __sb) +std::basic_istream::get cpp_src/istream /^ get(__streambuf_type& __sb, char_type __delim);$/;" p class:std::basic_istream file: access:public signature:(__streambuf_type& __sb, char_type __delim) +std::basic_istream::get cpp_src/istream /^ get(char_type& __c);$/;" p class:std::basic_istream file: access:public signature:(char_type& __c) +std::basic_istream::get cpp_src/istream /^ get(char_type* __s, streamsize __n)$/;" f class:std::basic_istream access:public signature:(char_type* __s, streamsize __n) +std::basic_istream::get cpp_src/istream /^ get(char_type* __s, streamsize __n, char_type __delim);$/;" p class:std::basic_istream file: access:public signature:(char_type* __s, streamsize __n, char_type __delim) +std::basic_istream::get cpp_src/istream.tcc /^ get(__streambuf_type& __sb, char_type __delim)$/;" f class:std::basic_istream signature:(__streambuf_type& __sb, char_type __delim) +std::basic_istream::get cpp_src/istream.tcc /^ get(char_type& __c)$/;" f class:std::basic_istream signature:(char_type& __c) +std::basic_istream::get cpp_src/istream.tcc /^ get(char_type* __s, streamsize __n, char_type __delim)$/;" f class:std::basic_istream signature:(char_type* __s, streamsize __n, char_type __delim) +std::basic_istream::get cpp_src/istream.tcc /^ get(void)$/;" f class:std::basic_istream signature:(void) +std::basic_istream::getline cpp_src/istream /^ getline(char_type* __s, streamsize __n)$/;" f class:std::basic_istream access:public signature:(char_type* __s, streamsize __n) +std::basic_istream::getline cpp_src/istream /^ getline(char_type* __s, streamsize __n, char_type __delim);$/;" p class:std::basic_istream file: access:public signature:(char_type* __s, streamsize __n, char_type __delim) +std::basic_istream::getline cpp_src/istream /^ getline(char_type* __s, streamsize __n, char_type __delim);$/;" p class:std::basic_istream file: signature:(char_type* __s, streamsize __n, char_type __delim) +std::basic_istream::getline cpp_src/istream.tcc /^ getline(char_type* __s, streamsize __n, char_type __delim)$/;" f class:std::basic_istream signature:(char_type* __s, streamsize __n, char_type __delim) +std::basic_istream::ignore cpp_src/istream /^ ignore();$/;" p class:std::basic_istream file: access:public signature:() +std::basic_istream::ignore cpp_src/istream /^ ignore(streamsize __n);$/;" p class:std::basic_istream file: access:public signature:(streamsize __n) +std::basic_istream::ignore cpp_src/istream /^ ignore(streamsize __n, int_type __delim);$/;" p class:std::basic_istream file: access:public signature:(streamsize __n, int_type __delim) +std::basic_istream::ignore cpp_src/istream /^ ignore(streamsize __n);$/;" p class:std::basic_istream file: signature:(streamsize __n) +std::basic_istream::ignore cpp_src/istream /^ ignore(streamsize __n, int_type __delim);$/;" p class:std::basic_istream file: signature:(streamsize __n, int_type __delim) +std::basic_istream::ignore cpp_src/istream.tcc /^ ignore(streamsize __n)$/;" f class:std::basic_istream signature:(streamsize __n) +std::basic_istream::ignore cpp_src/istream.tcc /^ ignore(streamsize __n, int_type __delim)$/;" f class:std::basic_istream signature:(streamsize __n, int_type __delim) +std::basic_istream::ignore cpp_src/istream.tcc /^ ignore(void)$/;" f class:std::basic_istream signature:(void) +std::basic_istream::int_type cpp_src/istream /^ typedef typename _Traits::int_type int_type;$/;" t class:std::basic_istream file: access:public +std::basic_istream::off_type cpp_src/istream /^ typedef typename _Traits::off_type off_type;$/;" t class:std::basic_istream file: access:public +std::basic_istream::operator >> cpp_src/istream /^ operator>>(basic_istream<_CharT2, _Traits2>&, _CharT2&);$/;" p class:std::basic_istream file: access:friend signature:(basic_istream<_CharT2, _Traits2>&, _CharT2&) +std::basic_istream::operator >> cpp_src/istream /^ operator>>(basic_istream<_CharT2, _Traits2>&, _CharT2*);$/;" p class:std::basic_istream file: access:friend signature:(basic_istream<_CharT2, _Traits2>&, _CharT2*) +std::basic_istream::operator >> cpp_src/istream /^ operator>>(__streambuf_type* __sb);$/;" p class:std::basic_istream file: access:public signature:(__streambuf_type* __sb) +std::basic_istream::operator >> cpp_src/istream /^ operator>>(bool& __n)$/;" f class:std::basic_istream access:public signature:(bool& __n) +std::basic_istream::operator >> cpp_src/istream /^ operator>>(double& __f)$/;" f class:std::basic_istream access:public signature:(double& __f) +std::basic_istream::operator >> cpp_src/istream /^ operator>>(float& __f)$/;" f class:std::basic_istream access:public signature:(float& __f) +std::basic_istream::operator >> cpp_src/istream /^ operator>>(int& __n);$/;" p class:std::basic_istream file: access:public signature:(int& __n) +std::basic_istream::operator >> cpp_src/istream /^ operator>>(long double& __f)$/;" f class:std::basic_istream access:public signature:(long double& __f) +std::basic_istream::operator >> cpp_src/istream /^ operator>>(long long& __n)$/;" f class:std::basic_istream access:public signature:(long long& __n) +std::basic_istream::operator >> cpp_src/istream /^ operator>>(long& __n)$/;" f class:std::basic_istream access:public signature:(long& __n) +std::basic_istream::operator >> cpp_src/istream /^ operator>>(short& __n);$/;" p class:std::basic_istream file: access:public signature:(short& __n) +std::basic_istream::operator >> cpp_src/istream /^ operator>>(unsigned int& __n)$/;" f class:std::basic_istream access:public signature:(unsigned int& __n) +std::basic_istream::operator >> cpp_src/istream /^ operator>>(unsigned long long& __n)$/;" f class:std::basic_istream access:public signature:(unsigned long long& __n) +std::basic_istream::operator >> cpp_src/istream /^ operator>>(unsigned long& __n)$/;" f class:std::basic_istream access:public signature:(unsigned long& __n) +std::basic_istream::operator >> cpp_src/istream /^ operator>>(unsigned short& __n)$/;" f class:std::basic_istream access:public signature:(unsigned short& __n) +std::basic_istream::operator >> cpp_src/istream /^ operator>>(void*& __p)$/;" f class:std::basic_istream access:public signature:(void*& __p) +std::basic_istream::operator >> cpp_src/istream.tcc /^ operator>>(__streambuf_type* __sbout)$/;" f class:std::basic_istream signature:(__streambuf_type* __sbout) +std::basic_istream::operator >> cpp_src/istream.tcc /^ operator>>(int& __n)$/;" f class:std::basic_istream signature:(int& __n) +std::basic_istream::operator >> cpp_src/istream.tcc /^ operator>>(short& __n)$/;" f class:std::basic_istream signature:(short& __n) +std::basic_istream::peek cpp_src/istream /^ peek();$/;" p class:std::basic_istream file: access:public signature:() +std::basic_istream::peek cpp_src/istream.tcc /^ peek(void)$/;" f class:std::basic_istream signature:(void) +std::basic_istream::pos_type cpp_src/istream /^ typedef typename _Traits::pos_type pos_type;$/;" t class:std::basic_istream file: access:public +std::basic_istream::putback cpp_src/istream /^ putback(char_type __c);$/;" p class:std::basic_istream file: access:public signature:(char_type __c) +std::basic_istream::putback cpp_src/istream.tcc /^ putback(char_type __c)$/;" f class:std::basic_istream signature:(char_type __c) +std::basic_istream::read cpp_src/istream /^ read(char_type* __s, streamsize __n);$/;" p class:std::basic_istream file: access:public signature:(char_type* __s, streamsize __n) +std::basic_istream::read cpp_src/istream.tcc /^ read(char_type* __s, streamsize __n)$/;" f class:std::basic_istream signature:(char_type* __s, streamsize __n) +std::basic_istream::readsome cpp_src/istream /^ readsome(char_type* __s, streamsize __n);$/;" p class:std::basic_istream file: access:public signature:(char_type* __s, streamsize __n) +std::basic_istream::readsome cpp_src/istream.tcc /^ readsome(char_type* __s, streamsize __n)$/;" f class:std::basic_istream signature:(char_type* __s, streamsize __n) +std::basic_istream::seekg cpp_src/istream /^ seekg(off_type, ios_base::seekdir);$/;" p class:std::basic_istream file: access:public signature:(off_type, ios_base::seekdir) +std::basic_istream::seekg cpp_src/istream /^ seekg(pos_type);$/;" p class:std::basic_istream file: access:public signature:(pos_type) +std::basic_istream::seekg cpp_src/istream.tcc /^ seekg(off_type __off, ios_base::seekdir __dir)$/;" f class:std::basic_istream signature:(off_type __off, ios_base::seekdir __dir) +std::basic_istream::seekg cpp_src/istream.tcc /^ seekg(pos_type __pos)$/;" f class:std::basic_istream signature:(pos_type __pos) +std::basic_istream::sentry cpp_src/istream /^ class basic_istream<_CharT, _Traits>::sentry$/;" c class:std::basic_istream file: +std::basic_istream::sentry::_M_ok cpp_src/istream /^ bool _M_ok;$/;" m class:std::basic_istream::sentry file: access:private +std::basic_istream::sentry::__ctype_type cpp_src/istream /^ typedef typename __istream_type::__ctype_type __ctype_type;$/;" t class:std::basic_istream::sentry file: access:public +std::basic_istream::sentry::__int_type cpp_src/istream /^ typedef typename _Traits::int_type __int_type;$/;" t class:std::basic_istream::sentry file: access:public +std::basic_istream::sentry::__istream_type cpp_src/istream /^ typedef basic_istream<_CharT, _Traits> __istream_type;$/;" t class:std::basic_istream::sentry file: access:public +std::basic_istream::sentry::__streambuf_type cpp_src/istream /^ typedef basic_streambuf<_CharT, _Traits> __streambuf_type;$/;" t class:std::basic_istream::sentry file: access:public +std::basic_istream::sentry::operator bool cpp_src/istream /^ operator bool() const$/;" f class:std::basic_istream::sentry access:public signature:() const +std::basic_istream::sentry::sentry cpp_src/istream /^ sentry(basic_istream<_CharT, _Traits>& __is, bool __noskipws = false);$/;" p class:std::basic_istream::sentry file: access:public signature:(basic_istream<_CharT, _Traits>& __is, bool __noskipws = false) +std::basic_istream::sentry::sentry cpp_src/istream.tcc /^ sentry(basic_istream<_CharT, _Traits>& __in, bool __noskip) : _M_ok(false)$/;" f class:std::basic_istream::sentry signature:(basic_istream<_CharT, _Traits>& __in, bool __noskip) +std::basic_istream::sentry::traits_type cpp_src/istream /^ typedef _Traits traits_type;$/;" t class:std::basic_istream::sentry file: access:public +std::basic_istream::sync cpp_src/istream /^ sync();$/;" p class:std::basic_istream file: access:public signature:() +std::basic_istream::sync cpp_src/istream.tcc /^ sync(void)$/;" f class:std::basic_istream signature:(void) +std::basic_istream::tellg cpp_src/istream /^ tellg();$/;" p class:std::basic_istream file: access:public signature:() +std::basic_istream::tellg cpp_src/istream.tcc /^ tellg(void)$/;" f class:std::basic_istream signature:(void) +std::basic_istream::traits_type cpp_src/istream /^ typedef _Traits traits_type;$/;" t class:std::basic_istream file: access:public +std::basic_istream::unget cpp_src/istream /^ unget();$/;" p class:std::basic_istream file: access:public signature:() +std::basic_istream::unget cpp_src/istream.tcc /^ unget(void)$/;" f class:std::basic_istream signature:(void) +std::basic_istream::~basic_istream cpp_src/istream /^ ~basic_istream() $/;" f class:std::basic_istream access:public signature:() +std::basic_istringstream cpp_src/sstream /^ class basic_istringstream : public basic_istream<_CharT, _Traits>$/;" c namespace:std file: inherits:basic_istream +std::basic_istringstream::_M_stringbuf cpp_src/sstream /^ __stringbuf_type _M_stringbuf;$/;" m class:std::basic_istringstream file: access:private +std::basic_istringstream::__istream_type cpp_src/sstream /^ typedef basic_istream __istream_type;$/;" t class:std::basic_istringstream file: access:public +std::basic_istringstream::__string_type cpp_src/sstream /^ typedef basic_string<_CharT, _Traits, _Alloc> __string_type;$/;" t class:std::basic_istringstream file: access:public +std::basic_istringstream::__stringbuf_type cpp_src/sstream /^ typedef basic_stringbuf<_CharT, _Traits, _Alloc> __stringbuf_type;$/;" t class:std::basic_istringstream file: access:public +std::basic_istringstream::allocator_type cpp_src/sstream /^ typedef _Alloc allocator_type;$/;" t class:std::basic_istringstream file: access:public +std::basic_istringstream::basic_istringstream cpp_src/sstream /^ basic_istringstream(const __string_type& __str,$/;" f class:std::basic_istringstream access:public signature:(const __string_type& __str, ios_base::openmode __mode = ios_base::in) +std::basic_istringstream::basic_istringstream cpp_src/sstream /^ basic_istringstream(ios_base::openmode __mode = ios_base::in)$/;" f class:std::basic_istringstream access:public signature:(ios_base::openmode __mode = ios_base::in) +std::basic_istringstream::char_type cpp_src/sstream /^ typedef _CharT char_type;$/;" t class:std::basic_istringstream file: access:public +std::basic_istringstream::int_type cpp_src/sstream /^ typedef typename traits_type::int_type int_type;$/;" t class:std::basic_istringstream file: access:public +std::basic_istringstream::off_type cpp_src/sstream /^ typedef typename traits_type::off_type off_type;$/;" t class:std::basic_istringstream file: access:public +std::basic_istringstream::pos_type cpp_src/sstream /^ typedef typename traits_type::pos_type pos_type;$/;" t class:std::basic_istringstream file: access:public +std::basic_istringstream::rdbuf cpp_src/sstream /^ rdbuf() const$/;" f class:std::basic_istringstream access:public signature:() const +std::basic_istringstream::str cpp_src/sstream /^ str() const$/;" f class:std::basic_istringstream access:public signature:() const +std::basic_istringstream::str cpp_src/sstream /^ str(const __string_type& __s)$/;" f class:std::basic_istringstream access:public signature:(const __string_type& __s) +std::basic_istringstream::traits_type cpp_src/sstream /^ typedef _Traits traits_type;$/;" t class:std::basic_istringstream file: access:public +std::basic_istringstream::~basic_istringstream cpp_src/sstream /^ ~basic_istringstream()$/;" f class:std::basic_istringstream access:public signature:() +std::basic_ofstream cpp_src/fstream /^ class basic_ofstream : public basic_ostream<_CharT,_Traits>$/;" c namespace:std file: inherits:basic_ostream +std::basic_ofstream::_M_filebuf cpp_src/fstream /^ __filebuf_type _M_filebuf;$/;" m class:std::basic_ofstream file: access:private +std::basic_ofstream::__filebuf_type cpp_src/fstream /^ typedef basic_filebuf __filebuf_type;$/;" t class:std::basic_ofstream file: access:public +std::basic_ofstream::__ostream_type cpp_src/fstream /^ typedef basic_ostream __ostream_type;$/;" t class:std::basic_ofstream file: access:public +std::basic_ofstream::basic_ofstream cpp_src/fstream /^ basic_ofstream(): __ostream_type(), _M_filebuf()$/;" f class:std::basic_ofstream access:public signature:() +std::basic_ofstream::basic_ofstream cpp_src/fstream /^ basic_ofstream(const char* __s,$/;" f class:std::basic_ofstream access:public signature:(const char* __s, ios_base::openmode __mode = ios_base::out|ios_base::trunc) +std::basic_ofstream::char_type cpp_src/fstream /^ typedef _CharT char_type;$/;" t class:std::basic_ofstream file: access:public +std::basic_ofstream::close cpp_src/fstream /^ close()$/;" f class:std::basic_ofstream access:public signature:() +std::basic_ofstream::int_type cpp_src/fstream /^ typedef typename traits_type::int_type int_type;$/;" t class:std::basic_ofstream file: access:public +std::basic_ofstream::is_open cpp_src/fstream /^ is_open() const$/;" f class:std::basic_ofstream access:public signature:() const +std::basic_ofstream::is_open cpp_src/fstream /^ is_open()$/;" f class:std::basic_ofstream access:public signature:() +std::basic_ofstream::off_type cpp_src/fstream /^ typedef typename traits_type::off_type off_type;$/;" t class:std::basic_ofstream file: access:public +std::basic_ofstream::open cpp_src/fstream /^ open(const char* __s,$/;" f class:std::basic_ofstream access:public signature:(const char* __s, ios_base::openmode __mode = ios_base::out | ios_base::trunc) +std::basic_ofstream::pos_type cpp_src/fstream /^ typedef typename traits_type::pos_type pos_type;$/;" t class:std::basic_ofstream file: access:public +std::basic_ofstream::rdbuf cpp_src/fstream /^ rdbuf() const$/;" f class:std::basic_ofstream access:public signature:() const +std::basic_ofstream::traits_type cpp_src/fstream /^ typedef _Traits traits_type;$/;" t class:std::basic_ofstream file: access:public +std::basic_ofstream::~basic_ofstream cpp_src/fstream /^ ~basic_ofstream()$/;" f class:std::basic_ofstream access:public signature:() +std::basic_ostream cpp_src/ostream /^ class basic_ostream : virtual public basic_ios<_CharT, _Traits>$/;" c namespace:std file: inherits:basic_ios +std::basic_ostream::_M_insert cpp_src/ostream /^ _M_insert(_ValueT __v);$/;" p class:std::basic_ostream file: access:protected signature:(_ValueT __v) +std::basic_ostream::_M_insert cpp_src/ostream.tcc /^ _M_insert(_ValueT __v)$/;" f class:std::basic_ostream signature:(_ValueT __v) +std::basic_ostream::_M_write cpp_src/ostream /^ _M_write(const char_type* __s, streamsize __n)$/;" f class:std::basic_ostream access:public signature:(const char_type* __s, streamsize __n) +std::basic_ostream::__ctype_type cpp_src/ostream /^ typedef ctype<_CharT> __ctype_type;$/;" t class:std::basic_ostream file: access:public +std::basic_ostream::__ios_type cpp_src/ostream /^ typedef basic_ios<_CharT, _Traits> __ios_type;$/;" t class:std::basic_ostream file: access:public +std::basic_ostream::__num_put_type cpp_src/ostream /^ __num_put_type;$/;" t class:std::basic_ostream file: access:public +std::basic_ostream::__ostream_type cpp_src/ostream /^ typedef basic_ostream<_CharT, _Traits> __ostream_type;$/;" t class:std::basic_ostream file: access:public +std::basic_ostream::__pf cpp_src/ostream /^ operator<<(__ios_type& (*__pf)(__ios_type&))$/;" f class:std::basic_ostream access:public signature:(__ios_type&) +std::basic_ostream::__pf cpp_src/ostream /^ operator<<(__ostream_type& (*__pf)(__ostream_type&))$/;" f class:std::basic_ostream access:public signature:(__ostream_type&) +std::basic_ostream::__pf cpp_src/ostream /^ operator<<(ios_base& (*__pf) (ios_base&))$/;" f class:std::basic_ostream access:public signature:(ios_base&) +std::basic_ostream::__streambuf_type cpp_src/ostream /^ typedef basic_streambuf<_CharT, _Traits> __streambuf_type;$/;" t class:std::basic_ostream file: access:public +std::basic_ostream::basic_ostream cpp_src/ostream /^ basic_ostream() { }$/;" f class:std::basic_ostream access:protected signature:() +std::basic_ostream::basic_ostream cpp_src/ostream /^ basic_ostream(__streambuf_type* __sb)$/;" f class:std::basic_ostream access:public signature:(__streambuf_type* __sb) +std::basic_ostream::char_type cpp_src/ostream /^ typedef _CharT char_type;$/;" t class:std::basic_ostream file: access:public +std::basic_ostream::flush cpp_src/ostream /^ flush();$/;" p class:std::basic_ostream file: access:public signature:() +std::basic_ostream::flush cpp_src/ostream.tcc /^ flush()$/;" f class:std::basic_ostream signature:() +std::basic_ostream::int_type cpp_src/ostream /^ typedef typename _Traits::int_type int_type;$/;" t class:std::basic_ostream file: access:public +std::basic_ostream::off_type cpp_src/ostream /^ typedef typename _Traits::off_type off_type;$/;" t class:std::basic_ostream file: access:public +std::basic_ostream::operator << cpp_src/ostream /^ operator<<(__streambuf_type* __sb);$/;" p class:std::basic_ostream file: access:public signature:(__streambuf_type* __sb) +std::basic_ostream::operator << cpp_src/ostream /^ operator<<(bool __n)$/;" f class:std::basic_ostream access:public signature:(bool __n) +std::basic_ostream::operator << cpp_src/ostream /^ operator<<(const void* __p)$/;" f class:std::basic_ostream access:public signature:(const void* __p) +std::basic_ostream::operator << cpp_src/ostream /^ operator<<(double __f)$/;" f class:std::basic_ostream access:public signature:(double __f) +std::basic_ostream::operator << cpp_src/ostream /^ operator<<(float __f)$/;" f class:std::basic_ostream access:public signature:(float __f) +std::basic_ostream::operator << cpp_src/ostream /^ operator<<(int __n);$/;" p class:std::basic_ostream file: access:public signature:(int __n) +std::basic_ostream::operator << cpp_src/ostream /^ operator<<(long __n)$/;" f class:std::basic_ostream access:public signature:(long __n) +std::basic_ostream::operator << cpp_src/ostream /^ operator<<(long double __f)$/;" f class:std::basic_ostream access:public signature:(long double __f) +std::basic_ostream::operator << cpp_src/ostream /^ operator<<(long long __n)$/;" f class:std::basic_ostream access:public signature:(long long __n) +std::basic_ostream::operator << cpp_src/ostream /^ operator<<(short __n);$/;" p class:std::basic_ostream file: access:public signature:(short __n) +std::basic_ostream::operator << cpp_src/ostream /^ operator<<(unsigned int __n)$/;" f class:std::basic_ostream access:public signature:(unsigned int __n) +std::basic_ostream::operator << cpp_src/ostream /^ operator<<(unsigned long __n)$/;" f class:std::basic_ostream access:public signature:(unsigned long __n) +std::basic_ostream::operator << cpp_src/ostream /^ operator<<(unsigned long long __n)$/;" f class:std::basic_ostream access:public signature:(unsigned long long __n) +std::basic_ostream::operator << cpp_src/ostream /^ operator<<(unsigned short __n)$/;" f class:std::basic_ostream access:public signature:(unsigned short __n) +std::basic_ostream::operator << cpp_src/ostream.tcc /^ operator<<(__streambuf_type* __sbin)$/;" f class:std::basic_ostream signature:(__streambuf_type* __sbin) +std::basic_ostream::operator << cpp_src/ostream.tcc /^ operator<<(int __n)$/;" f class:std::basic_ostream signature:(int __n) +std::basic_ostream::operator << cpp_src/ostream.tcc /^ operator<<(short __n)$/;" f class:std::basic_ostream signature:(short __n) +std::basic_ostream::pos_type cpp_src/ostream /^ typedef typename _Traits::pos_type pos_type;$/;" t class:std::basic_ostream file: access:public +std::basic_ostream::put cpp_src/ostream /^ put(char_type __c);$/;" p class:std::basic_ostream file: access:public signature:(char_type __c) +std::basic_ostream::put cpp_src/ostream.tcc /^ put(char_type __c)$/;" f class:std::basic_ostream signature:(char_type __c) +std::basic_ostream::seekp cpp_src/ostream /^ seekp(off_type, ios_base::seekdir);$/;" p class:std::basic_ostream file: access:public signature:(off_type, ios_base::seekdir) +std::basic_ostream::seekp cpp_src/ostream /^ seekp(pos_type);$/;" p class:std::basic_ostream file: access:public signature:(pos_type) +std::basic_ostream::seekp cpp_src/ostream.tcc /^ seekp(off_type __off, ios_base::seekdir __dir)$/;" f class:std::basic_ostream signature:(off_type __off, ios_base::seekdir __dir) +std::basic_ostream::seekp cpp_src/ostream.tcc /^ seekp(pos_type __pos)$/;" f class:std::basic_ostream signature:(pos_type __pos) +std::basic_ostream::sentry cpp_src/ostream /^ class basic_ostream<_CharT, _Traits>::sentry$/;" c class:std::basic_ostream file: +std::basic_ostream::sentry::_M_ok cpp_src/ostream /^ bool _M_ok;$/;" m class:std::basic_ostream::sentry file: access:private +std::basic_ostream::sentry::_M_os cpp_src/ostream /^ basic_ostream<_CharT, _Traits>& _M_os;$/;" m class:std::basic_ostream::sentry file: access:private +std::basic_ostream::sentry::operator bool cpp_src/ostream /^ operator bool() const$/;" f class:std::basic_ostream::sentry access:public signature:() const +std::basic_ostream::sentry::sentry cpp_src/ostream /^ sentry(basic_ostream<_CharT, _Traits>& __os);$/;" p class:std::basic_ostream::sentry file: access:public signature:(basic_ostream<_CharT, _Traits>& __os) +std::basic_ostream::sentry::sentry cpp_src/ostream.tcc /^ sentry(basic_ostream<_CharT, _Traits>& __os)$/;" f class:std::basic_ostream::sentry signature:(basic_ostream<_CharT, _Traits>& __os) +std::basic_ostream::sentry::~sentry cpp_src/ostream /^ ~sentry()$/;" f class:std::basic_ostream::sentry access:public signature:() +std::basic_ostream::tellp cpp_src/ostream /^ tellp();$/;" p class:std::basic_ostream file: access:public signature:() +std::basic_ostream::tellp cpp_src/ostream.tcc /^ tellp()$/;" f class:std::basic_ostream signature:() +std::basic_ostream::traits_type cpp_src/ostream /^ typedef _Traits traits_type;$/;" t class:std::basic_ostream file: access:public +std::basic_ostream::write cpp_src/ostream /^ write(const char_type* __s, streamsize __n);$/;" p class:std::basic_ostream file: access:public signature:(const char_type* __s, streamsize __n) +std::basic_ostream::write cpp_src/ostream.tcc /^ write(const _CharT* __s, streamsize __n)$/;" f class:std::basic_ostream signature:(const _CharT* __s, streamsize __n) +std::basic_ostream::~basic_ostream cpp_src/ostream /^ ~basic_ostream() { }$/;" f class:std::basic_ostream access:public signature:() +std::basic_ostringstream cpp_src/sstream /^ class basic_ostringstream : public basic_ostream<_CharT, _Traits>$/;" c namespace:std file: inherits:basic_ostream +std::basic_ostringstream::_M_stringbuf cpp_src/sstream /^ __stringbuf_type _M_stringbuf;$/;" m class:std::basic_ostringstream file: access:private +std::basic_ostringstream::__ostream_type cpp_src/sstream /^ typedef basic_ostream __ostream_type;$/;" t class:std::basic_ostringstream file: access:public +std::basic_ostringstream::__string_type cpp_src/sstream /^ typedef basic_string<_CharT, _Traits, _Alloc> __string_type;$/;" t class:std::basic_ostringstream file: access:public +std::basic_ostringstream::__stringbuf_type cpp_src/sstream /^ typedef basic_stringbuf<_CharT, _Traits, _Alloc> __stringbuf_type;$/;" t class:std::basic_ostringstream file: access:public +std::basic_ostringstream::allocator_type cpp_src/sstream /^ typedef _Alloc allocator_type;$/;" t class:std::basic_ostringstream file: access:public +std::basic_ostringstream::basic_ostringstream cpp_src/sstream /^ basic_ostringstream(const __string_type& __str,$/;" f class:std::basic_ostringstream access:public signature:(const __string_type& __str, ios_base::openmode __mode = ios_base::out) +std::basic_ostringstream::basic_ostringstream cpp_src/sstream /^ basic_ostringstream(ios_base::openmode __mode = ios_base::out)$/;" f class:std::basic_ostringstream access:public signature:(ios_base::openmode __mode = ios_base::out) +std::basic_ostringstream::char_type cpp_src/sstream /^ typedef _CharT char_type;$/;" t class:std::basic_ostringstream file: access:public +std::basic_ostringstream::int_type cpp_src/sstream /^ typedef typename traits_type::int_type int_type;$/;" t class:std::basic_ostringstream file: access:public +std::basic_ostringstream::off_type cpp_src/sstream /^ typedef typename traits_type::off_type off_type;$/;" t class:std::basic_ostringstream file: access:public +std::basic_ostringstream::pos_type cpp_src/sstream /^ typedef typename traits_type::pos_type pos_type;$/;" t class:std::basic_ostringstream file: access:public +std::basic_ostringstream::rdbuf cpp_src/sstream /^ rdbuf() const$/;" f class:std::basic_ostringstream access:public signature:() const +std::basic_ostringstream::str cpp_src/sstream /^ str() const$/;" f class:std::basic_ostringstream access:public signature:() const +std::basic_ostringstream::str cpp_src/sstream /^ str(const __string_type& __s)$/;" f class:std::basic_ostringstream access:public signature:(const __string_type& __s) +std::basic_ostringstream::traits_type cpp_src/sstream /^ typedef _Traits traits_type;$/;" t class:std::basic_ostringstream file: access:public +std::basic_ostringstream::~basic_ostringstream cpp_src/sstream /^ ~basic_ostringstream()$/;" f class:std::basic_ostringstream access:public signature:() +std::basic_streambuf cpp_src/streambuf /^ class basic_streambuf $/;" c namespace:std file: +std::basic_streambuf::_M_buf_locale cpp_src/streambuf /^ locale _M_buf_locale; $/;" m class:std::basic_streambuf file: access:protected +std::basic_streambuf::_M_in_beg cpp_src/streambuf /^ char_type* _M_in_beg; \/\/ Start of get area. $/;" m class:std::basic_streambuf file: access:protected +std::basic_streambuf::_M_in_cur cpp_src/streambuf /^ char_type* _M_in_cur; \/\/ Current read area. $/;" m class:std::basic_streambuf file: access:protected +std::basic_streambuf::_M_in_end cpp_src/streambuf /^ char_type* _M_in_end; \/\/ End of get area. $/;" m class:std::basic_streambuf file: access:protected +std::basic_streambuf::_M_out_beg cpp_src/streambuf /^ char_type* _M_out_beg; \/\/ Start of put area. $/;" m class:std::basic_streambuf file: access:protected +std::basic_streambuf::_M_out_cur cpp_src/streambuf /^ char_type* _M_out_cur; \/\/ Current put area. $/;" m class:std::basic_streambuf file: access:protected +std::basic_streambuf::_M_out_end cpp_src/streambuf /^ char_type* _M_out_end; \/\/ End of put area.$/;" m class:std::basic_streambuf file: access:protected +std::basic_streambuf::__copy_aux cpp_src/streambuf /^ __copy_aux(istreambuf_iterator<_CharT2>,$/;" p class:std::basic_streambuf file: access:friend signature:(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, _CharT2*) +std::basic_streambuf::__copy_streambufs_eof cpp_src/streambuf /^ __copy_streambufs_eof<>(__streambuf_type*, __streambuf_type*, bool&);$/;" p class:std::basic_streambuf file: access:friend signature:(__streambuf_type*, __streambuf_type*, bool&) +std::basic_streambuf::__streambuf_type cpp_src/streambuf /^ typedef basic_streambuf __streambuf_type;$/;" t class:std::basic_streambuf file: access:public +std::basic_streambuf::basic_streambuf cpp_src/streambuf /^ basic_streambuf()$/;" f class:std::basic_streambuf access:protected signature:() +std::basic_streambuf::basic_streambuf cpp_src/streambuf /^ basic_streambuf(const __streambuf_type& __sb)$/;" f class:std::basic_streambuf file: access:private signature:(const __streambuf_type& __sb) +std::basic_streambuf::char_type cpp_src/streambuf /^ typedef _CharT char_type;$/;" t class:std::basic_streambuf file: access:public +std::basic_streambuf::eback cpp_src/streambuf /^ eback() const { return _M_in_beg; }$/;" f class:std::basic_streambuf access:protected signature:() const +std::basic_streambuf::egptr cpp_src/streambuf /^ egptr() const { return _M_in_end; }$/;" f class:std::basic_streambuf access:protected signature:() const +std::basic_streambuf::epptr cpp_src/streambuf /^ epptr() const { return _M_out_end; }$/;" f class:std::basic_streambuf access:protected signature:() const +std::basic_streambuf::find cpp_src/streambuf /^ find(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>,$/;" p class:std::basic_streambuf file: access:friend signature:(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, const _CharT2&) +std::basic_streambuf::gbump cpp_src/streambuf /^ gbump(int __n) { _M_in_cur += __n; }$/;" f class:std::basic_streambuf access:protected signature:(int __n) +std::basic_streambuf::getline cpp_src/streambuf /^ getline(basic_istream<_CharT2, _Traits2>&,$/;" p class:std::basic_streambuf file: access:friend signature:(basic_istream<_CharT2, _Traits2>&, basic_string<_CharT2, _Traits2, _Alloc>&, _CharT2) +std::basic_streambuf::getloc cpp_src/streambuf /^ getloc() const$/;" f class:std::basic_streambuf access:public signature:() const +std::basic_streambuf::gptr cpp_src/streambuf /^ gptr() const { return _M_in_cur; }$/;" f class:std::basic_streambuf access:protected signature:() const +std::basic_streambuf::imbue cpp_src/streambuf /^ imbue(const locale&) $/;" f class:std::basic_streambuf access:protected signature:(const locale&) +std::basic_streambuf::in_avail cpp_src/streambuf /^ in_avail() $/;" f class:std::basic_streambuf access:public signature:() +std::basic_streambuf::int_type cpp_src/streambuf /^ typedef typename traits_type::int_type int_type;$/;" t class:std::basic_streambuf file: access:public +std::basic_streambuf::off_type cpp_src/streambuf /^ typedef typename traits_type::off_type off_type;$/;" t class:std::basic_streambuf file: access:public +std::basic_streambuf::operator = cpp_src/streambuf /^ operator=(const __streambuf_type&) { return *this; };$/;" f class:std::basic_streambuf file: access:private signature:(const __streambuf_type&) +std::basic_streambuf::operator >> cpp_src/streambuf /^ operator>>(basic_istream<_CharT2, _Traits2>&, _CharT2*);$/;" p class:std::basic_streambuf file: access:friend signature:(basic_istream<_CharT2, _Traits2>&, _CharT2*) +std::basic_streambuf::operator >> cpp_src/streambuf /^ operator>>(basic_istream<_CharT2, _Traits2>&,$/;" p class:std::basic_streambuf file: access:friend signature:(basic_istream<_CharT2, _Traits2>&, basic_string<_CharT2, _Traits2, _Alloc>&) +std::basic_streambuf::overflow cpp_src/streambuf /^ overflow(int_type \/* __c *\/ = traits_type::eof())$/;" f class:std::basic_streambuf access:protected signature:(int_type = traits_type::eof()) +std::basic_streambuf::pbackfail cpp_src/streambuf /^ pbackfail(int_type \/* __c *\/ = traits_type::eof())$/;" f class:std::basic_streambuf access:protected signature:(int_type = traits_type::eof()) +std::basic_streambuf::pbase cpp_src/streambuf /^ pbase() const { return _M_out_beg; }$/;" f class:std::basic_streambuf access:protected signature:() const +std::basic_streambuf::pbump cpp_src/streambuf /^ pbump(int __n) { _M_out_cur += __n; }$/;" f class:std::basic_streambuf access:protected signature:(int __n) +std::basic_streambuf::pos_type cpp_src/streambuf /^ typedef typename traits_type::pos_type pos_type;$/;" t class:std::basic_streambuf file: access:public +std::basic_streambuf::pptr cpp_src/streambuf /^ pptr() const { return _M_out_cur; }$/;" f class:std::basic_streambuf access:protected signature:() const +std::basic_streambuf::pubimbue cpp_src/streambuf /^ pubimbue(const locale &__loc)$/;" f class:std::basic_streambuf access:public signature:(const locale &__loc) +std::basic_streambuf::pubseekoff cpp_src/streambuf /^ pubseekoff(off_type __off, ios_base::seekdir __way, $/;" f class:std::basic_streambuf access:public signature:(off_type __off, ios_base::seekdir __way, ios_base::openmode __mode = ios_base::in | ios_base::out) +std::basic_streambuf::pubseekpos cpp_src/streambuf /^ pubseekpos(pos_type __sp,$/;" f class:std::basic_streambuf access:public signature:(pos_type __sp, ios_base::openmode __mode = ios_base::in | ios_base::out) +std::basic_streambuf::pubsetbuf cpp_src/streambuf /^ pubsetbuf(char_type* __s, streamsize __n) $/;" f class:std::basic_streambuf access:public signature:(char_type* __s, streamsize __n) +std::basic_streambuf::pubsync cpp_src/streambuf /^ pubsync() { return this->sync(); }$/;" f class:std::basic_streambuf access:public signature:() +std::basic_streambuf::sbumpc cpp_src/streambuf /^ sbumpc()$/;" f class:std::basic_streambuf access:public signature:() +std::basic_streambuf::seekoff cpp_src/streambuf /^ seekoff(off_type, ios_base::seekdir,$/;" f class:std::basic_streambuf access:protected signature:(off_type, ios_base::seekdir, ios_base::openmode = ios_base::in | ios_base::out) +std::basic_streambuf::seekpos cpp_src/streambuf /^ seekpos(pos_type, $/;" f class:std::basic_streambuf access:protected signature:(pos_type, ios_base::openmode = ios_base::in | ios_base::out) +std::basic_streambuf::setbuf cpp_src/streambuf /^ setbuf(char_type*, streamsize)$/;" f class:std::basic_streambuf access:protected signature:(char_type*, streamsize) +std::basic_streambuf::setg cpp_src/streambuf /^ setg(char_type* __gbeg, char_type* __gnext, char_type* __gend)$/;" f class:std::basic_streambuf access:protected signature:(char_type* __gbeg, char_type* __gnext, char_type* __gend) +std::basic_streambuf::setp cpp_src/streambuf /^ setp(char_type* __pbeg, char_type* __pend)$/;" f class:std::basic_streambuf access:protected signature:(char_type* __pbeg, char_type* __pend) +std::basic_streambuf::sgetc cpp_src/streambuf /^ sgetc()$/;" f class:std::basic_streambuf access:public signature:() +std::basic_streambuf::sgetn cpp_src/streambuf /^ sgetn(char_type* __s, streamsize __n)$/;" f class:std::basic_streambuf access:public signature:(char_type* __s, streamsize __n) +std::basic_streambuf::showmanyc cpp_src/streambuf /^ showmanyc() { return 0; }$/;" f class:std::basic_streambuf access:protected signature:() +std::basic_streambuf::snextc cpp_src/streambuf /^ snextc()$/;" f class:std::basic_streambuf access:public signature:() +std::basic_streambuf::sputbackc cpp_src/streambuf /^ sputbackc(char_type __c)$/;" f class:std::basic_streambuf access:public signature:(char_type __c) +std::basic_streambuf::sputc cpp_src/streambuf /^ sputc(char_type __c)$/;" f class:std::basic_streambuf access:public signature:(char_type __c) +std::basic_streambuf::sputn cpp_src/streambuf /^ sputn(const char_type* __s, streamsize __n)$/;" f class:std::basic_streambuf access:public signature:(const char_type* __s, streamsize __n) +std::basic_streambuf::stossc cpp_src/streambuf /^ stossc() $/;" f class:std::basic_streambuf access:public signature:() +std::basic_streambuf::sungetc cpp_src/streambuf /^ sungetc()$/;" f class:std::basic_streambuf access:public signature:() +std::basic_streambuf::sync cpp_src/streambuf /^ sync() { return 0; }$/;" f class:std::basic_streambuf access:protected signature:() +std::basic_streambuf::traits_type cpp_src/streambuf /^ typedef _Traits traits_type;$/;" t class:std::basic_streambuf file: access:public +std::basic_streambuf::uflow cpp_src/streambuf /^ uflow() $/;" f class:std::basic_streambuf access:protected signature:() +std::basic_streambuf::underflow cpp_src/streambuf /^ underflow()$/;" f class:std::basic_streambuf access:protected signature:() +std::basic_streambuf::xsgetn cpp_src/streambuf /^ xsgetn(char_type* __s, streamsize __n);$/;" p class:std::basic_streambuf file: access:protected signature:(char_type* __s, streamsize __n) +std::basic_streambuf::xsgetn cpp_src/streambuf.tcc /^ xsgetn(char_type* __s, streamsize __n)$/;" f class:std::basic_streambuf signature:(char_type* __s, streamsize __n) +std::basic_streambuf::xsputn cpp_src/streambuf /^ xsputn(const char_type* __s, streamsize __n);$/;" p class:std::basic_streambuf file: access:protected signature:(const char_type* __s, streamsize __n) +std::basic_streambuf::xsputn cpp_src/streambuf.tcc /^ xsputn(const char_type* __s, streamsize __n)$/;" f class:std::basic_streambuf signature:(const char_type* __s, streamsize __n) +std::basic_streambuf::~basic_streambuf cpp_src/streambuf /^ ~basic_streambuf() $/;" f class:std::basic_streambuf access:public signature:() +std::basic_string cpp_src/basic_string.h /^ class basic_string$/;" c namespace:std +std::basic_string::_Alloc_hider cpp_src/basic_string.h /^ struct _Alloc_hider : _Alloc$/;" s class:std::basic_string inherits:_Alloc access:private +std::basic_string::_Alloc_hider::_Alloc_hider cpp_src/basic_string.h /^ _Alloc_hider(_CharT* __dat, const _Alloc& __a)$/;" f struct:std::basic_string::_Alloc_hider access:public signature:(_CharT* __dat, const _Alloc& __a) +std::basic_string::_Alloc_hider::_M_p cpp_src/basic_string.h /^ _CharT* _M_p; \/\/ The actual data.$/;" m struct:std::basic_string::_Alloc_hider access:public +std::basic_string::_CharT_alloc_type cpp_src/basic_string.h /^ typedef typename _Alloc::template rebind<_CharT>::other _CharT_alloc_type;$/;" t class:std::basic_string access:private +std::basic_string::_M_assign cpp_src/basic_string.h /^ _M_assign(_CharT* __d, size_type __n, _CharT __c)$/;" f class:std::basic_string access:private signature:(_CharT* __d, size_type __n, _CharT __c) +std::basic_string::_M_check cpp_src/basic_string.h /^ _M_check(size_type __pos, const char* __s) const$/;" f class:std::basic_string access:private signature:(size_type __pos, const char* __s) const +std::basic_string::_M_check_length cpp_src/basic_string.h /^ _M_check_length(size_type __n1, size_type __n2, const char* __s) const$/;" f class:std::basic_string access:private signature:(size_type __n1, size_type __n2, const char* __s) const +std::basic_string::_M_copy cpp_src/basic_string.h /^ _M_copy(_CharT* __d, const _CharT* __s, size_type __n)$/;" f class:std::basic_string access:private signature:(_CharT* __d, const _CharT* __s, size_type __n) +std::basic_string::_M_data cpp_src/basic_string.h /^ _M_data() const$/;" f class:std::basic_string access:private signature:() const +std::basic_string::_M_data cpp_src/basic_string.h /^ _M_data(_CharT* __p)$/;" f class:std::basic_string access:private signature:(_CharT* __p) +std::basic_string::_M_dataplus cpp_src/basic_string.h /^ mutable _Alloc_hider _M_dataplus;$/;" m class:std::basic_string access:private +std::basic_string::_M_disjunct cpp_src/basic_string.h /^ _M_disjunct(const _CharT* __s) const$/;" f class:std::basic_string access:private signature:(const _CharT* __s) const +std::basic_string::_M_ibegin cpp_src/basic_string.h /^ _M_ibegin() const$/;" f class:std::basic_string access:private signature:() const +std::basic_string::_M_iend cpp_src/basic_string.h /^ _M_iend() const$/;" f class:std::basic_string access:private signature:() const +std::basic_string::_M_leak cpp_src/basic_string.h /^ _M_leak() \/\/ for use in begin() & non-const op[]$/;" f class:std::basic_string access:private signature:() +std::basic_string::_M_leak_hard cpp_src/basic_string.h /^ _M_leak_hard();$/;" p class:std::basic_string access:private signature:() +std::basic_string::_M_leak_hard cpp_src/basic_string.tcc /^ _M_leak_hard()$/;" f class:std::basic_string signature:() +std::basic_string::_M_limit cpp_src/basic_string.h /^ _M_limit(size_type __pos, size_type __off) const$/;" f class:std::basic_string access:private signature:(size_type __pos, size_type __off) const +std::basic_string::_M_move cpp_src/basic_string.h /^ _M_move(_CharT* __d, const _CharT* __s, size_type __n)$/;" f class:std::basic_string access:private signature:(_CharT* __d, const _CharT* __s, size_type __n) +std::basic_string::_M_mutate cpp_src/basic_string.h /^ _M_mutate(size_type __pos, size_type __len1, size_type __len2);$/;" p class:std::basic_string access:private signature:(size_type __pos, size_type __len1, size_type __len2) +std::basic_string::_M_mutate cpp_src/basic_string.tcc /^ _M_mutate(size_type __pos, size_type __len1, size_type __len2)$/;" f class:std::basic_string signature:(size_type __pos, size_type __len1, size_type __len2) +std::basic_string::_M_rep cpp_src/basic_string.h /^ _M_rep() const$/;" f class:std::basic_string access:private signature:() const +std::basic_string::_M_replace_aux cpp_src/basic_string.h /^ _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2,$/;" p class:std::basic_string access:private signature:(size_type __pos1, size_type __n1, size_type __n2, _CharT __c) +std::basic_string::_M_replace_aux cpp_src/basic_string.tcc /^ _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2,$/;" f class:std::basic_string signature:(size_type __pos1, size_type __n1, size_type __n2, _CharT __c) +std::basic_string::_M_replace_dispatch cpp_src/basic_string.h /^ _M_replace_dispatch(iterator __i1, iterator __i2, _InputIterator __k1,$/;" p class:std::basic_string access:private signature:(iterator __i1, iterator __i2, _InputIterator __k1, _InputIterator __k2, __false_type) +std::basic_string::_M_replace_dispatch cpp_src/basic_string.h /^ _M_replace_dispatch(iterator __i1, iterator __i2, _Integer __n,$/;" f class:std::basic_string access:private signature:(iterator __i1, iterator __i2, _Integer __n, _Integer __val, __true_type) +std::basic_string::_M_replace_dispatch cpp_src/basic_string.tcc /^ _M_replace_dispatch(iterator __i1, iterator __i2, _InputIterator __k1,$/;" f class:std::basic_string signature:(iterator __i1, iterator __i2, _InputIterator __k1, _InputIterator __k2, __false_type) +std::basic_string::_M_replace_safe cpp_src/basic_string.h /^ _M_replace_safe(size_type __pos1, size_type __n1, const _CharT* __s,$/;" p class:std::basic_string access:private signature:(size_type __pos1, size_type __n1, const _CharT* __s, size_type __n2) +std::basic_string::_M_replace_safe cpp_src/basic_string.tcc /^ _M_replace_safe(size_type __pos1, size_type __n1, const _CharT* __s,$/;" f class:std::basic_string signature:(size_type __pos1, size_type __n1, const _CharT* __s, size_type __n2) +std::basic_string::_Rep cpp_src/basic_string.h /^ struct _Rep : _Rep_base$/;" s class:std::basic_string inherits:_Rep_base access:private +std::basic_string::_Rep::_M_clone cpp_src/basic_string.h /^ _M_clone(const _Alloc&, size_type __res = 0);$/;" p struct:std::basic_string::_Rep access:public signature:(const _Alloc&, size_type __res = 0) +std::basic_string::_Rep::_M_clone cpp_src/basic_string.tcc /^ _M_clone(const _Alloc& __alloc, size_type __res)$/;" f class:std::basic_string::_Rep signature:(const _Alloc& __alloc, size_type __res) +std::basic_string::_Rep::_M_destroy cpp_src/basic_string.h /^ _M_destroy(const _Alloc&) throw();$/;" p struct:std::basic_string::_Rep access:public signature:(const _Alloc&) +std::basic_string::_Rep::_M_destroy cpp_src/basic_string.tcc /^ _M_destroy(const _Alloc& __a) throw ()$/;" f class:std::basic_string::_Rep signature:(const _Alloc& __a) +std::basic_string::_Rep::_M_dispose cpp_src/basic_string.h /^ _M_dispose(const _Alloc& __a)$/;" f struct:std::basic_string::_Rep access:public signature:(const _Alloc& __a) +std::basic_string::_Rep::_M_grab cpp_src/basic_string.h /^ _M_grab(const _Alloc& __alloc1, const _Alloc& __alloc2)$/;" f struct:std::basic_string::_Rep access:public signature:(const _Alloc& __alloc1, const _Alloc& __alloc2) +std::basic_string::_Rep::_M_is_leaked cpp_src/basic_string.h /^ _M_is_leaked() const$/;" f struct:std::basic_string::_Rep access:public signature:() const +std::basic_string::_Rep::_M_is_shared cpp_src/basic_string.h /^ _M_is_shared() const$/;" f struct:std::basic_string::_Rep access:public signature:() const +std::basic_string::_Rep::_M_refcopy cpp_src/basic_string.h /^ _M_refcopy() throw()$/;" f struct:std::basic_string::_Rep access:public signature:() +std::basic_string::_Rep::_M_refdata cpp_src/basic_string.h /^ _M_refdata() throw()$/;" f struct:std::basic_string::_Rep access:public signature:() +std::basic_string::_Rep::_M_set_leaked cpp_src/basic_string.h /^ _M_set_leaked()$/;" f struct:std::basic_string::_Rep access:public signature:() +std::basic_string::_Rep::_M_set_length_and_sharable cpp_src/basic_string.h /^ _M_set_length_and_sharable(size_type __n)$/;" f struct:std::basic_string::_Rep access:public signature:(size_type __n) +std::basic_string::_Rep::_M_set_sharable cpp_src/basic_string.h /^ _M_set_sharable()$/;" f struct:std::basic_string::_Rep access:public signature:() +std::basic_string::_Rep::_Raw_bytes_alloc cpp_src/basic_string.h /^ typedef typename _Alloc::template rebind::other _Raw_bytes_alloc;$/;" t struct:std::basic_string::_Rep access:public +std::basic_string::_Rep::_S_create cpp_src/basic_string.h /^ _S_create(size_type, size_type, const _Alloc&);$/;" p struct:std::basic_string::_Rep access:public signature:(size_type, size_type, const _Alloc&) +std::basic_string::_Rep::_S_create cpp_src/basic_string.tcc /^ _S_create(size_type __capacity, size_type __old_capacity,$/;" f class:std::basic_string::_Rep signature:(size_type __capacity, size_type __old_capacity, const _Alloc& __alloc) +std::basic_string::_Rep::_S_empty_rep cpp_src/basic_string.h /^ _S_empty_rep()$/;" f struct:std::basic_string::_Rep access:public signature:() +std::basic_string::_Rep::_S_empty_rep_storage cpp_src/basic_string.h /^ static size_type _S_empty_rep_storage[];$/;" m struct:std::basic_string::_Rep access:public +std::basic_string::_Rep::_S_empty_rep_storage cpp_src/basic_string.tcc /^ basic_string<_CharT, _Traits, _Alloc>::_Rep::_S_empty_rep_storage[$/;" m class:std::basic_string::_Rep file: +std::basic_string::_Rep::_S_max_size cpp_src/basic_string.h /^ static const size_type _S_max_size;$/;" m struct:std::basic_string::_Rep access:public +std::basic_string::_Rep::_S_max_size cpp_src/basic_string.tcc /^ _Rep::_S_max_size = (((npos - sizeof(_Rep_base))\/sizeof(_CharT)) - 1) \/ 4;$/;" m class:std::basic_string::_Rep file: +std::basic_string::_Rep::_S_terminal cpp_src/basic_string.h /^ static const _CharT _S_terminal;$/;" m struct:std::basic_string::_Rep access:public +std::basic_string::_Rep::_S_terminal cpp_src/basic_string.tcc /^ _Rep::_S_terminal = _CharT();$/;" m class:std::basic_string::_Rep file: +std::basic_string::_Rep_base cpp_src/basic_string.h /^ struct _Rep_base$/;" s class:std::basic_string access:private +std::basic_string::_Rep_base::_M_capacity cpp_src/basic_string.h /^ size_type _M_capacity;$/;" m struct:std::basic_string::_Rep_base access:public +std::basic_string::_Rep_base::_M_length cpp_src/basic_string.h /^ size_type _M_length;$/;" m struct:std::basic_string::_Rep_base access:public +std::basic_string::_Rep_base::_M_refcount cpp_src/basic_string.h /^ _Atomic_word _M_refcount;$/;" m struct:std::basic_string::_Rep_base access:public +std::basic_string::_S_construct cpp_src/basic_string.h /^ _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a,$/;" p class:std::basic_string access:private signature:(_InIterator __beg, _InIterator __end, const _Alloc& __a, input_iterator_tag) +std::basic_string::_S_construct cpp_src/basic_string.h /^ _S_construct(_FwdIterator __beg, _FwdIterator __end, const _Alloc& __a,$/;" p class:std::basic_string access:private signature:(_FwdIterator __beg, _FwdIterator __end, const _Alloc& __a, forward_iterator_tag) +std::basic_string::_S_construct cpp_src/basic_string.h /^ _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a)$/;" f class:std::basic_string access:private signature:(_InIterator __beg, _InIterator __end, const _Alloc& __a) +std::basic_string::_S_construct cpp_src/basic_string.h /^ _S_construct(size_type __req, _CharT __c, const _Alloc& __a);$/;" p class:std::basic_string access:private signature:(size_type __req, _CharT __c, const _Alloc& __a) +std::basic_string::_S_construct cpp_src/basic_string.tcc /^ _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a,$/;" f class:std::basic_string signature:(_InIterator __beg, _InIterator __end, const _Alloc& __a, forward_iterator_tag) +std::basic_string::_S_construct cpp_src/basic_string.tcc /^ _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a,$/;" f class:std::basic_string signature:(_InIterator __beg, _InIterator __end, const _Alloc& __a, input_iterator_tag) +std::basic_string::_S_construct cpp_src/basic_string.tcc /^ _S_construct(size_type __n, _CharT __c, const _Alloc& __a)$/;" f class:std::basic_string signature:(size_type __n, _CharT __c, const _Alloc& __a) +std::basic_string::_S_construct_aux cpp_src/basic_string.h /^ _S_construct_aux(_InIterator __beg, _InIterator __end,$/;" f class:std::basic_string access:private signature:(_InIterator __beg, _InIterator __end, const _Alloc& __a, __false_type) +std::basic_string::_S_construct_aux cpp_src/basic_string.h /^ _S_construct_aux(_InIterator __beg, _InIterator __end,$/;" f class:std::basic_string access:private signature:(_InIterator __beg, _InIterator __end, const _Alloc& __a, __true_type) +std::basic_string::_S_copy_chars cpp_src/basic_string.h /^ _S_copy_chars(_CharT* __p, _Iterator __k1, _Iterator __k2)$/;" f class:std::basic_string access:private signature:(_CharT* __p, _Iterator __k1, _Iterator __k2) +std::basic_string::_S_copy_chars cpp_src/basic_string.h /^ _S_copy_chars(_CharT* __p, _CharT* __k1, _CharT* __k2)$/;" f class:std::basic_string access:private signature:(_CharT* __p, _CharT* __k1, _CharT* __k2) +std::basic_string::_S_copy_chars cpp_src/basic_string.h /^ _S_copy_chars(_CharT* __p, const _CharT* __k1, const _CharT* __k2)$/;" f class:std::basic_string access:private signature:(_CharT* __p, const _CharT* __k1, const _CharT* __k2) +std::basic_string::_S_copy_chars cpp_src/basic_string.h /^ _S_copy_chars(_CharT* __p, const_iterator __k1, const_iterator __k2)$/;" f class:std::basic_string access:private signature:(_CharT* __p, const_iterator __k1, const_iterator __k2) +std::basic_string::_S_copy_chars cpp_src/basic_string.h /^ _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2)$/;" f class:std::basic_string access:private signature:(_CharT* __p, iterator __k1, iterator __k2) +std::basic_string::_S_empty_rep cpp_src/basic_string.h /^ _S_empty_rep()$/;" f class:std::basic_string access:private signature:() +std::basic_string::allocator_type cpp_src/basic_string.h /^ typedef _Alloc allocator_type;$/;" t class:std::basic_string access:public +std::basic_string::append cpp_src/basic_string.h /^ append(_InputIterator __first, _InputIterator __last)$/;" f class:std::basic_string access:public signature:(_InputIterator __first, _InputIterator __last) +std::basic_string::append cpp_src/basic_string.h /^ append(const _CharT* __s)$/;" f class:std::basic_string access:public signature:(const _CharT* __s) +std::basic_string::append cpp_src/basic_string.h /^ append(const _CharT* __s, size_type __n);$/;" p class:std::basic_string access:public signature:(const _CharT* __s, size_type __n) +std::basic_string::append cpp_src/basic_string.h /^ append(const basic_string& __str);$/;" p class:std::basic_string access:public signature:(const basic_string& __str) +std::basic_string::append cpp_src/basic_string.h /^ append(const basic_string& __str, size_type __pos, size_type __n);$/;" p class:std::basic_string access:public signature:(const basic_string& __str, size_type __pos, size_type __n) +std::basic_string::append cpp_src/basic_string.h /^ append(size_type __n, _CharT __c);$/;" p class:std::basic_string access:public signature:(size_type __n, _CharT __c) +std::basic_string::append cpp_src/basic_string.tcc /^ append(const _CharT* __s, size_type __n)$/;" f class:std::basic_string signature:(const _CharT* __s, size_type __n) +std::basic_string::append cpp_src/basic_string.tcc /^ append(const basic_string& __str)$/;" f class:std::basic_string signature:(const basic_string& __str) +std::basic_string::append cpp_src/basic_string.tcc /^ append(const basic_string& __str, size_type __pos, size_type __n)$/;" f class:std::basic_string signature:(const basic_string& __str, size_type __pos, size_type __n) +std::basic_string::append cpp_src/basic_string.tcc /^ append(size_type __n, _CharT __c)$/;" f class:std::basic_string signature:(size_type __n, _CharT __c) +std::basic_string::assign cpp_src/basic_string.h /^ assign(_InputIterator __first, _InputIterator __last)$/;" f class:std::basic_string access:public signature:(_InputIterator __first, _InputIterator __last) +std::basic_string::assign cpp_src/basic_string.h /^ assign(const _CharT* __s)$/;" f class:std::basic_string access:public signature:(const _CharT* __s) +std::basic_string::assign cpp_src/basic_string.h /^ assign(const _CharT* __s, size_type __n);$/;" p class:std::basic_string access:public signature:(const _CharT* __s, size_type __n) +std::basic_string::assign cpp_src/basic_string.h /^ assign(const basic_string& __str);$/;" p class:std::basic_string access:public signature:(const basic_string& __str) +std::basic_string::assign cpp_src/basic_string.h /^ assign(const basic_string& __str, size_type __pos, size_type __n)$/;" f class:std::basic_string access:public signature:(const basic_string& __str, size_type __pos, size_type __n) +std::basic_string::assign cpp_src/basic_string.h /^ assign(size_type __n, _CharT __c)$/;" f class:std::basic_string access:public signature:(size_type __n, _CharT __c) +std::basic_string::assign cpp_src/basic_string.tcc /^ assign(const _CharT* __s, size_type __n)$/;" f class:std::basic_string signature:(const _CharT* __s, size_type __n) +std::basic_string::assign cpp_src/basic_string.tcc /^ assign(const basic_string& __str)$/;" f class:std::basic_string signature:(const basic_string& __str) +std::basic_string::at cpp_src/basic_string.h /^ at(size_type __n) const$/;" f class:std::basic_string access:public signature:(size_type __n) const +std::basic_string::at cpp_src/basic_string.h /^ at(size_type __n)$/;" f class:std::basic_string access:public signature:(size_type __n) +std::basic_string::basic_string cpp_src/basic_string.h /^ basic_string(_InputIterator __beg, _InputIterator __end,$/;" p class:std::basic_string access:public signature:(_InputIterator __beg, _InputIterator __end, const _Alloc& __a = _Alloc()) +std::basic_string::basic_string cpp_src/basic_string.h /^ basic_string();$/;" p class:std::basic_string access:public signature:() +std::basic_string::basic_string cpp_src/basic_string.h /^ basic_string(const _Alloc& __a);$/;" p class:std::basic_string access:public signature:(const _Alloc& __a) +std::basic_string::basic_string cpp_src/basic_string.h /^ basic_string(const _CharT* __s, const _Alloc& __a = _Alloc());$/;" p class:std::basic_string access:public signature:(const _CharT* __s, const _Alloc& __a = _Alloc()) +std::basic_string::basic_string cpp_src/basic_string.h /^ basic_string(const _CharT* __s, size_type __n,$/;" p class:std::basic_string access:public signature:(const _CharT* __s, size_type __n, const _Alloc& __a = _Alloc()) +std::basic_string::basic_string cpp_src/basic_string.h /^ basic_string(const basic_string& __str);$/;" p class:std::basic_string access:public signature:(const basic_string& __str) +std::basic_string::basic_string cpp_src/basic_string.h /^ basic_string(const basic_string& __str, size_type __pos,$/;" p class:std::basic_string access:public signature:(const basic_string& __str, size_type __pos, size_type __n = npos) +std::basic_string::basic_string cpp_src/basic_string.h /^ basic_string(const basic_string& __str, size_type __pos,$/;" p class:std::basic_string access:public signature:(const basic_string& __str, size_type __pos, size_type __n, const _Alloc& __a) +std::basic_string::basic_string cpp_src/basic_string.h /^ basic_string(size_type __n, _CharT __c, const _Alloc& __a = _Alloc());$/;" p class:std::basic_string access:public signature:(size_type __n, _CharT __c, const _Alloc& __a = _Alloc()) +std::basic_string::basic_string cpp_src/basic_string.h /^ basic_string()$/;" f class:std::basic_string signature:() +std::basic_string::basic_string cpp_src/basic_string.tcc /^ basic_string(_InputIterator __beg, _InputIterator __end, const _Alloc& __a)$/;" f class:std::basic_string signature:(_InputIterator __beg, _InputIterator __end, const _Alloc& __a) +std::basic_string::basic_string cpp_src/basic_string.tcc /^ basic_string(const _Alloc& __a)$/;" f class:std::basic_string signature:(const _Alloc& __a) +std::basic_string::basic_string cpp_src/basic_string.tcc /^ basic_string(const _CharT* __s, const _Alloc& __a)$/;" f class:std::basic_string signature:(const _CharT* __s, const _Alloc& __a) +std::basic_string::basic_string cpp_src/basic_string.tcc /^ basic_string(const _CharT* __s, size_type __n, const _Alloc& __a)$/;" f class:std::basic_string signature:(const _CharT* __s, size_type __n, const _Alloc& __a) +std::basic_string::basic_string cpp_src/basic_string.tcc /^ basic_string(const basic_string& __str)$/;" f class:std::basic_string signature:(const basic_string& __str) +std::basic_string::basic_string cpp_src/basic_string.tcc /^ basic_string(const basic_string& __str, size_type __pos, size_type __n)$/;" f class:std::basic_string signature:(const basic_string& __str, size_type __pos, size_type __n) +std::basic_string::basic_string cpp_src/basic_string.tcc /^ basic_string(const basic_string& __str, size_type __pos,$/;" f class:std::basic_string signature:(const basic_string& __str, size_type __pos, size_type __n, const _Alloc& __a) +std::basic_string::basic_string cpp_src/basic_string.tcc /^ basic_string(size_type __n, _CharT __c, const _Alloc& __a)$/;" f class:std::basic_string signature:(size_type __n, _CharT __c, const _Alloc& __a) +std::basic_string::begin cpp_src/basic_string.h /^ begin() const$/;" f class:std::basic_string access:public signature:() const +std::basic_string::begin cpp_src/basic_string.h /^ begin()$/;" f class:std::basic_string access:public signature:() +std::basic_string::c_str cpp_src/basic_string.h /^ c_str() const$/;" f class:std::basic_string access:public signature:() const +std::basic_string::capacity cpp_src/basic_string.h /^ capacity() const$/;" f class:std::basic_string access:public signature:() const +std::basic_string::clear cpp_src/basic_string.h /^ clear()$/;" f class:std::basic_string access:public signature:() +std::basic_string::compare cpp_src/basic_string.h /^ compare(const _CharT* __s) const;$/;" p class:std::basic_string access:public signature:(const _CharT* __s) const +std::basic_string::compare cpp_src/basic_string.h /^ compare(const basic_string& __str) const$/;" f class:std::basic_string access:public signature:(const basic_string& __str) const +std::basic_string::compare cpp_src/basic_string.h /^ compare(size_type __pos, size_type __n, const basic_string& __str) const;$/;" p class:std::basic_string access:public signature:(size_type __pos, size_type __n, const basic_string& __str) const +std::basic_string::compare cpp_src/basic_string.h /^ compare(size_type __pos, size_type __n1, const _CharT* __s) const;$/;" p class:std::basic_string access:public signature:(size_type __pos, size_type __n1, const _CharT* __s) const +std::basic_string::compare cpp_src/basic_string.h /^ compare(size_type __pos, size_type __n1, const _CharT* __s,$/;" p class:std::basic_string access:public signature:(size_type __pos, size_type __n1, const _CharT* __s, size_type __n2) const +std::basic_string::compare cpp_src/basic_string.h /^ compare(size_type __pos1, size_type __n1, const basic_string& __str,$/;" p class:std::basic_string access:public signature:(size_type __pos1, size_type __n1, const basic_string& __str, size_type __pos2, size_type __n2) const +std::basic_string::compare cpp_src/basic_string.tcc /^ compare(const _CharT* __s) const$/;" f class:std::basic_string signature:(const _CharT* __s) const +std::basic_string::compare cpp_src/basic_string.tcc /^ compare(size_type __pos, size_type __n, const basic_string& __str) const$/;" f class:std::basic_string signature:(size_type __pos, size_type __n, const basic_string& __str) const +std::basic_string::compare cpp_src/basic_string.tcc /^ compare(size_type __pos, size_type __n1, const _CharT* __s) const$/;" f class:std::basic_string signature:(size_type __pos, size_type __n1, const _CharT* __s) const +std::basic_string::compare cpp_src/basic_string.tcc /^ compare(size_type __pos, size_type __n1, const _CharT* __s,$/;" f class:std::basic_string signature:(size_type __pos, size_type __n1, const _CharT* __s, size_type __n2) const +std::basic_string::compare cpp_src/basic_string.tcc /^ compare(size_type __pos1, size_type __n1, const basic_string& __str,$/;" f class:std::basic_string signature:(size_type __pos1, size_type __n1, const basic_string& __str, size_type __pos2, size_type __n2) const +std::basic_string::const_iterator cpp_src/basic_string.h /^ const_iterator;$/;" t class:std::basic_string access:public +std::basic_string::const_pointer cpp_src/basic_string.h /^ typedef typename _CharT_alloc_type::const_pointer const_pointer;$/;" t class:std::basic_string access:public +std::basic_string::const_reference cpp_src/basic_string.h /^ typedef typename _CharT_alloc_type::const_reference const_reference;$/;" t class:std::basic_string access:public +std::basic_string::const_reverse_iterator cpp_src/basic_string.h /^ typedef std::reverse_iterator const_reverse_iterator;$/;" t class:std::basic_string access:public +std::basic_string::copy cpp_src/basic_string.h /^ copy(_CharT* __s, size_type __n, size_type __pos = 0) const;$/;" p class:std::basic_string access:public signature:(_CharT* __s, size_type __n, size_type __pos = 0) const +std::basic_string::copy cpp_src/basic_string.tcc /^ copy(_CharT* __s, size_type __n, size_type __pos) const$/;" f class:std::basic_string signature:(_CharT* __s, size_type __n, size_type __pos) const +std::basic_string::data cpp_src/basic_string.h /^ data() const$/;" f class:std::basic_string access:public signature:() const +std::basic_string::difference_type cpp_src/basic_string.h /^ typedef typename _CharT_alloc_type::difference_type difference_type;$/;" t class:std::basic_string access:public +std::basic_string::empty cpp_src/basic_string.h /^ empty() const$/;" f class:std::basic_string access:public signature:() const +std::basic_string::end cpp_src/basic_string.h /^ end() const$/;" f class:std::basic_string access:public signature:() const +std::basic_string::end cpp_src/basic_string.h /^ end()$/;" f class:std::basic_string access:public signature:() +std::basic_string::erase cpp_src/basic_string.h /^ erase(iterator __first, iterator __last)$/;" f class:std::basic_string access:public signature:(iterator __first, iterator __last) +std::basic_string::erase cpp_src/basic_string.h /^ erase(iterator __position)$/;" f class:std::basic_string access:public signature:(iterator __position) +std::basic_string::erase cpp_src/basic_string.h /^ erase(size_type __pos = 0, size_type __n = npos)$/;" f class:std::basic_string access:public signature:(size_type __pos = 0, size_type __n = npos) +std::basic_string::find cpp_src/basic_string.h /^ find(_CharT __c, size_type __pos = 0) const;$/;" p class:std::basic_string access:public signature:(_CharT __c, size_type __pos = 0) const +std::basic_string::find cpp_src/basic_string.h /^ find(const _CharT* __s, size_type __pos = 0) const$/;" f class:std::basic_string access:public signature:(const _CharT* __s, size_type __pos = 0) const +std::basic_string::find cpp_src/basic_string.h /^ find(const _CharT* __s, size_type __pos, size_type __n) const;$/;" p class:std::basic_string access:public signature:(const _CharT* __s, size_type __pos, size_type __n) const +std::basic_string::find cpp_src/basic_string.h /^ find(const basic_string& __str, size_type __pos = 0) const$/;" f class:std::basic_string access:public signature:(const basic_string& __str, size_type __pos = 0) const +std::basic_string::find cpp_src/basic_string.tcc /^ find(_CharT __c, size_type __pos) const$/;" f class:std::basic_string signature:(_CharT __c, size_type __pos) const +std::basic_string::find cpp_src/basic_string.tcc /^ find(const _CharT* __s, size_type __pos, size_type __n) const$/;" f class:std::basic_string signature:(const _CharT* __s, size_type __pos, size_type __n) const +std::basic_string::find_first_not_of cpp_src/basic_string.h /^ find_first_not_of(_CharT __c, size_type __pos = 0) const;$/;" p class:std::basic_string access:public signature:(_CharT __c, size_type __pos = 0) const +std::basic_string::find_first_not_of cpp_src/basic_string.h /^ find_first_not_of(const _CharT* __s, size_type __pos = 0) const$/;" f class:std::basic_string access:public signature:(const _CharT* __s, size_type __pos = 0) const +std::basic_string::find_first_not_of cpp_src/basic_string.h /^ find_first_not_of(const _CharT* __s, size_type __pos,$/;" p class:std::basic_string access:public signature:(const _CharT* __s, size_type __pos, size_type __n) const +std::basic_string::find_first_not_of cpp_src/basic_string.h /^ find_first_not_of(const basic_string& __str, size_type __pos = 0) const$/;" f class:std::basic_string access:public signature:(const basic_string& __str, size_type __pos = 0) const +std::basic_string::find_first_not_of cpp_src/basic_string.tcc /^ find_first_not_of(_CharT __c, size_type __pos) const$/;" f class:std::basic_string signature:(_CharT __c, size_type __pos) const +std::basic_string::find_first_not_of cpp_src/basic_string.tcc /^ find_first_not_of(const _CharT* __s, size_type __pos, size_type __n) const$/;" f class:std::basic_string signature:(const _CharT* __s, size_type __pos, size_type __n) const +std::basic_string::find_first_of cpp_src/basic_string.h /^ find_first_of(_CharT __c, size_type __pos = 0) const$/;" f class:std::basic_string access:public signature:(_CharT __c, size_type __pos = 0) const +std::basic_string::find_first_of cpp_src/basic_string.h /^ find_first_of(const _CharT* __s, size_type __pos = 0) const$/;" f class:std::basic_string access:public signature:(const _CharT* __s, size_type __pos = 0) const +std::basic_string::find_first_of cpp_src/basic_string.h /^ find_first_of(const _CharT* __s, size_type __pos, size_type __n) const;$/;" p class:std::basic_string access:public signature:(const _CharT* __s, size_type __pos, size_type __n) const +std::basic_string::find_first_of cpp_src/basic_string.h /^ find_first_of(const basic_string& __str, size_type __pos = 0) const$/;" f class:std::basic_string access:public signature:(const basic_string& __str, size_type __pos = 0) const +std::basic_string::find_first_of cpp_src/basic_string.tcc /^ find_first_of(const _CharT* __s, size_type __pos, size_type __n) const$/;" f class:std::basic_string signature:(const _CharT* __s, size_type __pos, size_type __n) const +std::basic_string::find_last_not_of cpp_src/basic_string.h /^ find_last_not_of(_CharT __c, size_type __pos = npos) const;$/;" p class:std::basic_string access:public signature:(_CharT __c, size_type __pos = npos) const +std::basic_string::find_last_not_of cpp_src/basic_string.h /^ find_last_not_of(const _CharT* __s, size_type __pos = npos) const$/;" f class:std::basic_string access:public signature:(const _CharT* __s, size_type __pos = npos) const +std::basic_string::find_last_not_of cpp_src/basic_string.h /^ find_last_not_of(const _CharT* __s, size_type __pos,$/;" p class:std::basic_string access:public signature:(const _CharT* __s, size_type __pos, size_type __n) const +std::basic_string::find_last_not_of cpp_src/basic_string.h /^ find_last_not_of(const basic_string& __str, size_type __pos = npos) const$/;" f class:std::basic_string access:public signature:(const basic_string& __str, size_type __pos = npos) const +std::basic_string::find_last_not_of cpp_src/basic_string.tcc /^ find_last_not_of(_CharT __c, size_type __pos) const$/;" f class:std::basic_string signature:(_CharT __c, size_type __pos) const +std::basic_string::find_last_not_of cpp_src/basic_string.tcc /^ find_last_not_of(const _CharT* __s, size_type __pos, size_type __n) const$/;" f class:std::basic_string signature:(const _CharT* __s, size_type __pos, size_type __n) const +std::basic_string::find_last_of cpp_src/basic_string.h /^ find_last_of(_CharT __c, size_type __pos = npos) const$/;" f class:std::basic_string access:public signature:(_CharT __c, size_type __pos = npos) const +std::basic_string::find_last_of cpp_src/basic_string.h /^ find_last_of(const _CharT* __s, size_type __pos = npos) const$/;" f class:std::basic_string access:public signature:(const _CharT* __s, size_type __pos = npos) const +std::basic_string::find_last_of cpp_src/basic_string.h /^ find_last_of(const _CharT* __s, size_type __pos, size_type __n) const;$/;" p class:std::basic_string access:public signature:(const _CharT* __s, size_type __pos, size_type __n) const +std::basic_string::find_last_of cpp_src/basic_string.h /^ find_last_of(const basic_string& __str, size_type __pos = npos) const$/;" f class:std::basic_string access:public signature:(const basic_string& __str, size_type __pos = npos) const +std::basic_string::find_last_of cpp_src/basic_string.tcc /^ find_last_of(const _CharT* __s, size_type __pos, size_type __n) const$/;" f class:std::basic_string signature:(const _CharT* __s, size_type __pos, size_type __n) const +std::basic_string::get_allocator cpp_src/basic_string.h /^ get_allocator() const$/;" f class:std::basic_string access:public signature:() const +std::basic_string::insert cpp_src/basic_string.h /^ insert(iterator __p, _InputIterator __beg, _InputIterator __end)$/;" f class:std::basic_string access:public signature:(iterator __p, _InputIterator __beg, _InputIterator __end) +std::basic_string::insert cpp_src/basic_string.h /^ insert(iterator __p, _CharT __c)$/;" f class:std::basic_string access:public signature:(iterator __p, _CharT __c) +std::basic_string::insert cpp_src/basic_string.h /^ insert(iterator __p, size_type __n, _CharT __c)$/;" f class:std::basic_string access:public signature:(iterator __p, size_type __n, _CharT __c) +std::basic_string::insert cpp_src/basic_string.h /^ insert(size_type __pos, const _CharT* __s)$/;" f class:std::basic_string access:public signature:(size_type __pos, const _CharT* __s) +std::basic_string::insert cpp_src/basic_string.h /^ insert(size_type __pos, const _CharT* __s, size_type __n);$/;" p class:std::basic_string access:public signature:(size_type __pos, const _CharT* __s, size_type __n) +std::basic_string::insert cpp_src/basic_string.h /^ insert(size_type __pos, size_type __n, _CharT __c)$/;" f class:std::basic_string access:public signature:(size_type __pos, size_type __n, _CharT __c) +std::basic_string::insert cpp_src/basic_string.h /^ insert(size_type __pos1, const basic_string& __str)$/;" f class:std::basic_string access:public signature:(size_type __pos1, const basic_string& __str) +std::basic_string::insert cpp_src/basic_string.h /^ insert(size_type __pos1, const basic_string& __str,$/;" f class:std::basic_string access:public signature:(size_type __pos1, const basic_string& __str, size_type __pos2, size_type __n) +std::basic_string::insert cpp_src/basic_string.tcc /^ insert(size_type __pos, const _CharT* __s, size_type __n)$/;" f class:std::basic_string signature:(size_type __pos, const _CharT* __s, size_type __n) +std::basic_string::iterator cpp_src/basic_string.h /^ typedef __gnu_cxx::__normal_iterator iterator;$/;" t class:std::basic_string access:public +std::basic_string::length cpp_src/basic_string.h /^ length() const$/;" f class:std::basic_string access:public signature:() const +std::basic_string::max_size cpp_src/basic_string.h /^ max_size() const$/;" f class:std::basic_string access:public signature:() const +std::basic_string::npos cpp_src/basic_string.h /^ static const size_type npos = static_cast(-1);$/;" m class:std::basic_string access:public +std::basic_string::npos cpp_src/basic_string.tcc /^ basic_string<_CharT, _Traits, _Alloc>::npos;$/;" m class:std::basic_string file: +std::basic_string::operator += cpp_src/basic_string.h /^ operator+=(_CharT __c)$/;" f class:std::basic_string access:public signature:(_CharT __c) +std::basic_string::operator += cpp_src/basic_string.h /^ operator+=(const _CharT* __s)$/;" f class:std::basic_string access:public signature:(const _CharT* __s) +std::basic_string::operator += cpp_src/basic_string.h /^ operator+=(const basic_string& __str)$/;" f class:std::basic_string access:public signature:(const basic_string& __str) +std::basic_string::operator = cpp_src/basic_string.h /^ operator=(_CharT __c) $/;" f class:std::basic_string access:public signature:(_CharT __c) +std::basic_string::operator = cpp_src/basic_string.h /^ operator=(const _CharT* __s) $/;" f class:std::basic_string access:public signature:(const _CharT* __s) +std::basic_string::operator = cpp_src/basic_string.h /^ operator=(const basic_string& __str) $/;" f class:std::basic_string access:public signature:(const basic_string& __str) +std::basic_string::operator [] cpp_src/basic_string.h /^ operator[] (size_type __pos) const$/;" f class:std::basic_string access:public signature:(size_type __pos) const +std::basic_string::operator [] cpp_src/basic_string.h /^ operator[](size_type __pos)$/;" f class:std::basic_string access:public signature:(size_type __pos) +std::basic_string::pointer cpp_src/basic_string.h /^ typedef typename _CharT_alloc_type::pointer pointer;$/;" t class:std::basic_string access:public +std::basic_string::push_back cpp_src/basic_string.h /^ push_back(_CharT __c)$/;" f class:std::basic_string access:public signature:(_CharT __c) +std::basic_string::rbegin cpp_src/basic_string.h /^ rbegin() const$/;" f class:std::basic_string access:public signature:() const +std::basic_string::rbegin cpp_src/basic_string.h /^ rbegin()$/;" f class:std::basic_string access:public signature:() +std::basic_string::reference cpp_src/basic_string.h /^ typedef typename _CharT_alloc_type::reference reference;$/;" t class:std::basic_string access:public +std::basic_string::rend cpp_src/basic_string.h /^ rend() const$/;" f class:std::basic_string access:public signature:() const +std::basic_string::rend cpp_src/basic_string.h /^ rend()$/;" f class:std::basic_string access:public signature:() +std::basic_string::replace cpp_src/basic_string.h /^ replace(iterator __i1, iterator __i2,$/;" f class:std::basic_string access:public signature:(iterator __i1, iterator __i2, _InputIterator __k1, _InputIterator __k2) +std::basic_string::replace cpp_src/basic_string.h /^ replace(iterator __i1, iterator __i2, _CharT* __k1, _CharT* __k2)$/;" f class:std::basic_string access:public signature:(iterator __i1, iterator __i2, _CharT* __k1, _CharT* __k2) +std::basic_string::replace cpp_src/basic_string.h /^ replace(iterator __i1, iterator __i2, const _CharT* __s)$/;" f class:std::basic_string access:public signature:(iterator __i1, iterator __i2, const _CharT* __s) +std::basic_string::replace cpp_src/basic_string.h /^ replace(iterator __i1, iterator __i2, const _CharT* __s, size_type __n)$/;" f class:std::basic_string access:public signature:(iterator __i1, iterator __i2, const _CharT* __s, size_type __n) +std::basic_string::replace cpp_src/basic_string.h /^ replace(iterator __i1, iterator __i2, const basic_string& __str)$/;" f class:std::basic_string access:public signature:(iterator __i1, iterator __i2, const basic_string& __str) +std::basic_string::replace cpp_src/basic_string.h /^ replace(iterator __i1, iterator __i2, iterator __k1, iterator __k2)$/;" f class:std::basic_string access:public signature:(iterator __i1, iterator __i2, iterator __k1, iterator __k2) +std::basic_string::replace cpp_src/basic_string.h /^ replace(iterator __i1, iterator __i2, size_type __n, _CharT __c)$/;" f class:std::basic_string access:public signature:(iterator __i1, iterator __i2, size_type __n, _CharT __c) +std::basic_string::replace cpp_src/basic_string.h /^ replace(iterator __i1, iterator __i2,$/;" f class:std::basic_string access:public signature:(iterator __i1, iterator __i2, const _CharT* __k1, const _CharT* __k2) +std::basic_string::replace cpp_src/basic_string.h /^ replace(iterator __i1, iterator __i2,$/;" f class:std::basic_string access:public signature:(iterator __i1, iterator __i2, const_iterator __k1, const_iterator __k2) +std::basic_string::replace cpp_src/basic_string.h /^ replace(size_type __pos, size_type __n, const basic_string& __str)$/;" f class:std::basic_string access:public signature:(size_type __pos, size_type __n, const basic_string& __str) +std::basic_string::replace cpp_src/basic_string.h /^ replace(size_type __pos, size_type __n1, const _CharT* __s)$/;" f class:std::basic_string access:public signature:(size_type __pos, size_type __n1, const _CharT* __s) +std::basic_string::replace cpp_src/basic_string.h /^ replace(size_type __pos, size_type __n1, const _CharT* __s,$/;" p class:std::basic_string access:public signature:(size_type __pos, size_type __n1, const _CharT* __s, size_type __n2) +std::basic_string::replace cpp_src/basic_string.h /^ replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c)$/;" f class:std::basic_string access:public signature:(size_type __pos, size_type __n1, size_type __n2, _CharT __c) +std::basic_string::replace cpp_src/basic_string.h /^ replace(size_type __pos1, size_type __n1, const basic_string& __str,$/;" f class:std::basic_string access:public signature:(size_type __pos1, size_type __n1, const basic_string& __str, size_type __pos2, size_type __n2) +std::basic_string::replace cpp_src/basic_string.tcc /^ replace(size_type __pos, size_type __n1, const _CharT* __s,$/;" f class:std::basic_string signature:(size_type __pos, size_type __n1, const _CharT* __s, size_type __n2) +std::basic_string::reserve cpp_src/basic_string.h /^ reserve(size_type __res_arg = 0);$/;" p class:std::basic_string access:public signature:(size_type __res_arg = 0) +std::basic_string::reserve cpp_src/basic_string.tcc /^ reserve(size_type __res)$/;" f class:std::basic_string signature:(size_type __res) +std::basic_string::resize cpp_src/basic_string.h /^ resize(size_type __n)$/;" f class:std::basic_string access:public signature:(size_type __n) +std::basic_string::resize cpp_src/basic_string.h /^ resize(size_type __n, _CharT __c);$/;" p class:std::basic_string access:public signature:(size_type __n, _CharT __c) +std::basic_string::resize cpp_src/basic_string.tcc /^ resize(size_type __n, _CharT __c)$/;" f class:std::basic_string signature:(size_type __n, _CharT __c) +std::basic_string::reverse_iterator cpp_src/basic_string.h /^ typedef std::reverse_iterator reverse_iterator;$/;" t class:std::basic_string access:public +std::basic_string::rfind cpp_src/basic_string.h /^ rfind(_CharT __c, size_type __pos = npos) const;$/;" p class:std::basic_string access:public signature:(_CharT __c, size_type __pos = npos) const +std::basic_string::rfind cpp_src/basic_string.h /^ rfind(const _CharT* __s, size_type __pos = npos) const$/;" f class:std::basic_string access:public signature:(const _CharT* __s, size_type __pos = npos) const +std::basic_string::rfind cpp_src/basic_string.h /^ rfind(const _CharT* __s, size_type __pos, size_type __n) const;$/;" p class:std::basic_string access:public signature:(const _CharT* __s, size_type __pos, size_type __n) const +std::basic_string::rfind cpp_src/basic_string.h /^ rfind(const basic_string& __str, size_type __pos = npos) const$/;" f class:std::basic_string access:public signature:(const basic_string& __str, size_type __pos = npos) const +std::basic_string::rfind cpp_src/basic_string.tcc /^ rfind(_CharT __c, size_type __pos) const$/;" f class:std::basic_string signature:(_CharT __c, size_type __pos) const +std::basic_string::rfind cpp_src/basic_string.tcc /^ rfind(const _CharT* __s, size_type __pos, size_type __n) const$/;" f class:std::basic_string signature:(const _CharT* __s, size_type __pos, size_type __n) const +std::basic_string::size cpp_src/basic_string.h /^ size() const$/;" f class:std::basic_string access:public signature:() const +std::basic_string::size_type cpp_src/basic_string.h /^ typedef typename _CharT_alloc_type::size_type size_type;$/;" t class:std::basic_string access:public +std::basic_string::substr cpp_src/basic_string.h /^ substr(size_type __pos = 0, size_type __n = npos) const$/;" f class:std::basic_string access:public signature:(size_type __pos = 0, size_type __n = npos) const +std::basic_string::swap cpp_src/basic_string.h /^ swap(basic_string& __s);$/;" p class:std::basic_string access:public signature:(basic_string& __s) +std::basic_string::swap cpp_src/basic_string.tcc /^ swap(basic_string& __s)$/;" f class:std::basic_string signature:(basic_string& __s) +std::basic_string::traits_type cpp_src/basic_string.h /^ typedef _Traits traits_type;$/;" t class:std::basic_string access:public +std::basic_string::value_type cpp_src/basic_string.h /^ typedef typename _Traits::char_type value_type;$/;" t class:std::basic_string access:public +std::basic_string::~basic_string cpp_src/basic_string.h /^ ~basic_string()$/;" f class:std::basic_string access:public signature:() +std::basic_stringbuf cpp_src/sstream /^ class basic_stringbuf : public basic_streambuf<_CharT, _Traits>$/;" c namespace:std file: inherits:basic_streambuf +std::basic_stringbuf::_M_mode cpp_src/sstream /^ ios_base::openmode _M_mode;$/;" m class:std::basic_stringbuf file: access:protected +std::basic_stringbuf::_M_string cpp_src/sstream /^ __string_type _M_string;$/;" m class:std::basic_stringbuf file: access:protected +std::basic_stringbuf::_M_stringbuf_init cpp_src/sstream /^ _M_stringbuf_init(ios_base::openmode __mode)$/;" f class:std::basic_stringbuf access:protected signature:(ios_base::openmode __mode) +std::basic_stringbuf::_M_sync cpp_src/sstream /^ _M_sync(char_type* __base, __size_type __i, __size_type __o);$/;" p class:std::basic_stringbuf file: access:protected signature:(char_type* __base, __size_type __i, __size_type __o) +std::basic_stringbuf::_M_sync cpp_src/sstream.tcc /^ _M_sync(char_type* __base, __size_type __i, __size_type __o)$/;" f class:std::basic_stringbuf signature:(char_type* __base, __size_type __i, __size_type __o) +std::basic_stringbuf::_M_update_egptr cpp_src/sstream /^ _M_update_egptr()$/;" f class:std::basic_stringbuf access:protected signature:() +std::basic_stringbuf::__size_type cpp_src/sstream /^ typedef typename __string_type::size_type __size_type;$/;" t class:std::basic_stringbuf file: access:public +std::basic_stringbuf::__streambuf_type cpp_src/sstream /^ typedef basic_streambuf __streambuf_type;$/;" t class:std::basic_stringbuf file: access:public +std::basic_stringbuf::__string_type cpp_src/sstream /^ typedef basic_string __string_type;$/;" t class:std::basic_stringbuf file: access:public +std::basic_stringbuf::allocator_type cpp_src/sstream /^ typedef _Alloc allocator_type;$/;" t class:std::basic_stringbuf file: access:public +std::basic_stringbuf::basic_stringbuf cpp_src/sstream /^ basic_stringbuf(const __string_type& __str,$/;" f class:std::basic_stringbuf access:public signature:(const __string_type& __str, ios_base::openmode __mode = ios_base::in | ios_base::out) +std::basic_stringbuf::basic_stringbuf cpp_src/sstream /^ basic_stringbuf(ios_base::openmode __mode = ios_base::in | ios_base::out)$/;" f class:std::basic_stringbuf access:public signature:(ios_base::openmode __mode = ios_base::in | ios_base::out) +std::basic_stringbuf::char_type cpp_src/sstream /^ typedef _CharT char_type;$/;" t class:std::basic_stringbuf file: access:public +std::basic_stringbuf::int_type cpp_src/sstream /^ typedef typename traits_type::int_type int_type;$/;" t class:std::basic_stringbuf file: access:public +std::basic_stringbuf::off_type cpp_src/sstream /^ typedef typename traits_type::off_type off_type;$/;" t class:std::basic_stringbuf file: access:public +std::basic_stringbuf::overflow cpp_src/sstream /^ overflow(int_type __c = traits_type::eof());$/;" p class:std::basic_stringbuf file: access:protected signature:(int_type __c = traits_type::eof()) +std::basic_stringbuf::overflow cpp_src/sstream.tcc /^ overflow(int_type __c)$/;" f class:std::basic_stringbuf signature:(int_type __c) +std::basic_stringbuf::pbackfail cpp_src/sstream /^ pbackfail(int_type __c = traits_type::eof());$/;" p class:std::basic_stringbuf file: access:protected signature:(int_type __c = traits_type::eof()) +std::basic_stringbuf::pbackfail cpp_src/sstream.tcc /^ pbackfail(int_type __c)$/;" f class:std::basic_stringbuf signature:(int_type __c) +std::basic_stringbuf::pos_type cpp_src/sstream /^ typedef typename traits_type::pos_type pos_type;$/;" t class:std::basic_stringbuf file: access:public +std::basic_stringbuf::seekoff cpp_src/sstream /^ seekoff(off_type __off, ios_base::seekdir __way,$/;" p class:std::basic_stringbuf file: access:protected signature:(off_type __off, ios_base::seekdir __way, ios_base::openmode __mode = ios_base::in | ios_base::out) +std::basic_stringbuf::seekoff cpp_src/sstream.tcc /^ seekoff(off_type __off, ios_base::seekdir __way, ios_base::openmode __mode)$/;" f class:std::basic_stringbuf signature:(off_type __off, ios_base::seekdir __way, ios_base::openmode __mode) +std::basic_stringbuf::seekpos cpp_src/sstream /^ seekpos(pos_type __sp,$/;" p class:std::basic_stringbuf file: access:protected signature:(pos_type __sp, ios_base::openmode __mode = ios_base::in | ios_base::out) +std::basic_stringbuf::seekpos cpp_src/sstream.tcc /^ seekpos(pos_type __sp, ios_base::openmode __mode)$/;" f class:std::basic_stringbuf signature:(pos_type __sp, ios_base::openmode __mode) +std::basic_stringbuf::setbuf cpp_src/sstream /^ setbuf(char_type* __s, streamsize __n)$/;" f class:std::basic_stringbuf access:protected signature:(char_type* __s, streamsize __n) +std::basic_stringbuf::showmanyc cpp_src/sstream /^ showmanyc()$/;" f class:std::basic_stringbuf access:protected signature:() +std::basic_stringbuf::str cpp_src/sstream /^ str() const$/;" f class:std::basic_stringbuf access:public signature:() const +std::basic_stringbuf::str cpp_src/sstream /^ str(const __string_type& __s)$/;" f class:std::basic_stringbuf access:public signature:(const __string_type& __s) +std::basic_stringbuf::traits_type cpp_src/sstream /^ typedef _Traits traits_type;$/;" t class:std::basic_stringbuf file: access:public +std::basic_stringbuf::underflow cpp_src/sstream /^ underflow();$/;" p class:std::basic_stringbuf file: access:protected signature:() +std::basic_stringbuf::underflow cpp_src/sstream.tcc /^ underflow()$/;" f class:std::basic_stringbuf signature:() +std::basic_stringstream cpp_src/sstream /^ class basic_stringstream : public basic_iostream<_CharT, _Traits>$/;" c namespace:std file: inherits:basic_iostream +std::basic_stringstream::_M_stringbuf cpp_src/sstream /^ __stringbuf_type _M_stringbuf;$/;" m class:std::basic_stringstream file: access:private +std::basic_stringstream::__iostream_type cpp_src/sstream /^ typedef basic_iostream __iostream_type;$/;" t class:std::basic_stringstream file: access:public +std::basic_stringstream::__string_type cpp_src/sstream /^ typedef basic_string<_CharT, _Traits, _Alloc> __string_type;$/;" t class:std::basic_stringstream file: access:public +std::basic_stringstream::__stringbuf_type cpp_src/sstream /^ typedef basic_stringbuf<_CharT, _Traits, _Alloc> __stringbuf_type;$/;" t class:std::basic_stringstream file: access:public +std::basic_stringstream::allocator_type cpp_src/sstream /^ typedef _Alloc allocator_type;$/;" t class:std::basic_stringstream file: access:public +std::basic_stringstream::basic_stringstream cpp_src/sstream /^ basic_stringstream(const __string_type& __str,$/;" f class:std::basic_stringstream access:public signature:(const __string_type& __str, ios_base::openmode __m = ios_base::out | ios_base::in) +std::basic_stringstream::basic_stringstream cpp_src/sstream /^ basic_stringstream(ios_base::openmode __m = ios_base::out | ios_base::in)$/;" f class:std::basic_stringstream access:public signature:(ios_base::openmode __m = ios_base::out | ios_base::in) +std::basic_stringstream::char_type cpp_src/sstream /^ typedef _CharT char_type;$/;" t class:std::basic_stringstream file: access:public +std::basic_stringstream::int_type cpp_src/sstream /^ typedef typename traits_type::int_type int_type;$/;" t class:std::basic_stringstream file: access:public +std::basic_stringstream::off_type cpp_src/sstream /^ typedef typename traits_type::off_type off_type;$/;" t class:std::basic_stringstream file: access:public +std::basic_stringstream::pos_type cpp_src/sstream /^ typedef typename traits_type::pos_type pos_type;$/;" t class:std::basic_stringstream file: access:public +std::basic_stringstream::rdbuf cpp_src/sstream /^ rdbuf() const$/;" f class:std::basic_stringstream access:public signature:() const +std::basic_stringstream::str cpp_src/sstream /^ str() const$/;" f class:std::basic_stringstream access:public signature:() const +std::basic_stringstream::str cpp_src/sstream /^ str(const __string_type& __s)$/;" f class:std::basic_stringstream access:public signature:(const __string_type& __s) +std::basic_stringstream::traits_type cpp_src/sstream /^ typedef _Traits traits_type;$/;" t class:std::basic_stringstream file: access:public +std::basic_stringstream::~basic_stringstream cpp_src/sstream /^ ~basic_stringstream()$/;" f class:std::basic_stringstream access:public signature:() +std::bidirectional_iterator_tag cpp_src/stl_iterator_base_types.h /^ struct bidirectional_iterator_tag : public forward_iterator_tag {};$/;" s namespace:std inherits:forward_iterator_tag +std::binary_function cpp_src/stl_function.h /^ struct binary_function$/;" s namespace:std +std::binary_function::first_argument_type cpp_src/stl_function.h /^ typedef _Arg1 first_argument_type; \/\/\/< the type of the first argument$/;" t struct:std::binary_function access:public +std::binary_function::result_type cpp_src/stl_function.h /^ typedef _Result result_type; \/\/\/< type of the return type$/;" t struct:std::binary_function access:public +std::binary_function::second_argument_type cpp_src/stl_function.h /^ typedef _Arg2 second_argument_type; \/\/\/< the type of the second argument$/;" t struct:std::binary_function access:public +std::binary_negate cpp_src/stl_function.h /^ class binary_negate$/;" c namespace:std inherits:binary_function +std::binary_negate::_M_pred cpp_src/stl_function.h /^ _Predicate _M_pred;$/;" m class:std::binary_negate access:protected +std::binary_negate::binary_negate cpp_src/stl_function.h /^ binary_negate(const _Predicate& __x)$/;" f class:std::binary_negate access:public signature:(const _Predicate& __x) +std::binary_negate::operator () cpp_src/stl_function.h /^ operator()(const typename _Predicate::first_argument_type& __x,$/;" f class:std::binary_negate access:public signature:(const typename _Predicate::first_argument_type& __x, const typename _Predicate::second_argument_type& __y) const +std::binary_search cpp_src/stl_algo.h /^ binary_search(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val) +std::binary_search cpp_src/stl_algo.h /^ binary_search(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val, _Compare __comp) +std::bind1st cpp_src/stl_function.h /^ bind1st(const _Operation& __fn, const _Tp& __x)$/;" f namespace:std signature:(const _Operation& __fn, const _Tp& __x) +std::bind2nd cpp_src/stl_function.h /^ bind2nd(const _Operation& __fn, const _Tp& __x)$/;" f namespace:std signature:(const _Operation& __fn, const _Tp& __x) +std::binder1st cpp_src/stl_function.h /^ class binder1st$/;" c namespace:std inherits:unary_function +std::binder1st::binder1st cpp_src/stl_function.h /^ binder1st(const _Operation& __x,$/;" f class:std::binder1st access:public signature:(const _Operation& __x, const typename _Operation::first_argument_type& __y) +std::binder1st::op cpp_src/stl_function.h /^ _Operation op;$/;" m class:std::binder1st access:protected +std::binder1st::operator () cpp_src/stl_function.h /^ operator()(const typename _Operation::second_argument_type& __x) const$/;" f class:std::binder1st access:public signature:(const typename _Operation::second_argument_type& __x) const +std::binder1st::operator () cpp_src/stl_function.h /^ operator()(typename _Operation::second_argument_type& __x) const$/;" f class:std::binder1st access:public signature:(typename _Operation::second_argument_type& __x) const +std::binder1st::value cpp_src/stl_function.h /^ typename _Operation::first_argument_type value;$/;" m class:std::binder1st access:protected +std::binder2nd cpp_src/stl_function.h /^ class binder2nd$/;" c namespace:std inherits:unary_function +std::binder2nd::binder2nd cpp_src/stl_function.h /^ binder2nd(const _Operation& __x,$/;" f class:std::binder2nd access:public signature:(const _Operation& __x, const typename _Operation::second_argument_type& __y) +std::binder2nd::op cpp_src/stl_function.h /^ _Operation op;$/;" m class:std::binder2nd access:protected +std::binder2nd::operator () cpp_src/stl_function.h /^ operator()(const typename _Operation::first_argument_type& __x) const$/;" f class:std::binder2nd access:public signature:(const typename _Operation::first_argument_type& __x) const +std::binder2nd::operator () cpp_src/stl_function.h /^ operator()(typename _Operation::first_argument_type& __x) const$/;" f class:std::binder2nd access:public signature:(typename _Operation::first_argument_type& __x) const +std::binder2nd::value cpp_src/stl_function.h /^ typename _Operation::second_argument_type value;$/;" m class:std::binder2nd access:protected +std::bitset cpp_src/bitset /^ class bitset$/;" c namespace:std file: inherits:_Base_bitset +std::bitset::_Base cpp_src/bitset /^ typedef _Base_bitset<_GLIBCXX_BITSET_WORDS(_Nb)> _Base;$/;" t class:std::bitset file: access:private +std::bitset::_Find_first cpp_src/bitset /^ _Find_first() const$/;" f class:std::bitset access:public signature:() const +std::bitset::_Find_next cpp_src/bitset /^ _Find_next(size_t __prev ) const$/;" f class:std::bitset access:public signature:(size_t __prev ) const +std::bitset::_M_copy_from_string cpp_src/bitset /^ _M_copy_from_string(const std::basic_string<_CharT,$/;" p class:std::bitset file: access:public signature:(const std::basic_string<_CharT, _Traits, _Alloc>& __s, size_t, size_t) +std::bitset::_M_copy_from_string cpp_src/bitset /^ _M_copy_from_string(const std::basic_string<_CharT, _Traits,$/;" f class:std::bitset signature:(const std::basic_string<_CharT, _Traits, _Alloc>& __s, size_t __pos, size_t __n) +std::bitset::_M_copy_to_string cpp_src/bitset /^ _M_copy_to_string(std::basic_string<_CharT, _Traits, _Alloc>&) const;$/;" p class:std::bitset file: access:public signature:(std::basic_string<_CharT, _Traits, _Alloc>&) const +std::bitset::_M_copy_to_string cpp_src/bitset /^ _M_copy_to_string(std::basic_string<_CharT, _Traits, _Alloc>& __s) const$/;" f class:std::bitset signature:(std::basic_string<_CharT, _Traits, _Alloc>& __s) const +std::bitset::_M_do_sanitize cpp_src/bitset /^ _M_do_sanitize()$/;" f class:std::bitset file: access:private signature:() +std::bitset::_Unchecked_flip cpp_src/bitset /^ _Unchecked_flip(size_t __pos)$/;" f class:std::bitset access:public signature:(size_t __pos) +std::bitset::_Unchecked_reset cpp_src/bitset /^ _Unchecked_reset(size_t __pos)$/;" f class:std::bitset access:public signature:(size_t __pos) +std::bitset::_Unchecked_set cpp_src/bitset /^ _Unchecked_set(size_t __pos)$/;" f class:std::bitset access:public signature:(size_t __pos) +std::bitset::_Unchecked_set cpp_src/bitset /^ _Unchecked_set(size_t __pos, int __val)$/;" f class:std::bitset access:public signature:(size_t __pos, int __val) +std::bitset::_Unchecked_test cpp_src/bitset /^ _Unchecked_test(size_t __pos) const$/;" f class:std::bitset access:public signature:(size_t __pos) const +std::bitset::_WordT cpp_src/bitset /^ typedef unsigned long _WordT;$/;" t class:std::bitset file: access:private +std::bitset::any cpp_src/bitset /^ any() const$/;" f class:std::bitset access:public signature:() const +std::bitset::bitset cpp_src/bitset /^ bitset(const std::basic_string<_CharT, _Traits, _Alloc>& __s,$/;" f class:std::bitset access:public signature:(const std::basic_string<_CharT, _Traits, _Alloc>& __s, size_t __position = 0) +std::bitset::bitset cpp_src/bitset /^ bitset(const std::basic_string<_CharT, _Traits, _Alloc>& __s,$/;" f class:std::bitset access:public signature:(const std::basic_string<_CharT, _Traits, _Alloc>& __s, size_t __position, size_t __n) +std::bitset::bitset cpp_src/bitset /^ bitset()$/;" f class:std::bitset access:public signature:() +std::bitset::bitset cpp_src/bitset /^ bitset(unsigned long __val)$/;" f class:std::bitset access:public signature:(unsigned long __val) +std::bitset::count cpp_src/bitset /^ count() const$/;" f class:std::bitset access:public signature:() const +std::bitset::flip cpp_src/bitset /^ flip()$/;" f class:std::bitset access:public signature:() +std::bitset::flip cpp_src/bitset /^ flip(size_t __position)$/;" f class:std::bitset access:public signature:(size_t __position) +std::bitset::flip cpp_src/bitset /^ flip(size_t)$/;" f class:std::bitset signature:(size_t) +std::bitset::none cpp_src/bitset /^ none() const$/;" f class:std::bitset access:public signature:() const +std::bitset::operator != cpp_src/bitset /^ operator!=(const bitset<_Nb>& __rhs) const$/;" f class:std::bitset access:public signature:(const bitset<_Nb>& __rhs) const +std::bitset::operator &= cpp_src/bitset /^ operator&=(const bitset<_Nb>& __rhs)$/;" f class:std::bitset access:public signature:(const bitset<_Nb>& __rhs) +std::bitset::operator << cpp_src/bitset /^ operator<<(size_t __position) const$/;" f class:std::bitset access:public signature:(size_t __position) const +std::bitset::operator <<= cpp_src/bitset /^ operator<<=(size_t __position)$/;" f class:std::bitset access:public signature:(size_t __position) +std::bitset::operator == cpp_src/bitset /^ operator==(const bitset<_Nb>& __rhs) const$/;" f class:std::bitset access:public signature:(const bitset<_Nb>& __rhs) const +std::bitset::operator >> cpp_src/bitset /^ operator>>(size_t __position) const$/;" f class:std::bitset access:public signature:(size_t __position) const +std::bitset::operator >>= cpp_src/bitset /^ operator>>=(size_t __position)$/;" f class:std::bitset access:public signature:(size_t __position) +std::bitset::operator [] cpp_src/bitset /^ operator[](size_t __position) const$/;" f class:std::bitset access:public signature:(size_t __position) const +std::bitset::operator [] cpp_src/bitset /^ operator[](size_t __position)$/;" f class:std::bitset access:public signature:(size_t __position) +std::bitset::operator ^= cpp_src/bitset /^ operator^=(const bitset<_Nb>& __rhs)$/;" f class:std::bitset access:public signature:(const bitset<_Nb>& __rhs) +std::bitset::operator |= cpp_src/bitset /^ operator|=(const bitset<_Nb>& __rhs)$/;" f class:std::bitset access:public signature:(const bitset<_Nb>& __rhs) +std::bitset::operator ~ cpp_src/bitset /^ operator~() const$/;" f class:std::bitset access:public signature:() const +std::bitset::reference cpp_src/bitset /^ class reference$/;" c class:std::bitset file: access:public +std::bitset::reference::_M_bpos cpp_src/bitset /^ size_t _M_bpos;$/;" m class:std::bitset::reference file: access:private +std::bitset::reference::_M_wp cpp_src/bitset /^ _WordT *_M_wp;$/;" m class:std::bitset::reference file: access:private +std::bitset::reference::flip cpp_src/bitset /^ flip()$/;" f class:std::bitset::reference access:public signature:() +std::bitset::reference::operator = cpp_src/bitset /^ operator=(bool __x)$/;" f class:std::bitset::reference access:public signature:(bool __x) +std::bitset::reference::operator = cpp_src/bitset /^ operator=(const reference& __j)$/;" f class:std::bitset::reference access:public signature:(const reference& __j) +std::bitset::reference::operator bool cpp_src/bitset /^ operator bool() const$/;" f class:std::bitset::reference access:public signature:() const +std::bitset::reference::operator ~ cpp_src/bitset /^ operator~() const$/;" f class:std::bitset::reference access:public signature:() const +std::bitset::reference::reference cpp_src/bitset /^ reference();$/;" p class:std::bitset::reference file: access:private signature:() +std::bitset::reference::reference cpp_src/bitset /^ reference(bitset& __b, size_t __pos)$/;" f class:std::bitset::reference access:public signature:(bitset& __b, size_t __pos) +std::bitset::reference::~reference cpp_src/bitset /^ ~reference()$/;" f class:std::bitset::reference access:public signature:() +std::bitset::reset cpp_src/bitset /^ reset()$/;" f class:std::bitset access:public signature:() +std::bitset::reset cpp_src/bitset /^ reset(size_t __position)$/;" f class:std::bitset access:public signature:(size_t __position) +std::bitset::reset cpp_src/bitset /^ reset(size_t)$/;" f class:std::bitset signature:(size_t) +std::bitset::set cpp_src/bitset /^ set()$/;" f class:std::bitset access:public signature:() +std::bitset::set cpp_src/bitset /^ set(size_t __position, bool __val = true)$/;" f class:std::bitset access:public signature:(size_t __position, bool __val = true) +std::bitset::set cpp_src/bitset /^ set(size_t, bool)$/;" f class:std::bitset signature:(size_t, bool) +std::bitset::size cpp_src/bitset /^ size() const$/;" f class:std::bitset access:public signature:() const +std::bitset::test cpp_src/bitset /^ test(size_t __position) const$/;" f class:std::bitset access:public signature:(size_t __position) const +std::bitset::test cpp_src/bitset /^ test(size_t) const$/;" f class:std::bitset signature:(size_t) const +std::bitset::to_string cpp_src/bitset /^ to_string() const$/;" f class:std::bitset access:public signature:() const +std::bitset::to_string cpp_src/bitset /^ to_string() const$/;" f class:std::bitset access:public signature:() const +std::bitset::to_ulong cpp_src/bitset /^ to_ulong() const$/;" f class:std::bitset access:public signature:() const +std::boolalpha cpp_src/ios_base.h /^ boolalpha(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +std::ceil cpp_src/cmath /^ ceil(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +std::ceil cpp_src/cmath /^ ceil(float __x)$/;" f namespace:std signature:(float __x) +std::ceil cpp_src/cmath /^ ceil(long double __x)$/;" f namespace:std signature:(long double __x) +std::cerr cpp_src/iostream /^ static ostream cerr; \/\/\/< Linked to standard error (unbuffered)$/;" m namespace:std file: +std::cin cpp_src/iostream /^ static istream cin; \/\/\/< Linked to standard input$/;" m namespace:std file: +std::clog cpp_src/iostream /^ static ostream clog; \/\/\/< Linked to standard error (buffered)$/;" m namespace:std file: +std::codecvt cpp_src/codecvt.h /^ class codecvt$/;" c namespace:std inherits:__codecvt_abstract_base +std::codecvt cpp_src/codecvt.h /^ class codecvt$/;" c namespace:std inherits:__codecvt_abstract_base +std::codecvt cpp_src/codecvt.h /^ class codecvt$/;" c namespace:std inherits:__codecvt_abstract_base +std::codecvt::_M_c_locale_codecvt cpp_src/codecvt.h /^ __c_locale _M_c_locale_codecvt;$/;" m class:std::codecvt access:protected +std::codecvt::codecvt cpp_src/codecvt.h /^ codecvt(__c_locale __cloc, size_t __refs = 0);$/;" p class:std::codecvt access:public signature:(__c_locale __cloc, size_t __refs = 0) +std::codecvt::codecvt cpp_src/codecvt.h /^ codecvt(size_t __refs = 0)$/;" f class:std::codecvt access:public signature:(size_t __refs = 0) +std::codecvt::codecvt cpp_src/codecvt.h /^ codecvt(size_t __refs = 0);$/;" p class:std::codecvt access:public signature:(size_t __refs = 0) +std::codecvt::do_always_noconv cpp_src/codecvt.h /^ bool do_always_noconv() const throw();$/;" p class:std::codecvt access:protected signature:() const +std::codecvt::do_always_noconv cpp_src/codecvt.h /^ do_always_noconv() const throw();$/;" p class:std::codecvt access:protected signature:() const +std::codecvt::do_encoding cpp_src/codecvt.h /^ do_encoding() const throw();$/;" p class:std::codecvt access:protected signature:() const +std::codecvt::do_encoding cpp_src/codecvt.h /^ int do_encoding() const throw();$/;" p class:std::codecvt access:protected signature:() const +std::codecvt::do_in cpp_src/codecvt.h /^ do_in(state_type& __state, const extern_type* __from,$/;" p class:std::codecvt access:protected signature:(state_type& __state, const extern_type* __from, const extern_type* __from_end, const extern_type*& __from_next, intern_type* __to, intern_type* __to_end, intern_type*& __to_next) const +std::codecvt::do_in cpp_src/codecvt.h /^ do_in(state_type& __state,$/;" p class:std::codecvt access:protected signature:(state_type& __state, const extern_type* __from, const extern_type* __from_end, const extern_type*& __from_next, intern_type* __to, intern_type* __to_end, intern_type*& __to_next) const +std::codecvt::do_length cpp_src/codecvt.h /^ do_length(state_type&, const extern_type* __from,$/;" p class:std::codecvt access:protected signature:(state_type&, const extern_type* __from, const extern_type* __end, size_t __max) const +std::codecvt::do_length cpp_src/codecvt.h /^ int do_length(state_type&, const extern_type* __from,$/;" p class:std::codecvt access:protected signature:(state_type&, const extern_type* __from, const extern_type* __end, size_t __max) const +std::codecvt::do_max_length cpp_src/codecvt.h /^ do_max_length() const throw();$/;" p class:std::codecvt access:protected signature:() const +std::codecvt::do_out cpp_src/codecvt.h /^ do_out(state_type& __state, const intern_type* __from,$/;" p class:std::codecvt access:protected signature:(state_type& __state, const intern_type* __from, const intern_type* __from_end, const intern_type*& __from_next, extern_type* __to, extern_type* __to_end, extern_type*& __to_next) const +std::codecvt::do_unshift cpp_src/codecvt.h /^ do_unshift(state_type& __state, extern_type* __to,$/;" p class:std::codecvt access:protected signature:(state_type& __state, extern_type* __to, extern_type* __to_end, extern_type*& __to_next) const +std::codecvt::do_unshift cpp_src/codecvt.h /^ do_unshift(state_type& __state,$/;" p class:std::codecvt access:protected signature:(state_type& __state, extern_type* __to, extern_type* __to_end, extern_type*& __to_next) const +std::codecvt::extern_type cpp_src/codecvt.h /^ typedef _ExternT extern_type;$/;" t class:std::codecvt access:public +std::codecvt::extern_type cpp_src/codecvt.h /^ typedef char extern_type;$/;" t class:std::codecvt access:public +std::codecvt::id cpp_src/codecvt.h /^ static locale::id id;$/;" m class:std::codecvt access:public +std::codecvt::id cpp_src/codecvt.h /^ static locale::id id;$/;" m class:std::codecvt access:public +std::codecvt::id cpp_src/codecvt.h /^ locale::id codecvt<_InternT, _ExternT, _StateT>::id;$/;" m class:std::codecvt +std::codecvt::intern_type cpp_src/codecvt.h /^ typedef _InternT intern_type;$/;" t class:std::codecvt access:public +std::codecvt::intern_type cpp_src/codecvt.h /^ typedef char intern_type;$/;" t class:std::codecvt access:public +std::codecvt::intern_type cpp_src/codecvt.h /^ typedef wchar_t intern_type;$/;" t class:std::codecvt access:public +std::codecvt::result cpp_src/codecvt.h /^ typedef codecvt_base::result result;$/;" t class:std::codecvt access:public +std::codecvt::state_type cpp_src/codecvt.h /^ typedef _StateT state_type;$/;" t class:std::codecvt access:public +std::codecvt::state_type cpp_src/codecvt.h /^ typedef mbstate_t state_type;$/;" t class:std::codecvt access:public +std::codecvt::~codecvt cpp_src/codecvt.h /^ ~codecvt() { }$/;" f class:std::codecvt access:protected signature:() +std::codecvt::~codecvt cpp_src/codecvt.h /^ ~codecvt();$/;" p class:std::codecvt access:protected signature:() +std::codecvt_base cpp_src/codecvt.h /^ class codecvt_base$/;" c namespace:std +std::codecvt_base::error cpp_src/codecvt.h /^ error,$/;" e enum:std::codecvt_base::result +std::codecvt_base::noconv cpp_src/codecvt.h /^ noconv$/;" e enum:std::codecvt_base::result +std::codecvt_base::ok cpp_src/codecvt.h /^ ok,$/;" e enum:std::codecvt_base::result +std::codecvt_base::partial cpp_src/codecvt.h /^ partial,$/;" e enum:std::codecvt_base::result +std::codecvt_base::result cpp_src/codecvt.h /^ enum result$/;" g class:std::codecvt_base access:public +std::codecvt_byname cpp_src/codecvt.h /^ class codecvt_byname : public codecvt<_InternT, _ExternT, _StateT>$/;" c namespace:std inherits:codecvt +std::codecvt_byname::codecvt_byname cpp_src/codecvt.h /^ codecvt_byname(const char* __s, size_t __refs = 0)$/;" f class:std::codecvt_byname access:public signature:(const char* __s, size_t __refs = 0) +std::codecvt_byname::~codecvt_byname cpp_src/codecvt.h /^ ~codecvt_byname() { }$/;" f class:std::codecvt_byname access:protected signature:() +std::collate cpp_src/locale_facets.h /^ class collate : public locale::facet$/;" c namespace:std inherits:locale::facet +std::collate::_M_c_locale_collate cpp_src/locale_facets.h /^ __c_locale _M_c_locale_collate;$/;" m class:std::collate access:protected +std::collate::_M_compare cpp_src/locale_facets.h /^ _M_compare(const _CharT*, const _CharT*) const;$/;" p class:std::collate access:public signature:(const _CharT*, const _CharT*) const +std::collate::_M_compare cpp_src/locale_facets.h /^ collate::_M_compare(const char*, const char*) const;$/;" p class:std::collate signature:(const char*, const char*) const +std::collate::_M_compare cpp_src/locale_facets.h /^ collate::_M_compare(const wchar_t*, const wchar_t*) const;$/;" p class:std::collate signature:(const wchar_t*, const wchar_t*) const +std::collate::_M_compare cpp_src/locale_facets.tcc /^ collate<_CharT>::_M_compare(const _CharT*, const _CharT*) const$/;" f class:std::collate signature:(const _CharT*, const _CharT*) const +std::collate::_M_transform cpp_src/locale_facets.h /^ _M_transform(_CharT*, const _CharT*, size_t) const;$/;" p class:std::collate access:public signature:(_CharT*, const _CharT*, size_t) const +std::collate::_M_transform cpp_src/locale_facets.h /^ collate::_M_transform(char*, const char*, size_t) const;$/;" p class:std::collate signature:(char*, const char*, size_t) const +std::collate::_M_transform cpp_src/locale_facets.h /^ collate::_M_transform(wchar_t*, const wchar_t*, size_t) const;$/;" p class:std::collate signature:(wchar_t*, const wchar_t*, size_t) const +std::collate::_M_transform cpp_src/locale_facets.tcc /^ collate<_CharT>::_M_transform(_CharT*, const _CharT*, size_t) const$/;" f class:std::collate signature:(_CharT*, const _CharT*, size_t) const +std::collate::char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::collate access:public +std::collate::collate cpp_src/locale_facets.h /^ collate(__c_locale __cloc, size_t __refs = 0)$/;" f class:std::collate access:public signature:(__c_locale __cloc, size_t __refs = 0) +std::collate::collate cpp_src/locale_facets.h /^ collate(size_t __refs = 0)$/;" f class:std::collate access:public signature:(size_t __refs = 0) +std::collate::compare cpp_src/locale_facets.h /^ compare(const _CharT* __lo1, const _CharT* __hi1,$/;" f class:std::collate access:public signature:(const _CharT* __lo1, const _CharT* __hi1, const _CharT* __lo2, const _CharT* __hi2) const +std::collate::do_compare cpp_src/locale_facets.h /^ do_compare(const _CharT* __lo1, const _CharT* __hi1,$/;" p class:std::collate access:protected signature:(const _CharT* __lo1, const _CharT* __hi1, const _CharT* __lo2, const _CharT* __hi2) const +std::collate::do_compare cpp_src/locale_facets.tcc /^ do_compare(const _CharT* __lo1, const _CharT* __hi1,$/;" f class:std::collate signature:(const _CharT* __lo1, const _CharT* __hi1, const _CharT* __lo2, const _CharT* __hi2) const +std::collate::do_hash cpp_src/locale_facets.h /^ do_hash(const _CharT* __lo, const _CharT* __hi) const;$/;" p class:std::collate access:protected signature:(const _CharT* __lo, const _CharT* __hi) const +std::collate::do_hash cpp_src/locale_facets.tcc /^ do_hash(const _CharT* __lo, const _CharT* __hi) const$/;" f class:std::collate signature:(const _CharT* __lo, const _CharT* __hi) const +std::collate::do_transform cpp_src/locale_facets.h /^ do_transform(const _CharT* __lo, const _CharT* __hi) const;$/;" p class:std::collate access:protected signature:(const _CharT* __lo, const _CharT* __hi) const +std::collate::do_transform cpp_src/locale_facets.tcc /^ do_transform(const _CharT* __lo, const _CharT* __hi) const$/;" f class:std::collate signature:(const _CharT* __lo, const _CharT* __hi) const +std::collate::hash cpp_src/locale_facets.h /^ hash(const _CharT* __lo, const _CharT* __hi) const$/;" f class:std::collate access:public signature:(const _CharT* __lo, const _CharT* __hi) const +std::collate::id cpp_src/locale_facets.h /^ static locale::id id;$/;" m class:std::collate access:public +std::collate::id cpp_src/locale_facets.h /^ locale::id collate<_CharT>::id;$/;" m class:std::collate +std::collate::string_type cpp_src/locale_facets.h /^ typedef basic_string<_CharT> string_type;$/;" t class:std::collate access:public +std::collate::transform cpp_src/locale_facets.h /^ transform(const _CharT* __lo, const _CharT* __hi) const$/;" f class:std::collate access:public signature:(const _CharT* __lo, const _CharT* __hi) const +std::collate::~collate cpp_src/locale_facets.h /^ ~collate()$/;" f class:std::collate access:protected signature:() +std::collate_byname cpp_src/locale_facets.h /^ class collate_byname : public collate<_CharT>$/;" c namespace:std inherits:collate +std::collate_byname::char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::collate_byname access:public +std::collate_byname::collate_byname cpp_src/locale_facets.h /^ collate_byname(const char* __s, size_t __refs = 0)$/;" f class:std::collate_byname access:public signature:(const char* __s, size_t __refs = 0) +std::collate_byname::string_type cpp_src/locale_facets.h /^ typedef basic_string<_CharT> string_type;$/;" t class:std::collate_byname access:public +std::collate_byname::~collate_byname cpp_src/locale_facets.h /^ ~collate_byname() { }$/;" f class:std::collate_byname access:protected signature:() +std::complex cpp_src/complex /^ struct complex$/;" s namespace:std file: +std::complex cpp_src/complex /^ struct complex$/;" s namespace:std file: +std::complex cpp_src/complex /^ struct complex$/;" s namespace:std file: +std::complex cpp_src/complex /^ struct complex$/;" s namespace:std file: +std::complex::_ComplexT cpp_src/complex /^ typedef __complex__ double _ComplexT;$/;" t struct:std::complex file: access:public +std::complex::_ComplexT cpp_src/complex /^ typedef __complex__ float _ComplexT;$/;" t struct:std::complex file: access:public +std::complex::_ComplexT cpp_src/complex /^ typedef __complex__ long double _ComplexT;$/;" t struct:std::complex file: access:public +std::complex::_M_imag cpp_src/complex /^ _Tp _M_imag;$/;" m struct:std::complex file: access:private +std::complex::_M_real cpp_src/complex /^ _Tp _M_real;$/;" m struct:std::complex file: access:private +std::complex::_M_value cpp_src/complex /^ _ComplexT _M_value;$/;" m struct:std::complex file: access:private +std::complex::__rep cpp_src/complex /^ const _ComplexT& __rep() const { return _M_value; }$/;" f struct:std::complex access:public signature:() const +std::complex::__rep cpp_src/complex /^ const complex& __rep() const;$/;" p struct:std::complex file: access:public signature:() const +std::complex::__rep cpp_src/complex /^ complex<_Tp>::__rep() const { return *this; }$/;" f class:std::complex signature:() const +std::complex::complex cpp_src/complex /^ complex(const complex<_Up>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Up>&) +std::complex::complex cpp_src/complex /^ complex(_ComplexT __z) : _M_value(__z) { }$/;" f struct:std::complex access:public signature:(_ComplexT __z) +std::complex::complex cpp_src/complex /^ complex(const _Tp& = _Tp(), const _Tp & = _Tp());$/;" p struct:std::complex file: access:public signature:(const _Tp& = _Tp(), const _Tp & = _Tp()) +std::complex::complex cpp_src/complex /^ complex(const complex&);$/;" p struct:std::complex file: access:public signature:(const complex&) +std::complex::complex cpp_src/complex /^ complex(const complex&);$/;" p struct:std::complex file: access:public signature:(const complex&) +std::complex::complex cpp_src/complex /^ complex(double = 0.0, double = 0.0);$/;" p struct:std::complex file: access:public signature:(double = 0.0, double = 0.0) +std::complex::complex cpp_src/complex /^ complex(float = 0.0f, float = 0.0f);$/;" p struct:std::complex file: access:public signature:(float = 0.0f, float = 0.0f) +std::complex::complex cpp_src/complex /^ complex(long double = 0.0L, long double = 0.0L);$/;" p struct:std::complex file: access:public signature:(long double = 0.0L, long double = 0.0L) +std::complex::complex cpp_src/complex /^ explicit complex(const complex&);$/;" p struct:std::complex file: access:public signature:(const complex&) +std::complex::complex cpp_src/complex /^ explicit complex(const complex&);$/;" p struct:std::complex file: access:public signature:(const complex&) +std::complex::complex cpp_src/complex /^ complex<_Tp>::complex(const _Tp& __r, const _Tp& __i)$/;" f class:std::complex signature:(const _Tp& __r, const _Tp& __i) +std::complex::complex cpp_src/complex /^ complex<_Tp>::complex(const complex<_Up>& __z)$/;" f class:std::complex signature:(const complex<_Up>& __z) +std::complex::complex cpp_src/complex /^ complex::complex(const complex& __z) $/;" f class:std::complex signature:(const complex& __z) +std::complex::complex cpp_src/complex /^ complex::complex(const complex& __z)$/;" f class:std::complex signature:(const complex& __z) +std::complex::complex cpp_src/complex /^ complex::complex(double __r, double __i)$/;" f class:std::complex signature:(double __r, double __i) +std::complex::complex cpp_src/complex /^ complex::complex(const complex& __z)$/;" f class:std::complex signature:(const complex& __z) +std::complex::complex cpp_src/complex /^ complex::complex(const complex& __z)$/;" f class:std::complex signature:(const complex& __z) +std::complex::complex cpp_src/complex /^ complex::complex(float r, float i)$/;" f class:std::complex signature:(float r, float i) +std::complex::complex cpp_src/complex /^ complex::complex(const complex& __z)$/;" f class:std::complex signature:(const complex& __z) +std::complex::complex cpp_src/complex /^ complex::complex(const complex& __z)$/;" f class:std::complex signature:(const complex& __z) +std::complex::complex cpp_src/complex /^ complex::complex(long double __r, long double __i)$/;" f class:std::complex signature:(long double __r, long double __i) +std::complex::imag cpp_src/complex /^ _Tp& imag();$/;" p struct:std::complex file: access:public signature:() +std::complex::imag cpp_src/complex /^ const _Tp& imag() const;$/;" p struct:std::complex file: access:public signature:() const +std::complex::imag cpp_src/complex /^ const double& imag() const;$/;" p struct:std::complex file: access:public signature:() const +std::complex::imag cpp_src/complex /^ const float& imag() const;$/;" p struct:std::complex file: access:public signature:() const +std::complex::imag cpp_src/complex /^ const long double& imag() const;$/;" p struct:std::complex file: access:public signature:() const +std::complex::imag cpp_src/complex /^ double& imag();$/;" p struct:std::complex file: access:public signature:() +std::complex::imag cpp_src/complex /^ float& imag();$/;" p struct:std::complex file: access:public signature:() +std::complex::imag cpp_src/complex /^ long double& imag();$/;" p struct:std::complex file: access:public signature:() +std::complex::imag cpp_src/complex /^ complex<_Tp>::imag() const { return _M_imag; }$/;" f class:std::complex signature:() const +std::complex::imag cpp_src/complex /^ complex<_Tp>::imag() { return _M_imag; }$/;" f class:std::complex signature:() +std::complex::imag cpp_src/complex /^ complex::imag() const$/;" f class:std::complex signature:() const +std::complex::imag cpp_src/complex /^ complex::imag()$/;" f class:std::complex signature:() +std::complex::imag cpp_src/complex /^ complex::imag() const$/;" f class:std::complex signature:() const +std::complex::imag cpp_src/complex /^ complex::imag()$/;" f class:std::complex signature:() +std::complex::imag cpp_src/complex /^ complex::imag() const$/;" f class:std::complex signature:() const +std::complex::imag cpp_src/complex /^ complex::imag()$/;" f class:std::complex signature:() +std::complex::operator *= cpp_src/complex /^ complex<_Tp>& operator*=(const complex<_Up>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Up>&) +std::complex::operator *= cpp_src/complex /^ complex& operator*=(const complex<_Tp>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Tp>&) +std::complex::operator *= cpp_src/complex /^ complex& operator*=(const complex<_Tp>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Tp>&) +std::complex::operator *= cpp_src/complex /^ complex& operator*=(const complex<_Tp>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Tp>&) +std::complex::operator *= cpp_src/complex /^ complex<_Tp>& operator*=(const _Tp&);$/;" p struct:std::complex file: access:public signature:(const _Tp&) +std::complex::operator *= cpp_src/complex /^ complex& operator*=(double);$/;" p struct:std::complex file: access:public signature:(double) +std::complex::operator *= cpp_src/complex /^ complex& operator*=(float);$/;" p struct:std::complex file: access:public signature:(float) +std::complex::operator *= cpp_src/complex /^ complex& operator*= (long double);$/;" p struct:std::complex file: access:public signature:(long double) +std::complex::operator *= cpp_src/complex /^ complex<_Tp>::operator*=(const _Tp& __t)$/;" f class:std::complex signature:(const _Tp& __t) +std::complex::operator *= cpp_src/complex /^ complex<_Tp>::operator*=(const complex<_Up>& __z)$/;" f class:std::complex signature:(const complex<_Up>& __z) +std::complex::operator *= cpp_src/complex /^ complex::operator*=(const complex<_Tp>& __z)$/;" f class:std::complex signature:(const complex<_Tp>& __z) +std::complex::operator *= cpp_src/complex /^ complex::operator*=(const complex<_Tp>& __z)$/;" f class:std::complex signature:(const complex<_Tp>& __z) +std::complex::operator *= cpp_src/complex /^ complex::operator*=(const complex<_Tp>& __z)$/;" f class:std::complex signature:(const complex<_Tp>& __z) +std::complex::operator *= cpp_src/complex /^ complex::operator*=(double __d)$/;" f class:std::complex signature:(double __d) +std::complex::operator *= cpp_src/complex /^ complex::operator*=(float __f)$/;" f class:std::complex signature:(float __f) +std::complex::operator *= cpp_src/complex /^ complex::operator*=(long double __r)$/;" f class:std::complex signature:(long double __r) +std::complex::operator += cpp_src/complex /^ complex<_Tp>& operator+=(const complex<_Up>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Up>&) +std::complex::operator += cpp_src/complex /^ complex& operator+=(const complex<_Tp>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Tp>&) +std::complex::operator += cpp_src/complex /^ complex& operator+=(const complex<_Tp>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Tp>&) +std::complex::operator += cpp_src/complex /^ complex& operator+=(const complex<_Tp>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Tp>&) +std::complex::operator += cpp_src/complex /^ complex<_Tp>& operator+=(const _Tp&);$/;" p struct:std::complex file: access:public signature:(const _Tp&) +std::complex::operator += cpp_src/complex /^ complex& operator+=(double);$/;" p struct:std::complex file: access:public signature:(double) +std::complex::operator += cpp_src/complex /^ complex& operator+=(float);$/;" p struct:std::complex file: access:public signature:(float) +std::complex::operator += cpp_src/complex /^ complex& operator+= (long double);$/;" p struct:std::complex file: access:public signature:(long double) +std::complex::operator += cpp_src/complex /^ complex<_Tp>::operator+=(const _Tp& __t)$/;" f class:std::complex signature:(const _Tp& __t) +std::complex::operator += cpp_src/complex /^ complex<_Tp>::operator+=(const complex<_Up>& __z)$/;" f class:std::complex signature:(const complex<_Up>& __z) +std::complex::operator += cpp_src/complex /^ complex::operator+=(const complex<_Tp>& __z)$/;" f class:std::complex signature:(const complex<_Tp>& __z) +std::complex::operator += cpp_src/complex /^ complex::operator+=(const complex<_Tp>& __z)$/;" f class:std::complex signature:(const complex<_Tp>& __z) +std::complex::operator += cpp_src/complex /^ complex::operator+=(double __d)$/;" f class:std::complex signature:(double __d) +std::complex::operator += cpp_src/complex /^ complex::operator+=(const complex<_Tp>& __z)$/;" f class:std::complex signature:(const complex<_Tp>& __z) +std::complex::operator += cpp_src/complex /^ complex::operator+=(float __f)$/;" f class:std::complex signature:(float __f) +std::complex::operator += cpp_src/complex /^ complex::operator+=(long double __r)$/;" f class:std::complex signature:(long double __r) +std::complex::operator -= cpp_src/complex /^ complex<_Tp>& operator-=(const complex<_Up>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Up>&) +std::complex::operator -= cpp_src/complex /^ complex& operator-=(const complex<_Tp>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Tp>&) +std::complex::operator -= cpp_src/complex /^ complex& operator-=(const complex<_Tp>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Tp>&) +std::complex::operator -= cpp_src/complex /^ complex& operator-=(const complex<_Tp>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Tp>&) +std::complex::operator -= cpp_src/complex /^ complex<_Tp>& operator-=(const _Tp&);$/;" p struct:std::complex file: access:public signature:(const _Tp&) +std::complex::operator -= cpp_src/complex /^ complex& operator-=(double);$/;" p struct:std::complex file: access:public signature:(double) +std::complex::operator -= cpp_src/complex /^ complex& operator-=(float);$/;" p struct:std::complex file: access:public signature:(float) +std::complex::operator -= cpp_src/complex /^ complex& operator-= (long double);$/;" p struct:std::complex file: access:public signature:(long double) +std::complex::operator -= cpp_src/complex /^ complex<_Tp>::operator-=(const _Tp& __t)$/;" f class:std::complex signature:(const _Tp& __t) +std::complex::operator -= cpp_src/complex /^ complex<_Tp>::operator-=(const complex<_Up>& __z)$/;" f class:std::complex signature:(const complex<_Up>& __z) +std::complex::operator -= cpp_src/complex /^ complex::operator-=(const complex<_Tp>& __z)$/;" f class:std::complex signature:(const complex<_Tp>& __z) +std::complex::operator -= cpp_src/complex /^ complex::operator-=(const complex<_Tp>& __z)$/;" f class:std::complex signature:(const complex<_Tp>& __z) +std::complex::operator -= cpp_src/complex /^ complex::operator-=(const complex<_Tp>& __z)$/;" f class:std::complex signature:(const complex<_Tp>& __z) +std::complex::operator -= cpp_src/complex /^ complex::operator-=(double __d)$/;" f class:std::complex signature:(double __d) +std::complex::operator -= cpp_src/complex /^ complex::operator-=(float __f)$/;" f class:std::complex signature:(float __f) +std::complex::operator -= cpp_src/complex /^ complex::operator-=(long double __r)$/;" f class:std::complex signature:(long double __r) +std::complex::operator /= cpp_src/complex /^ complex<_Tp>& operator\/=(const complex<_Up>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Up>&) +std::complex::operator /= cpp_src/complex /^ complex& operator\/=(const complex<_Tp>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Tp>&) +std::complex::operator /= cpp_src/complex /^ complex&operator\/=(const complex<_Tp>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Tp>&) +std::complex::operator /= cpp_src/complex /^ complex& operator\/=(const complex<_Tp>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Tp>&) +std::complex::operator /= cpp_src/complex /^ complex<_Tp>& operator\/=(const _Tp&);$/;" p struct:std::complex file: access:public signature:(const _Tp&) +std::complex::operator /= cpp_src/complex /^ complex& operator\/=(double);$/;" p struct:std::complex file: access:public signature:(double) +std::complex::operator /= cpp_src/complex /^ complex& operator\/=(float);$/;" p struct:std::complex file: access:public signature:(float) +std::complex::operator /= cpp_src/complex /^ complex& operator\/= (long double);$/;" p struct:std::complex file: access:public signature:(long double) +std::complex::operator /= cpp_src/complex /^ complex<_Tp>::operator\/=(const _Tp& __t)$/;" f class:std::complex signature:(const _Tp& __t) +std::complex::operator /= cpp_src/complex /^ complex<_Tp>::operator\/=(const complex<_Up>& __z)$/;" f class:std::complex signature:(const complex<_Up>& __z) +std::complex::operator /= cpp_src/complex /^ complex::operator\/=(const complex<_Tp>& __z)$/;" f class:std::complex signature:(const complex<_Tp>& __z) +std::complex::operator /= cpp_src/complex /^ complex::operator\/=(const complex<_Tp>& __z)$/;" f class:std::complex signature:(const complex<_Tp>& __z) +std::complex::operator /= cpp_src/complex /^ complex::operator\/=(const complex<_Tp>& __z)$/;" f class:std::complex signature:(const complex<_Tp>& __z) +std::complex::operator /= cpp_src/complex /^ complex::operator\/=(double __d)$/;" f class:std::complex signature:(double __d) +std::complex::operator /= cpp_src/complex /^ complex::operator\/=(float __f)$/;" f class:std::complex signature:(float __f) +std::complex::operator /= cpp_src/complex /^ complex::operator\/=(long double __r)$/;" f class:std::complex signature:(long double __r) +std::complex::operator = cpp_src/complex /^ complex<_Tp>& operator=(const complex<_Up>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Up>&) +std::complex::operator = cpp_src/complex /^ complex& operator=(const complex<_Tp>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Tp>&) +std::complex::operator = cpp_src/complex /^ complex&operator=(const complex<_Tp>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Tp>&) +std::complex::operator = cpp_src/complex /^ complex& operator=(const complex<_Tp>&);$/;" p struct:std::complex file: access:public signature:(const complex<_Tp>&) +std::complex::operator = cpp_src/complex /^ complex<_Tp>& operator=(const _Tp&);$/;" p struct:std::complex file: access:public signature:(const _Tp&) +std::complex::operator = cpp_src/complex /^ complex& operator=(double);$/;" p struct:std::complex file: access:public signature:(double) +std::complex::operator = cpp_src/complex /^ complex& operator=(float);$/;" p struct:std::complex file: access:public signature:(float) +std::complex::operator = cpp_src/complex /^ complex& operator= (long double);$/;" p struct:std::complex file: access:public signature:(long double) +std::complex::operator = cpp_src/complex /^ complex<_Tp>::operator=(const _Tp& __t)$/;" f class:std::complex signature:(const _Tp& __t) +std::complex::operator = cpp_src/complex /^ complex<_Tp>::operator=(const complex<_Up>& __z)$/;" f class:std::complex signature:(const complex<_Up>& __z) +std::complex::operator = cpp_src/complex /^ complex::operator=(const complex<_Tp>& __z)$/;" f class:std::complex signature:(const complex<_Tp>& __z) +std::complex::operator = cpp_src/complex /^ complex::operator=(const complex<_Tp>& __z)$/;" f class:std::complex signature:(const complex<_Tp>& __z) +std::complex::operator = cpp_src/complex /^ complex::operator=(double __d)$/;" f class:std::complex signature:(double __d) +std::complex::operator = cpp_src/complex /^ complex::operator=(const complex<_Tp>& __z)$/;" f class:std::complex signature:(const complex<_Tp>& __z) +std::complex::operator = cpp_src/complex /^ complex::operator=(float __f)$/;" f class:std::complex signature:(float __f) +std::complex::operator = cpp_src/complex /^ complex::operator=(long double __r)$/;" f class:std::complex signature:(long double __r) +std::complex::real cpp_src/complex /^ _Tp& real(); $/;" p struct:std::complex file: access:public signature:() +std::complex::real cpp_src/complex /^ const _Tp& real() const;$/;" p struct:std::complex file: access:public signature:() const +std::complex::real cpp_src/complex /^ const double& real() const;$/;" p struct:std::complex file: access:public signature:() const +std::complex::real cpp_src/complex /^ const float& real() const;$/;" p struct:std::complex file: access:public signature:() const +std::complex::real cpp_src/complex /^ const long double& real() const;$/;" p struct:std::complex file: access:public signature:() const +std::complex::real cpp_src/complex /^ double& real();$/;" p struct:std::complex file: access:public signature:() +std::complex::real cpp_src/complex /^ float& real();$/;" p struct:std::complex file: access:public signature:() +std::complex::real cpp_src/complex /^ long double& real();$/;" p struct:std::complex file: access:public signature:() +std::complex::real cpp_src/complex /^ complex<_Tp>::real() const { return _M_real; }$/;" f class:std::complex signature:() const +std::complex::real cpp_src/complex /^ complex<_Tp>::real() { return _M_real; }$/;" f class:std::complex signature:() +std::complex::real cpp_src/complex /^ complex::real() const$/;" f class:std::complex signature:() const +std::complex::real cpp_src/complex /^ complex::real()$/;" f class:std::complex signature:() +std::complex::real cpp_src/complex /^ complex::real() const$/;" f class:std::complex signature:() const +std::complex::real cpp_src/complex /^ complex::real()$/;" f class:std::complex signature:() +std::complex::real cpp_src/complex /^ complex::real() const$/;" f class:std::complex signature:() const +std::complex::real cpp_src/complex /^ complex::real()$/;" f class:std::complex signature:() +std::complex::value_type cpp_src/complex /^ typedef _Tp value_type;$/;" t struct:std::complex file: access:public +std::complex::value_type cpp_src/complex /^ typedef double value_type;$/;" t struct:std::complex file: access:public +std::complex::value_type cpp_src/complex /^ typedef float value_type;$/;" t struct:std::complex file: access:public +std::complex::value_type cpp_src/complex /^ typedef long double value_type;$/;" t struct:std::complex file: access:public +std::conj cpp_src/complex /^ conj(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::conj cpp_src/complex /^ template complex<_Tp> conj(const complex<_Tp>&);$/;" p namespace:std file: signature:(const complex<_Tp>&) +std::const_mem_fun1_ref_t cpp_src/stl_function.h /^ class const_mem_fun1_ref_t : public binary_function<_Tp, _Arg, _Ret>$/;" c namespace:std inherits:binary_function +std::const_mem_fun1_ref_t::_M_f cpp_src/stl_function.h /^ _Ret (_Tp::*_M_f)(_Arg) const;$/;" m class:std::const_mem_fun1_ref_t access:private +std::const_mem_fun1_ref_t::_Ret cpp_src/stl_function.h /^ const_mem_fun1_ref_t(_Ret (_Tp::*__pf)(_Arg) const)$/;" f class:std::const_mem_fun1_ref_t access:public signature:(_Tp::*__pf) const +std::const_mem_fun1_ref_t::operator () cpp_src/stl_function.h /^ operator()(const _Tp& __r, _Arg __x) const$/;" f class:std::const_mem_fun1_ref_t access:public signature:(const _Tp& __r, _Arg __x) const +std::const_mem_fun1_t cpp_src/stl_function.h /^ class const_mem_fun1_t : public binary_function$/;" c namespace:std inherits:binary_function +std::const_mem_fun1_t::_M_f cpp_src/stl_function.h /^ _Ret (_Tp::*_M_f)(_Arg) const;$/;" m class:std::const_mem_fun1_t access:private +std::const_mem_fun1_t::_Ret cpp_src/stl_function.h /^ const_mem_fun1_t(_Ret (_Tp::*__pf)(_Arg) const)$/;" f class:std::const_mem_fun1_t access:public signature:(_Tp::*__pf) const +std::const_mem_fun1_t::operator () cpp_src/stl_function.h /^ operator()(const _Tp* __p, _Arg __x) const$/;" f class:std::const_mem_fun1_t access:public signature:(const _Tp* __p, _Arg __x) const +std::const_mem_fun_ref_t cpp_src/stl_function.h /^ class const_mem_fun_ref_t : public unary_function<_Tp, _Ret>$/;" c namespace:std inherits:unary_function +std::const_mem_fun_ref_t::_M_f cpp_src/stl_function.h /^ _Ret (_Tp::*_M_f)() const;$/;" m class:std::const_mem_fun_ref_t access:private +std::const_mem_fun_ref_t::_Ret cpp_src/stl_function.h /^ const_mem_fun_ref_t(_Ret (_Tp::*__pf)() const)$/;" f class:std::const_mem_fun_ref_t access:public signature:(_Tp::*__pf) const +std::const_mem_fun_ref_t::operator () cpp_src/stl_function.h /^ operator()(const _Tp& __r) const$/;" f class:std::const_mem_fun_ref_t access:public signature:(const _Tp& __r) const +std::const_mem_fun_t cpp_src/stl_function.h /^ class const_mem_fun_t : public unary_function$/;" c namespace:std inherits:unary_function +std::const_mem_fun_t::_M_f cpp_src/stl_function.h /^ _Ret (_Tp::*_M_f)() const;$/;" m class:std::const_mem_fun_t access:private +std::const_mem_fun_t::_Ret cpp_src/stl_function.h /^ const_mem_fun_t(_Ret (_Tp::*__pf)() const)$/;" f class:std::const_mem_fun_t access:public signature:(_Tp::*__pf) const +std::const_mem_fun_t::operator () cpp_src/stl_function.h /^ operator()(const _Tp* __p) const$/;" f class:std::const_mem_fun_t access:public signature:(const _Tp* __p) const +std::copy cpp_src/stl_algobase.h /^ copy(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _OutputIterator __result) +std::copy cpp_src/stl_algobase.h /^ copy(istreambuf_iterator<_CharT>, istreambuf_iterator<_CharT>,$/;" p namespace:std signature:(istreambuf_iterator<_CharT>, istreambuf_iterator<_CharT>, ostreambuf_iterator<_CharT>) +std::copy cpp_src/streambuf_iterator.h /^ copy(istreambuf_iterator<_CharT> __first,$/;" f namespace:std signature:(istreambuf_iterator<_CharT> __first, istreambuf_iterator<_CharT> __last, ostreambuf_iterator<_CharT> __result) +std::copy_backward cpp_src/stl_algobase.h /^ copy_backward(_BI1 __first, _BI1 __last, _BI2 __result)$/;" f namespace:std signature:(_BI1 __first, _BI1 __last, _BI2 __result) +std::cos cpp_src/cmath /^ cos(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +std::cos cpp_src/cmath /^ cos(float __x)$/;" f namespace:std signature:(float __x) +std::cos cpp_src/cmath /^ cos(long double __x)$/;" f namespace:std signature:(long double __x) +std::cos cpp_src/complex /^ cos(const complex<_Tp>& __z) { return __complex_cos(__z); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::cos cpp_src/complex /^ cos(const complex<_Tp>& __z) { return __complex_cos(__z.__rep()); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::cos cpp_src/complex /^ template complex<_Tp> cos(const complex<_Tp>&);$/;" p namespace:std file: signature:(const complex<_Tp>&) +std::cosh cpp_src/cmath /^ cosh(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +std::cosh cpp_src/cmath /^ cosh(float __x)$/;" f namespace:std signature:(float __x) +std::cosh cpp_src/cmath /^ cosh(long double __x)$/;" f namespace:std signature:(long double __x) +std::cosh cpp_src/complex /^ cosh(const complex<_Tp>& __z) { return __complex_cosh(__z); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::cosh cpp_src/complex /^ cosh(const complex<_Tp>& __z) { return __complex_cosh(__z.__rep()); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::cosh cpp_src/complex /^ template complex<_Tp> cosh(const complex<_Tp>&);$/;" p namespace:std file: signature:(const complex<_Tp>&) +std::count cpp_src/stl_algo.h /^ count(_InputIterator __first, _InputIterator __last, const _Tp& __value)$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, const _Tp& __value) +std::count_if cpp_src/stl_algo.h /^ count_if(_InputIterator __first, _InputIterator __last, _Predicate __pred)$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _Predicate __pred) +std::cout cpp_src/iostream /^ static ostream cout; \/\/\/< Linked to standard output$/;" m namespace:std file: +std::ctype cpp_src/locale_facets.h /^ class ctype : public __ctype_abstract_base<_CharT>$/;" c namespace:std inherits:__ctype_abstract_base +std::ctype cpp_src/locale_facets.h /^ class ctype : public locale::facet, public ctype_base$/;" c namespace:std inherits:locale::facet,ctype_base +std::ctype cpp_src/locale_facets.h /^ class ctype : public __ctype_abstract_base$/;" c namespace:std inherits:__ctype_abstract_base +std::ctype::_M_bit cpp_src/locale_facets.h /^ mask _M_bit[16];$/;" m class:std::ctype access:protected +std::ctype::_M_c_locale_ctype cpp_src/locale_facets.h /^ __c_locale _M_c_locale_ctype;$/;" m class:std::ctype access:protected +std::ctype::_M_convert_to_wmask cpp_src/locale_facets.h /^ _M_convert_to_wmask(const mask __m) const;$/;" p class:std::ctype access:protected signature:(const mask __m) const +std::ctype::_M_del cpp_src/locale_facets.h /^ bool _M_del;$/;" m class:std::ctype access:protected +std::ctype::_M_initialize_ctype cpp_src/locale_facets.h /^ _M_initialize_ctype();$/;" p class:std::ctype access:protected signature:() +std::ctype::_M_narrow cpp_src/locale_facets.h /^ char _M_narrow[128];$/;" m class:std::ctype access:protected +std::ctype::_M_narrow cpp_src/locale_facets.h /^ mutable char _M_narrow[1 + static_cast(-1)];$/;" m class:std::ctype access:protected +std::ctype::_M_narrow_init cpp_src/locale_facets.h /^ void _M_narrow_init() const$/;" f class:std::ctype access:private signature:() const +std::ctype::_M_narrow_ok cpp_src/locale_facets.h /^ bool _M_narrow_ok;$/;" m class:std::ctype access:protected +std::ctype::_M_narrow_ok cpp_src/locale_facets.h /^ mutable char _M_narrow_ok; \/\/ 0 uninitialized, 1 init,$/;" m class:std::ctype access:protected +std::ctype::_M_table cpp_src/locale_facets.h /^ const mask* _M_table;$/;" m class:std::ctype access:protected +std::ctype::_M_tolower cpp_src/locale_facets.h /^ __to_type _M_tolower;$/;" m class:std::ctype access:protected +std::ctype::_M_toupper cpp_src/locale_facets.h /^ __to_type _M_toupper;$/;" m class:std::ctype access:protected +std::ctype::_M_widen cpp_src/locale_facets.h /^ mutable char _M_widen[1 + static_cast(-1)];$/;" m class:std::ctype access:protected +std::ctype::_M_widen cpp_src/locale_facets.h /^ wint_t _M_widen[1 + static_cast(-1)];$/;" m class:std::ctype access:protected +std::ctype::_M_widen_init cpp_src/locale_facets.h /^ void _M_widen_init() const$/;" f class:std::ctype access:private signature:() const +std::ctype::_M_widen_ok cpp_src/locale_facets.h /^ mutable char _M_widen_ok;$/;" m class:std::ctype access:protected +std::ctype::_M_wmask cpp_src/locale_facets.h /^ __wmask_type _M_wmask[16];$/;" m class:std::ctype access:protected +std::ctype::__wmask_type cpp_src/locale_facets.h /^ typedef wctype_t __wmask_type;$/;" t class:std::ctype access:public +std::ctype::char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::ctype access:public +std::ctype::char_type cpp_src/locale_facets.h /^ typedef char char_type;$/;" t class:std::ctype access:public +std::ctype::char_type cpp_src/locale_facets.h /^ typedef wchar_t char_type;$/;" t class:std::ctype access:public +std::ctype::classic_table cpp_src/locale_facets.h /^ classic_table() throw();$/;" p class:std::ctype access:protected signature:() +std::ctype::ctype cpp_src/locale_facets.h /^ ctype(__c_locale __cloc, const mask* __table = 0, bool __del = false,$/;" p class:std::ctype access:public signature:(__c_locale __cloc, const mask* __table = 0, bool __del = false, size_t __refs = 0) +std::ctype::ctype cpp_src/locale_facets.h /^ ctype(__c_locale __cloc, size_t __refs = 0);$/;" p class:std::ctype access:public signature:(__c_locale __cloc, size_t __refs = 0) +std::ctype::ctype cpp_src/locale_facets.h /^ ctype(const mask* __table = 0, bool __del = false, size_t __refs = 0);$/;" p class:std::ctype access:public signature:(const mask* __table = 0, bool __del = false, size_t __refs = 0) +std::ctype::ctype cpp_src/locale_facets.h /^ ctype(size_t __refs = 0) : __ctype_abstract_base<_CharT>(__refs) { }$/;" f class:std::ctype access:public signature:(size_t __refs = 0) +std::ctype::ctype cpp_src/locale_facets.h /^ ctype(size_t __refs = 0);$/;" p class:std::ctype access:public signature:(size_t __refs = 0) +std::ctype::do_is cpp_src/locale_facets.h /^ do_is(const char_type* __lo, const char_type* __hi, mask* __vec) const;$/;" p class:std::ctype access:protected signature:(const char_type* __lo, const char_type* __hi, mask* __vec) const +std::ctype::do_is cpp_src/locale_facets.h /^ do_is(mask __m, char_type __c) const;$/;" p class:std::ctype access:protected signature:(mask __m, char_type __c) const +std::ctype::do_narrow cpp_src/locale_facets.h /^ do_narrow(char_type __c, char) const$/;" f class:std::ctype access:protected signature:(char_type __c, char) const +std::ctype::do_narrow cpp_src/locale_facets.h /^ do_narrow(char_type, char __dfault) const;$/;" p class:std::ctype access:protected signature:(char_type, char __dfault) const +std::ctype::do_narrow cpp_src/locale_facets.h /^ do_narrow(const char_type* __lo, const char_type* __hi,$/;" f class:std::ctype access:protected signature:(const char_type* __lo, const char_type* __hi, char, char* __dest) const +std::ctype::do_narrow cpp_src/locale_facets.h /^ do_narrow(const char_type* __lo, const char_type* __hi,$/;" p class:std::ctype access:protected signature:(const char_type* __lo, const char_type* __hi, char __dfault, char* __dest) const +std::ctype::do_scan_is cpp_src/locale_facets.h /^ do_scan_is(mask __m, const char_type* __lo, const char_type* __hi) const;$/;" p class:std::ctype access:protected signature:(mask __m, const char_type* __lo, const char_type* __hi) const +std::ctype::do_scan_not cpp_src/locale_facets.h /^ do_scan_not(mask __m, const char_type* __lo,$/;" p class:std::ctype access:protected signature:(mask __m, const char_type* __lo, const char_type* __hi) const +std::ctype::do_tolower cpp_src/locale_facets.h /^ do_tolower(char_type __c) const;$/;" p class:std::ctype access:protected signature:(char_type __c) const +std::ctype::do_tolower cpp_src/locale_facets.h /^ do_tolower(char_type) const;$/;" p class:std::ctype access:protected signature:(char_type) const +std::ctype::do_tolower cpp_src/locale_facets.h /^ do_tolower(char_type* __lo, const char_type* __hi) const;$/;" p class:std::ctype access:protected signature:(char_type* __lo, const char_type* __hi) const +std::ctype::do_toupper cpp_src/locale_facets.h /^ do_toupper(char_type __c) const;$/;" p class:std::ctype access:protected signature:(char_type __c) const +std::ctype::do_toupper cpp_src/locale_facets.h /^ do_toupper(char_type) const;$/;" p class:std::ctype access:protected signature:(char_type) const +std::ctype::do_toupper cpp_src/locale_facets.h /^ do_toupper(char_type* __lo, const char_type* __hi) const;$/;" p class:std::ctype access:protected signature:(char_type* __lo, const char_type* __hi) const +std::ctype::do_widen cpp_src/locale_facets.h /^ do_widen(char __c) const$/;" f class:std::ctype access:protected signature:(char __c) const +std::ctype::do_widen cpp_src/locale_facets.h /^ do_widen(char __c) const;$/;" p class:std::ctype access:protected signature:(char __c) const +std::ctype::do_widen cpp_src/locale_facets.h /^ do_widen(char) const;$/;" p class:std::ctype access:protected signature:(char) const +std::ctype::do_widen cpp_src/locale_facets.h /^ do_widen(const char* __lo, const char* __hi, char_type* __dest) const$/;" f class:std::ctype access:protected signature:(const char* __lo, const char* __hi, char_type* __dest) const +std::ctype::do_widen cpp_src/locale_facets.h /^ do_widen(const char* __lo, const char* __hi, char_type* __dest) const;$/;" p class:std::ctype access:protected signature:(const char* __lo, const char* __hi, char_type* __dest) const +std::ctype::id cpp_src/locale_facets.h /^ static locale::id id;$/;" m class:std::ctype access:public +std::ctype::id cpp_src/locale_facets.h /^ static locale::id id;$/;" m class:std::ctype access:public +std::ctype::id cpp_src/locale_facets.h /^ static locale::id id;$/;" m class:std::ctype access:public +std::ctype::id cpp_src/locale_facets.h /^ locale::id ctype<_CharT>::id;$/;" m class:std::ctype +std::ctype::is cpp_src/locale_facets.h /^ is(const char* __lo, const char* __hi, mask* __vec) const;$/;" p class:std::ctype access:public signature:(const char* __lo, const char* __hi, mask* __vec) const +std::ctype::is cpp_src/locale_facets.h /^ is(mask __m, char __c) const;$/;" p class:std::ctype access:public signature:(mask __m, char __c) const +std::ctype::mask cpp_src/locale_facets.h /^ typedef typename __ctype_abstract_base<_CharT>::mask mask;$/;" t class:std::ctype access:public +std::ctype::narrow cpp_src/locale_facets.h /^ narrow(char_type __c, char __dfault) const$/;" f class:std::ctype access:public signature:(char_type __c, char __dfault) const +std::ctype::narrow cpp_src/locale_facets.h /^ narrow(const char_type* __lo, const char_type* __hi,$/;" f class:std::ctype access:public signature:(const char_type* __lo, const char_type* __hi, char __dfault, char *__to) const +std::ctype::scan_is cpp_src/locale_facets.h /^ scan_is(mask __m, const char* __lo, const char* __hi) const;$/;" p class:std::ctype access:public signature:(mask __m, const char* __lo, const char* __hi) const +std::ctype::scan_not cpp_src/locale_facets.h /^ scan_not(mask __m, const char* __lo, const char* __hi) const;$/;" p class:std::ctype access:public signature:(mask __m, const char* __lo, const char* __hi) const +std::ctype::table cpp_src/locale_facets.h /^ table() const throw()$/;" f class:std::ctype access:protected signature:() const +std::ctype::table_size cpp_src/locale_facets.h /^ static const size_t table_size = 1 + static_cast(-1);$/;" m class:std::ctype access:public +std::ctype::tolower cpp_src/locale_facets.h /^ tolower(char_type __c) const$/;" f class:std::ctype access:public signature:(char_type __c) const +std::ctype::tolower cpp_src/locale_facets.h /^ tolower(char_type* __lo, const char_type* __hi) const$/;" f class:std::ctype access:public signature:(char_type* __lo, const char_type* __hi) const +std::ctype::toupper cpp_src/locale_facets.h /^ toupper(char_type *__lo, const char_type* __hi) const$/;" f class:std::ctype access:public signature:(char_type *__lo, const char_type* __hi) const +std::ctype::toupper cpp_src/locale_facets.h /^ toupper(char_type __c) const$/;" f class:std::ctype access:public signature:(char_type __c) const +std::ctype::widen cpp_src/locale_facets.h /^ widen(char __c) const$/;" f class:std::ctype access:public signature:(char __c) const +std::ctype::widen cpp_src/locale_facets.h /^ widen(const char* __lo, const char* __hi, char_type* __to) const$/;" f class:std::ctype access:public signature:(const char* __lo, const char* __hi, char_type* __to) const +std::ctype::~ctype cpp_src/locale_facets.h /^ ~ctype();$/;" p class:std::ctype access:protected signature:() +std::ctype_byname cpp_src/locale_facets.h /^ class ctype_byname : public ctype<_CharT>$/;" c namespace:std inherits:ctype +std::ctype_byname::char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::ctype_byname access:public +std::ctype_byname::ctype_byname cpp_src/locale_facets.h /^ ctype_byname(const char* __s, size_t __refs = 0);$/;" p class:std::ctype_byname access:public signature:(const char* __s, size_t __refs = 0) +std::ctype_byname::ctype_byname cpp_src/locale_facets.h /^ ctype_byname::ctype_byname(const char*, size_t refs);$/;" p class:std::ctype_byname signature:(const char*, size_t refs) +std::ctype_byname::ctype_byname cpp_src/locale_facets.h /^ ctype_byname::ctype_byname(const char*, size_t refs);$/;" p class:std::ctype_byname signature:(const char*, size_t refs) +std::ctype_byname::~ctype_byname cpp_src/locale_facets.h /^ ~ctype_byname() { };$/;" f class:std::ctype_byname access:protected signature:() +std::dec cpp_src/ios_base.h /^ dec(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +std::denorm_absent cpp_src/limits /^ denorm_absent = 0,$/;" e enum:std::float_denorm_style file: +std::denorm_indeterminate cpp_src/limits /^ denorm_indeterminate = -1,$/;" e enum:std::float_denorm_style file: +std::denorm_present cpp_src/limits /^ denorm_present = 1$/;" e enum:std::float_denorm_style file: +std::deque cpp_src/stl_deque.h /^ class deque : protected _Deque_base<_Tp, _Alloc>$/;" c namespace:std inherits:_Deque_base +std::deque::_Alloc_value_type cpp_src/stl_deque.h /^ typedef typename _Alloc::value_type _Alloc_value_type;$/;" t class:std::deque access:private +std::deque::_Base cpp_src/stl_deque.h /^ typedef _Deque_base<_Tp, _Alloc> _Base;$/;" t class:std::deque access:private +std::deque::_M_assign_aux cpp_src/deque.tcc /^ _M_assign_aux(_InputIterator __first, _InputIterator __last,$/;" f class:std::deque signature:(_InputIterator __first, _InputIterator __last, std::input_iterator_tag) +std::deque::_M_assign_aux cpp_src/stl_deque.h /^ _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,$/;" f class:std::deque access:protected signature:(_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) +std::deque::_M_assign_aux cpp_src/stl_deque.h /^ _M_assign_aux(_InputIterator __first, _InputIterator __last,$/;" p class:std::deque access:protected signature:(_InputIterator __first, _InputIterator __last, std::input_iterator_tag) +std::deque::_M_assign_dispatch cpp_src/stl_deque.h /^ _M_assign_dispatch(_InputIterator __first, _InputIterator __last,$/;" f class:std::deque access:protected signature:(_InputIterator __first, _InputIterator __last, __false_type) +std::deque::_M_assign_dispatch cpp_src/stl_deque.h /^ _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)$/;" f class:std::deque access:protected signature:(_Integer __n, _Integer __val, __true_type) +std::deque::_M_destroy_data cpp_src/stl_deque.h /^ _M_destroy_data(iterator __first, iterator __last, const _Alloc1&)$/;" f class:std::deque access:protected signature:(iterator __first, iterator __last, const _Alloc1&) +std::deque::_M_destroy_data cpp_src/stl_deque.h /^ _M_destroy_data(iterator __first, iterator __last,$/;" f class:std::deque access:protected signature:(iterator __first, iterator __last, const std::allocator<_Tp>&) +std::deque::_M_destroy_data_aux cpp_src/deque.tcc /^ _M_destroy_data_aux(iterator __first, iterator __last)$/;" f class:std::deque signature:(iterator __first, iterator __last) +std::deque::_M_destroy_data_aux cpp_src/stl_deque.h /^ _M_destroy_data_aux(iterator __first, iterator __last);$/;" p class:std::deque access:protected signature:(iterator __first, iterator __last) +std::deque::_M_destroy_data_dispatch cpp_src/stl_deque.h /^ _M_destroy_data_dispatch(iterator __first, iterator __last, __false_type)$/;" f class:std::deque access:protected signature:(iterator __first, iterator __last, __false_type) +std::deque::_M_destroy_data_dispatch cpp_src/stl_deque.h /^ _M_destroy_data_dispatch(iterator, iterator, __true_type) { }$/;" f class:std::deque access:protected signature:(iterator, iterator, __true_type) +std::deque::_M_erase_at_begin cpp_src/stl_deque.h /^ _M_erase_at_begin(iterator __pos)$/;" f class:std::deque access:protected signature:(iterator __pos) +std::deque::_M_erase_at_end cpp_src/stl_deque.h /^ _M_erase_at_end(iterator __pos)$/;" f class:std::deque access:protected signature:(iterator __pos) +std::deque::_M_fill_assign cpp_src/stl_deque.h /^ _M_fill_assign(size_type __n, const value_type& __val)$/;" f class:std::deque access:protected signature:(size_type __n, const value_type& __val) +std::deque::_M_fill_initialize cpp_src/deque.tcc /^ _M_fill_initialize(const value_type& __value)$/;" f class:std::deque signature:(const value_type& __value) +std::deque::_M_fill_initialize cpp_src/stl_deque.h /^ _M_fill_initialize(const value_type& __value);$/;" p class:std::deque access:protected signature:(const value_type& __value) +std::deque::_M_fill_insert cpp_src/deque.tcc /^ _M_fill_insert(iterator __pos, size_type __n, const value_type& __x)$/;" f class:std::deque signature:(iterator __pos, size_type __n, const value_type& __x) +std::deque::_M_fill_insert cpp_src/stl_deque.h /^ _M_fill_insert(iterator __pos, size_type __n, const value_type& __x);$/;" p class:std::deque access:protected signature:(iterator __pos, size_type __n, const value_type& __x) +std::deque::_M_initialize_dispatch cpp_src/stl_deque.h /^ _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,$/;" f class:std::deque access:protected signature:(_InputIterator __first, _InputIterator __last, __false_type) +std::deque::_M_initialize_dispatch cpp_src/stl_deque.h /^ _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type)$/;" f class:std::deque access:protected signature:(_Integer __n, _Integer __x, __true_type) +std::deque::_M_insert_aux cpp_src/deque.tcc /^ _M_insert_aux(iterator __pos,$/;" f class:std::deque signature:(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, size_type __n) +std::deque::_M_insert_aux cpp_src/deque.tcc /^ _M_insert_aux(iterator __pos, const value_type& __x)$/;" f class:std::deque signature:(iterator __pos, const value_type& __x) +std::deque::_M_insert_aux cpp_src/deque.tcc /^ _M_insert_aux(iterator __pos, size_type __n, const value_type& __x)$/;" f class:std::deque signature:(iterator __pos, size_type __n, const value_type& __x) +std::deque::_M_insert_aux cpp_src/stl_deque.h /^ _M_insert_aux(iterator __pos,$/;" p class:std::deque access:protected signature:(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, size_type __n) +std::deque::_M_insert_aux cpp_src/stl_deque.h /^ _M_insert_aux(iterator __pos, const value_type& __x);$/;" p class:std::deque access:protected signature:(iterator __pos, const value_type& __x) +std::deque::_M_insert_aux cpp_src/stl_deque.h /^ _M_insert_aux(iterator __pos, size_type __n, const value_type& __x);$/;" p class:std::deque access:protected signature:(iterator __pos, size_type __n, const value_type& __x) +std::deque::_M_insert_dispatch cpp_src/stl_deque.h /^ _M_insert_dispatch(iterator __pos,$/;" f class:std::deque access:protected signature:(iterator __pos, _InputIterator __first, _InputIterator __last, __false_type) +std::deque::_M_insert_dispatch cpp_src/stl_deque.h /^ _M_insert_dispatch(iterator __pos,$/;" f class:std::deque access:protected signature:(iterator __pos, _Integer __n, _Integer __x, __true_type) +std::deque::_M_new_elements_at_back cpp_src/deque.tcc /^ _M_new_elements_at_back(size_type __new_elems)$/;" f class:std::deque signature:(size_type __new_elems) +std::deque::_M_new_elements_at_back cpp_src/stl_deque.h /^ _M_new_elements_at_back(size_type __new_elements);$/;" p class:std::deque access:protected signature:(size_type __new_elements) +std::deque::_M_new_elements_at_front cpp_src/deque.tcc /^ _M_new_elements_at_front(size_type __new_elems)$/;" f class:std::deque signature:(size_type __new_elems) +std::deque::_M_new_elements_at_front cpp_src/stl_deque.h /^ _M_new_elements_at_front(size_type __new_elements);$/;" p class:std::deque access:protected signature:(size_type __new_elements) +std::deque::_M_pop_back_aux cpp_src/deque.tcc /^ _M_pop_back_aux()$/;" f class:std::deque signature:() +std::deque::_M_pop_back_aux cpp_src/stl_deque.h /^ void _M_pop_back_aux();$/;" p class:std::deque access:protected signature:() +std::deque::_M_pop_front_aux cpp_src/deque.tcc /^ _M_pop_front_aux()$/;" f class:std::deque signature:() +std::deque::_M_pop_front_aux cpp_src/stl_deque.h /^ void _M_pop_front_aux();$/;" p class:std::deque access:protected signature:() +std::deque::_M_push_back_aux cpp_src/deque.tcc /^ _M_push_back_aux(const value_type& __t)$/;" f class:std::deque signature:(const value_type& __t) +std::deque::_M_push_back_aux cpp_src/stl_deque.h /^ void _M_push_back_aux(const value_type&);$/;" p class:std::deque access:protected signature:(const value_type&) +std::deque::_M_push_front_aux cpp_src/deque.tcc /^ _M_push_front_aux(const value_type& __t)$/;" f class:std::deque signature:(const value_type& __t) +std::deque::_M_push_front_aux cpp_src/stl_deque.h /^ void _M_push_front_aux(const value_type&);$/;" p class:std::deque access:protected signature:(const value_type&) +std::deque::_M_range_check cpp_src/stl_deque.h /^ _M_range_check(size_type __n) const$/;" f class:std::deque access:protected signature:(size_type __n) const +std::deque::_M_range_initialize cpp_src/deque.tcc /^ _M_range_initialize(_ForwardIterator __first, _ForwardIterator __last,$/;" f class:std::deque signature:(_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) +std::deque::_M_range_initialize cpp_src/deque.tcc /^ _M_range_initialize(_InputIterator __first, _InputIterator __last,$/;" f class:std::deque signature:(_InputIterator __first, _InputIterator __last, std::input_iterator_tag) +std::deque::_M_range_initialize cpp_src/stl_deque.h /^ _M_range_initialize(_ForwardIterator __first, _ForwardIterator __last,$/;" p class:std::deque access:protected signature:(_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) +std::deque::_M_range_initialize cpp_src/stl_deque.h /^ _M_range_initialize(_InputIterator __first, _InputIterator __last,$/;" p class:std::deque access:protected signature:(_InputIterator __first, _InputIterator __last, std::input_iterator_tag) +std::deque::_M_range_insert_aux cpp_src/deque.tcc /^ _M_range_insert_aux(iterator __pos,$/;" f class:std::deque signature:(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) +std::deque::_M_range_insert_aux cpp_src/deque.tcc /^ _M_range_insert_aux(iterator __pos,$/;" f class:std::deque signature:(iterator __pos, _InputIterator __first, _InputIterator __last, std::input_iterator_tag) +std::deque::_M_range_insert_aux cpp_src/stl_deque.h /^ _M_range_insert_aux(iterator __pos, _ForwardIterator __first,$/;" p class:std::deque access:protected signature:(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) +std::deque::_M_range_insert_aux cpp_src/stl_deque.h /^ _M_range_insert_aux(iterator __pos, _InputIterator __first,$/;" p class:std::deque access:protected signature:(iterator __pos, _InputIterator __first, _InputIterator __last, std::input_iterator_tag) +std::deque::_M_reallocate_map cpp_src/deque.tcc /^ _M_reallocate_map(size_type __nodes_to_add, bool __add_at_front)$/;" f class:std::deque signature:(size_type __nodes_to_add, bool __add_at_front) +std::deque::_M_reallocate_map cpp_src/stl_deque.h /^ _M_reallocate_map(size_type __nodes_to_add, bool __add_at_front);$/;" p class:std::deque access:protected signature:(size_type __nodes_to_add, bool __add_at_front) +std::deque::_M_reserve_elements_at_back cpp_src/stl_deque.h /^ _M_reserve_elements_at_back(size_type __n)$/;" f class:std::deque access:protected signature:(size_type __n) +std::deque::_M_reserve_elements_at_front cpp_src/stl_deque.h /^ _M_reserve_elements_at_front(size_type __n)$/;" f class:std::deque access:protected signature:(size_type __n) +std::deque::_M_reserve_map_at_back cpp_src/stl_deque.h /^ _M_reserve_map_at_back(size_type __nodes_to_add = 1)$/;" f class:std::deque access:protected signature:(size_type __nodes_to_add = 1) +std::deque::_M_reserve_map_at_front cpp_src/stl_deque.h /^ _M_reserve_map_at_front(size_type __nodes_to_add = 1)$/;" f class:std::deque access:protected signature:(size_type __nodes_to_add = 1) +std::deque::_Map_pointer cpp_src/stl_deque.h /^ typedef pointer* _Map_pointer;$/;" t class:std::deque access:protected +std::deque::_S_buffer_size cpp_src/stl_deque.h /^ static size_t _S_buffer_size()$/;" f class:std::deque access:protected signature:() +std::deque::_Tp_alloc_type cpp_src/stl_deque.h /^ typedef typename _Base::_Tp_alloc_type _Tp_alloc_type;$/;" t class:std::deque access:private +std::deque::allocator_type cpp_src/stl_deque.h /^ typedef _Alloc allocator_type;$/;" t class:std::deque access:public +std::deque::assign cpp_src/stl_deque.h /^ assign(_InputIterator __first, _InputIterator __last)$/;" f class:std::deque access:public signature:(_InputIterator __first, _InputIterator __last) +std::deque::assign cpp_src/stl_deque.h /^ assign(size_type __n, const value_type& __val)$/;" f class:std::deque access:public signature:(size_type __n, const value_type& __val) +std::deque::at cpp_src/stl_deque.h /^ at(size_type __n) const$/;" f class:std::deque access:public signature:(size_type __n) const +std::deque::at cpp_src/stl_deque.h /^ at(size_type __n)$/;" f class:std::deque access:public signature:(size_type __n) +std::deque::back cpp_src/stl_deque.h /^ back() const$/;" f class:std::deque access:public signature:() const +std::deque::back cpp_src/stl_deque.h /^ back()$/;" f class:std::deque access:public signature:() +std::deque::begin cpp_src/stl_deque.h /^ begin() const$/;" f class:std::deque access:public signature:() const +std::deque::begin cpp_src/stl_deque.h /^ begin()$/;" f class:std::deque access:public signature:() +std::deque::clear cpp_src/stl_deque.h /^ clear()$/;" f class:std::deque access:public signature:() +std::deque::const_iterator cpp_src/stl_deque.h /^ typedef typename _Base::const_iterator const_iterator;$/;" t class:std::deque access:public +std::deque::const_pointer cpp_src/stl_deque.h /^ typedef typename _Tp_alloc_type::const_pointer const_pointer;$/;" t class:std::deque access:public +std::deque::const_reference cpp_src/stl_deque.h /^ typedef typename _Tp_alloc_type::const_reference const_reference;$/;" t class:std::deque access:public +std::deque::const_reverse_iterator cpp_src/stl_deque.h /^ typedef std::reverse_iterator const_reverse_iterator;$/;" t class:std::deque access:public +std::deque::deque cpp_src/stl_deque.h /^ deque(_InputIterator __first, _InputIterator __last,$/;" f class:std::deque access:public signature:(_InputIterator __first, _InputIterator __last, const allocator_type& __a = allocator_type()) +std::deque::deque cpp_src/stl_deque.h /^ deque(const allocator_type& __a = allocator_type())$/;" f class:std::deque access:public signature:(const allocator_type& __a = allocator_type()) +std::deque::deque cpp_src/stl_deque.h /^ deque(const deque& __x)$/;" f class:std::deque access:public signature:(const deque& __x) +std::deque::deque cpp_src/stl_deque.h /^ deque(size_type __n, const value_type& __value = value_type(),$/;" f class:std::deque access:public signature:(size_type __n, const value_type& __value = value_type(), const allocator_type& __a = allocator_type()) +std::deque::difference_type cpp_src/stl_deque.h /^ typedef ptrdiff_t difference_type;$/;" t class:std::deque access:public +std::deque::empty cpp_src/stl_deque.h /^ empty() const$/;" f class:std::deque access:public signature:() const +std::deque::end cpp_src/stl_deque.h /^ end() const$/;" f class:std::deque access:public signature:() const +std::deque::end cpp_src/stl_deque.h /^ end()$/;" f class:std::deque access:public signature:() +std::deque::erase cpp_src/deque.tcc /^ erase(iterator __first, iterator __last)$/;" f class:std::deque signature:(iterator __first, iterator __last) +std::deque::erase cpp_src/deque.tcc /^ erase(iterator __position)$/;" f class:std::deque signature:(iterator __position) +std::deque::erase cpp_src/stl_deque.h /^ erase(iterator __first, iterator __last);$/;" p class:std::deque access:public signature:(iterator __first, iterator __last) +std::deque::erase cpp_src/stl_deque.h /^ erase(iterator __position);$/;" p class:std::deque access:public signature:(iterator __position) +std::deque::front cpp_src/stl_deque.h /^ front() const$/;" f class:std::deque access:public signature:() const +std::deque::front cpp_src/stl_deque.h /^ front()$/;" f class:std::deque access:public signature:() +std::deque::get_allocator cpp_src/stl_deque.h /^ get_allocator() const$/;" f class:std::deque access:public signature:() const +std::deque::insert cpp_src/deque.tcc /^ insert(iterator __position, const value_type& __x)$/;" f class:std::deque signature:(iterator __position, const value_type& __x) +std::deque::insert cpp_src/stl_deque.h /^ insert(iterator __position, _InputIterator __first,$/;" f class:std::deque access:public signature:(iterator __position, _InputIterator __first, _InputIterator __last) +std::deque::insert cpp_src/stl_deque.h /^ insert(iterator __position, const value_type& __x);$/;" p class:std::deque access:public signature:(iterator __position, const value_type& __x) +std::deque::insert cpp_src/stl_deque.h /^ insert(iterator __position, size_type __n, const value_type& __x)$/;" f class:std::deque access:public signature:(iterator __position, size_type __n, const value_type& __x) +std::deque::iterator cpp_src/stl_deque.h /^ typedef typename _Base::iterator iterator;$/;" t class:std::deque access:public +std::deque::max_size cpp_src/stl_deque.h /^ max_size() const$/;" f class:std::deque access:public signature:() const +std::deque::operator = cpp_src/deque.tcc /^ operator=(const deque& __x)$/;" f class:std::deque signature:(const deque& __x) +std::deque::operator = cpp_src/stl_deque.h /^ operator=(const deque& __x);$/;" p class:std::deque access:public signature:(const deque& __x) +std::deque::operator [] cpp_src/stl_deque.h /^ operator[](size_type __n) const$/;" f class:std::deque access:public signature:(size_type __n) const +std::deque::operator [] cpp_src/stl_deque.h /^ operator[](size_type __n)$/;" f class:std::deque access:public signature:(size_type __n) +std::deque::pointer cpp_src/stl_deque.h /^ typedef typename _Tp_alloc_type::pointer pointer;$/;" t class:std::deque access:public +std::deque::pop_back cpp_src/stl_deque.h /^ pop_back()$/;" f class:std::deque access:public signature:() +std::deque::pop_front cpp_src/stl_deque.h /^ pop_front()$/;" f class:std::deque access:public signature:() +std::deque::push_back cpp_src/stl_deque.h /^ push_back(const value_type& __x)$/;" f class:std::deque access:public signature:(const value_type& __x) +std::deque::push_front cpp_src/stl_deque.h /^ push_front(const value_type& __x)$/;" f class:std::deque access:public signature:(const value_type& __x) +std::deque::rbegin cpp_src/stl_deque.h /^ rbegin() const$/;" f class:std::deque access:public signature:() const +std::deque::rbegin cpp_src/stl_deque.h /^ rbegin()$/;" f class:std::deque access:public signature:() +std::deque::reference cpp_src/stl_deque.h /^ typedef typename _Tp_alloc_type::reference reference;$/;" t class:std::deque access:public +std::deque::rend cpp_src/stl_deque.h /^ rend() const$/;" f class:std::deque access:public signature:() const +std::deque::rend cpp_src/stl_deque.h /^ rend()$/;" f class:std::deque access:public signature:() +std::deque::resize cpp_src/stl_deque.h /^ resize(size_type __new_size, value_type __x = value_type())$/;" f class:std::deque access:public signature:(size_type __new_size, value_type __x = value_type()) +std::deque::reverse_iterator cpp_src/stl_deque.h /^ typedef std::reverse_iterator reverse_iterator;$/;" t class:std::deque access:public +std::deque::size cpp_src/stl_deque.h /^ size() const$/;" f class:std::deque access:public signature:() const +std::deque::size_type cpp_src/stl_deque.h /^ typedef size_t size_type;$/;" t class:std::deque access:public +std::deque::swap cpp_src/stl_deque.h /^ swap(deque& __x)$/;" f class:std::deque access:public signature:(deque& __x) +std::deque::value_type cpp_src/stl_deque.h /^ typedef _Tp value_type;$/;" t class:std::deque access:public +std::deque::~deque cpp_src/stl_deque.h /^ ~deque()$/;" f class:std::deque access:public signature:() +std::distance cpp_src/stl_iterator_base_funcs.h /^ distance(_InputIterator __first, _InputIterator __last)$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last) +std::divides cpp_src/stl_function.h /^ struct divides : public binary_function<_Tp, _Tp, _Tp>$/;" s namespace:std inherits:binary_function +std::divides::operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::divides access:public signature:(const _Tp& __x, const _Tp& __y) const +std::domain_error cpp_src/stdexcept /^ class domain_error : public logic_error $/;" c namespace:std file: inherits:logic_error +std::domain_error::domain_error cpp_src/stdexcept /^ explicit domain_error(const string& __arg);$/;" p class:std::domain_error file: access:public signature:(const string& __arg) +std::endl cpp_src/ostream /^ endl(basic_ostream<_CharT, _Traits>& __os)$/;" f namespace:std signature:(basic_ostream<_CharT, _Traits>& __os) +std::endl cpp_src/ostream.tcc /^ extern template ostream& endl(ostream&);$/;" p namespace:std file: signature:(ostream&) +std::endl cpp_src/ostream.tcc /^ extern template wostream& endl(wostream&);$/;" p namespace:std file: signature:(wostream&) +std::ends cpp_src/ostream /^ ends(basic_ostream<_CharT, _Traits>& __os)$/;" f namespace:std signature:(basic_ostream<_CharT, _Traits>& __os) +std::ends cpp_src/ostream.tcc /^ extern template ostream& ends(ostream&);$/;" p namespace:std file: signature:(ostream&) +std::ends cpp_src/ostream.tcc /^ extern template wostream& ends(wostream&);$/;" p namespace:std file: signature:(wostream&) +std::equal cpp_src/stl_algobase.h /^ equal(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) +std::equal cpp_src/stl_algobase.h /^ equal(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __binary_pred) +std::equal_range cpp_src/stl_algo.h /^ equal_range(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val) +std::equal_range cpp_src/stl_algo.h /^ equal_range(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val, _Compare __comp) +std::equal_to cpp_src/stl_function.h /^ struct equal_to : public binary_function<_Tp, _Tp, bool>$/;" s namespace:std inherits:binary_function +std::equal_to::operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::equal_to access:public signature:(const _Tp& __x, const _Tp& __y) const +std::exception cpp_src/exception /^ class exception $/;" c namespace:std file: +std::exception::exception cpp_src/exception /^ exception() throw() { }$/;" f class:std::exception access:public signature:() +std::exception::what cpp_src/exception /^ virtual const char* what() const throw();$/;" p class:std::exception file: access:public signature:() const +std::exception::~exception cpp_src/exception /^ virtual ~exception() throw();$/;" p class:std::exception file: access:public signature:() +std::exit cpp_src/cstdlib /^ extern "C" void exit(int);$/;" p namespace:std file: signature:(int) +std::exp cpp_src/cmath /^ exp(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +std::exp cpp_src/cmath /^ exp(float __x)$/;" f namespace:std signature:(float __x) +std::exp cpp_src/cmath /^ exp(long double __x)$/;" f namespace:std signature:(long double __x) +std::exp cpp_src/complex /^ exp(const complex<_Tp>& __z) { return __complex_exp(__z); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::exp cpp_src/complex /^ exp(const complex<_Tp>& __z) { return __complex_exp(__z.__rep()); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::exp cpp_src/complex /^ template complex<_Tp> exp(const complex<_Tp>&);$/;" p namespace:std file: signature:(const complex<_Tp>&) +std::fabs cpp_src/cmath /^ fabs(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +std::fabs cpp_src/cmath /^ fabs(float __x)$/;" f namespace:std signature:(float __x) +std::fabs cpp_src/cmath /^ fabs(long double __x)$/;" f namespace:std signature:(long double __x) +std::filebuf cpp_src/iosfwd /^ typedef basic_filebuf filebuf; \/\/\/< @isiosfwd$/;" t namespace:std file: +std::fill cpp_src/deque.tcc /^ fill(const _Deque_iterator<_Tp, _Tp&, _Tp*>& __first,$/;" f namespace:std signature:(const _Deque_iterator<_Tp, _Tp&, _Tp*>& __first, const _Deque_iterator<_Tp, _Tp&, _Tp*>& __last, const _Tp& __value) +std::fill cpp_src/stl_algobase.h /^ fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value)$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) +std::fill cpp_src/stl_algobase.h /^ fill(char* __first, char* __last, const char& __c)$/;" f namespace:std signature:(char* __first, char* __last, const char& __c) +std::fill cpp_src/stl_algobase.h /^ fill(signed char* __first, signed char* __last, const signed char& __c)$/;" f namespace:std signature:(signed char* __first, signed char* __last, const signed char& __c) +std::fill cpp_src/stl_algobase.h /^ fill(unsigned char* __first, unsigned char* __last, const unsigned char& __c)$/;" f namespace:std signature:(unsigned char* __first, unsigned char* __last, const unsigned char& __c) +std::fill cpp_src/stl_bvector.h /^ fill(_Bit_iterator __first, _Bit_iterator __last, const bool& __x)$/;" f namespace:std signature:(_Bit_iterator __first, _Bit_iterator __last, const bool& __x) +std::fill cpp_src/stl_deque.h /^ fill(const _Deque_iterator<_Tp, _Tp&, _Tp*>& __first,$/;" p namespace:std signature:(const _Deque_iterator<_Tp, _Tp&, _Tp*>& __first, const _Deque_iterator<_Tp, _Tp&, _Tp*>& __last, const _Tp& __value) +std::fill_n cpp_src/stl_algobase.h /^ fill_n(_OutputIterator __first, _Size __n, const _Tp& __value)$/;" f namespace:std signature:(_OutputIterator __first, _Size __n, const _Tp& __value) +std::fill_n cpp_src/stl_algobase.h /^ fill_n(char* __first, _Size __n, const char& __c)$/;" f namespace:std signature:(char* __first, _Size __n, const char& __c) +std::fill_n cpp_src/stl_algobase.h /^ fill_n(signed char* __first, _Size __n, const signed char& __c)$/;" f namespace:std signature:(signed char* __first, _Size __n, const signed char& __c) +std::fill_n cpp_src/stl_algobase.h /^ fill_n(unsigned char* __first, _Size __n, const unsigned char& __c)$/;" f namespace:std signature:(unsigned char* __first, _Size __n, const unsigned char& __c) +std::find cpp_src/stl_algo.h /^ find(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, const _Tp& __val) +std::find cpp_src/stl_algo.h /^ find(istreambuf_iterator<_CharT>, istreambuf_iterator<_CharT>,$/;" p namespace:std signature:(istreambuf_iterator<_CharT>, istreambuf_iterator<_CharT>, const _CharT&) +std::find cpp_src/streambuf_iterator.h /^ find(istreambuf_iterator<_CharT> __first,$/;" f namespace:std signature:(istreambuf_iterator<_CharT> __first, istreambuf_iterator<_CharT> __last, const _CharT& __val) +std::find_end cpp_src/stl_algo.h /^ find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,$/;" f namespace:std signature:(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2) +std::find_end cpp_src/stl_algo.h /^ find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,$/;" f namespace:std signature:(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __comp) +std::find_first_of cpp_src/stl_algo.h /^ find_first_of(_InputIterator __first1, _InputIterator __last1,$/;" f namespace:std signature:(_InputIterator __first1, _InputIterator __last1, _ForwardIterator __first2, _ForwardIterator __last2) +std::find_first_of cpp_src/stl_algo.h /^ find_first_of(_InputIterator __first1, _InputIterator __last1,$/;" f namespace:std signature:(_InputIterator __first1, _InputIterator __last1, _ForwardIterator __first2, _ForwardIterator __last2, _BinaryPredicate __comp) +std::find_if cpp_src/stl_algo.h /^ find_if(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _Predicate __pred) +std::fixed cpp_src/ios_base.h /^ fixed(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +std::float_denorm_style cpp_src/limits /^ enum float_denorm_style$/;" g namespace:std file: +std::float_round_style cpp_src/limits /^ enum float_round_style$/;" g namespace:std file: +std::floor cpp_src/cmath /^ floor(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +std::floor cpp_src/cmath /^ floor(float __x)$/;" f namespace:std signature:(float __x) +std::floor cpp_src/cmath /^ floor(long double __x)$/;" f namespace:std signature:(long double __x) +std::flush cpp_src/ostream /^ flush(basic_ostream<_CharT, _Traits>& __os)$/;" f namespace:std signature:(basic_ostream<_CharT, _Traits>& __os) +std::flush cpp_src/ostream.tcc /^ extern template ostream& flush(ostream&);$/;" p namespace:std file: signature:(ostream&) +std::flush cpp_src/ostream.tcc /^ extern template wostream& flush(wostream&);$/;" p namespace:std file: signature:(wostream&) +std::fmod cpp_src/cmath /^ fmod(float __x, float __y)$/;" f namespace:std signature:(float __x, float __y) +std::fmod cpp_src/cmath /^ fmod(long double __x, long double __y)$/;" f namespace:std signature:(long double __x, long double __y) +std::for_each cpp_src/stl_algo.h /^ for_each(_InputIterator __first, _InputIterator __last, _Function __f)$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _Function __f) +std::forward_iterator_tag cpp_src/stl_iterator_base_types.h /^ struct forward_iterator_tag : public input_iterator_tag {};$/;" s namespace:std inherits:input_iterator_tag +std::fpos cpp_src/postypes.h /^ class fpos$/;" c namespace:std +std::fpos::_M_off cpp_src/postypes.h /^ streamoff _M_off;$/;" m class:std::fpos access:private +std::fpos::_M_state cpp_src/postypes.h /^ _StateT _M_state;$/;" m class:std::fpos access:private +std::fpos::fpos cpp_src/postypes.h /^ fpos()$/;" f class:std::fpos access:public signature:() +std::fpos::fpos cpp_src/postypes.h /^ fpos(streamoff __off)$/;" f class:std::fpos access:public signature:(streamoff __off) +std::fpos::operator + cpp_src/postypes.h /^ operator+(streamoff __off) const$/;" f class:std::fpos access:public signature:(streamoff __off) const +std::fpos::operator += cpp_src/postypes.h /^ operator+=(streamoff __off)$/;" f class:std::fpos access:public signature:(streamoff __off) +std::fpos::operator - cpp_src/postypes.h /^ operator-(const fpos& __other) const$/;" f class:std::fpos access:public signature:(const fpos& __other) const +std::fpos::operator - cpp_src/postypes.h /^ operator-(streamoff __off) const$/;" f class:std::fpos access:public signature:(streamoff __off) const +std::fpos::operator -= cpp_src/postypes.h /^ operator-=(streamoff __off)$/;" f class:std::fpos access:public signature:(streamoff __off) +std::fpos::operator streamoff cpp_src/postypes.h /^ operator streamoff() const { return _M_off; }$/;" f class:std::fpos access:public signature:() const +std::fpos::state cpp_src/postypes.h /^ state() const$/;" f class:std::fpos access:public signature:() const +std::fpos::state cpp_src/postypes.h /^ state(_StateT __st)$/;" f class:std::fpos access:public signature:(_StateT __st) +std::frexp cpp_src/cmath /^ frexp(_Tp __x, int* __exp)$/;" f namespace:std signature:(_Tp __x, int* __exp) +std::frexp cpp_src/cmath /^ frexp(float __x, int* __exp)$/;" f namespace:std signature:(float __x, int* __exp) +std::frexp cpp_src/cmath /^ frexp(long double __x, int* __exp)$/;" f namespace:std signature:(long double __x, int* __exp) +std::front_insert_iterator cpp_src/stl_iterator.h /^ class front_insert_iterator$/;" c namespace:std inherits:iterator +std::front_insert_iterator::container cpp_src/stl_iterator.h /^ _Container* container;$/;" m class:std::front_insert_iterator access:protected +std::front_insert_iterator::container_type cpp_src/stl_iterator.h /^ typedef _Container container_type;$/;" t class:std::front_insert_iterator access:public +std::front_insert_iterator::front_insert_iterator cpp_src/stl_iterator.h /^ explicit front_insert_iterator(_Container& __x) : container(&__x) { }$/;" f class:std::front_insert_iterator access:public signature:(_Container& __x) +std::front_insert_iterator::operator * cpp_src/stl_iterator.h /^ operator*()$/;" f class:std::front_insert_iterator access:public signature:() +std::front_insert_iterator::operator ++ cpp_src/stl_iterator.h /^ operator++()$/;" f class:std::front_insert_iterator access:public signature:() +std::front_insert_iterator::operator ++ cpp_src/stl_iterator.h /^ operator++(int)$/;" f class:std::front_insert_iterator access:public signature:(int) +std::front_insert_iterator::operator = cpp_src/stl_iterator.h /^ operator=(typename _Container::const_reference __value)$/;" f class:std::front_insert_iterator access:public signature:(typename _Container::const_reference __value) +std::front_inserter cpp_src/stl_iterator.h /^ front_inserter(_Container& __x)$/;" f namespace:std signature:(_Container& __x) +std::fstream cpp_src/iosfwd /^ typedef basic_fstream fstream; \/\/\/< @isiosfwd$/;" t namespace:std file: +std::generate cpp_src/stl_algo.h /^ generate(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) +std::generate_n cpp_src/stl_algo.h /^ generate_n(_OutputIterator __first, _Size __n, _Generator __gen)$/;" f namespace:std signature:(_OutputIterator __first, _Size __n, _Generator __gen) +std::get_temporary_buffer cpp_src/memory /^ get_temporary_buffer(ptrdiff_t __len)$/;" f namespace:std signature:(ptrdiff_t __len) +std::getline cpp_src/basic_string.h /^ getline(basic_istream<_CharT, _Traits>& __is,$/;" f namespace:std signature:(basic_istream<_CharT, _Traits>& __is, basic_string<_CharT, _Traits, _Alloc>& __str) +std::getline cpp_src/basic_string.h /^ getline(basic_istream<_CharT, _Traits>& __is,$/;" p namespace:std signature:(basic_istream<_CharT, _Traits>& __is, basic_string<_CharT, _Traits, _Alloc>& __str, _CharT __delim) +std::getline cpp_src/basic_string.h /^ getline(basic_istream& __in, basic_string& __str,$/;" p namespace:std signature:(basic_istream& __in, basic_string& __str, char __delim) +std::getline cpp_src/basic_string.h /^ getline(basic_istream& __in, basic_string& __str,$/;" p namespace:std signature:(basic_istream& __in, basic_string& __str, wchar_t __delim) +std::getline cpp_src/basic_string.tcc /^ getline(basic_istream&, string&);$/;" p namespace:std file: signature:(basic_istream&, string&) +std::getline cpp_src/basic_string.tcc /^ getline(basic_istream&, string&, char);$/;" p namespace:std file: signature:(basic_istream&, string&, char) +std::getline cpp_src/basic_string.tcc /^ getline(basic_istream&, wstring&);$/;" p namespace:std file: signature:(basic_istream&, wstring&) +std::getline cpp_src/basic_string.tcc /^ getline(basic_istream&, wstring&, wchar_t);$/;" p namespace:std file: signature:(basic_istream&, wstring&, wchar_t) +std::getline cpp_src/istream.tcc /^ getline(basic_istream<_CharT, _Traits>& __in,$/;" f namespace:std signature:(basic_istream<_CharT, _Traits>& __in, basic_string<_CharT, _Traits, _Alloc>& __str, _CharT __delim) +std::greater cpp_src/stl_function.h /^ struct greater : public binary_function<_Tp, _Tp, bool>$/;" s namespace:std inherits:binary_function +std::greater::operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::greater access:public signature:(const _Tp& __x, const _Tp& __y) const +std::greater_equal cpp_src/stl_function.h /^ struct greater_equal : public binary_function<_Tp, _Tp, bool>$/;" s namespace:std inherits:binary_function +std::greater_equal::operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::greater_equal access:public signature:(const _Tp& __x, const _Tp& __y) const +std::gslice cpp_src/gslice.h /^ class gslice$/;" c namespace:std +std::gslice::_Indexer cpp_src/gslice.h /^ struct _Indexer$/;" s class:std::gslice access:private +std::gslice::_Indexer::_Indexer cpp_src/gslice.h /^ _Indexer(size_t, const valarray&,$/;" p struct:std::gslice::_Indexer access:public signature:(size_t, const valarray&, const valarray&) +std::gslice::_Indexer::_M_count cpp_src/gslice.h /^ size_t _M_count;$/;" m struct:std::gslice::_Indexer access:public +std::gslice::_Indexer::_M_decrement_use cpp_src/gslice.h /^ _M_decrement_use()$/;" f struct:std::gslice::_Indexer access:public signature:() +std::gslice::_Indexer::_M_increment_use cpp_src/gslice.h /^ _M_increment_use()$/;" f struct:std::gslice::_Indexer access:public signature:() +std::gslice::_Indexer::_M_index cpp_src/gslice.h /^ valarray _M_index; \/\/ Linear array of referenced indices$/;" m struct:std::gslice::_Indexer access:public +std::gslice::_Indexer::_M_size cpp_src/gslice.h /^ valarray _M_size;$/;" m struct:std::gslice::_Indexer access:public +std::gslice::_Indexer::_M_start cpp_src/gslice.h /^ size_t _M_start;$/;" m struct:std::gslice::_Indexer access:public +std::gslice::_Indexer::_M_stride cpp_src/gslice.h /^ valarray _M_stride;$/;" m struct:std::gslice::_Indexer access:public +std::gslice::_M_index cpp_src/gslice.h /^ _Indexer* _M_index;$/;" m class:std::gslice access:private +std::gslice::gslice cpp_src/gslice.h /^ gslice ();$/;" p class:std::gslice access:public signature:() +std::gslice::gslice cpp_src/gslice.h /^ gslice(const gslice&);$/;" p class:std::gslice access:public signature:(const gslice&) +std::gslice::gslice cpp_src/gslice.h /^ gslice(size_t, const valarray&, const valarray&);$/;" p class:std::gslice access:public signature:(size_t, const valarray&, const valarray&) +std::gslice::gslice cpp_src/gslice.h /^ gslice::gslice(const gslice& __g) : _M_index(__g._M_index)$/;" f class:std::gslice signature:(const gslice& __g) +std::gslice::gslice cpp_src/gslice.h /^ gslice::gslice(size_t __o, const valarray& __l,$/;" f class:std::gslice signature:(size_t __o, const valarray& __l, const valarray& __s) +std::gslice::gslice cpp_src/gslice.h /^ inline gslice::gslice () : _M_index(0) {}$/;" f class:std::gslice signature:() +std::gslice::operator = cpp_src/gslice.h /^ gslice& operator=(const gslice&);$/;" p class:std::gslice access:public signature:(const gslice&) +std::gslice::operator = cpp_src/gslice.h /^ gslice::operator= (const gslice& __g)$/;" f class:std::gslice signature:(const gslice& __g) +std::gslice::size cpp_src/gslice.h /^ valarray size() const;$/;" p class:std::gslice access:public signature:() const +std::gslice::size cpp_src/gslice.h /^ gslice::size () const$/;" f class:std::gslice signature:() const +std::gslice::start cpp_src/gslice.h /^ size_t start() const;$/;" p class:std::gslice access:public signature:() const +std::gslice::start cpp_src/gslice.h /^ gslice::start () const$/;" f class:std::gslice signature:() const +std::gslice::stride cpp_src/gslice.h /^ valarray stride() const;$/;" p class:std::gslice access:public signature:() const +std::gslice::stride cpp_src/gslice.h /^ gslice::stride () const$/;" f class:std::gslice signature:() const +std::gslice::~gslice cpp_src/gslice.h /^ ~gslice();$/;" p class:std::gslice access:public signature:() +std::gslice::~gslice cpp_src/gslice.h /^ gslice::~gslice()$/;" f class:std::gslice signature:() +std::gslice_array cpp_src/gslice_array.h /^ class gslice_array$/;" c namespace:std +std::gslice_array::_M_array cpp_src/gslice_array.h /^ _Array<_Tp> _M_array;$/;" m class:std::gslice_array access:private +std::gslice_array::_M_index cpp_src/gslice_array.h /^ const valarray& _M_index;$/;" m class:std::gslice_array access:private +std::gslice_array::gslice_array cpp_src/gslice_array.h /^ gslice_array();$/;" p class:std::gslice_array access:private signature:() +std::gslice_array::gslice_array cpp_src/gslice_array.h /^ gslice_array(_Array<_Tp>, const valarray&);$/;" p class:std::gslice_array access:private signature:(_Array<_Tp>, const valarray&) +std::gslice_array::gslice_array cpp_src/gslice_array.h /^ gslice_array(const gslice_array&);$/;" p class:std::gslice_array access:public signature:(const gslice_array&) +std::gslice_array::gslice_array cpp_src/gslice_array.h /^ gslice_array<_Tp>::gslice_array(_Array<_Tp> __a,$/;" f class:std::gslice_array signature:(_Array<_Tp> __a, const valarray& __i) +std::gslice_array::gslice_array cpp_src/gslice_array.h /^ gslice_array<_Tp>::gslice_array(const gslice_array<_Tp>& __a)$/;" f class:std::gslice_array signature:(const gslice_array<_Tp>& __a) +std::gslice_array::operator %= cpp_src/gslice_array.h /^ void operator%=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::gslice_array::operator %= cpp_src/gslice_array.h /^ void operator%=(const valarray<_Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const valarray<_Tp>&) const +std::gslice_array::operator &= cpp_src/gslice_array.h /^ void operator&=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::gslice_array::operator &= cpp_src/gslice_array.h /^ void operator&=(const valarray<_Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const valarray<_Tp>&) const +std::gslice_array::operator *= cpp_src/gslice_array.h /^ void operator*=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::gslice_array::operator *= cpp_src/gslice_array.h /^ void operator*=(const valarray<_Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const valarray<_Tp>&) const +std::gslice_array::operator += cpp_src/gslice_array.h /^ void operator+=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::gslice_array::operator += cpp_src/gslice_array.h /^ void operator+=(const valarray<_Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const valarray<_Tp>&) const +std::gslice_array::operator -= cpp_src/gslice_array.h /^ void operator-=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::gslice_array::operator -= cpp_src/gslice_array.h /^ void operator-=(const valarray<_Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const valarray<_Tp>&) const +std::gslice_array::operator /= cpp_src/gslice_array.h /^ void operator\/=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::gslice_array::operator /= cpp_src/gslice_array.h /^ void operator\/=(const valarray<_Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const valarray<_Tp>&) const +std::gslice_array::operator <<= cpp_src/gslice_array.h /^ void operator<<=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::gslice_array::operator <<= cpp_src/gslice_array.h /^ void operator<<=(const valarray<_Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const valarray<_Tp>&) const +std::gslice_array::operator = cpp_src/gslice_array.h /^ void operator=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::gslice_array::operator = cpp_src/gslice_array.h /^ gslice_array& operator=(const gslice_array&);$/;" p class:std::gslice_array access:public signature:(const gslice_array&) +std::gslice_array::operator = cpp_src/gslice_array.h /^ gslice_array<_Tp>::operator=(const _Expr<_Dom, _Tp>& __e) const$/;" f class:std::gslice_array signature:(const _Expr<_Dom, _Tp>& __e) const +std::gslice_array::operator = cpp_src/gslice_array.h /^ void operator=(const _Tp&) const;$/;" p class:std::gslice_array access:public signature:(const _Tp&) const +std::gslice_array::operator = cpp_src/gslice_array.h /^ void operator=(const valarray<_Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const valarray<_Tp>&) const +std::gslice_array::operator = cpp_src/gslice_array.h /^ gslice_array<_Tp>::operator=(const _Tp& __t) const$/;" f class:std::gslice_array signature:(const _Tp& __t) const +std::gslice_array::operator = cpp_src/gslice_array.h /^ gslice_array<_Tp>::operator=(const gslice_array<_Tp>& __a)$/;" f class:std::gslice_array signature:(const gslice_array<_Tp>& __a) +std::gslice_array::operator = cpp_src/gslice_array.h /^ gslice_array<_Tp>::operator=(const valarray<_Tp>& __v) const$/;" f class:std::gslice_array signature:(const valarray<_Tp>& __v) const +std::gslice_array::operator >>= cpp_src/gslice_array.h /^ void operator>>=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::gslice_array::operator >>= cpp_src/gslice_array.h /^ void operator>>=(const valarray<_Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const valarray<_Tp>&) const +std::gslice_array::operator ^= cpp_src/gslice_array.h /^ void operator^=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::gslice_array::operator ^= cpp_src/gslice_array.h /^ void operator^=(const valarray<_Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const valarray<_Tp>&) const +std::gslice_array::operator |= cpp_src/gslice_array.h /^ void operator|=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::gslice_array::operator |= cpp_src/gslice_array.h /^ void operator|=(const valarray<_Tp>&) const;$/;" p class:std::gslice_array access:public signature:(const valarray<_Tp>&) const +std::gslice_array::value_type cpp_src/gslice_array.h /^ typedef _Tp value_type;$/;" t class:std::gslice_array access:public +std::has_facet cpp_src/locale_facets.tcc /^ has_facet(const locale& __loc) throw()$/;" f namespace:std signature:(const locale& __loc) +std::has_facet cpp_src/locale_facets.tcc /^ has_facet<__timepunct >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::has_facet cpp_src/locale_facets.tcc /^ has_facet<__timepunct >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::has_facet cpp_src/locale_facets.tcc /^ has_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::has_facet cpp_src/localefwd.h /^ has_facet(const locale& __loc) throw();$/;" p namespace:std signature:(const locale& __loc) +std::hex cpp_src/ios_base.h /^ hex(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +std::ifstream cpp_src/iosfwd /^ typedef basic_ifstream ifstream; \/\/\/< @isiosfwd$/;" t namespace:std file: +std::imag cpp_src/complex /^ imag(complex<_Tp>& __z)$/;" f namespace:std signature:(complex<_Tp>& __z) +std::imag cpp_src/complex /^ imag(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::includes cpp_src/stl_algo.h /^ includes(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) +std::includes cpp_src/stl_algo.h /^ includes(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) +std::indirect_array cpp_src/indirect_array.h /^ class indirect_array$/;" c namespace:std +std::indirect_array::_M_array cpp_src/indirect_array.h /^ const _Array<_Tp> _M_array;$/;" m class:std::indirect_array access:private +std::indirect_array::_M_index cpp_src/indirect_array.h /^ const _Array _M_index;$/;" m class:std::indirect_array access:private +std::indirect_array::_M_sz cpp_src/indirect_array.h /^ const size_t _M_sz;$/;" m class:std::indirect_array access:private +std::indirect_array::indirect_array cpp_src/indirect_array.h /^ indirect_array();$/;" p class:std::indirect_array access:private signature:() +std::indirect_array::indirect_array cpp_src/indirect_array.h /^ indirect_array(_Array<_Tp>, size_t, _Array);$/;" p class:std::indirect_array access:private signature:(_Array<_Tp>, size_t, _Array) +std::indirect_array::indirect_array cpp_src/indirect_array.h /^ indirect_array(const indirect_array&);$/;" p class:std::indirect_array access:public signature:(const indirect_array&) +std::indirect_array::indirect_array cpp_src/indirect_array.h /^ indirect_array<_Tp>::indirect_array(_Array<_Tp> __a, size_t __s,$/;" f class:std::indirect_array signature:(_Array<_Tp> __a, size_t __s, _Array __i) +std::indirect_array::indirect_array cpp_src/indirect_array.h /^ indirect_array<_Tp>::indirect_array(const indirect_array<_Tp>& __a)$/;" f class:std::indirect_array signature:(const indirect_array<_Tp>& __a) +std::indirect_array::operator %= cpp_src/indirect_array.h /^ void operator%=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::indirect_array::operator %= cpp_src/indirect_array.h /^ void operator%=(const valarray<_Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const valarray<_Tp>&) const +std::indirect_array::operator &= cpp_src/indirect_array.h /^ void operator&=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::indirect_array::operator &= cpp_src/indirect_array.h /^ void operator&=(const valarray<_Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const valarray<_Tp>&) const +std::indirect_array::operator *= cpp_src/indirect_array.h /^ void operator*=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::indirect_array::operator *= cpp_src/indirect_array.h /^ void operator*=(const valarray<_Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const valarray<_Tp>&) const +std::indirect_array::operator += cpp_src/indirect_array.h /^ void operator+=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::indirect_array::operator += cpp_src/indirect_array.h /^ void operator+=(const valarray<_Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const valarray<_Tp>&) const +std::indirect_array::operator -= cpp_src/indirect_array.h /^ void operator-=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::indirect_array::operator -= cpp_src/indirect_array.h /^ void operator-=(const valarray<_Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const valarray<_Tp>&) const +std::indirect_array::operator /= cpp_src/indirect_array.h /^ void operator\/=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::indirect_array::operator /= cpp_src/indirect_array.h /^ void operator\/=(const valarray<_Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const valarray<_Tp>&) const +std::indirect_array::operator <<= cpp_src/indirect_array.h /^ void operator<<=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::indirect_array::operator <<= cpp_src/indirect_array.h /^ void operator<<=(const valarray<_Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const valarray<_Tp>&) const +std::indirect_array::operator = cpp_src/indirect_array.h /^ indirect_array& operator=(const indirect_array&);$/;" p class:std::indirect_array access:public signature:(const indirect_array&) +std::indirect_array::operator = cpp_src/indirect_array.h /^ indirect_array<_Tp>::operator=(const _Expr<_Dom, _Tp>& __e) const$/;" f class:std::indirect_array signature:(const _Expr<_Dom, _Tp>& __e) const +std::indirect_array::operator = cpp_src/indirect_array.h /^ void operator= (const _Tp&) const;$/;" p class:std::indirect_array access:public signature:(const _Tp&) const +std::indirect_array::operator = cpp_src/indirect_array.h /^ void operator=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::indirect_array::operator = cpp_src/indirect_array.h /^ void operator=(const valarray<_Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const valarray<_Tp>&) const +std::indirect_array::operator = cpp_src/indirect_array.h /^ indirect_array<_Tp>::operator=(const _Tp& __t) const$/;" f class:std::indirect_array signature:(const _Tp& __t) const +std::indirect_array::operator = cpp_src/indirect_array.h /^ indirect_array<_Tp>::operator=(const indirect_array<_Tp>& __a)$/;" f class:std::indirect_array signature:(const indirect_array<_Tp>& __a) +std::indirect_array::operator = cpp_src/indirect_array.h /^ indirect_array<_Tp>::operator=(const valarray<_Tp>& __v) const$/;" f class:std::indirect_array signature:(const valarray<_Tp>& __v) const +std::indirect_array::operator >>= cpp_src/indirect_array.h /^ void operator>>=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::indirect_array::operator >>= cpp_src/indirect_array.h /^ void operator>>=(const valarray<_Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const valarray<_Tp>&) const +std::indirect_array::operator ^= cpp_src/indirect_array.h /^ void operator^=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::indirect_array::operator ^= cpp_src/indirect_array.h /^ void operator^=(const valarray<_Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const valarray<_Tp>&) const +std::indirect_array::operator |= cpp_src/indirect_array.h /^ void operator|=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::indirect_array::operator |= cpp_src/indirect_array.h /^ void operator|=(const valarray<_Tp>&) const;$/;" p class:std::indirect_array access:public signature:(const valarray<_Tp>&) const +std::indirect_array::value_type cpp_src/indirect_array.h /^ typedef _Tp value_type;$/;" t class:std::indirect_array access:public +std::inner_product cpp_src/stl_numeric.h /^ inner_product(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _Tp __init) +std::inner_product cpp_src/stl_numeric.h /^ inner_product(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _Tp __init, _BinaryOperation1 __binary_op1, _BinaryOperation2 __binary_op2) +std::inplace_merge cpp_src/stl_algo.h /^ inplace_merge(_BidirectionalIterator __first,$/;" f namespace:std signature:(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) +std::inplace_merge cpp_src/stl_algo.h /^ inplace_merge(_BidirectionalIterator __first,$/;" f namespace:std signature:(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Compare __comp) +std::input_iterator_tag cpp_src/stl_iterator_base_types.h /^ struct input_iterator_tag {};$/;" s namespace:std +std::insert_iterator cpp_src/stl_iterator.h /^ class insert_iterator$/;" c namespace:std inherits:iterator +std::insert_iterator::container cpp_src/stl_iterator.h /^ _Container* container;$/;" m class:std::insert_iterator access:protected +std::insert_iterator::container_type cpp_src/stl_iterator.h /^ typedef _Container container_type;$/;" t class:std::insert_iterator access:public +std::insert_iterator::insert_iterator cpp_src/stl_iterator.h /^ insert_iterator(_Container& __x, typename _Container::iterator __i)$/;" f class:std::insert_iterator access:public signature:(_Container& __x, typename _Container::iterator __i) +std::insert_iterator::iter cpp_src/stl_iterator.h /^ typename _Container::iterator iter;$/;" m class:std::insert_iterator access:protected +std::insert_iterator::operator * cpp_src/stl_iterator.h /^ operator*()$/;" f class:std::insert_iterator access:public signature:() +std::insert_iterator::operator ++ cpp_src/stl_iterator.h /^ operator++()$/;" f class:std::insert_iterator access:public signature:() +std::insert_iterator::operator ++ cpp_src/stl_iterator.h /^ operator++(int)$/;" f class:std::insert_iterator access:public signature:(int) +std::insert_iterator::operator = cpp_src/stl_iterator.h /^ operator=(const typename _Container::const_reference __value)$/;" f class:std::insert_iterator access:public signature:(const typename _Container::const_reference __value) +std::inserter cpp_src/stl_iterator.h /^ inserter(_Container& __x, _Iterator __i)$/;" f namespace:std signature:(_Container& __x, _Iterator __i) +std::internal cpp_src/ios_base.h /^ internal(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +std::invalid_argument cpp_src/stdexcept /^ class invalid_argument : public logic_error $/;" c namespace:std file: inherits:logic_error +std::invalid_argument::invalid_argument cpp_src/stdexcept /^ explicit invalid_argument(const string& __arg);$/;" p class:std::invalid_argument file: access:public signature:(const string& __arg) +std::ios cpp_src/iosfwd /^ typedef basic_ios ios; \/\/\/< @isiosfwd$/;" t namespace:std file: +std::ios_base cpp_src/ios_base.h /^ class ios_base$/;" c namespace:std +std::ios_base::Init cpp_src/ios_base.h /^ class Init$/;" c class:std::ios_base access:public +std::ios_base::Init::Init cpp_src/ios_base.h /^ Init();$/;" p class:std::ios_base::Init access:public signature:() +std::ios_base::Init::_S_refcount cpp_src/ios_base.h /^ static _Atomic_word _S_refcount;$/;" m class:std::ios_base::Init access:private +std::ios_base::Init::_S_synced_with_stdio cpp_src/ios_base.h /^ static bool _S_synced_with_stdio;$/;" m class:std::ios_base::Init access:private +std::ios_base::Init::~Init cpp_src/ios_base.h /^ ~Init();$/;" p class:std::ios_base::Init access:public signature:() +std::ios_base::_Callback_list cpp_src/ios_base.h /^ struct _Callback_list$/;" s class:std::ios_base access:protected +std::ios_base::_Callback_list::_Callback_list cpp_src/ios_base.h /^ _Callback_list(ios_base::event_callback __fn, int __index,$/;" f struct:std::ios_base::_Callback_list access:public signature:(ios_base::event_callback __fn, int __index, _Callback_list* __cb) +std::ios_base::_Callback_list::_M_add_reference cpp_src/ios_base.h /^ _M_add_reference() { __gnu_cxx::__atomic_add_dispatch(&_M_refcount, 1); }$/;" f struct:std::ios_base::_Callback_list access:public signature:() +std::ios_base::_Callback_list::_M_fn cpp_src/ios_base.h /^ ios_base::event_callback _M_fn;$/;" m struct:std::ios_base::_Callback_list access:public +std::ios_base::_Callback_list::_M_index cpp_src/ios_base.h /^ int _M_index;$/;" m struct:std::ios_base::_Callback_list access:public +std::ios_base::_Callback_list::_M_next cpp_src/ios_base.h /^ _Callback_list* _M_next;$/;" m struct:std::ios_base::_Callback_list access:public +std::ios_base::_Callback_list::_M_refcount cpp_src/ios_base.h /^ _Atomic_word _M_refcount; \/\/ 0 means one reference.$/;" m struct:std::ios_base::_Callback_list access:public +std::ios_base::_Callback_list::_M_remove_reference cpp_src/ios_base.h /^ _M_remove_reference() $/;" f struct:std::ios_base::_Callback_list access:public signature:() +std::ios_base::_M_call_callbacks cpp_src/ios_base.h /^ _M_call_callbacks(event __ev) throw();$/;" p class:std::ios_base access:protected signature:(event __ev) +std::ios_base::_M_callbacks cpp_src/ios_base.h /^ _Callback_list* _M_callbacks;$/;" m class:std::ios_base access:protected +std::ios_base::_M_dispose_callbacks cpp_src/ios_base.h /^ _M_dispose_callbacks(void);$/;" p class:std::ios_base access:protected signature:(void) +std::ios_base::_M_exception cpp_src/ios_base.h /^ iostate _M_exception;$/;" m class:std::ios_base access:protected +std::ios_base::_M_flags cpp_src/ios_base.h /^ fmtflags _M_flags;$/;" m class:std::ios_base access:protected +std::ios_base::_M_getloc cpp_src/ios_base.h /^ _M_getloc() const { return _M_ios_locale; }$/;" f class:std::ios_base access:public signature:() const +std::ios_base::_M_grow_words cpp_src/ios_base.h /^ _M_grow_words(int __index, bool __iword);$/;" p class:std::ios_base access:protected signature:(int __index, bool __iword) +std::ios_base::_M_init cpp_src/ios_base.h /^ _M_init();$/;" p class:std::ios_base access:protected signature:() +std::ios_base::_M_ios_locale cpp_src/ios_base.h /^ locale _M_ios_locale;$/;" m class:std::ios_base access:protected +std::ios_base::_M_local_word cpp_src/ios_base.h /^ _Words _M_local_word[_S_local_word_size];$/;" m class:std::ios_base access:protected +std::ios_base::_M_precision cpp_src/ios_base.h /^ streamsize _M_precision;$/;" m class:std::ios_base access:protected +std::ios_base::_M_streambuf_state cpp_src/ios_base.h /^ iostate _M_streambuf_state;$/;" m class:std::ios_base access:protected +std::ios_base::_M_width cpp_src/ios_base.h /^ streamsize _M_width;$/;" m class:std::ios_base access:protected +std::ios_base::_M_word cpp_src/ios_base.h /^ _Words* _M_word;$/;" m class:std::ios_base access:protected +std::ios_base::_M_word_size cpp_src/ios_base.h /^ int _M_word_size;$/;" m class:std::ios_base access:protected +std::ios_base::_M_word_zero cpp_src/ios_base.h /^ _Words _M_word_zero;$/;" m class:std::ios_base access:protected +std::ios_base::_S_local_word_size cpp_src/ios_base.h /^ enum { _S_local_word_size = 8 };$/;" e enum:std::ios_base::__anon5 +std::ios_base::_Words cpp_src/ios_base.h /^ struct _Words$/;" s class:std::ios_base access:protected +std::ios_base::_Words::_M_iword cpp_src/ios_base.h /^ long _M_iword;$/;" m struct:std::ios_base::_Words access:public +std::ios_base::_Words::_M_pword cpp_src/ios_base.h /^ void* _M_pword;$/;" m struct:std::ios_base::_Words access:public +std::ios_base::_Words::_Words cpp_src/ios_base.h /^ _Words() : _M_pword(0), _M_iword(0) { }$/;" f struct:std::ios_base::_Words access:public signature:() +std::ios_base::adjustfield cpp_src/ios_base.h /^ static const fmtflags adjustfield = _S_adjustfield;$/;" m class:std::ios_base access:public +std::ios_base::app cpp_src/ios_base.h /^ static const openmode app = _S_app;$/;" m class:std::ios_base access:public +std::ios_base::ate cpp_src/ios_base.h /^ static const openmode ate = _S_ate;$/;" m class:std::ios_base access:public +std::ios_base::badbit cpp_src/ios_base.h /^ static const iostate badbit = _S_badbit;$/;" m class:std::ios_base access:public +std::ios_base::basefield cpp_src/ios_base.h /^ static const fmtflags basefield = _S_basefield;$/;" m class:std::ios_base access:public +std::ios_base::beg cpp_src/ios_base.h /^ static const seekdir beg = _S_beg;$/;" m class:std::ios_base access:public +std::ios_base::binary cpp_src/ios_base.h /^ static const openmode binary = _S_bin;$/;" m class:std::ios_base access:public +std::ios_base::boolalpha cpp_src/ios_base.h /^ static const fmtflags boolalpha = _S_boolalpha;$/;" m class:std::ios_base access:public +std::ios_base::copyfmt_event cpp_src/ios_base.h /^ copyfmt_event$/;" e enum:std::ios_base::event +std::ios_base::cur cpp_src/ios_base.h /^ static const seekdir cur = _S_cur;$/;" m class:std::ios_base access:public +std::ios_base::dec cpp_src/ios_base.h /^ static const fmtflags dec = _S_dec;$/;" m class:std::ios_base access:public +std::ios_base::end cpp_src/ios_base.h /^ static const seekdir end = _S_end;$/;" m class:std::ios_base access:public +std::ios_base::eofbit cpp_src/ios_base.h /^ static const iostate eofbit = _S_eofbit;$/;" m class:std::ios_base access:public +std::ios_base::erase_event cpp_src/ios_base.h /^ erase_event,$/;" e enum:std::ios_base::event +std::ios_base::event cpp_src/ios_base.h /^ enum event$/;" g class:std::ios_base access:public +std::ios_base::event_callback cpp_src/ios_base.h /^ typedef void (*event_callback) (event, ios_base&, int);$/;" t class:std::ios_base access:public +std::ios_base::failbit cpp_src/ios_base.h /^ static const iostate failbit = _S_failbit;$/;" m class:std::ios_base access:public +std::ios_base::failure cpp_src/ios_base.h /^ class failure : public exception$/;" c class:std::ios_base inherits:exception access:public +std::ios_base::failure::_M_msg cpp_src/ios_base.h /^ string _M_msg;$/;" m class:std::ios_base::failure access:private +std::ios_base::failure::failure cpp_src/ios_base.h /^ failure(const string& __str) throw();$/;" p class:std::ios_base::failure access:public signature:(const string& __str) +std::ios_base::failure::what cpp_src/ios_base.h /^ what() const throw();$/;" p class:std::ios_base::failure access:public signature:() const +std::ios_base::failure::~failure cpp_src/ios_base.h /^ ~failure() throw();$/;" p class:std::ios_base::failure access:public signature:() +std::ios_base::fixed cpp_src/ios_base.h /^ static const fmtflags fixed = _S_fixed;$/;" m class:std::ios_base access:public +std::ios_base::flags cpp_src/ios_base.h /^ flags() const { return _M_flags; }$/;" f class:std::ios_base access:public signature:() const +std::ios_base::flags cpp_src/ios_base.h /^ flags(fmtflags __fmtfl)$/;" f class:std::ios_base access:public signature:(fmtflags __fmtfl) +std::ios_base::floatfield cpp_src/ios_base.h /^ static const fmtflags floatfield = _S_floatfield;$/;" m class:std::ios_base access:public +std::ios_base::fmtflags cpp_src/ios_base.h /^ typedef _Ios_Fmtflags fmtflags;$/;" t class:std::ios_base access:public +std::ios_base::getloc cpp_src/ios_base.h /^ getloc() const { return _M_ios_locale; }$/;" f class:std::ios_base access:public signature:() const +std::ios_base::goodbit cpp_src/ios_base.h /^ static const iostate goodbit = _S_goodbit;$/;" m class:std::ios_base access:public +std::ios_base::hex cpp_src/ios_base.h /^ static const fmtflags hex = _S_hex;$/;" m class:std::ios_base access:public +std::ios_base::imbue cpp_src/ios_base.h /^ imbue(const locale& __loc);$/;" p class:std::ios_base access:public signature:(const locale& __loc) +std::ios_base::imbue_event cpp_src/ios_base.h /^ imbue_event,$/;" e enum:std::ios_base::event +std::ios_base::in cpp_src/ios_base.h /^ static const openmode in = _S_in;$/;" m class:std::ios_base access:public +std::ios_base::internal cpp_src/ios_base.h /^ static const fmtflags internal = _S_internal;$/;" m class:std::ios_base access:public +std::ios_base::io_state cpp_src/ios_base.h /^ typedef int io_state;$/;" t class:std::ios_base access:public +std::ios_base::ios_base cpp_src/ios_base.h /^ ios_base();$/;" p class:std::ios_base access:protected signature:() +std::ios_base::ios_base cpp_src/ios_base.h /^ ios_base(const ios_base&);$/;" p class:std::ios_base access:private signature:(const ios_base&) +std::ios_base::iostate cpp_src/ios_base.h /^ typedef _Ios_Iostate iostate;$/;" t class:std::ios_base access:public +std::ios_base::iword cpp_src/ios_base.h /^ iword(int __ix)$/;" f class:std::ios_base access:public signature:(int __ix) +std::ios_base::left cpp_src/ios_base.h /^ static const fmtflags left = _S_left;$/;" m class:std::ios_base access:public +std::ios_base::oct cpp_src/ios_base.h /^ static const fmtflags oct = _S_oct;$/;" m class:std::ios_base access:public +std::ios_base::open_mode cpp_src/ios_base.h /^ typedef int open_mode;$/;" t class:std::ios_base access:public +std::ios_base::openmode cpp_src/ios_base.h /^ typedef _Ios_Openmode openmode;$/;" t class:std::ios_base access:public +std::ios_base::operator = cpp_src/ios_base.h /^ operator=(const ios_base&);$/;" p class:std::ios_base access:private signature:(const ios_base&) +std::ios_base::out cpp_src/ios_base.h /^ static const openmode out = _S_out;$/;" m class:std::ios_base access:public +std::ios_base::precision cpp_src/ios_base.h /^ precision() const { return _M_precision; }$/;" f class:std::ios_base access:public signature:() const +std::ios_base::precision cpp_src/ios_base.h /^ precision(streamsize __prec)$/;" f class:std::ios_base access:public signature:(streamsize __prec) +std::ios_base::pword cpp_src/ios_base.h /^ pword(int __ix)$/;" f class:std::ios_base access:public signature:(int __ix) +std::ios_base::register_callback cpp_src/ios_base.h /^ register_callback(event_callback __fn, int __index);$/;" p class:std::ios_base access:public signature:(event_callback __fn, int __index) +std::ios_base::right cpp_src/ios_base.h /^ static const fmtflags right = _S_right;$/;" m class:std::ios_base access:public +std::ios_base::scientific cpp_src/ios_base.h /^ static const fmtflags scientific = _S_scientific;$/;" m class:std::ios_base access:public +std::ios_base::seek_dir cpp_src/ios_base.h /^ typedef int seek_dir;$/;" t class:std::ios_base access:public +std::ios_base::seekdir cpp_src/ios_base.h /^ typedef _Ios_Seekdir seekdir;$/;" t class:std::ios_base access:public +std::ios_base::setf cpp_src/ios_base.h /^ setf(fmtflags __fmtfl)$/;" f class:std::ios_base access:public signature:(fmtflags __fmtfl) +std::ios_base::setf cpp_src/ios_base.h /^ setf(fmtflags __fmtfl, fmtflags __mask)$/;" f class:std::ios_base access:public signature:(fmtflags __fmtfl, fmtflags __mask) +std::ios_base::showbase cpp_src/ios_base.h /^ static const fmtflags showbase = _S_showbase;$/;" m class:std::ios_base access:public +std::ios_base::showpoint cpp_src/ios_base.h /^ static const fmtflags showpoint = _S_showpoint;$/;" m class:std::ios_base access:public +std::ios_base::showpos cpp_src/ios_base.h /^ static const fmtflags showpos = _S_showpos;$/;" m class:std::ios_base access:public +std::ios_base::skipws cpp_src/ios_base.h /^ static const fmtflags skipws = _S_skipws;$/;" m class:std::ios_base access:public +std::ios_base::streamoff cpp_src/ios_base.h /^ typedef std::streamoff streamoff;$/;" t class:std::ios_base access:public +std::ios_base::streampos cpp_src/ios_base.h /^ typedef std::streampos streampos;$/;" t class:std::ios_base access:public +std::ios_base::sync_with_stdio cpp_src/ios_base.h /^ sync_with_stdio(bool __sync = true);$/;" p class:std::ios_base access:public signature:(bool __sync = true) +std::ios_base::trunc cpp_src/ios_base.h /^ static const openmode trunc = _S_trunc;$/;" m class:std::ios_base access:public +std::ios_base::unitbuf cpp_src/ios_base.h /^ static const fmtflags unitbuf = _S_unitbuf;$/;" m class:std::ios_base access:public +std::ios_base::unsetf cpp_src/ios_base.h /^ unsetf(fmtflags __mask) { _M_flags &= ~__mask; }$/;" f class:std::ios_base access:public signature:(fmtflags __mask) +std::ios_base::uppercase cpp_src/ios_base.h /^ static const fmtflags uppercase = _S_uppercase;$/;" m class:std::ios_base access:public +std::ios_base::width cpp_src/ios_base.h /^ width() const { return _M_width; }$/;" f class:std::ios_base access:public signature:() const +std::ios_base::width cpp_src/ios_base.h /^ width(streamsize __wide)$/;" f class:std::ios_base access:public signature:(streamsize __wide) +std::ios_base::xalloc cpp_src/ios_base.h /^ xalloc() throw();$/;" p class:std::ios_base access:public signature:() +std::ios_base::~ios_base cpp_src/ios_base.h /^ virtual ~ios_base();$/;" p class:std::ios_base access:public signature:() +std::iostream cpp_src/iosfwd /^ typedef basic_iostream iostream; \/\/\/< @isiosfwd$/;" t namespace:std file: +std::isalnum cpp_src/locale_facets.h /^ isalnum(_CharT __c, const locale& __loc)$/;" f namespace:std signature:(_CharT __c, const locale& __loc) +std::isalnum cpp_src/localefwd.h /^ isalnum(_CharT, const locale&);$/;" p namespace:std signature:(_CharT, const locale&) +std::isalpha cpp_src/locale_facets.h /^ isalpha(_CharT __c, const locale& __loc)$/;" f namespace:std signature:(_CharT __c, const locale& __loc) +std::isalpha cpp_src/localefwd.h /^ isalpha(_CharT, const locale&);$/;" p namespace:std signature:(_CharT, const locale&) +std::iscntrl cpp_src/locale_facets.h /^ iscntrl(_CharT __c, const locale& __loc)$/;" f namespace:std signature:(_CharT __c, const locale& __loc) +std::iscntrl cpp_src/localefwd.h /^ iscntrl(_CharT, const locale&);$/;" p namespace:std signature:(_CharT, const locale&) +std::isdigit cpp_src/locale_facets.h /^ isdigit(_CharT __c, const locale& __loc)$/;" f namespace:std signature:(_CharT __c, const locale& __loc) +std::isdigit cpp_src/localefwd.h /^ isdigit(_CharT, const locale&);$/;" p namespace:std signature:(_CharT, const locale&) +std::isgraph cpp_src/locale_facets.h /^ isgraph(_CharT __c, const locale& __loc)$/;" f namespace:std signature:(_CharT __c, const locale& __loc) +std::isgraph cpp_src/localefwd.h /^ isgraph(_CharT, const locale&);$/;" p namespace:std signature:(_CharT, const locale&) +std::islower cpp_src/locale_facets.h /^ islower(_CharT __c, const locale& __loc)$/;" f namespace:std signature:(_CharT __c, const locale& __loc) +std::islower cpp_src/localefwd.h /^ islower(_CharT, const locale&);$/;" p namespace:std signature:(_CharT, const locale&) +std::isprint cpp_src/locale_facets.h /^ isprint(_CharT __c, const locale& __loc)$/;" f namespace:std signature:(_CharT __c, const locale& __loc) +std::isprint cpp_src/localefwd.h /^ isprint(_CharT, const locale&);$/;" p namespace:std signature:(_CharT, const locale&) +std::ispunct cpp_src/locale_facets.h /^ ispunct(_CharT __c, const locale& __loc)$/;" f namespace:std signature:(_CharT __c, const locale& __loc) +std::ispunct cpp_src/localefwd.h /^ ispunct(_CharT, const locale&);$/;" p namespace:std signature:(_CharT, const locale&) +std::isspace cpp_src/locale_facets.h /^ isspace(_CharT __c, const locale& __loc)$/;" f namespace:std signature:(_CharT __c, const locale& __loc) +std::isspace cpp_src/localefwd.h /^ isspace(_CharT, const locale&);$/;" p namespace:std signature:(_CharT, const locale&) +std::istream cpp_src/iosfwd /^ typedef basic_istream istream; \/\/\/< @isiosfwd$/;" t namespace:std file: +std::istream::_M_extract cpp_src/istream.tcc /^ extern template istream& istream::_M_extract(bool&);$/;" p class:std::istream file: signature:(bool&) +std::istream::_M_extract cpp_src/istream.tcc /^ extern template istream& istream::_M_extract(double&);$/;" p class:std::istream file: signature:(double&) +std::istream::_M_extract cpp_src/istream.tcc /^ extern template istream& istream::_M_extract(float&);$/;" p class:std::istream file: signature:(float&) +std::istream::_M_extract cpp_src/istream.tcc /^ extern template istream& istream::_M_extract(long double&);$/;" p class:std::istream file: signature:(long double&) +std::istream::_M_extract cpp_src/istream.tcc /^ extern template istream& istream::_M_extract(long long&);$/;" p class:std::istream file: signature:(long long&) +std::istream::_M_extract cpp_src/istream.tcc /^ extern template istream& istream::_M_extract(long&);$/;" p class:std::istream file: signature:(long&) +std::istream::_M_extract cpp_src/istream.tcc /^ extern template istream& istream::_M_extract(unsigned int&); $/;" p class:std::istream file: signature:(unsigned int&) +std::istream::_M_extract cpp_src/istream.tcc /^ extern template istream& istream::_M_extract(unsigned long long&);$/;" p class:std::istream file: signature:(unsigned long long&) +std::istream::_M_extract cpp_src/istream.tcc /^ extern template istream& istream::_M_extract(unsigned long&);$/;" p class:std::istream file: signature:(unsigned long&) +std::istream::_M_extract cpp_src/istream.tcc /^ extern template istream& istream::_M_extract(unsigned short&);$/;" p class:std::istream file: signature:(unsigned short&) +std::istream::_M_extract cpp_src/istream.tcc /^ extern template istream& istream::_M_extract(void*&);$/;" p class:std::istream file: signature:(void*&) +std::istream_iterator cpp_src/stream_iterator.h /^ class istream_iterator$/;" c namespace:std inherits:iterator +std::istream_iterator::_M_equal cpp_src/stream_iterator.h /^ _M_equal(const istream_iterator& __x) const$/;" f class:std::istream_iterator access:public signature:(const istream_iterator& __x) const +std::istream_iterator::_M_ok cpp_src/stream_iterator.h /^ bool _M_ok;$/;" m class:std::istream_iterator access:private +std::istream_iterator::_M_read cpp_src/stream_iterator.h /^ _M_read()$/;" f class:std::istream_iterator access:private signature:() +std::istream_iterator::_M_stream cpp_src/stream_iterator.h /^ istream_type* _M_stream;$/;" m class:std::istream_iterator access:private +std::istream_iterator::_M_value cpp_src/stream_iterator.h /^ _Tp _M_value;$/;" m class:std::istream_iterator access:private +std::istream_iterator::char_type cpp_src/stream_iterator.h /^ typedef _CharT char_type;$/;" t class:std::istream_iterator access:public +std::istream_iterator::istream_iterator cpp_src/stream_iterator.h /^ istream_iterator()$/;" f class:std::istream_iterator access:public signature:() +std::istream_iterator::istream_iterator cpp_src/stream_iterator.h /^ istream_iterator(const istream_iterator& __obj)$/;" f class:std::istream_iterator access:public signature:(const istream_iterator& __obj) +std::istream_iterator::istream_iterator cpp_src/stream_iterator.h /^ istream_iterator(istream_type& __s)$/;" f class:std::istream_iterator access:public signature:(istream_type& __s) +std::istream_iterator::istream_type cpp_src/stream_iterator.h /^ typedef basic_istream<_CharT, _Traits> istream_type;$/;" t class:std::istream_iterator access:public +std::istream_iterator::operator * cpp_src/stream_iterator.h /^ operator*() const$/;" f class:std::istream_iterator access:public signature:() const +std::istream_iterator::operator ++ cpp_src/stream_iterator.h /^ operator++()$/;" f class:std::istream_iterator access:public signature:() +std::istream_iterator::operator ++ cpp_src/stream_iterator.h /^ operator++(int)$/;" f class:std::istream_iterator access:public signature:(int) +std::istream_iterator::operator -> cpp_src/stream_iterator.h /^ operator->() const { return &(operator*()); }$/;" f class:std::istream_iterator access:public signature:() const +std::istream_iterator::traits_type cpp_src/stream_iterator.h /^ typedef _Traits traits_type;$/;" t class:std::istream_iterator access:public +std::istreambuf_iterator cpp_src/streambuf_iterator.h /^ class istreambuf_iterator$/;" c namespace:std inherits:iterator +std::istreambuf_iterator::_M_at_eof cpp_src/streambuf_iterator.h /^ _M_at_eof() const$/;" f class:std::istreambuf_iterator access:private signature:() const +std::istreambuf_iterator::_M_c cpp_src/streambuf_iterator.h /^ mutable int_type _M_c;$/;" m class:std::istreambuf_iterator access:private +std::istreambuf_iterator::_M_get cpp_src/streambuf_iterator.h /^ _M_get() const$/;" f class:std::istreambuf_iterator access:private signature:() const +std::istreambuf_iterator::_M_sbuf cpp_src/streambuf_iterator.h /^ mutable streambuf_type* _M_sbuf;$/;" m class:std::istreambuf_iterator access:private +std::istreambuf_iterator::__copy_aux cpp_src/streambuf_iterator.h /^ __copy_aux(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>,$/;" p class:std::istreambuf_iterator access:friend signature:(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, _CharT2*) +std::istreambuf_iterator::char_type cpp_src/streambuf_iterator.h /^ typedef _CharT char_type;$/;" t class:std::istreambuf_iterator access:public +std::istreambuf_iterator::copy cpp_src/streambuf_iterator.h /^ copy(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>,$/;" p class:std::istreambuf_iterator access:friend signature:(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, ostreambuf_iterator<_CharT2>) +std::istreambuf_iterator::equal cpp_src/streambuf_iterator.h /^ equal(const istreambuf_iterator& __b) const$/;" f class:std::istreambuf_iterator access:public signature:(const istreambuf_iterator& __b) const +std::istreambuf_iterator::find cpp_src/streambuf_iterator.h /^ find(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>,$/;" p class:std::istreambuf_iterator access:friend signature:(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, const _CharT2&) +std::istreambuf_iterator::int_type cpp_src/streambuf_iterator.h /^ typedef typename _Traits::int_type int_type;$/;" t class:std::istreambuf_iterator access:public +std::istreambuf_iterator::istream_type cpp_src/streambuf_iterator.h /^ typedef basic_istream<_CharT, _Traits> istream_type;$/;" t class:std::istreambuf_iterator access:public +std::istreambuf_iterator::istreambuf_iterator cpp_src/streambuf_iterator.h /^ istreambuf_iterator() throw()$/;" f class:std::istreambuf_iterator access:public signature:() +std::istreambuf_iterator::istreambuf_iterator cpp_src/streambuf_iterator.h /^ istreambuf_iterator(istream_type& __s) throw()$/;" f class:std::istreambuf_iterator access:public signature:(istream_type& __s) +std::istreambuf_iterator::istreambuf_iterator cpp_src/streambuf_iterator.h /^ istreambuf_iterator(streambuf_type* __s) throw()$/;" f class:std::istreambuf_iterator access:public signature:(streambuf_type* __s) +std::istreambuf_iterator::operator * cpp_src/streambuf_iterator.h /^ operator*() const$/;" f class:std::istreambuf_iterator access:public signature:() const +std::istreambuf_iterator::operator ++ cpp_src/streambuf_iterator.h /^ operator++()$/;" f class:std::istreambuf_iterator access:public signature:() +std::istreambuf_iterator::operator ++ cpp_src/streambuf_iterator.h /^ operator++(int)$/;" f class:std::istreambuf_iterator access:public signature:(int) +std::istreambuf_iterator::streambuf_type cpp_src/streambuf_iterator.h /^ typedef basic_streambuf<_CharT, _Traits> streambuf_type;$/;" t class:std::istreambuf_iterator access:public +std::istreambuf_iterator::traits_type cpp_src/streambuf_iterator.h /^ typedef _Traits traits_type;$/;" t class:std::istreambuf_iterator access:public +std::istringstream cpp_src/iosfwd /^ typedef basic_istringstream istringstream; \/\/\/< @isiosfwd$/;" t namespace:std file: +std::isupper cpp_src/locale_facets.h /^ isupper(_CharT __c, const locale& __loc)$/;" f namespace:std signature:(_CharT __c, const locale& __loc) +std::isupper cpp_src/localefwd.h /^ isupper(_CharT, const locale&);$/;" p namespace:std signature:(_CharT, const locale&) +std::isxdigit cpp_src/locale_facets.h /^ isxdigit(_CharT __c, const locale& __loc)$/;" f namespace:std signature:(_CharT __c, const locale& __loc) +std::isxdigit cpp_src/localefwd.h /^ isxdigit(_CharT, const locale&);$/;" p namespace:std signature:(_CharT, const locale&) +std::iter_swap cpp_src/stl_algobase.h /^ iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)$/;" f namespace:std signature:(_ForwardIterator1 __a, _ForwardIterator2 __b) +std::iterator cpp_src/stl_iterator_base_types.h /^ struct iterator$/;" s namespace:std +std::iterator::difference_type cpp_src/stl_iterator_base_types.h /^ typedef _Distance difference_type;$/;" t struct:std::iterator access:public +std::iterator::iterator_category cpp_src/stl_iterator_base_types.h /^ typedef _Category iterator_category;$/;" t struct:std::iterator access:public +std::iterator::pointer cpp_src/stl_iterator_base_types.h /^ typedef _Pointer pointer;$/;" t struct:std::iterator access:public +std::iterator::reference cpp_src/stl_iterator_base_types.h /^ typedef _Reference reference;$/;" t struct:std::iterator access:public +std::iterator::value_type cpp_src/stl_iterator_base_types.h /^ typedef _Tp value_type;$/;" t struct:std::iterator access:public +std::iterator_traits cpp_src/stl_iterator_base_types.h /^ struct iterator_traits$/;" s namespace:std +std::iterator_traits cpp_src/stl_iterator_base_types.h /^ struct iterator_traits<_Tp*>$/;" s namespace:std +std::iterator_traits cpp_src/stl_iterator_base_types.h /^ struct iterator_traits$/;" s namespace:std +std::iterator_traits::difference_type cpp_src/stl_iterator_base_types.h /^ typedef ptrdiff_t difference_type;$/;" t struct:std::iterator_traits access:public +std::iterator_traits::difference_type cpp_src/stl_iterator_base_types.h /^ typedef typename _Iterator::difference_type difference_type;$/;" t struct:std::iterator_traits access:public +std::iterator_traits::iterator_category cpp_src/stl_iterator_base_types.h /^ typedef random_access_iterator_tag iterator_category;$/;" t struct:std::iterator_traits access:public +std::iterator_traits::iterator_category cpp_src/stl_iterator_base_types.h /^ typedef typename _Iterator::iterator_category iterator_category;$/;" t struct:std::iterator_traits access:public +std::iterator_traits::pointer cpp_src/stl_iterator_base_types.h /^ typedef _Tp* pointer;$/;" t struct:std::iterator_traits access:public +std::iterator_traits::pointer cpp_src/stl_iterator_base_types.h /^ typedef const _Tp* pointer;$/;" t struct:std::iterator_traits access:public +std::iterator_traits::pointer cpp_src/stl_iterator_base_types.h /^ typedef typename _Iterator::pointer pointer;$/;" t struct:std::iterator_traits access:public +std::iterator_traits::reference cpp_src/stl_iterator_base_types.h /^ typedef _Tp& reference;$/;" t struct:std::iterator_traits access:public +std::iterator_traits::reference cpp_src/stl_iterator_base_types.h /^ typedef const _Tp& reference;$/;" t struct:std::iterator_traits access:public +std::iterator_traits::reference cpp_src/stl_iterator_base_types.h /^ typedef typename _Iterator::reference reference;$/;" t struct:std::iterator_traits access:public +std::iterator_traits::value_type cpp_src/stl_iterator_base_types.h /^ typedef _Tp value_type;$/;" t struct:std::iterator_traits access:public +std::iterator_traits::value_type cpp_src/stl_iterator_base_types.h /^ typedef typename _Iterator::value_type value_type;$/;" t struct:std::iterator_traits access:public +std::ldexp cpp_src/cmath /^ ldexp(_Tp __x, int __exp)$/;" f namespace:std signature:(_Tp __x, int __exp) +std::ldexp cpp_src/cmath /^ ldexp(float __x, int __exp)$/;" f namespace:std signature:(float __x, int __exp) +std::ldexp cpp_src/cmath /^ ldexp(long double __x, int __exp)$/;" f namespace:std signature:(long double __x, int __exp) +std::left cpp_src/ios_base.h /^ left(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +std::length_error cpp_src/stdexcept /^ class length_error : public logic_error $/;" c namespace:std file: inherits:logic_error +std::length_error::length_error cpp_src/stdexcept /^ explicit length_error(const string& __arg);$/;" p class:std::length_error file: access:public signature:(const string& __arg) +std::less cpp_src/stl_function.h /^ struct less : public binary_function<_Tp, _Tp, bool>$/;" s namespace:std inherits:binary_function +std::less::operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::less access:public signature:(const _Tp& __x, const _Tp& __y) const +std::less_equal cpp_src/stl_function.h /^ struct less_equal : public binary_function<_Tp, _Tp, bool>$/;" s namespace:std inherits:binary_function +std::less_equal::operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::less_equal access:public signature:(const _Tp& __x, const _Tp& __y) const +std::lexicographical_compare cpp_src/stl_algobase.h /^ lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) +std::lexicographical_compare cpp_src/stl_algobase.h /^ lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) +std::lexicographical_compare cpp_src/stl_algobase.h /^ lexicographical_compare(const char* __first1, const char* __last1,$/;" f namespace:std signature:(const char* __first1, const char* __last1, const char* __first2, const char* __last2) +std::lexicographical_compare cpp_src/stl_algobase.h /^ lexicographical_compare(const unsigned char* __first1,$/;" f namespace:std signature:(const unsigned char* __first1, const unsigned char* __last1, const unsigned char* __first2, const unsigned char* __last2) +std::list cpp_src/stl_list.h /^ class list : protected _List_base<_Tp, _Alloc>$/;" c namespace:std inherits:_List_base +std::list::_Alloc_value_type cpp_src/stl_list.h /^ typedef typename _Alloc::value_type _Alloc_value_type;$/;" t class:std::list access:private +std::list::_Base cpp_src/stl_list.h /^ typedef _List_base<_Tp, _Alloc> _Base;$/;" t class:std::list access:private +std::list::_M_assign_dispatch cpp_src/list.tcc /^ _M_assign_dispatch(_InputIterator __first2, _InputIterator __last2,$/;" f class:std::list signature:(_InputIterator __first2, _InputIterator __last2, __false_type) +std::list::_M_assign_dispatch cpp_src/stl_list.h /^ _M_assign_dispatch(_InputIterator __first, _InputIterator __last,$/;" p class:std::list access:protected signature:(_InputIterator __first, _InputIterator __last, __false_type) +std::list::_M_assign_dispatch cpp_src/stl_list.h /^ _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)$/;" f class:std::list access:protected signature:(_Integer __n, _Integer __val, __true_type) +std::list::_M_check_equal_allocators cpp_src/stl_list.h /^ _M_check_equal_allocators(list& __x)$/;" f class:std::list access:protected signature:(list& __x) +std::list::_M_create_node cpp_src/stl_list.h /^ _M_create_node(const value_type& __x)$/;" f class:std::list access:protected signature:(const value_type& __x) +std::list::_M_erase cpp_src/stl_list.h /^ _M_erase(iterator __position)$/;" f class:std::list access:protected signature:(iterator __position) +std::list::_M_fill_assign cpp_src/list.tcc /^ _M_fill_assign(size_type __n, const value_type& __val)$/;" f class:std::list signature:(size_type __n, const value_type& __val) +std::list::_M_fill_assign cpp_src/stl_list.h /^ _M_fill_assign(size_type __n, const value_type& __val);$/;" p class:std::list access:protected signature:(size_type __n, const value_type& __val) +std::list::_M_fill_initialize cpp_src/stl_list.h /^ _M_fill_initialize(size_type __n, const value_type& __x)$/;" f class:std::list access:protected signature:(size_type __n, const value_type& __x) +std::list::_M_initialize_dispatch cpp_src/stl_list.h /^ _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,$/;" f class:std::list access:protected signature:(_InputIterator __first, _InputIterator __last, __false_type) +std::list::_M_initialize_dispatch cpp_src/stl_list.h /^ _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type)$/;" f class:std::list access:protected signature:(_Integer __n, _Integer __x, __true_type) +std::list::_M_insert cpp_src/stl_list.h /^ _M_insert(iterator __position, const value_type& __x)$/;" f class:std::list access:protected signature:(iterator __position, const value_type& __x) +std::list::_M_transfer cpp_src/stl_list.h /^ _M_transfer(iterator __position, iterator __first, iterator __last)$/;" f class:std::list access:protected signature:(iterator __position, iterator __first, iterator __last) +std::list::_Node cpp_src/stl_list.h /^ typedef _List_node<_Tp> _Node;$/;" t class:std::list access:protected +std::list::_Tp_alloc_type cpp_src/stl_list.h /^ typedef typename _Base::_Tp_alloc_type _Tp_alloc_type;$/;" t class:std::list access:private +std::list::allocator_type cpp_src/stl_list.h /^ typedef _Alloc allocator_type;$/;" t class:std::list access:public +std::list::assign cpp_src/stl_list.h /^ assign(_InputIterator __first, _InputIterator __last)$/;" f class:std::list access:public signature:(_InputIterator __first, _InputIterator __last) +std::list::assign cpp_src/stl_list.h /^ assign(size_type __n, const value_type& __val)$/;" f class:std::list access:public signature:(size_type __n, const value_type& __val) +std::list::back cpp_src/stl_list.h /^ back() const$/;" f class:std::list access:public signature:() const +std::list::back cpp_src/stl_list.h /^ back()$/;" f class:std::list access:public signature:() +std::list::begin cpp_src/stl_list.h /^ begin() const$/;" f class:std::list access:public signature:() const +std::list::begin cpp_src/stl_list.h /^ begin()$/;" f class:std::list access:public signature:() +std::list::clear cpp_src/stl_list.h /^ clear()$/;" f class:std::list access:public signature:() +std::list::const_iterator cpp_src/stl_list.h /^ typedef _List_const_iterator<_Tp> const_iterator;$/;" t class:std::list access:public +std::list::const_pointer cpp_src/stl_list.h /^ typedef typename _Tp_alloc_type::const_pointer const_pointer;$/;" t class:std::list access:public +std::list::const_reference cpp_src/stl_list.h /^ typedef typename _Tp_alloc_type::const_reference const_reference;$/;" t class:std::list access:public +std::list::const_reverse_iterator cpp_src/stl_list.h /^ typedef std::reverse_iterator const_reverse_iterator;$/;" t class:std::list access:public +std::list::difference_type cpp_src/stl_list.h /^ typedef ptrdiff_t difference_type;$/;" t class:std::list access:public +std::list::empty cpp_src/stl_list.h /^ empty() const$/;" f class:std::list access:public signature:() const +std::list::end cpp_src/stl_list.h /^ end() const$/;" f class:std::list access:public signature:() const +std::list::end cpp_src/stl_list.h /^ end()$/;" f class:std::list access:public signature:() +std::list::erase cpp_src/list.tcc /^ erase(iterator __position)$/;" f class:std::list signature:(iterator __position) +std::list::erase cpp_src/stl_list.h /^ erase(iterator __first, iterator __last)$/;" f class:std::list access:public signature:(iterator __first, iterator __last) +std::list::erase cpp_src/stl_list.h /^ erase(iterator __position);$/;" p class:std::list access:public signature:(iterator __position) +std::list::front cpp_src/stl_list.h /^ front() const$/;" f class:std::list access:public signature:() const +std::list::front cpp_src/stl_list.h /^ front()$/;" f class:std::list access:public signature:() +std::list::get_allocator cpp_src/stl_list.h /^ get_allocator() const$/;" f class:std::list access:public signature:() const +std::list::insert cpp_src/list.tcc /^ insert(iterator __position, const value_type& __x)$/;" f class:std::list signature:(iterator __position, const value_type& __x) +std::list::insert cpp_src/stl_list.h /^ insert(iterator __position, _InputIterator __first,$/;" f class:std::list access:public signature:(iterator __position, _InputIterator __first, _InputIterator __last) +std::list::insert cpp_src/stl_list.h /^ insert(iterator __position, const value_type& __x);$/;" p class:std::list access:public signature:(iterator __position, const value_type& __x) +std::list::insert cpp_src/stl_list.h /^ insert(iterator __position, size_type __n, const value_type& __x)$/;" f class:std::list access:public signature:(iterator __position, size_type __n, const value_type& __x) +std::list::iterator cpp_src/stl_list.h /^ typedef _List_iterator<_Tp> iterator;$/;" t class:std::list access:public +std::list::list cpp_src/stl_list.h /^ list(_InputIterator __first, _InputIterator __last,$/;" f class:std::list access:public signature:(_InputIterator __first, _InputIterator __last, const allocator_type& __a = allocator_type()) +std::list::list cpp_src/stl_list.h /^ list(const allocator_type& __a = allocator_type())$/;" f class:std::list access:public signature:(const allocator_type& __a = allocator_type()) +std::list::list cpp_src/stl_list.h /^ list(const list& __x)$/;" f class:std::list access:public signature:(const list& __x) +std::list::list cpp_src/stl_list.h /^ list(size_type __n, const value_type& __value = value_type(),$/;" f class:std::list access:public signature:(size_type __n, const value_type& __value = value_type(), const allocator_type& __a = allocator_type()) +std::list::max_size cpp_src/stl_list.h /^ max_size() const$/;" f class:std::list access:public signature:() const +std::list::merge cpp_src/list.tcc /^ merge(list& __x, _StrictWeakOrdering __comp)$/;" f class:std::list signature:(list& __x, _StrictWeakOrdering __comp) +std::list::merge cpp_src/list.tcc /^ merge(list& __x)$/;" f class:std::list signature:(list& __x) +std::list::merge cpp_src/stl_list.h /^ merge(list&, _StrictWeakOrdering);$/;" p class:std::list access:public signature:(list&, _StrictWeakOrdering) +std::list::merge cpp_src/stl_list.h /^ merge(list& __x);$/;" p class:std::list access:public signature:(list& __x) +std::list::operator = cpp_src/list.tcc /^ operator=(const list& __x)$/;" f class:std::list signature:(const list& __x) +std::list::operator = cpp_src/stl_list.h /^ operator=(const list& __x);$/;" p class:std::list access:public signature:(const list& __x) +std::list::pointer cpp_src/stl_list.h /^ typedef typename _Tp_alloc_type::pointer pointer;$/;" t class:std::list access:public +std::list::pop_back cpp_src/stl_list.h /^ pop_back()$/;" f class:std::list access:public signature:() +std::list::pop_front cpp_src/stl_list.h /^ pop_front()$/;" f class:std::list access:public signature:() +std::list::push_back cpp_src/stl_list.h /^ push_back(const value_type& __x)$/;" f class:std::list access:public signature:(const value_type& __x) +std::list::push_front cpp_src/stl_list.h /^ push_front(const value_type& __x)$/;" f class:std::list access:public signature:(const value_type& __x) +std::list::rbegin cpp_src/stl_list.h /^ rbegin() const$/;" f class:std::list access:public signature:() const +std::list::rbegin cpp_src/stl_list.h /^ rbegin()$/;" f class:std::list access:public signature:() +std::list::reference cpp_src/stl_list.h /^ typedef typename _Tp_alloc_type::reference reference;$/;" t class:std::list access:public +std::list::remove cpp_src/list.tcc /^ remove(const value_type& __value)$/;" f class:std::list signature:(const value_type& __value) +std::list::remove cpp_src/stl_list.h /^ remove(const _Tp& __value);$/;" p class:std::list access:public signature:(const _Tp& __value) +std::list::remove_if cpp_src/list.tcc /^ remove_if(_Predicate __pred)$/;" f class:std::list signature:(_Predicate __pred) +std::list::remove_if cpp_src/stl_list.h /^ remove_if(_Predicate);$/;" p class:std::list access:public signature:(_Predicate) +std::list::rend cpp_src/stl_list.h /^ rend() const$/;" f class:std::list access:public signature:() const +std::list::rend cpp_src/stl_list.h /^ rend()$/;" f class:std::list access:public signature:() +std::list::resize cpp_src/list.tcc /^ resize(size_type __new_size, value_type __x)$/;" f class:std::list signature:(size_type __new_size, value_type __x) +std::list::resize cpp_src/stl_list.h /^ resize(size_type __new_size, value_type __x = value_type());$/;" p class:std::list access:public signature:(size_type __new_size, value_type __x = value_type()) +std::list::reverse cpp_src/stl_list.h /^ reverse()$/;" f class:std::list access:public signature:() +std::list::reverse_iterator cpp_src/stl_list.h /^ typedef std::reverse_iterator reverse_iterator;$/;" t class:std::list access:public +std::list::size cpp_src/stl_list.h /^ size() const$/;" f class:std::list access:public signature:() const +std::list::size_type cpp_src/stl_list.h /^ typedef size_t size_type;$/;" t class:std::list access:public +std::list::sort cpp_src/list.tcc /^ sort(_StrictWeakOrdering __comp)$/;" f class:std::list signature:(_StrictWeakOrdering __comp) +std::list::sort cpp_src/list.tcc /^ sort()$/;" f class:std::list signature:() +std::list::sort cpp_src/stl_list.h /^ sort(_StrictWeakOrdering);$/;" p class:std::list access:public signature:(_StrictWeakOrdering) +std::list::sort cpp_src/stl_list.h /^ sort();$/;" p class:std::list access:public signature:() +std::list::splice cpp_src/stl_list.h /^ splice(iterator __position, list& __x)$/;" f class:std::list access:public signature:(iterator __position, list& __x) +std::list::splice cpp_src/stl_list.h /^ splice(iterator __position, list& __x, iterator __first, iterator __last)$/;" f class:std::list access:public signature:(iterator __position, list& __x, iterator __first, iterator __last) +std::list::splice cpp_src/stl_list.h /^ splice(iterator __position, list& __x, iterator __i)$/;" f class:std::list access:public signature:(iterator __position, list& __x, iterator __i) +std::list::swap cpp_src/stl_list.h /^ swap(list& __x)$/;" f class:std::list access:public signature:(list& __x) +std::list::unique cpp_src/list.tcc /^ unique(_BinaryPredicate __binary_pred)$/;" f class:std::list signature:(_BinaryPredicate __binary_pred) +std::list::unique cpp_src/list.tcc /^ unique()$/;" f class:std::list signature:() +std::list::unique cpp_src/stl_list.h /^ unique(_BinaryPredicate);$/;" p class:std::list access:public signature:(_BinaryPredicate) +std::list::unique cpp_src/stl_list.h /^ unique();$/;" p class:std::list access:public signature:() +std::list::value_type cpp_src/stl_list.h /^ typedef _Tp value_type;$/;" t class:std::list access:public +std::locale cpp_src/locale_classes.h /^ class locale$/;" c namespace:std +std::locale::_Impl cpp_src/locale_classes.h /^ class locale::_Impl$/;" c class:std::locale +std::locale::_Impl::_Impl cpp_src/locale_classes.h /^ _Impl(const _Impl&); \/\/ Not defined.$/;" p class:std::locale::_Impl access:private signature:(const _Impl&) +std::locale::_Impl::_Impl cpp_src/locale_classes.h /^ _Impl(const _Impl&, size_t);$/;" p class:std::locale::_Impl access:private signature:(const _Impl&, size_t) +std::locale::_Impl::_Impl cpp_src/locale_classes.h /^ _Impl(const char*, size_t);$/;" p class:std::locale::_Impl access:private signature:(const char*, size_t) +std::locale::_Impl::_Impl cpp_src/locale_classes.h /^ _Impl(size_t) throw();$/;" p class:std::locale::_Impl access:private signature:(size_t) +std::locale::_Impl::_M_add_reference cpp_src/locale_classes.h /^ _M_add_reference() throw()$/;" f class:std::locale::_Impl access:private signature:() +std::locale::_Impl::_M_caches cpp_src/locale_classes.h /^ const facet** _M_caches;$/;" m class:std::locale::_Impl access:private +std::locale::_Impl::_M_check_same_name cpp_src/locale_classes.h /^ _M_check_same_name()$/;" f class:std::locale::_Impl access:private signature:() +std::locale::_Impl::_M_facets cpp_src/locale_classes.h /^ const facet** _M_facets;$/;" m class:std::locale::_Impl access:private +std::locale::_Impl::_M_facets_size cpp_src/locale_classes.h /^ size_t _M_facets_size;$/;" m class:std::locale::_Impl access:private +std::locale::_Impl::_M_init_facet cpp_src/locale_classes.h /^ _M_init_facet(_Facet* __facet)$/;" f class:std::locale::_Impl access:private signature:(_Facet* __facet) +std::locale::_Impl::_M_install_cache cpp_src/locale_classes.h /^ _M_install_cache(const facet*, size_t);$/;" p class:std::locale::_Impl access:private signature:(const facet*, size_t) +std::locale::_Impl::_M_install_facet cpp_src/locale_classes.h /^ _M_install_facet(const locale::id*, const facet*);$/;" p class:std::locale::_Impl access:private signature:(const locale::id*, const facet*) +std::locale::_Impl::_M_names cpp_src/locale_classes.h /^ char** _M_names;$/;" m class:std::locale::_Impl access:private +std::locale::_Impl::_M_refcount cpp_src/locale_classes.h /^ _Atomic_word _M_refcount;$/;" m class:std::locale::_Impl access:private +std::locale::_Impl::_M_remove_reference cpp_src/locale_classes.h /^ _M_remove_reference() throw()$/;" f class:std::locale::_Impl access:private signature:() +std::locale::_Impl::_M_replace_categories cpp_src/locale_classes.h /^ _M_replace_categories(const _Impl*, category);$/;" p class:std::locale::_Impl access:private signature:(const _Impl*, category) +std::locale::_Impl::_M_replace_category cpp_src/locale_classes.h /^ _M_replace_category(const _Impl*, const locale::id* const*);$/;" p class:std::locale::_Impl access:private signature:(const _Impl*, const locale::id* const*) +std::locale::_Impl::_M_replace_facet cpp_src/locale_classes.h /^ _M_replace_facet(const _Impl*, const locale::id*);$/;" p class:std::locale::_Impl access:private signature:(const _Impl*, const locale::id*) +std::locale::_Impl::has_facet cpp_src/locale_classes.h /^ has_facet(const locale&) throw();$/;" p class:std::locale::_Impl access:friend signature:(const locale&) +std::locale::_Impl::locale::_S_facet_categories cpp_src/locale_classes.h /^ static const locale::id* const* const _S_facet_categories[];$/;" m class:std::locale::_Impl::locale access:private +std::locale::_Impl::locale::_S_id_collate cpp_src/locale_classes.h /^ static const locale::id* const _S_id_collate[];$/;" m class:std::locale::_Impl::locale access:private +std::locale::_Impl::locale::_S_id_ctype cpp_src/locale_classes.h /^ static const locale::id* const _S_id_ctype[];$/;" m class:std::locale::_Impl::locale access:private +std::locale::_Impl::locale::_S_id_messages cpp_src/locale_classes.h /^ static const locale::id* const _S_id_messages[];$/;" m class:std::locale::_Impl::locale access:private +std::locale::_Impl::locale::_S_id_monetary cpp_src/locale_classes.h /^ static const locale::id* const _S_id_monetary[];$/;" m class:std::locale::_Impl::locale access:private +std::locale::_Impl::locale::_S_id_numeric cpp_src/locale_classes.h /^ static const locale::id* const _S_id_numeric[];$/;" m class:std::locale::_Impl::locale access:private +std::locale::_Impl::locale::_S_id_time cpp_src/locale_classes.h /^ static const locale::id* const _S_id_time[];$/;" m class:std::locale::_Impl::locale access:private +std::locale::_Impl::operator = cpp_src/locale_classes.h /^ operator=(const _Impl&); \/\/ Not defined.$/;" p class:std::locale::_Impl access:private signature:(const _Impl&) +std::locale::_Impl::use_facet cpp_src/locale_classes.h /^ use_facet(const locale&);$/;" p class:std::locale::_Impl access:friend signature:(const locale&) +std::locale::_Impl::~_Impl cpp_src/locale_classes.h /^ ~_Impl() throw();$/;" p class:std::locale::_Impl access:private signature:() +std::locale::_M_coalesce cpp_src/locale_classes.h /^ _M_coalesce(const locale& __base, const locale& __add, category __cat);$/;" p class:std::locale access:private signature:(const locale& __base, const locale& __add, category __cat) +std::locale::_M_impl cpp_src/locale_classes.h /^ _Impl* _M_impl;$/;" m class:std::locale access:private +std::locale::_S_categories cpp_src/locale_classes.h /^ static const char* const* const _S_categories;$/;" m class:std::locale access:private +std::locale::_S_categories_size cpp_src/locale_classes.h /^ enum { _S_categories_size = 6 + _GLIBCXX_NUM_CATEGORIES };$/;" e enum:std::locale::__anon4 +std::locale::_S_classic cpp_src/locale_classes.h /^ static _Impl* _S_classic;$/;" m class:std::locale access:private +std::locale::_S_global cpp_src/locale_classes.h /^ static _Impl* _S_global;$/;" m class:std::locale access:private +std::locale::_S_initialize cpp_src/locale_classes.h /^ _S_initialize();$/;" p class:std::locale access:private signature:() +std::locale::_S_initialize_once cpp_src/locale_classes.h /^ _S_initialize_once();$/;" p class:std::locale access:private signature:() +std::locale::_S_normalize_category cpp_src/locale_classes.h /^ _S_normalize_category(category);$/;" p class:std::locale access:private signature:(category) +std::locale::_S_once cpp_src/locale_classes.h /^ static __gthread_once_t _S_once;$/;" m class:std::locale access:private +std::locale::all cpp_src/locale_classes.h /^ static const category all = (ctype | numeric | collate |$/;" m class:std::locale access:public +std::locale::category cpp_src/locale_classes.h /^ typedef int category;$/;" t class:std::locale access:public +std::locale::classic cpp_src/locale_classes.h /^ classic();$/;" p class:std::locale access:public signature:() +std::locale::collate cpp_src/locale_classes.h /^ static const category collate = 1L << 2;$/;" m class:std::locale access:public +std::locale::combine cpp_src/locale_classes.h /^ combine(const locale& __other) const;$/;" p class:std::locale access:public signature:(const locale& __other) const +std::locale::combine cpp_src/locale_facets.tcc /^ locale::combine(const locale& __other) const$/;" f class:std::locale signature:(const locale& __other) const +std::locale::ctype cpp_src/locale_classes.h /^ static const category ctype = 1L << 0;$/;" m class:std::locale access:public +std::locale::facet cpp_src/locale_classes.h /^ class locale::facet$/;" c class:std::locale +std::locale::facet::_M_add_reference cpp_src/locale_classes.h /^ _M_add_reference() const throw()$/;" f class:std::locale::facet access:private signature:() const +std::locale::facet::_M_refcount cpp_src/locale_classes.h /^ mutable _Atomic_word _M_refcount;$/;" m class:std::locale::facet access:private +std::locale::facet::_M_remove_reference cpp_src/locale_classes.h /^ _M_remove_reference() const throw()$/;" f class:std::locale::facet access:private signature:() const +std::locale::facet::_S_c_locale cpp_src/locale_classes.h /^ static __c_locale _S_c_locale;$/;" m class:std::locale::facet access:private +std::locale::facet::_S_c_name cpp_src/locale_classes.h /^ static const char _S_c_name[2];$/;" m class:std::locale::facet access:private +std::locale::facet::_S_clone_c_locale cpp_src/locale_classes.h /^ _S_clone_c_locale(__c_locale& __cloc);$/;" p class:std::locale::facet access:protected signature:(__c_locale& __cloc) +std::locale::facet::_S_create_c_locale cpp_src/locale_classes.h /^ _S_create_c_locale(__c_locale& __cloc, const char* __s,$/;" p class:std::locale::facet access:protected signature:(__c_locale& __cloc, const char* __s, __c_locale __old = 0) +std::locale::facet::_S_destroy_c_locale cpp_src/locale_classes.h /^ _S_destroy_c_locale(__c_locale& __cloc);$/;" p class:std::locale::facet access:protected signature:(__c_locale& __cloc) +std::locale::facet::_S_get_c_locale cpp_src/locale_classes.h /^ _S_get_c_locale();$/;" p class:std::locale::facet access:protected signature:() +std::locale::facet::_S_get_c_name cpp_src/locale_classes.h /^ _S_get_c_name();$/;" p class:std::locale::facet access:protected signature:() +std::locale::facet::_S_initialize_once cpp_src/locale_classes.h /^ _S_initialize_once();$/;" p class:std::locale::facet access:private signature:() +std::locale::facet::_S_once cpp_src/locale_classes.h /^ static __gthread_once_t _S_once;$/;" m class:std::locale::facet access:private +std::locale::facet::facet cpp_src/locale_classes.h /^ facet(const facet&); \/\/ Not defined.$/;" p class:std::locale::facet access:private signature:(const facet&) +std::locale::facet::facet cpp_src/locale_classes.h /^ facet(size_t __refs = 0) throw() : _M_refcount(__refs ? 1 : 0)$/;" f class:std::locale::facet access:protected signature:(size_t __refs = 0) +std::locale::facet::operator = cpp_src/locale_classes.h /^ operator=(const facet&); \/\/ Not defined.$/;" p class:std::locale::facet access:private signature:(const facet&) +std::locale::facet::~facet cpp_src/locale_classes.h /^ ~facet();$/;" p class:std::locale::facet access:protected signature:() +std::locale::global cpp_src/locale_classes.h /^ global(const locale&);$/;" p class:std::locale access:public signature:(const locale&) +std::locale::has_facet cpp_src/locale_classes.h /^ has_facet(const locale&) throw();$/;" p class:std::locale access:friend signature:(const locale&) +std::locale::id cpp_src/locale_classes.h /^ class locale::id$/;" c class:std::locale +std::locale::id::_M_id cpp_src/locale_classes.h /^ _M_id() const;$/;" p class:std::locale::id access:public signature:() const +std::locale::id::_M_index cpp_src/locale_classes.h /^ mutable size_t _M_index;$/;" m class:std::locale::id access:private +std::locale::id::_S_refcount cpp_src/locale_classes.h /^ static _Atomic_word _S_refcount;$/;" m class:std::locale::id access:private +std::locale::id::has_facet cpp_src/locale_classes.h /^ has_facet(const locale&) throw ();$/;" p class:std::locale::id access:friend signature:(const locale&) +std::locale::id::id cpp_src/locale_classes.h /^ id() { }$/;" f class:std::locale::id access:public signature:() +std::locale::id::id cpp_src/locale_classes.h /^ id(const id&); \/\/ Not defined.$/;" p class:std::locale::id access:private signature:(const id&) +std::locale::id::operator = cpp_src/locale_classes.h /^ operator=(const id&); \/\/ Not defined.$/;" p class:std::locale::id access:private signature:(const id&) +std::locale::id::use_facet cpp_src/locale_classes.h /^ use_facet(const locale&);$/;" p class:std::locale::id access:friend signature:(const locale&) +std::locale::locale cpp_src/locale_classes.h /^ locale(const locale& __other, _Facet* __f);$/;" p class:std::locale access:public signature:(const locale& __other, _Facet* __f) +std::locale::locale cpp_src/locale_classes.h /^ locale() throw();$/;" p class:std::locale access:public signature:() +std::locale::locale cpp_src/locale_classes.h /^ locale(_Impl*) throw();$/;" p class:std::locale access:private signature:(_Impl*) +std::locale::locale cpp_src/locale_classes.h /^ locale(const char* __s);$/;" p class:std::locale access:public signature:(const char* __s) +std::locale::locale cpp_src/locale_classes.h /^ locale(const locale& __base, const char* __s, category __cat);$/;" p class:std::locale access:public signature:(const locale& __base, const char* __s, category __cat) +std::locale::locale cpp_src/locale_classes.h /^ locale(const locale& __base, const locale& __add, category __cat);$/;" p class:std::locale access:public signature:(const locale& __base, const locale& __add, category __cat) +std::locale::locale cpp_src/locale_classes.h /^ locale(const locale& __other) throw();$/;" p class:std::locale access:public signature:(const locale& __other) +std::locale::locale cpp_src/locale_classes.h /^ locale::locale(const locale& __other, _Facet* __f)$/;" f class:std::locale signature:(const locale& __other, _Facet* __f) +std::locale::messages cpp_src/locale_classes.h /^ static const category messages = 1L << 5;$/;" m class:std::locale access:public +std::locale::monetary cpp_src/locale_classes.h /^ static const category monetary = 1L << 4;$/;" m class:std::locale access:public +std::locale::name cpp_src/locale_classes.h /^ name() const;$/;" p class:std::locale access:public signature:() const +std::locale::none cpp_src/locale_classes.h /^ static const category none = 0;$/;" m class:std::locale access:public +std::locale::numeric cpp_src/locale_classes.h /^ static const category numeric = 1L << 1;$/;" m class:std::locale access:public +std::locale::operator != cpp_src/locale_classes.h /^ operator!=(const locale& __other) const throw ()$/;" f class:std::locale access:public signature:(const locale& __other) const +std::locale::operator () cpp_src/locale_classes.h /^ operator()(const basic_string<_Char, _Traits, _Alloc>& __s1,$/;" p class:std::locale access:public signature:(const basic_string<_Char, _Traits, _Alloc>& __s1, const basic_string<_Char, _Traits, _Alloc>& __s2) const +std::locale::operator () cpp_src/locale_facets.tcc /^ locale::operator()(const basic_string<_CharT, _Traits, _Alloc>& __s1,$/;" f class:std::locale signature:(const basic_string<_CharT, _Traits, _Alloc>& __s1, const basic_string<_CharT, _Traits, _Alloc>& __s2) const +std::locale::operator = cpp_src/locale_classes.h /^ operator=(const locale& __other) throw();$/;" p class:std::locale access:public signature:(const locale& __other) +std::locale::operator == cpp_src/locale_classes.h /^ operator==(const locale& __other) const throw ();$/;" p class:std::locale access:public signature:(const locale& __other) const +std::locale::time cpp_src/locale_classes.h /^ static const category time = 1L << 3;$/;" m class:std::locale access:public +std::locale::use_facet cpp_src/locale_classes.h /^ use_facet(const locale&);$/;" p class:std::locale access:friend signature:(const locale&) +std::locale::~locale cpp_src/locale_classes.h /^ ~locale() throw();$/;" p class:std::locale access:public signature:() +std::log cpp_src/cmath /^ log(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +std::log cpp_src/cmath /^ log(float __x)$/;" f namespace:std signature:(float __x) +std::log cpp_src/cmath /^ log(long double __x)$/;" f namespace:std signature:(long double __x) +std::log cpp_src/complex /^ log(const complex<_Tp>& __z) { return __complex_log(__z); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::log cpp_src/complex /^ log(const complex<_Tp>& __z) { return __complex_log(__z.__rep()); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::log cpp_src/complex /^ template complex<_Tp> log(const complex<_Tp>&);$/;" p namespace:std file: signature:(const complex<_Tp>&) +std::log10 cpp_src/cmath /^ log10(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +std::log10 cpp_src/cmath /^ log10(float __x)$/;" f namespace:std signature:(float __x) +std::log10 cpp_src/cmath /^ log10(long double __x)$/;" f namespace:std signature:(long double __x) +std::log10 cpp_src/complex /^ log10(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::log10 cpp_src/complex /^ template complex<_Tp> log10(const complex<_Tp>&);$/;" p namespace:std file: signature:(const complex<_Tp>&) +std::logic_error cpp_src/stdexcept /^ class logic_error : public exception $/;" c namespace:std file: inherits:exception +std::logic_error::_M_msg cpp_src/stdexcept /^ string _M_msg;$/;" m class:std::logic_error file: access:private +std::logic_error::logic_error cpp_src/stdexcept /^ logic_error(const string& __arg);$/;" p class:std::logic_error file: access:public signature:(const string& __arg) +std::logic_error::what cpp_src/stdexcept /^ what() const throw();$/;" p class:std::logic_error file: access:public signature:() const +std::logic_error::~logic_error cpp_src/stdexcept /^ ~logic_error() throw();$/;" p class:std::logic_error file: access:public signature:() +std::logical_and cpp_src/stl_function.h /^ struct logical_and : public binary_function<_Tp, _Tp, bool>$/;" s namespace:std inherits:binary_function +std::logical_and::operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::logical_and access:public signature:(const _Tp& __x, const _Tp& __y) const +std::logical_not cpp_src/stl_function.h /^ struct logical_not : public unary_function<_Tp, bool>$/;" s namespace:std inherits:unary_function +std::logical_not::operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x) const$/;" f struct:std::logical_not access:public signature:(const _Tp& __x) const +std::logical_or cpp_src/stl_function.h /^ struct logical_or : public binary_function<_Tp, _Tp, bool>$/;" s namespace:std inherits:binary_function +std::logical_or::operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::logical_or access:public signature:(const _Tp& __x, const _Tp& __y) const +std::lower_bound cpp_src/stl_algo.h /^ lower_bound(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val) +std::lower_bound cpp_src/stl_algo.h /^ lower_bound(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val, _Compare __comp) +std::make_heap cpp_src/stl_heap.h /^ make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last) +std::make_heap cpp_src/stl_heap.h /^ make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) +std::make_pair cpp_src/stl_pair.h /^ make_pair(_T1 __x, _T2 __y)$/;" f namespace:std signature:(_T1 __x, _T2 __y) +std::map cpp_src/stl_map.h /^ class map$/;" c namespace:std +std::map::_Alloc_value_type cpp_src/stl_map.h /^ typedef typename _Alloc::value_type _Alloc_value_type;$/;" t class:std::map access:private +std::map::_M_t cpp_src/stl_map.h /^ _Rep_type _M_t;$/;" m class:std::map access:private +std::map::_Pair_alloc_type cpp_src/stl_map.h /^ _Pair_alloc_type;$/;" t class:std::map access:private +std::map::_Rep_type cpp_src/stl_map.h /^ key_compare, _Pair_alloc_type> _Rep_type;$/;" t class:std::map access:private +std::map::allocator_type cpp_src/stl_map.h /^ typedef _Alloc allocator_type;$/;" t class:std::map access:public +std::map::at cpp_src/stl_map.h /^ at(const key_type& __k) const$/;" f class:std::map access:public signature:(const key_type& __k) const +std::map::at cpp_src/stl_map.h /^ at(const key_type& __k)$/;" f class:std::map access:public signature:(const key_type& __k) +std::map::begin cpp_src/stl_map.h /^ begin() const$/;" f class:std::map access:public signature:() const +std::map::begin cpp_src/stl_map.h /^ begin()$/;" f class:std::map access:public signature:() +std::map::clear cpp_src/stl_map.h /^ clear()$/;" f class:std::map access:public signature:() +std::map::const_iterator cpp_src/stl_map.h /^ typedef typename _Rep_type::const_iterator const_iterator;$/;" t class:std::map access:public +std::map::const_pointer cpp_src/stl_map.h /^ typedef typename _Pair_alloc_type::const_pointer const_pointer;$/;" t class:std::map access:public +std::map::const_reference cpp_src/stl_map.h /^ typedef typename _Pair_alloc_type::const_reference const_reference;$/;" t class:std::map access:public +std::map::const_reverse_iterator cpp_src/stl_map.h /^ typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator;$/;" t class:std::map access:public +std::map::count cpp_src/stl_map.h /^ count(const key_type& __x) const$/;" f class:std::map access:public signature:(const key_type& __x) const +std::map::difference_type cpp_src/stl_map.h /^ typedef typename _Rep_type::difference_type difference_type;$/;" t class:std::map access:public +std::map::empty cpp_src/stl_map.h /^ empty() const$/;" f class:std::map access:public signature:() const +std::map::end cpp_src/stl_map.h /^ end() const$/;" f class:std::map access:public signature:() const +std::map::end cpp_src/stl_map.h /^ end()$/;" f class:std::map access:public signature:() +std::map::equal_range cpp_src/stl_map.h /^ equal_range(const key_type& __x) const$/;" f class:std::map access:public signature:(const key_type& __x) const +std::map::equal_range cpp_src/stl_map.h /^ equal_range(const key_type& __x)$/;" f class:std::map access:public signature:(const key_type& __x) +std::map::erase cpp_src/stl_map.h /^ erase(const key_type& __x)$/;" f class:std::map access:public signature:(const key_type& __x) +std::map::erase cpp_src/stl_map.h /^ erase(iterator __first, iterator __last)$/;" f class:std::map access:public signature:(iterator __first, iterator __last) +std::map::erase cpp_src/stl_map.h /^ erase(iterator __position)$/;" f class:std::map access:public signature:(iterator __position) +std::map::find cpp_src/stl_map.h /^ find(const key_type& __x) const$/;" f class:std::map access:public signature:(const key_type& __x) const +std::map::find cpp_src/stl_map.h /^ find(const key_type& __x)$/;" f class:std::map access:public signature:(const key_type& __x) +std::map::get_allocator cpp_src/stl_map.h /^ get_allocator() const$/;" f class:std::map access:public signature:() const +std::map::insert cpp_src/stl_map.h /^ insert(_InputIterator __first, _InputIterator __last)$/;" f class:std::map access:public signature:(_InputIterator __first, _InputIterator __last) +std::map::insert cpp_src/stl_map.h /^ insert(const value_type& __x)$/;" f class:std::map access:public signature:(const value_type& __x) +std::map::insert cpp_src/stl_map.h /^ insert(iterator __position, const value_type& __x)$/;" f class:std::map access:public signature:(iterator __position, const value_type& __x) +std::map::iterator cpp_src/stl_map.h /^ typedef typename _Rep_type::iterator iterator;$/;" t class:std::map access:public +std::map::key_comp cpp_src/stl_map.h /^ key_comp() const$/;" f class:std::map access:public signature:() const +std::map::key_compare cpp_src/stl_map.h /^ typedef _Compare key_compare;$/;" t class:std::map access:public +std::map::key_type cpp_src/stl_map.h /^ typedef _Key key_type;$/;" t class:std::map access:public +std::map::lower_bound cpp_src/stl_map.h /^ lower_bound(const key_type& __x) const$/;" f class:std::map access:public signature:(const key_type& __x) const +std::map::lower_bound cpp_src/stl_map.h /^ lower_bound(const key_type& __x)$/;" f class:std::map access:public signature:(const key_type& __x) +std::map::map cpp_src/stl_map.h /^ map(_InputIterator __first, _InputIterator __last)$/;" f class:std::map access:public signature:(_InputIterator __first, _InputIterator __last) +std::map::map cpp_src/stl_map.h /^ map(_InputIterator __first, _InputIterator __last,$/;" f class:std::map access:public signature:(_InputIterator __first, _InputIterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) +std::map::map cpp_src/stl_map.h /^ map()$/;" f class:std::map access:public signature:() +std::map::map cpp_src/stl_map.h /^ map(const _Compare& __comp, const allocator_type& __a = allocator_type())$/;" f class:std::map access:public signature:(const _Compare& __comp, const allocator_type& __a = allocator_type()) +std::map::map cpp_src/stl_map.h /^ map(const map& __x)$/;" f class:std::map access:public signature:(const map& __x) +std::map::mapped_type cpp_src/stl_map.h /^ typedef _Tp mapped_type;$/;" t class:std::map access:public +std::map::max_size cpp_src/stl_map.h /^ max_size() const$/;" f class:std::map access:public signature:() const +std::map::operator < cpp_src/stl_map.h /^ operator< (const map<_K1, _T1, _C1, _A1>&,$/;" p class:std::map access:friend signature:(const map<_K1, _T1, _C1, _A1>&, const map<_K1, _T1, _C1, _A1>&) +std::map::operator = cpp_src/stl_map.h /^ operator=(const map& __x)$/;" f class:std::map access:public signature:(const map& __x) +std::map::operator == cpp_src/stl_map.h /^ operator== (const map<_K1, _T1, _C1, _A1>&,$/;" p class:std::map access:friend signature:(const map<_K1, _T1, _C1, _A1>&, const map<_K1, _T1, _C1, _A1>&) +std::map::operator [] cpp_src/stl_map.h /^ operator[](const key_type& __k)$/;" f class:std::map access:public signature:(const key_type& __k) +std::map::pointer cpp_src/stl_map.h /^ typedef typename _Pair_alloc_type::pointer pointer;$/;" t class:std::map access:public +std::map::rbegin cpp_src/stl_map.h /^ rbegin() const$/;" f class:std::map access:public signature:() const +std::map::rbegin cpp_src/stl_map.h /^ rbegin()$/;" f class:std::map access:public signature:() +std::map::reference cpp_src/stl_map.h /^ typedef typename _Pair_alloc_type::reference reference;$/;" t class:std::map access:public +std::map::rend cpp_src/stl_map.h /^ rend() const$/;" f class:std::map access:public signature:() const +std::map::rend cpp_src/stl_map.h /^ rend()$/;" f class:std::map access:public signature:() +std::map::reverse_iterator cpp_src/stl_map.h /^ typedef typename _Rep_type::reverse_iterator reverse_iterator;$/;" t class:std::map access:public +std::map::size cpp_src/stl_map.h /^ size() const$/;" f class:std::map access:public signature:() const +std::map::size_type cpp_src/stl_map.h /^ typedef typename _Rep_type::size_type size_type;$/;" t class:std::map access:public +std::map::swap cpp_src/stl_map.h /^ swap(map& __x)$/;" f class:std::map access:public signature:(map& __x) +std::map::upper_bound cpp_src/stl_map.h /^ upper_bound(const key_type& __x) const$/;" f class:std::map access:public signature:(const key_type& __x) const +std::map::upper_bound cpp_src/stl_map.h /^ upper_bound(const key_type& __x)$/;" f class:std::map access:public signature:(const key_type& __x) +std::map::value_comp cpp_src/stl_map.h /^ value_comp() const$/;" f class:std::map access:public signature:() const +std::map::value_compare cpp_src/stl_map.h /^ class value_compare$/;" c class:std::map inherits:std::binary_function access:public +std::map::value_compare::comp cpp_src/stl_map.h /^ _Compare comp;$/;" m class:std::map::value_compare access:protected +std::map::value_compare::operator () cpp_src/stl_map.h /^ bool operator()(const value_type& __x, const value_type& __y) const$/;" f class:std::map::value_compare access:public signature:(const value_type& __x, const value_type& __y) const +std::map::value_compare::value_compare cpp_src/stl_map.h /^ value_compare(_Compare __c)$/;" f class:std::map::value_compare access:protected signature:(_Compare __c) +std::map::value_type cpp_src/stl_map.h /^ typedef std::pair value_type;$/;" t class:std::map access:public +std::mask_array cpp_src/mask_array.h /^ class mask_array$/;" c namespace:std +std::mask_array::_M_array cpp_src/mask_array.h /^ const _Array<_Tp> _M_array;$/;" m class:std::mask_array access:private +std::mask_array::_M_mask cpp_src/mask_array.h /^ const _Array _M_mask;$/;" m class:std::mask_array access:private +std::mask_array::_M_sz cpp_src/mask_array.h /^ const size_t _M_sz;$/;" m class:std::mask_array access:private +std::mask_array::mask_array cpp_src/mask_array.h /^ mask_array (const mask_array&);$/;" p class:std::mask_array access:public signature:(const mask_array&) +std::mask_array::mask_array cpp_src/mask_array.h /^ mask_array();$/;" p class:std::mask_array access:private signature:() +std::mask_array::mask_array cpp_src/mask_array.h /^ mask_array(_Array<_Tp>, size_t, _Array);$/;" p class:std::mask_array access:private signature:(_Array<_Tp>, size_t, _Array) +std::mask_array::mask_array cpp_src/mask_array.h /^ inline mask_array<_Tp>::mask_array(const mask_array<_Tp>& a)$/;" f class:std::mask_array signature:(const mask_array<_Tp>& a) +std::mask_array::mask_array cpp_src/mask_array.h /^ mask_array<_Tp>::mask_array(_Array<_Tp> __a, size_t __s, _Array __m)$/;" f class:std::mask_array signature:(_Array<_Tp> __a, size_t __s, _Array __m) +std::mask_array::operator %= cpp_src/mask_array.h /^ void operator%=(const _Expr<_Dom,_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const _Expr<_Dom,_Tp>&) const +std::mask_array::operator %= cpp_src/mask_array.h /^ void operator%=(const valarray<_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const valarray<_Tp>&) const +std::mask_array::operator &= cpp_src/mask_array.h /^ void operator&=(const _Expr<_Dom,_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const _Expr<_Dom,_Tp>&) const +std::mask_array::operator &= cpp_src/mask_array.h /^ void operator&=(const valarray<_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const valarray<_Tp>&) const +std::mask_array::operator *= cpp_src/mask_array.h /^ void operator*=(const _Expr<_Dom,_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const _Expr<_Dom,_Tp>&) const +std::mask_array::operator *= cpp_src/mask_array.h /^ void operator*=(const valarray<_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const valarray<_Tp>&) const +std::mask_array::operator += cpp_src/mask_array.h /^ void operator+=(const _Expr<_Dom,_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const _Expr<_Dom,_Tp>&) const +std::mask_array::operator += cpp_src/mask_array.h /^ void operator+=(const valarray<_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const valarray<_Tp>&) const +std::mask_array::operator -= cpp_src/mask_array.h /^ void operator-=(const _Expr<_Dom,_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const _Expr<_Dom,_Tp>&) const +std::mask_array::operator -= cpp_src/mask_array.h /^ void operator-=(const valarray<_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const valarray<_Tp>&) const +std::mask_array::operator /= cpp_src/mask_array.h /^ void operator\/=(const _Expr<_Dom,_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const _Expr<_Dom,_Tp>&) const +std::mask_array::operator /= cpp_src/mask_array.h /^ void operator\/=(const valarray<_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const valarray<_Tp>&) const +std::mask_array::operator <<= cpp_src/mask_array.h /^ void operator<<=(const _Expr<_Dom,_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const _Expr<_Dom,_Tp>&) const +std::mask_array::operator <<= cpp_src/mask_array.h /^ void operator<<=(const valarray<_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const valarray<_Tp>&) const +std::mask_array::operator = cpp_src/mask_array.h /^ void operator=(const _Expr<_Dom,_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const _Expr<_Dom,_Tp>&) const +std::mask_array::operator = cpp_src/mask_array.h /^ mask_array& operator=(const mask_array&);$/;" p class:std::mask_array access:public signature:(const mask_array&) +std::mask_array::operator = cpp_src/mask_array.h /^ mask_array<_Tp>::operator=(const _Expr<_Ex, _Tp>& __e) const$/;" f class:std::mask_array signature:(const _Expr<_Ex, _Tp>& __e) const +std::mask_array::operator = cpp_src/mask_array.h /^ void operator=(const _Tp&) const;$/;" p class:std::mask_array access:public signature:(const _Tp&) const +std::mask_array::operator = cpp_src/mask_array.h /^ void operator=(const valarray<_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const valarray<_Tp>&) const +std::mask_array::operator = cpp_src/mask_array.h /^ mask_array<_Tp>::operator=(const _Tp& __t) const$/;" f class:std::mask_array signature:(const _Tp& __t) const +std::mask_array::operator = cpp_src/mask_array.h /^ mask_array<_Tp>::operator=(const mask_array<_Tp>& __a)$/;" f class:std::mask_array signature:(const mask_array<_Tp>& __a) +std::mask_array::operator = cpp_src/mask_array.h /^ mask_array<_Tp>::operator=(const valarray<_Tp>& __v) const$/;" f class:std::mask_array signature:(const valarray<_Tp>& __v) const +std::mask_array::operator >>= cpp_src/mask_array.h /^ void operator>>=(const _Expr<_Dom,_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const _Expr<_Dom,_Tp>&) const +std::mask_array::operator >>= cpp_src/mask_array.h /^ void operator>>=(const valarray<_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const valarray<_Tp>&) const +std::mask_array::operator ^= cpp_src/mask_array.h /^ void operator^=(const _Expr<_Dom,_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const _Expr<_Dom,_Tp>&) const +std::mask_array::operator ^= cpp_src/mask_array.h /^ void operator^=(const valarray<_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const valarray<_Tp>&) const +std::mask_array::operator |= cpp_src/mask_array.h /^ void operator|=(const _Expr<_Dom,_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const _Expr<_Dom,_Tp>&) const +std::mask_array::operator |= cpp_src/mask_array.h /^ void operator|=(const valarray<_Tp>&) const;$/;" p class:std::mask_array access:public signature:(const valarray<_Tp>&) const +std::mask_array::value_type cpp_src/mask_array.h /^ typedef _Tp value_type;$/;" t class:std::mask_array access:public +std::max cpp_src/stl_algobase.h /^ max(const _Tp& __a, const _Tp& __b)$/;" f namespace:std signature:(const _Tp& __a, const _Tp& __b) +std::max cpp_src/stl_algobase.h /^ max(const _Tp& __a, const _Tp& __b, _Compare __comp)$/;" f namespace:std signature:(const _Tp& __a, const _Tp& __b, _Compare __comp) +std::max_element cpp_src/stl_algo.h /^ max_element(_ForwardIterator __first, _ForwardIterator __last)$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last) +std::max_element cpp_src/stl_algo.h /^ max_element(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) +std::mem_fun1_ref_t cpp_src/stl_function.h /^ class mem_fun1_ref_t : public binary_function<_Tp, _Arg, _Ret>$/;" c namespace:std inherits:binary_function +std::mem_fun1_ref_t::_M_f cpp_src/stl_function.h /^ _Ret (_Tp::*_M_f)(_Arg);$/;" m class:std::mem_fun1_ref_t access:private +std::mem_fun1_ref_t::_Ret cpp_src/stl_function.h /^ mem_fun1_ref_t(_Ret (_Tp::*__pf)(_Arg))$/;" f class:std::mem_fun1_ref_t access:public signature:(_Tp::*__pf) +std::mem_fun1_ref_t::operator () cpp_src/stl_function.h /^ operator()(_Tp& __r, _Arg __x) const$/;" f class:std::mem_fun1_ref_t access:public signature:(_Tp& __r, _Arg __x) const +std::mem_fun1_t cpp_src/stl_function.h /^ class mem_fun1_t : public binary_function<_Tp*, _Arg, _Ret>$/;" c namespace:std inherits:binary_function +std::mem_fun1_t::_M_f cpp_src/stl_function.h /^ _Ret (_Tp::*_M_f)(_Arg);$/;" m class:std::mem_fun1_t access:private +std::mem_fun1_t::_Ret cpp_src/stl_function.h /^ mem_fun1_t(_Ret (_Tp::*__pf)(_Arg))$/;" f class:std::mem_fun1_t access:public signature:(_Tp::*__pf) +std::mem_fun1_t::operator () cpp_src/stl_function.h /^ operator()(_Tp* __p, _Arg __x) const$/;" f class:std::mem_fun1_t access:public signature:(_Tp* __p, _Arg __x) const +std::mem_fun_ref_t cpp_src/stl_function.h /^ class mem_fun_ref_t : public unary_function<_Tp, _Ret>$/;" c namespace:std inherits:unary_function +std::mem_fun_ref_t::_M_f cpp_src/stl_function.h /^ _Ret (_Tp::*_M_f)();$/;" m class:std::mem_fun_ref_t access:private +std::mem_fun_ref_t::_Ret cpp_src/stl_function.h /^ mem_fun_ref_t(_Ret (_Tp::*__pf)())$/;" f class:std::mem_fun_ref_t access:public signature:(_Tp::*__pf) +std::mem_fun_ref_t::operator () cpp_src/stl_function.h /^ operator()(_Tp& __r) const$/;" f class:std::mem_fun_ref_t access:public signature:(_Tp& __r) const +std::mem_fun_t cpp_src/stl_function.h /^ class mem_fun_t : public unary_function<_Tp*, _Ret>$/;" c namespace:std inherits:unary_function +std::mem_fun_t::_M_f cpp_src/stl_function.h /^ _Ret (_Tp::*_M_f)();$/;" m class:std::mem_fun_t access:private +std::mem_fun_t::_Ret cpp_src/stl_function.h /^ mem_fun_t(_Ret (_Tp::*__pf)())$/;" f class:std::mem_fun_t access:public signature:(_Tp::*__pf) +std::mem_fun_t::operator () cpp_src/stl_function.h /^ operator()(_Tp* __p) const$/;" f class:std::mem_fun_t access:public signature:(_Tp* __p) const +std::memchr cpp_src/cstring /^ memchr(void* __p, int __c, size_t __n)$/;" f namespace:std signature:(void* __p, int __c, size_t __n) +std::merge cpp_src/stl_algo.h /^ merge(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) +std::merge cpp_src/stl_algo.h /^ merge(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) +std::messages cpp_src/locale_facets.h /^ class messages : public locale::facet, public messages_base$/;" c namespace:std inherits:locale::facet,messages_base +std::messages::_M_c_locale_messages cpp_src/locale_facets.h /^ __c_locale _M_c_locale_messages;$/;" m class:std::messages access:protected +std::messages::_M_convert_from_char cpp_src/locale_facets.h /^ _M_convert_from_char(char*) const$/;" f class:std::messages access:protected signature:(char*) const +std::messages::_M_convert_to_char cpp_src/locale_facets.h /^ _M_convert_to_char(const string_type& __msg) const$/;" f class:std::messages access:protected signature:(const string_type& __msg) const +std::messages::_M_name_messages cpp_src/locale_facets.h /^ const char* _M_name_messages;$/;" m class:std::messages access:protected +std::messages::char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::messages access:public +std::messages::close cpp_src/locale_facets.h /^ close(catalog __c) const$/;" f class:std::messages access:public signature:(catalog __c) const +std::messages::do_close cpp_src/locale_facets.h /^ do_close(catalog) const;$/;" p class:std::messages access:protected signature:(catalog) const +std::messages::do_get cpp_src/locale_facets.h /^ do_get(catalog, int, int, const string_type& __dfault) const;$/;" p class:std::messages access:protected signature:(catalog, int, int, const string_type& __dfault) const +std::messages::do_get cpp_src/locale_facets.h /^ messages::do_get(catalog, int, int, const string&) const;$/;" p class:std::messages signature:(catalog, int, int, const string&) const +std::messages::do_get cpp_src/locale_facets.h /^ messages::do_get(catalog, int, int, const wstring&) const;$/;" p class:std::messages signature:(catalog, int, int, const wstring&) const +std::messages::do_open cpp_src/locale_facets.h /^ do_open(const basic_string&, const locale&) const;$/;" p class:std::messages access:protected signature:(const basic_string&, const locale&) const +std::messages::get cpp_src/locale_facets.h /^ get(catalog __c, int __set, int __msgid, const string_type& __s) const$/;" f class:std::messages access:public signature:(catalog __c, int __set, int __msgid, const string_type& __s) const +std::messages::id cpp_src/locale_facets.h /^ static locale::id id;$/;" m class:std::messages access:public +std::messages::id cpp_src/locale_facets.h /^ locale::id messages<_CharT>::id;$/;" m class:std::messages +std::messages::messages cpp_src/locale_facets.h /^ messages(__c_locale __cloc, const char* __s, size_t __refs = 0);$/;" p class:std::messages access:public signature:(__c_locale __cloc, const char* __s, size_t __refs = 0) +std::messages::messages cpp_src/locale_facets.h /^ messages(size_t __refs = 0);$/;" p class:std::messages access:public signature:(size_t __refs = 0) +std::messages::open cpp_src/locale_facets.h /^ open(const basic_string& __s, const locale& __loc) const$/;" f class:std::messages access:public signature:(const basic_string& __s, const locale& __loc) const +std::messages::open cpp_src/locale_facets.h /^ open(const basic_string&, const locale&, const char*) const;$/;" p class:std::messages access:public signature:(const basic_string&, const locale&, const char*) const +std::messages::string_type cpp_src/locale_facets.h /^ typedef basic_string<_CharT> string_type;$/;" t class:std::messages access:public +std::messages::~messages cpp_src/locale_facets.h /^ ~messages();$/;" p class:std::messages access:protected signature:() +std::messages_base cpp_src/locale_facets.h /^ struct messages_base$/;" s namespace:std +std::messages_base::catalog cpp_src/locale_facets.h /^ typedef int catalog;$/;" t struct:std::messages_base access:public +std::messages_byname cpp_src/locale_facets.h /^ class messages_byname : public messages<_CharT>$/;" c namespace:std inherits:messages +std::messages_byname::char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::messages_byname access:public +std::messages_byname::messages_byname cpp_src/locale_facets.h /^ messages_byname(const char* __s, size_t __refs = 0);$/;" p class:std::messages_byname access:public signature:(const char* __s, size_t __refs = 0) +std::messages_byname::string_type cpp_src/locale_facets.h /^ typedef basic_string<_CharT> string_type;$/;" t class:std::messages_byname access:public +std::messages_byname::~messages_byname cpp_src/locale_facets.h /^ ~messages_byname()$/;" f class:std::messages_byname access:protected signature:() +std::min cpp_src/stl_algobase.h /^ min(const _Tp& __a, const _Tp& __b)$/;" f namespace:std signature:(const _Tp& __a, const _Tp& __b) +std::min cpp_src/stl_algobase.h /^ min(const _Tp& __a, const _Tp& __b, _Compare __comp)$/;" f namespace:std signature:(const _Tp& __a, const _Tp& __b, _Compare __comp) +std::min_element cpp_src/stl_algo.h /^ min_element(_ForwardIterator __first, _ForwardIterator __last)$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last) +std::min_element cpp_src/stl_algo.h /^ min_element(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) +std::minus cpp_src/stl_function.h /^ struct minus : public binary_function<_Tp, _Tp, _Tp>$/;" s namespace:std inherits:binary_function +std::minus::operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::minus access:public signature:(const _Tp& __x, const _Tp& __y) const +std::mismatch cpp_src/stl_algobase.h /^ mismatch(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) +std::mismatch cpp_src/stl_algobase.h /^ mismatch(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __binary_pred) +std::modf cpp_src/cmath /^ modf(float __x, float* __iptr)$/;" f namespace:std signature:(float __x, float* __iptr) +std::modf cpp_src/cmath /^ modf(long double __x, long double* __iptr)$/;" f namespace:std signature:(long double __x, long double* __iptr) +std::modulus cpp_src/stl_function.h /^ struct modulus : public binary_function<_Tp, _Tp, _Tp>$/;" s namespace:std inherits:binary_function +std::modulus::operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::modulus access:public signature:(const _Tp& __x, const _Tp& __y) const +std::money_base cpp_src/locale_facets.h /^ class money_base$/;" c namespace:std +std::money_base::_S_atoms cpp_src/locale_facets.h /^ static const char* _S_atoms;$/;" m class:std::money_base access:public +std::money_base::_S_construct_pattern cpp_src/locale_facets.h /^ _S_construct_pattern(char __precedes, char __space, char __posn);$/;" p class:std::money_base access:public signature:(char __precedes, char __space, char __posn) +std::money_base::_S_default_pattern cpp_src/locale_facets.h /^ static const pattern _S_default_pattern;$/;" m class:std::money_base access:public +std::money_base::_S_end cpp_src/locale_facets.h /^ _S_end = 11$/;" e enum:std::money_base::__anon9 +std::money_base::_S_minus cpp_src/locale_facets.h /^ _S_minus,$/;" e enum:std::money_base::__anon9 +std::money_base::_S_zero cpp_src/locale_facets.h /^ _S_zero,$/;" e enum:std::money_base::__anon9 +std::money_base::none cpp_src/locale_facets.h /^ enum part { none, space, symbol, sign, value };$/;" e enum:std::money_base::part +std::money_base::part cpp_src/locale_facets.h /^ enum part { none, space, symbol, sign, value };$/;" g class:std::money_base access:public +std::money_base::pattern cpp_src/locale_facets.h /^ struct pattern { char field[4]; };$/;" s class:std::money_base access:public +std::money_base::pattern::field cpp_src/locale_facets.h /^ struct pattern { char field[4]; };$/;" m struct:std::money_base::pattern access:public +std::money_base::sign cpp_src/locale_facets.h /^ enum part { none, space, symbol, sign, value };$/;" e enum:std::money_base::part +std::money_base::space cpp_src/locale_facets.h /^ enum part { none, space, symbol, sign, value };$/;" e enum:std::money_base::part +std::money_base::symbol cpp_src/locale_facets.h /^ enum part { none, space, symbol, sign, value };$/;" e enum:std::money_base::part +std::money_base::value cpp_src/locale_facets.h /^ enum part { none, space, symbol, sign, value };$/;" e enum:std::money_base::part +std::money_get cpp_src/locale_facets.h /^ class money_get : public locale::facet$/;" c namespace:std inherits:locale::facet +std::money_get::_M_extract cpp_src/locale_facets.h /^ _M_extract(iter_type __s, iter_type __end, ios_base& __io,$/;" p class:std::money_get access:protected signature:(iter_type __s, iter_type __end, ios_base& __io, ios_base::iostate& __err, string& __digits) const +std::money_get::_M_extract cpp_src/locale_facets.tcc /^ _M_extract(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::money_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, string& __units) const +std::money_get::__do_get cpp_src/locale_facets.h /^ __do_get(iter_type __s, iter_type __end, bool __intl, ios_base& __io,$/;" p class:std::money_get access:protected signature:(iter_type __s, iter_type __end, bool __intl, ios_base& __io, ios_base::iostate& __err, double& __units) const +std::money_get::__do_get cpp_src/locale_facets.tcc /^ __do_get(iter_type __beg, iter_type __end, bool __intl, ios_base& __io,$/;" f class:std::money_get signature:(iter_type __beg, iter_type __end, bool __intl, ios_base& __io, ios_base::iostate& __err, double& __units) const +std::money_get::char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::money_get access:public +std::money_get::do_get cpp_src/locale_facets.h /^ do_get(iter_type __s, iter_type __end, bool __intl, ios_base& __io,$/;" p class:std::money_get access:protected signature:(iter_type __s, iter_type __end, bool __intl, ios_base& __io, ios_base::iostate& __err, long double& __units) const +std::money_get::do_get cpp_src/locale_facets.h /^ do_get(iter_type __s, iter_type __end, bool __intl, ios_base& __io,$/;" p class:std::money_get access:protected signature:(iter_type __s, iter_type __end, bool __intl, ios_base& __io, ios_base::iostate& __err, string_type& __digits) const +std::money_get::do_get cpp_src/locale_facets.tcc /^ do_get(iter_type __beg, iter_type __end, bool __intl, ios_base& __io,$/;" f class:std::money_get signature:(iter_type __beg, iter_type __end, bool __intl, ios_base& __io, ios_base::iostate& __err, long double& __units) const +std::money_get::do_get cpp_src/locale_facets.tcc /^ do_get(iter_type __beg, iter_type __end, bool __intl, ios_base& __io,$/;" f class:std::money_get signature:(iter_type __beg, iter_type __end, bool __intl, ios_base& __io, ios_base::iostate& __err, string_type& __digits) const +std::money_get::get cpp_src/locale_facets.h /^ get(iter_type __s, iter_type __end, bool __intl, ios_base& __io,$/;" f class:std::money_get access:public signature:(iter_type __s, iter_type __end, bool __intl, ios_base& __io, ios_base::iostate& __err, long double& __units) const +std::money_get::get cpp_src/locale_facets.h /^ get(iter_type __s, iter_type __end, bool __intl, ios_base& __io,$/;" f class:std::money_get access:public signature:(iter_type __s, iter_type __end, bool __intl, ios_base& __io, ios_base::iostate& __err, string_type& __digits) const +std::money_get::id cpp_src/locale_facets.h /^ static locale::id id;$/;" m class:std::money_get access:public +std::money_get::id cpp_src/locale_facets.h /^ locale::id money_get<_CharT, _InIter>::id;$/;" m class:std::money_get +std::money_get::iter_type cpp_src/locale_facets.h /^ typedef _InIter iter_type;$/;" t class:std::money_get access:public +std::money_get::money_get cpp_src/locale_facets.h /^ money_get(size_t __refs = 0) : facet(__refs) { }$/;" f class:std::money_get access:public signature:(size_t __refs = 0) +std::money_get::string_type cpp_src/locale_facets.h /^ typedef basic_string<_CharT> string_type;$/;" t class:std::money_get access:public +std::money_get::~money_get cpp_src/locale_facets.h /^ ~money_get() { }$/;" f class:std::money_get access:protected signature:() +std::money_put cpp_src/locale_facets.h /^ class money_put : public locale::facet$/;" c namespace:std inherits:locale::facet +std::money_put::_M_insert cpp_src/locale_facets.h /^ _M_insert(iter_type __s, ios_base& __io, char_type __fill,$/;" p class:std::money_put access:protected signature:(iter_type __s, ios_base& __io, char_type __fill, const string_type& __digits) const +std::money_put::_M_insert cpp_src/locale_facets.tcc /^ _M_insert(iter_type __s, ios_base& __io, char_type __fill,$/;" f class:std::money_put signature:(iter_type __s, ios_base& __io, char_type __fill, const string_type& __digits) const +std::money_put::__do_put cpp_src/locale_facets.h /^ __do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill,$/;" p class:std::money_put access:protected signature:(iter_type __s, bool __intl, ios_base& __io, char_type __fill, double __units) const +std::money_put::__do_put cpp_src/locale_facets.tcc /^ __do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill,$/;" f class:std::money_put signature:(iter_type __s, bool __intl, ios_base& __io, char_type __fill, double __units) const +std::money_put::char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::money_put access:public +std::money_put::do_put cpp_src/locale_facets.h /^ do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill,$/;" p class:std::money_put access:protected signature:(iter_type __s, bool __intl, ios_base& __io, char_type __fill, const string_type& __digits) const +std::money_put::do_put cpp_src/locale_facets.h /^ do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill,$/;" p class:std::money_put access:protected signature:(iter_type __s, bool __intl, ios_base& __io, char_type __fill, long double __units) const +std::money_put::do_put cpp_src/locale_facets.tcc /^ do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill,$/;" f class:std::money_put signature:(iter_type __s, bool __intl, ios_base& __io, char_type __fill, const string_type& __digits) const +std::money_put::do_put cpp_src/locale_facets.tcc /^ do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill,$/;" f class:std::money_put signature:(iter_type __s, bool __intl, ios_base& __io, char_type __fill, long double __units) const +std::money_put::id cpp_src/locale_facets.h /^ static locale::id id;$/;" m class:std::money_put access:public +std::money_put::id cpp_src/locale_facets.h /^ locale::id money_put<_CharT, _OutIter>::id;$/;" m class:std::money_put +std::money_put::iter_type cpp_src/locale_facets.h /^ typedef _OutIter iter_type;$/;" t class:std::money_put access:public +std::money_put::money_put cpp_src/locale_facets.h /^ money_put(size_t __refs = 0) : facet(__refs) { }$/;" f class:std::money_put access:public signature:(size_t __refs = 0) +std::money_put::put cpp_src/locale_facets.h /^ put(iter_type __s, bool __intl, ios_base& __io,$/;" f class:std::money_put access:public signature:(iter_type __s, bool __intl, ios_base& __io, char_type __fill, const string_type& __digits) const +std::money_put::put cpp_src/locale_facets.h /^ put(iter_type __s, bool __intl, ios_base& __io,$/;" f class:std::money_put access:public signature:(iter_type __s, bool __intl, ios_base& __io, char_type __fill, long double __units) const +std::money_put::string_type cpp_src/locale_facets.h /^ typedef basic_string<_CharT> string_type;$/;" t class:std::money_put access:public +std::money_put::~money_put cpp_src/locale_facets.h /^ ~money_put() { }$/;" f class:std::money_put access:protected signature:() +std::moneypunct cpp_src/locale_facets.h /^ class moneypunct : public locale::facet, public money_base$/;" c namespace:std inherits:locale::facet,money_base +std::moneypunct::_M_data cpp_src/locale_facets.h /^ __cache_type* _M_data;$/;" m class:std::moneypunct access:private +std::moneypunct::_M_initialize_moneypunct cpp_src/locale_facets.h /^ _M_initialize_moneypunct(__c_locale __cloc = NULL,$/;" p class:std::moneypunct access:protected signature:(__c_locale __cloc = NULL, const char* __name = NULL) +std::moneypunct::_M_initialize_moneypunct cpp_src/locale_facets.h /^ moneypunct::_M_initialize_moneypunct(__c_locale, const char*);$/;" p class:std::moneypunct signature:(__c_locale, const char*) +std::moneypunct::_M_initialize_moneypunct cpp_src/locale_facets.h /^ moneypunct::_M_initialize_moneypunct(__c_locale, const char*);$/;" p class:std::moneypunct signature:(__c_locale, const char*) +std::moneypunct::_M_initialize_moneypunct cpp_src/locale_facets.h /^ moneypunct::_M_initialize_moneypunct(__c_locale,$/;" p class:std::moneypunct signature:(__c_locale, const char*) +std::moneypunct::_M_initialize_moneypunct cpp_src/locale_facets.h /^ moneypunct::_M_initialize_moneypunct(__c_locale,$/;" p class:std::moneypunct signature:(__c_locale, const char*) +std::moneypunct::__cache_type cpp_src/locale_facets.h /^ typedef __moneypunct_cache<_CharT, _Intl> __cache_type;$/;" t class:std::moneypunct access:public +std::moneypunct::char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::moneypunct access:public +std::moneypunct::curr_symbol cpp_src/locale_facets.h /^ curr_symbol() const$/;" f class:std::moneypunct access:public signature:() const +std::moneypunct::decimal_point cpp_src/locale_facets.h /^ decimal_point() const$/;" f class:std::moneypunct access:public signature:() const +std::moneypunct::do_curr_symbol cpp_src/locale_facets.h /^ do_curr_symbol() const$/;" f class:std::moneypunct access:protected signature:() const +std::moneypunct::do_decimal_point cpp_src/locale_facets.h /^ do_decimal_point() const$/;" f class:std::moneypunct access:protected signature:() const +std::moneypunct::do_frac_digits cpp_src/locale_facets.h /^ do_frac_digits() const$/;" f class:std::moneypunct access:protected signature:() const +std::moneypunct::do_grouping cpp_src/locale_facets.h /^ do_grouping() const$/;" f class:std::moneypunct access:protected signature:() const +std::moneypunct::do_neg_format cpp_src/locale_facets.h /^ do_neg_format() const$/;" f class:std::moneypunct access:protected signature:() const +std::moneypunct::do_negative_sign cpp_src/locale_facets.h /^ do_negative_sign() const$/;" f class:std::moneypunct access:protected signature:() const +std::moneypunct::do_pos_format cpp_src/locale_facets.h /^ do_pos_format() const$/;" f class:std::moneypunct access:protected signature:() const +std::moneypunct::do_positive_sign cpp_src/locale_facets.h /^ do_positive_sign() const$/;" f class:std::moneypunct access:protected signature:() const +std::moneypunct::do_thousands_sep cpp_src/locale_facets.h /^ do_thousands_sep() const$/;" f class:std::moneypunct access:protected signature:() const +std::moneypunct::frac_digits cpp_src/locale_facets.h /^ frac_digits() const$/;" f class:std::moneypunct access:public signature:() const +std::moneypunct::grouping cpp_src/locale_facets.h /^ grouping() const$/;" f class:std::moneypunct access:public signature:() const +std::moneypunct::id cpp_src/locale_facets.h /^ static locale::id id;$/;" m class:std::moneypunct access:public +std::moneypunct::id cpp_src/locale_facets.h /^ locale::id moneypunct<_CharT, _Intl>::id;$/;" m class:std::moneypunct +std::moneypunct::intl cpp_src/locale_facets.h /^ static const bool intl = _Intl;$/;" m class:std::moneypunct access:public +std::moneypunct::intl cpp_src/locale_facets.h /^ const bool moneypunct<_CharT, _Intl>::intl;$/;" m class:std::moneypunct +std::moneypunct::moneypunct cpp_src/locale_facets.h /^ moneypunct(__c_locale __cloc, const char* __s, size_t __refs = 0)$/;" f class:std::moneypunct access:public signature:(__c_locale __cloc, const char* __s, size_t __refs = 0) +std::moneypunct::moneypunct cpp_src/locale_facets.h /^ moneypunct(__cache_type* __cache, size_t __refs = 0)$/;" f class:std::moneypunct access:public signature:(__cache_type* __cache, size_t __refs = 0) +std::moneypunct::moneypunct cpp_src/locale_facets.h /^ moneypunct(size_t __refs = 0) : facet(__refs), _M_data(NULL)$/;" f class:std::moneypunct access:public signature:(size_t __refs = 0) +std::moneypunct::neg_format cpp_src/locale_facets.h /^ neg_format() const$/;" f class:std::moneypunct access:public signature:() const +std::moneypunct::negative_sign cpp_src/locale_facets.h /^ negative_sign() const$/;" f class:std::moneypunct access:public signature:() const +std::moneypunct::pos_format cpp_src/locale_facets.h /^ pos_format() const$/;" f class:std::moneypunct access:public signature:() const +std::moneypunct::positive_sign cpp_src/locale_facets.h /^ positive_sign() const$/;" f class:std::moneypunct access:public signature:() const +std::moneypunct::string_type cpp_src/locale_facets.h /^ typedef basic_string<_CharT> string_type;$/;" t class:std::moneypunct access:public +std::moneypunct::thousands_sep cpp_src/locale_facets.h /^ thousands_sep() const$/;" f class:std::moneypunct access:public signature:() const +std::moneypunct::~moneypunct cpp_src/locale_facets.h /^ ~moneypunct();$/;" p class:std::moneypunct access:protected signature:() +std::moneypunct::~moneypunct cpp_src/locale_facets.h /^ moneypunct::~moneypunct();$/;" p class:std::moneypunct signature:() +std::moneypunct::~moneypunct cpp_src/locale_facets.h /^ moneypunct::~moneypunct();$/;" p class:std::moneypunct signature:() +std::moneypunct::~moneypunct cpp_src/locale_facets.h /^ moneypunct::~moneypunct();$/;" p class:std::moneypunct signature:() +std::moneypunct::~moneypunct cpp_src/locale_facets.h /^ moneypunct::~moneypunct();$/;" p class:std::moneypunct signature:() +std::moneypunct_byname cpp_src/locale_facets.h /^ class moneypunct_byname : public moneypunct<_CharT, _Intl>$/;" c namespace:std inherits:moneypunct +std::moneypunct_byname::char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::moneypunct_byname access:public +std::moneypunct_byname::intl cpp_src/locale_facets.h /^ static const bool intl = _Intl;$/;" m class:std::moneypunct_byname access:public +std::moneypunct_byname::intl cpp_src/locale_facets.h /^ const bool moneypunct_byname<_CharT, _Intl>::intl;$/;" m class:std::moneypunct_byname +std::moneypunct_byname::moneypunct_byname cpp_src/locale_facets.h /^ moneypunct_byname(const char* __s, size_t __refs = 0)$/;" f class:std::moneypunct_byname access:public signature:(const char* __s, size_t __refs = 0) +std::moneypunct_byname::string_type cpp_src/locale_facets.h /^ typedef basic_string<_CharT> string_type;$/;" t class:std::moneypunct_byname access:public +std::moneypunct_byname::~moneypunct_byname cpp_src/locale_facets.h /^ ~moneypunct_byname() { }$/;" f class:std::moneypunct_byname access:protected signature:() +std::multimap cpp_src/stl_multimap.h /^ class multimap$/;" c namespace:std +std::multimap::_Alloc_value_type cpp_src/stl_multimap.h /^ typedef typename _Alloc::value_type _Alloc_value_type;$/;" t class:std::multimap access:private +std::multimap::_M_t cpp_src/stl_multimap.h /^ _Rep_type _M_t;$/;" m class:std::multimap access:private +std::multimap::_Pair_alloc_type cpp_src/stl_multimap.h /^ _Pair_alloc_type;$/;" t class:std::multimap access:private +std::multimap::_Rep_type cpp_src/stl_multimap.h /^ key_compare, _Pair_alloc_type> _Rep_type;$/;" t class:std::multimap access:private +std::multimap::allocator_type cpp_src/stl_multimap.h /^ typedef _Alloc allocator_type;$/;" t class:std::multimap access:public +std::multimap::begin cpp_src/stl_multimap.h /^ begin() const$/;" f class:std::multimap access:public signature:() const +std::multimap::begin cpp_src/stl_multimap.h /^ begin()$/;" f class:std::multimap access:public signature:() +std::multimap::clear cpp_src/stl_multimap.h /^ clear()$/;" f class:std::multimap access:public signature:() +std::multimap::const_iterator cpp_src/stl_multimap.h /^ typedef typename _Rep_type::const_iterator const_iterator;$/;" t class:std::multimap access:public +std::multimap::const_pointer cpp_src/stl_multimap.h /^ typedef typename _Pair_alloc_type::const_pointer const_pointer;$/;" t class:std::multimap access:public +std::multimap::const_reference cpp_src/stl_multimap.h /^ typedef typename _Pair_alloc_type::const_reference const_reference;$/;" t class:std::multimap access:public +std::multimap::const_reverse_iterator cpp_src/stl_multimap.h /^ typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator;$/;" t class:std::multimap access:public +std::multimap::count cpp_src/stl_multimap.h /^ count(const key_type& __x) const$/;" f class:std::multimap access:public signature:(const key_type& __x) const +std::multimap::difference_type cpp_src/stl_multimap.h /^ typedef typename _Rep_type::difference_type difference_type;$/;" t class:std::multimap access:public +std::multimap::empty cpp_src/stl_multimap.h /^ empty() const$/;" f class:std::multimap access:public signature:() const +std::multimap::end cpp_src/stl_multimap.h /^ end() const$/;" f class:std::multimap access:public signature:() const +std::multimap::end cpp_src/stl_multimap.h /^ end()$/;" f class:std::multimap access:public signature:() +std::multimap::equal_range cpp_src/stl_multimap.h /^ equal_range(const key_type& __x) const$/;" f class:std::multimap access:public signature:(const key_type& __x) const +std::multimap::equal_range cpp_src/stl_multimap.h /^ equal_range(const key_type& __x)$/;" f class:std::multimap access:public signature:(const key_type& __x) +std::multimap::erase cpp_src/stl_multimap.h /^ erase(const key_type& __x)$/;" f class:std::multimap access:public signature:(const key_type& __x) +std::multimap::erase cpp_src/stl_multimap.h /^ erase(iterator __first, iterator __last)$/;" f class:std::multimap access:public signature:(iterator __first, iterator __last) +std::multimap::erase cpp_src/stl_multimap.h /^ erase(iterator __position)$/;" f class:std::multimap access:public signature:(iterator __position) +std::multimap::find cpp_src/stl_multimap.h /^ find(const key_type& __x) const$/;" f class:std::multimap access:public signature:(const key_type& __x) const +std::multimap::find cpp_src/stl_multimap.h /^ find(const key_type& __x)$/;" f class:std::multimap access:public signature:(const key_type& __x) +std::multimap::get_allocator cpp_src/stl_multimap.h /^ get_allocator() const$/;" f class:std::multimap access:public signature:() const +std::multimap::insert cpp_src/stl_multimap.h /^ insert(_InputIterator __first, _InputIterator __last)$/;" f class:std::multimap access:public signature:(_InputIterator __first, _InputIterator __last) +std::multimap::insert cpp_src/stl_multimap.h /^ insert(const value_type& __x)$/;" f class:std::multimap access:public signature:(const value_type& __x) +std::multimap::insert cpp_src/stl_multimap.h /^ insert(iterator __position, const value_type& __x)$/;" f class:std::multimap access:public signature:(iterator __position, const value_type& __x) +std::multimap::iterator cpp_src/stl_multimap.h /^ typedef typename _Rep_type::iterator iterator;$/;" t class:std::multimap access:public +std::multimap::key_comp cpp_src/stl_multimap.h /^ key_comp() const$/;" f class:std::multimap access:public signature:() const +std::multimap::key_compare cpp_src/stl_multimap.h /^ typedef _Compare key_compare;$/;" t class:std::multimap access:public +std::multimap::key_type cpp_src/stl_multimap.h /^ typedef _Key key_type;$/;" t class:std::multimap access:public +std::multimap::lower_bound cpp_src/stl_multimap.h /^ lower_bound(const key_type& __x) const$/;" f class:std::multimap access:public signature:(const key_type& __x) const +std::multimap::lower_bound cpp_src/stl_multimap.h /^ lower_bound(const key_type& __x)$/;" f class:std::multimap access:public signature:(const key_type& __x) +std::multimap::mapped_type cpp_src/stl_multimap.h /^ typedef _Tp mapped_type;$/;" t class:std::multimap access:public +std::multimap::max_size cpp_src/stl_multimap.h /^ max_size() const$/;" f class:std::multimap access:public signature:() const +std::multimap::multimap cpp_src/stl_multimap.h /^ multimap(_InputIterator __first, _InputIterator __last)$/;" f class:std::multimap access:public signature:(_InputIterator __first, _InputIterator __last) +std::multimap::multimap cpp_src/stl_multimap.h /^ multimap(_InputIterator __first, _InputIterator __last,$/;" f class:std::multimap access:public signature:(_InputIterator __first, _InputIterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) +std::multimap::multimap cpp_src/stl_multimap.h /^ multimap()$/;" f class:std::multimap access:public signature:() +std::multimap::multimap cpp_src/stl_multimap.h /^ multimap(const _Compare& __comp,$/;" f class:std::multimap access:public signature:(const _Compare& __comp, const allocator_type& __a = allocator_type()) +std::multimap::multimap cpp_src/stl_multimap.h /^ multimap(const multimap& __x)$/;" f class:std::multimap access:public signature:(const multimap& __x) +std::multimap::operator < cpp_src/stl_multimap.h /^ operator< (const multimap<_K1, _T1, _C1, _A1>&,$/;" p class:std::multimap access:friend signature:(const multimap<_K1, _T1, _C1, _A1>&, const multimap<_K1, _T1, _C1, _A1>&) +std::multimap::operator = cpp_src/stl_multimap.h /^ operator=(const multimap& __x)$/;" f class:std::multimap access:public signature:(const multimap& __x) +std::multimap::operator == cpp_src/stl_multimap.h /^ operator== (const multimap<_K1, _T1, _C1, _A1>&,$/;" p class:std::multimap access:friend signature:(const multimap<_K1, _T1, _C1, _A1>&, const multimap<_K1, _T1, _C1, _A1>&) +std::multimap::pointer cpp_src/stl_multimap.h /^ typedef typename _Pair_alloc_type::pointer pointer;$/;" t class:std::multimap access:public +std::multimap::rbegin cpp_src/stl_multimap.h /^ rbegin() const$/;" f class:std::multimap access:public signature:() const +std::multimap::rbegin cpp_src/stl_multimap.h /^ rbegin()$/;" f class:std::multimap access:public signature:() +std::multimap::reference cpp_src/stl_multimap.h /^ typedef typename _Pair_alloc_type::reference reference;$/;" t class:std::multimap access:public +std::multimap::rend cpp_src/stl_multimap.h /^ rend() const$/;" f class:std::multimap access:public signature:() const +std::multimap::rend cpp_src/stl_multimap.h /^ rend()$/;" f class:std::multimap access:public signature:() +std::multimap::reverse_iterator cpp_src/stl_multimap.h /^ typedef typename _Rep_type::reverse_iterator reverse_iterator;$/;" t class:std::multimap access:public +std::multimap::size cpp_src/stl_multimap.h /^ size() const$/;" f class:std::multimap access:public signature:() const +std::multimap::size_type cpp_src/stl_multimap.h /^ typedef typename _Rep_type::size_type size_type;$/;" t class:std::multimap access:public +std::multimap::swap cpp_src/stl_multimap.h /^ swap(multimap& __x)$/;" f class:std::multimap access:public signature:(multimap& __x) +std::multimap::upper_bound cpp_src/stl_multimap.h /^ upper_bound(const key_type& __x) const$/;" f class:std::multimap access:public signature:(const key_type& __x) const +std::multimap::upper_bound cpp_src/stl_multimap.h /^ upper_bound(const key_type& __x)$/;" f class:std::multimap access:public signature:(const key_type& __x) +std::multimap::value_comp cpp_src/stl_multimap.h /^ value_comp() const$/;" f class:std::multimap access:public signature:() const +std::multimap::value_compare cpp_src/stl_multimap.h /^ class value_compare$/;" c class:std::multimap inherits:std::binary_function access:public +std::multimap::value_compare::comp cpp_src/stl_multimap.h /^ _Compare comp;$/;" m class:std::multimap::value_compare access:protected +std::multimap::value_compare::operator () cpp_src/stl_multimap.h /^ bool operator()(const value_type& __x, const value_type& __y) const$/;" f class:std::multimap::value_compare access:public signature:(const value_type& __x, const value_type& __y) const +std::multimap::value_compare::value_compare cpp_src/stl_multimap.h /^ value_compare(_Compare __c)$/;" f class:std::multimap::value_compare access:protected signature:(_Compare __c) +std::multimap::value_type cpp_src/stl_multimap.h /^ typedef std::pair value_type;$/;" t class:std::multimap access:public +std::multiplies cpp_src/stl_function.h /^ struct multiplies : public binary_function<_Tp, _Tp, _Tp>$/;" s namespace:std inherits:binary_function +std::multiplies::operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::multiplies access:public signature:(const _Tp& __x, const _Tp& __y) const +std::multiset cpp_src/stl_multiset.h /^ class multiset$/;" c namespace:std +std::multiset::_Alloc_value_type cpp_src/stl_multiset.h /^ typedef typename _Alloc::value_type _Alloc_value_type;$/;" t class:std::multiset access:private +std::multiset::_Key_alloc_type cpp_src/stl_multiset.h /^ typedef typename _Alloc::template rebind<_Key>::other _Key_alloc_type;$/;" t class:std::multiset access:private +std::multiset::_M_t cpp_src/stl_multiset.h /^ _Rep_type _M_t;$/;" m class:std::multiset access:private +std::multiset::_Rep_type cpp_src/stl_multiset.h /^ key_compare, _Key_alloc_type> _Rep_type;$/;" t class:std::multiset access:private +std::multiset::allocator_type cpp_src/stl_multiset.h /^ typedef _Alloc allocator_type;$/;" t class:std::multiset access:public +std::multiset::begin cpp_src/stl_multiset.h /^ begin() const$/;" f class:std::multiset access:public signature:() const +std::multiset::clear cpp_src/stl_multiset.h /^ clear()$/;" f class:std::multiset access:public signature:() +std::multiset::const_iterator cpp_src/stl_multiset.h /^ typedef typename _Rep_type::const_iterator const_iterator;$/;" t class:std::multiset access:public +std::multiset::const_pointer cpp_src/stl_multiset.h /^ typedef typename _Key_alloc_type::const_pointer const_pointer;$/;" t class:std::multiset access:public +std::multiset::const_reference cpp_src/stl_multiset.h /^ typedef typename _Key_alloc_type::const_reference const_reference;$/;" t class:std::multiset access:public +std::multiset::const_reverse_iterator cpp_src/stl_multiset.h /^ typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator;$/;" t class:std::multiset access:public +std::multiset::count cpp_src/stl_multiset.h /^ count(const key_type& __x) const$/;" f class:std::multiset access:public signature:(const key_type& __x) const +std::multiset::difference_type cpp_src/stl_multiset.h /^ typedef typename _Rep_type::difference_type difference_type;$/;" t class:std::multiset access:public +std::multiset::empty cpp_src/stl_multiset.h /^ empty() const$/;" f class:std::multiset access:public signature:() const +std::multiset::end cpp_src/stl_multiset.h /^ end() const$/;" f class:std::multiset access:public signature:() const +std::multiset::equal_range cpp_src/stl_multiset.h /^ equal_range(const key_type& __x) const$/;" f class:std::multiset access:public signature:(const key_type& __x) const +std::multiset::equal_range cpp_src/stl_multiset.h /^ equal_range(const key_type& __x)$/;" f class:std::multiset access:public signature:(const key_type& __x) +std::multiset::erase cpp_src/stl_multiset.h /^ erase(const key_type& __x)$/;" f class:std::multiset access:public signature:(const key_type& __x) +std::multiset::erase cpp_src/stl_multiset.h /^ erase(iterator __first, iterator __last)$/;" f class:std::multiset access:public signature:(iterator __first, iterator __last) +std::multiset::erase cpp_src/stl_multiset.h /^ erase(iterator __position)$/;" f class:std::multiset access:public signature:(iterator __position) +std::multiset::find cpp_src/stl_multiset.h /^ find(const key_type& __x) const$/;" f class:std::multiset access:public signature:(const key_type& __x) const +std::multiset::find cpp_src/stl_multiset.h /^ find(const key_type& __x)$/;" f class:std::multiset access:public signature:(const key_type& __x) +std::multiset::get_allocator cpp_src/stl_multiset.h /^ get_allocator() const$/;" f class:std::multiset access:public signature:() const +std::multiset::insert cpp_src/stl_multiset.h /^ insert(_InputIterator __first, _InputIterator __last)$/;" f class:std::multiset access:public signature:(_InputIterator __first, _InputIterator __last) +std::multiset::insert cpp_src/stl_multiset.h /^ insert(const value_type& __x)$/;" f class:std::multiset access:public signature:(const value_type& __x) +std::multiset::insert cpp_src/stl_multiset.h /^ insert(iterator __position, const value_type& __x)$/;" f class:std::multiset access:public signature:(iterator __position, const value_type& __x) +std::multiset::iterator cpp_src/stl_multiset.h /^ typedef typename _Rep_type::const_iterator iterator;$/;" t class:std::multiset access:public +std::multiset::key_comp cpp_src/stl_multiset.h /^ key_comp() const$/;" f class:std::multiset access:public signature:() const +std::multiset::key_compare cpp_src/stl_multiset.h /^ typedef _Compare key_compare;$/;" t class:std::multiset access:public +std::multiset::key_type cpp_src/stl_multiset.h /^ typedef _Key key_type;$/;" t class:std::multiset access:public +std::multiset::lower_bound cpp_src/stl_multiset.h /^ lower_bound(const key_type& __x) const$/;" f class:std::multiset access:public signature:(const key_type& __x) const +std::multiset::lower_bound cpp_src/stl_multiset.h /^ lower_bound(const key_type& __x)$/;" f class:std::multiset access:public signature:(const key_type& __x) +std::multiset::max_size cpp_src/stl_multiset.h /^ max_size() const$/;" f class:std::multiset access:public signature:() const +std::multiset::multiset cpp_src/stl_multiset.h /^ multiset(_InputIterator __first, _InputIterator __last)$/;" f class:std::multiset access:public signature:(_InputIterator __first, _InputIterator __last) +std::multiset::multiset cpp_src/stl_multiset.h /^ multiset(_InputIterator __first, _InputIterator __last,$/;" f class:std::multiset access:public signature:(_InputIterator __first, _InputIterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) +std::multiset::multiset cpp_src/stl_multiset.h /^ multiset()$/;" f class:std::multiset access:public signature:() +std::multiset::multiset cpp_src/stl_multiset.h /^ multiset(const _Compare& __comp,$/;" f class:std::multiset access:public signature:(const _Compare& __comp, const allocator_type& __a = allocator_type()) +std::multiset::multiset cpp_src/stl_multiset.h /^ multiset(const multiset<_Key,_Compare,_Alloc>& __x)$/;" f class:std::multiset access:public signature:(const multiset<_Key,_Compare,_Alloc>& __x) +std::multiset::operator < cpp_src/stl_multiset.h /^ operator< (const multiset<_K1, _C1, _A1>&,$/;" p class:std::multiset access:friend signature:(const multiset<_K1, _C1, _A1>&, const multiset<_K1, _C1, _A1>&) +std::multiset::operator = cpp_src/stl_multiset.h /^ operator=(const multiset<_Key,_Compare,_Alloc>& __x)$/;" f class:std::multiset access:public signature:(const multiset<_Key,_Compare,_Alloc>& __x) +std::multiset::operator == cpp_src/stl_multiset.h /^ operator== (const multiset<_K1, _C1, _A1>&,$/;" p class:std::multiset access:friend signature:(const multiset<_K1, _C1, _A1>&, const multiset<_K1, _C1, _A1>&) +std::multiset::pointer cpp_src/stl_multiset.h /^ typedef typename _Key_alloc_type::pointer pointer;$/;" t class:std::multiset access:public +std::multiset::rbegin cpp_src/stl_multiset.h /^ rbegin() const$/;" f class:std::multiset access:public signature:() const +std::multiset::reference cpp_src/stl_multiset.h /^ typedef typename _Key_alloc_type::reference reference;$/;" t class:std::multiset access:public +std::multiset::rend cpp_src/stl_multiset.h /^ rend() const$/;" f class:std::multiset access:public signature:() const +std::multiset::reverse_iterator cpp_src/stl_multiset.h /^ typedef typename _Rep_type::const_reverse_iterator reverse_iterator;$/;" t class:std::multiset access:public +std::multiset::size cpp_src/stl_multiset.h /^ size() const$/;" f class:std::multiset access:public signature:() const +std::multiset::size_type cpp_src/stl_multiset.h /^ typedef typename _Rep_type::size_type size_type;$/;" t class:std::multiset access:public +std::multiset::swap cpp_src/stl_multiset.h /^ swap(multiset<_Key, _Compare, _Alloc>& __x)$/;" f class:std::multiset access:public signature:(multiset<_Key, _Compare, _Alloc>& __x) +std::multiset::upper_bound cpp_src/stl_multiset.h /^ upper_bound(const key_type& __x) const$/;" f class:std::multiset access:public signature:(const key_type& __x) const +std::multiset::upper_bound cpp_src/stl_multiset.h /^ upper_bound(const key_type& __x)$/;" f class:std::multiset access:public signature:(const key_type& __x) +std::multiset::value_comp cpp_src/stl_multiset.h /^ value_comp() const$/;" f class:std::multiset access:public signature:() const +std::multiset::value_compare cpp_src/stl_multiset.h /^ typedef _Compare value_compare;$/;" t class:std::multiset access:public +std::multiset::value_type cpp_src/stl_multiset.h /^ typedef _Key value_type;$/;" t class:std::multiset access:public +std::negate cpp_src/stl_function.h /^ struct negate : public unary_function<_Tp, _Tp>$/;" s namespace:std inherits:unary_function +std::negate::operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x) const$/;" f struct:std::negate access:public signature:(const _Tp& __x) const +std::new_handler cpp_src/new /^ typedef void (*new_handler)();$/;" t namespace:std file: +std::next_permutation cpp_src/stl_algo.h /^ next_permutation(_BidirectionalIterator __first,$/;" f namespace:std signature:(_BidirectionalIterator __first, _BidirectionalIterator __last) +std::next_permutation cpp_src/stl_algo.h /^ next_permutation(_BidirectionalIterator __first,$/;" f namespace:std signature:(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) +std::noboolalpha cpp_src/ios_base.h /^ noboolalpha(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +std::norm cpp_src/complex /^ norm(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::norm cpp_src/complex /^ template _Tp norm(const complex<_Tp>&);$/;" p namespace:std file: signature:(const complex<_Tp>&) +std::noshowbase cpp_src/ios_base.h /^ noshowbase(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +std::noshowpoint cpp_src/ios_base.h /^ noshowpoint(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +std::noshowpos cpp_src/ios_base.h /^ noshowpos(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +std::noskipws cpp_src/ios_base.h /^ noskipws(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +std::not1 cpp_src/stl_function.h /^ not1(const _Predicate& __pred)$/;" f namespace:std signature:(const _Predicate& __pred) +std::not2 cpp_src/stl_function.h /^ not2(const _Predicate& __pred)$/;" f namespace:std signature:(const _Predicate& __pred) +std::not_equal_to cpp_src/stl_function.h /^ struct not_equal_to : public binary_function<_Tp, _Tp, bool>$/;" s namespace:std inherits:binary_function +std::not_equal_to::operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::not_equal_to access:public signature:(const _Tp& __x, const _Tp& __y) const +std::nothrow_t cpp_src/new /^ struct nothrow_t { };$/;" s namespace:std file: +std::nounitbuf cpp_src/ios_base.h /^ nounitbuf(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +std::nouppercase cpp_src/ios_base.h /^ nouppercase(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +std::nth_element cpp_src/stl_algo.h /^ nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) +std::nth_element cpp_src/stl_algo.h /^ nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) +std::num_get cpp_src/locale_facets.h /^ class num_get : public locale::facet$/;" c namespace:std inherits:locale::facet +std::num_get::_M_extract_float cpp_src/locale_facets.h /^ _M_extract_float(iter_type, iter_type, ios_base&, ios_base::iostate&,$/;" p class:std::num_get access:protected signature:(iter_type, iter_type, ios_base&, ios_base::iostate&, string& __xtrc) const +std::num_get::_M_extract_float cpp_src/locale_facets.tcc /^ _M_extract_float(_InIter __beg, _InIter __end, ios_base& __io,$/;" f class:std::num_get signature:(_InIter __beg, _InIter __end, ios_base& __io, ios_base::iostate& __err, string& __xtrc) const +std::num_get::_M_extract_int cpp_src/locale_facets.h /^ _M_extract_int(iter_type, iter_type, ios_base&, ios_base::iostate&,$/;" p class:std::num_get access:protected signature:(iter_type, iter_type, ios_base&, ios_base::iostate&, _ValueT& __v) const +std::num_get::_M_extract_int cpp_src/locale_facets.tcc /^ _M_extract_int(_InIter __beg, _InIter __end, ios_base& __io,$/;" f class:std::num_get signature:(_InIter __beg, _InIter __end, ios_base& __io, ios_base::iostate& __err, _ValueT& __v) const +std::num_get::_M_find cpp_src/locale_facets.h /^ _M_find(const _CharT2* __zero, size_t __len, _CharT2 __c) const$/;" f class:std::num_get access:protected signature:(const _CharT2* __zero, size_t __len, _CharT2 __c) const +std::num_get::_M_find cpp_src/locale_facets.h /^ _M_find(const _CharT2*, size_t __len, _CharT2 __c) const$/;" f class:std::num_get access:protected signature:(const _CharT2*, size_t __len, _CharT2 __c) const +std::num_get::__do_get cpp_src/locale_facets.h /^ __do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,$/;" p class:std::num_get access:protected signature:(iter_type, iter_type, ios_base&, ios_base::iostate& __err, double&) const +std::num_get::__do_get cpp_src/locale_facets.tcc /^ __do_get(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::num_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, double& __v) const +std::num_get::char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::num_get access:public +std::num_get::do_get cpp_src/locale_facets.h /^ do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,$/;" p class:std::num_get access:protected signature:(iter_type, iter_type, ios_base&, ios_base::iostate& __err, double&) const +std::num_get::do_get cpp_src/locale_facets.h /^ do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,$/;" p class:std::num_get access:protected signature:(iter_type, iter_type, ios_base&, ios_base::iostate& __err, float&) const +std::num_get::do_get cpp_src/locale_facets.h /^ do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,$/;" p class:std::num_get access:protected signature:(iter_type, iter_type, ios_base&, ios_base::iostate& __err, long double&) const +std::num_get::do_get cpp_src/locale_facets.h /^ do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,$/;" p class:std::num_get access:protected signature:(iter_type, iter_type, ios_base&, ios_base::iostate& __err, long long&) const +std::num_get::do_get cpp_src/locale_facets.h /^ do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,$/;" p class:std::num_get access:protected signature:(iter_type, iter_type, ios_base&, ios_base::iostate& __err, unsigned int&) const +std::num_get::do_get cpp_src/locale_facets.h /^ do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,$/;" p class:std::num_get access:protected signature:(iter_type, iter_type, ios_base&, ios_base::iostate& __err, unsigned long long&) const +std::num_get::do_get cpp_src/locale_facets.h /^ do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,$/;" p class:std::num_get access:protected signature:(iter_type, iter_type, ios_base&, ios_base::iostate& __err, unsigned long&) const +std::num_get::do_get cpp_src/locale_facets.h /^ do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,$/;" p class:std::num_get access:protected signature:(iter_type, iter_type, ios_base&, ios_base::iostate& __err, unsigned short&) const +std::num_get::do_get cpp_src/locale_facets.h /^ do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err,$/;" p class:std::num_get access:protected signature:(iter_type, iter_type, ios_base&, ios_base::iostate& __err, void*&) const +std::num_get::do_get cpp_src/locale_facets.h /^ do_get(iter_type, iter_type, ios_base&, ios_base::iostate&, bool&) const;$/;" p class:std::num_get access:protected signature:(iter_type, iter_type, ios_base&, ios_base::iostate&, bool&) const +std::num_get::do_get cpp_src/locale_facets.h /^ do_get(iter_type, iter_type, ios_base&, ios_base::iostate&, long&) const;$/;" p class:std::num_get access:protected signature:(iter_type, iter_type, ios_base&, ios_base::iostate&, long&) const +std::num_get::do_get cpp_src/locale_facets.tcc /^ do_get(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::num_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, bool& __v) const +std::num_get::do_get cpp_src/locale_facets.tcc /^ do_get(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::num_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, double& __v) const +std::num_get::do_get cpp_src/locale_facets.tcc /^ do_get(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::num_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, float& __v) const +std::num_get::do_get cpp_src/locale_facets.tcc /^ do_get(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::num_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, long double& __v) const +std::num_get::do_get cpp_src/locale_facets.tcc /^ do_get(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::num_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, long long& __v) const +std::num_get::do_get cpp_src/locale_facets.tcc /^ do_get(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::num_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, long& __v) const +std::num_get::do_get cpp_src/locale_facets.tcc /^ do_get(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::num_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, unsigned int& __v) const +std::num_get::do_get cpp_src/locale_facets.tcc /^ do_get(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::num_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, unsigned long long& __v) const +std::num_get::do_get cpp_src/locale_facets.tcc /^ do_get(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::num_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, unsigned long& __v) const +std::num_get::do_get cpp_src/locale_facets.tcc /^ do_get(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::num_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, unsigned short& __v) const +std::num_get::do_get cpp_src/locale_facets.tcc /^ do_get(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::num_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, void*& __v) const +std::num_get::get cpp_src/locale_facets.h /^ get(iter_type __in, iter_type __end, ios_base& __io,$/;" f class:std::num_get access:public signature:(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, bool& __v) const +std::num_get::get cpp_src/locale_facets.h /^ get(iter_type __in, iter_type __end, ios_base& __io,$/;" f class:std::num_get access:public signature:(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, double& __v) const +std::num_get::get cpp_src/locale_facets.h /^ get(iter_type __in, iter_type __end, ios_base& __io,$/;" f class:std::num_get access:public signature:(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, float& __v) const +std::num_get::get cpp_src/locale_facets.h /^ get(iter_type __in, iter_type __end, ios_base& __io,$/;" f class:std::num_get access:public signature:(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, long double& __v) const +std::num_get::get cpp_src/locale_facets.h /^ get(iter_type __in, iter_type __end, ios_base& __io,$/;" f class:std::num_get access:public signature:(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, long long& __v) const +std::num_get::get cpp_src/locale_facets.h /^ get(iter_type __in, iter_type __end, ios_base& __io,$/;" f class:std::num_get access:public signature:(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, long& __v) const +std::num_get::get cpp_src/locale_facets.h /^ get(iter_type __in, iter_type __end, ios_base& __io,$/;" f class:std::num_get access:public signature:(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, unsigned int& __v) const +std::num_get::get cpp_src/locale_facets.h /^ get(iter_type __in, iter_type __end, ios_base& __io,$/;" f class:std::num_get access:public signature:(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, unsigned long long& __v) const +std::num_get::get cpp_src/locale_facets.h /^ get(iter_type __in, iter_type __end, ios_base& __io,$/;" f class:std::num_get access:public signature:(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, unsigned long& __v) const +std::num_get::get cpp_src/locale_facets.h /^ get(iter_type __in, iter_type __end, ios_base& __io,$/;" f class:std::num_get access:public signature:(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, unsigned short& __v) const +std::num_get::get cpp_src/locale_facets.h /^ get(iter_type __in, iter_type __end, ios_base& __io,$/;" f class:std::num_get access:public signature:(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, void*& __v) const +std::num_get::id cpp_src/locale_facets.h /^ static locale::id id;$/;" m class:std::num_get access:public +std::num_get::id cpp_src/locale_facets.h /^ locale::id num_get<_CharT, _InIter>::id;$/;" m class:std::num_get +std::num_get::iter_type cpp_src/locale_facets.h /^ typedef _InIter iter_type;$/;" t class:std::num_get access:public +std::num_get::num_get cpp_src/locale_facets.h /^ num_get(size_t __refs = 0) : facet(__refs) { }$/;" f class:std::num_get access:public signature:(size_t __refs = 0) +std::num_get::~num_get cpp_src/locale_facets.h /^ virtual ~num_get() { }$/;" f class:std::num_get access:protected signature:() +std::num_put cpp_src/locale_facets.h /^ class num_put : public locale::facet$/;" c namespace:std inherits:locale::facet +std::num_put::_M_group_float cpp_src/locale_facets.h /^ _M_group_float(const char* __grouping, size_t __grouping_size,$/;" p class:std::num_put access:protected signature:(const char* __grouping, size_t __grouping_size, char_type __sep, const char_type* __p, char_type* __new, char_type* __cs, int& __len) const +std::num_put::_M_group_float cpp_src/locale_facets.tcc /^ _M_group_float(const char* __grouping, size_t __grouping_size,$/;" f class:std::num_put signature:(const char* __grouping, size_t __grouping_size, _CharT __sep, const _CharT* __p, _CharT* __new, _CharT* __cs, int& __len) const +std::num_put::_M_group_int cpp_src/locale_facets.h /^ _M_group_int(const char* __grouping, size_t __grouping_size,$/;" p class:std::num_put access:protected signature:(const char* __grouping, size_t __grouping_size, char_type __sep, ios_base& __io, char_type* __new, char_type* __cs, int& __len) const +std::num_put::_M_group_int cpp_src/locale_facets.tcc /^ _M_group_int(const char* __grouping, size_t __grouping_size, _CharT __sep,$/;" f class:std::num_put signature:(const char* __grouping, size_t __grouping_size, _CharT __sep, ios_base&, _CharT* __new, _CharT* __cs, int& __len) const +std::num_put::_M_insert_float cpp_src/locale_facets.h /^ _M_insert_float(iter_type, ios_base& __io, char_type __fill,$/;" p class:std::num_put access:protected signature:(iter_type, ios_base& __io, char_type __fill, char __mod, _ValueT __v) const +std::num_put::_M_insert_float cpp_src/locale_facets.tcc /^ _M_insert_float(_OutIter __s, ios_base& __io, _CharT __fill, char __mod,$/;" f class:std::num_put signature:(_OutIter __s, ios_base& __io, _CharT __fill, char __mod, _ValueT __v) const +std::num_put::_M_insert_int cpp_src/locale_facets.h /^ _M_insert_int(iter_type, ios_base& __io, char_type __fill,$/;" p class:std::num_put access:protected signature:(iter_type, ios_base& __io, char_type __fill, _ValueT __v) const +std::num_put::_M_insert_int cpp_src/locale_facets.tcc /^ _M_insert_int(_OutIter __s, ios_base& __io, _CharT __fill,$/;" f class:std::num_put signature:(_OutIter __s, ios_base& __io, _CharT __fill, _ValueT __v) const +std::num_put::_M_pad cpp_src/locale_facets.h /^ _M_pad(char_type __fill, streamsize __w, ios_base& __io,$/;" p class:std::num_put access:protected signature:(char_type __fill, streamsize __w, ios_base& __io, char_type* __new, const char_type* __cs, int& __len) const +std::num_put::_M_pad cpp_src/locale_facets.tcc /^ _M_pad(_CharT __fill, streamsize __w, ios_base& __io,$/;" f class:std::num_put signature:(_CharT __fill, streamsize __w, ios_base& __io, _CharT* __new, const _CharT* __cs, int& __len) const +std::num_put::__do_put cpp_src/locale_facets.h /^ __do_put(iter_type, ios_base&, char_type __fill, double __v) const;$/;" p class:std::num_put access:protected signature:(iter_type, ios_base&, char_type __fill, double __v) const +std::num_put::__do_put cpp_src/locale_facets.tcc /^ __do_put(iter_type __s, ios_base& __io, char_type __fill, double __v) const$/;" f class:std::num_put signature:(iter_type __s, ios_base& __io, char_type __fill, double __v) const +std::num_put::char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::num_put access:public +std::num_put::do_put cpp_src/locale_facets.h /^ do_put(iter_type, ios_base&, char_type __fill, bool __v) const;$/;" p class:std::num_put access:protected signature:(iter_type, ios_base&, char_type __fill, bool __v) const +std::num_put::do_put cpp_src/locale_facets.h /^ do_put(iter_type, ios_base&, char_type __fill, const void* __v) const;$/;" p class:std::num_put access:protected signature:(iter_type, ios_base&, char_type __fill, const void* __v) const +std::num_put::do_put cpp_src/locale_facets.h /^ do_put(iter_type, ios_base&, char_type __fill, double __v) const;$/;" p class:std::num_put access:protected signature:(iter_type, ios_base&, char_type __fill, double __v) const +std::num_put::do_put cpp_src/locale_facets.h /^ do_put(iter_type, ios_base&, char_type __fill, long __v) const;$/;" p class:std::num_put access:protected signature:(iter_type, ios_base&, char_type __fill, long __v) const +std::num_put::do_put cpp_src/locale_facets.h /^ do_put(iter_type, ios_base&, char_type __fill, long double __v) const;$/;" p class:std::num_put access:protected signature:(iter_type, ios_base&, char_type __fill, long double __v) const +std::num_put::do_put cpp_src/locale_facets.h /^ do_put(iter_type, ios_base&, char_type __fill, long long __v) const;$/;" p class:std::num_put access:protected signature:(iter_type, ios_base&, char_type __fill, long long __v) const +std::num_put::do_put cpp_src/locale_facets.h /^ do_put(iter_type, ios_base&, char_type __fill, unsigned long long) const;$/;" p class:std::num_put access:protected signature:(iter_type, ios_base&, char_type __fill, unsigned long long) const +std::num_put::do_put cpp_src/locale_facets.h /^ do_put(iter_type, ios_base&, char_type __fill, unsigned long) const;$/;" p class:std::num_put access:protected signature:(iter_type, ios_base&, char_type __fill, unsigned long) const +std::num_put::do_put cpp_src/locale_facets.tcc /^ do_put(iter_type __s, ios_base& __io, char_type __fill, bool __v) const$/;" f class:std::num_put signature:(iter_type __s, ios_base& __io, char_type __fill, bool __v) const +std::num_put::do_put cpp_src/locale_facets.tcc /^ do_put(iter_type __s, ios_base& __io, char_type __fill, double __v) const$/;" f class:std::num_put signature:(iter_type __s, ios_base& __io, char_type __fill, double __v) const +std::num_put::do_put cpp_src/locale_facets.tcc /^ do_put(iter_type __s, ios_base& __io, char_type __fill, long __v) const$/;" f class:std::num_put signature:(iter_type __s, ios_base& __io, char_type __fill, long __v) const +std::num_put::do_put cpp_src/locale_facets.tcc /^ do_put(iter_type __s, ios_base& __io, char_type __fill, long long __v) const$/;" f class:std::num_put signature:(iter_type __s, ios_base& __io, char_type __fill, long long __v) const +std::num_put::do_put cpp_src/locale_facets.tcc /^ do_put(iter_type __s, ios_base& __io, char_type __fill,$/;" f class:std::num_put signature:(iter_type __s, ios_base& __io, char_type __fill, const void* __v) const +std::num_put::do_put cpp_src/locale_facets.tcc /^ do_put(iter_type __s, ios_base& __io, char_type __fill,$/;" f class:std::num_put signature:(iter_type __s, ios_base& __io, char_type __fill, long double __v) const +std::num_put::do_put cpp_src/locale_facets.tcc /^ do_put(iter_type __s, ios_base& __io, char_type __fill,$/;" f class:std::num_put signature:(iter_type __s, ios_base& __io, char_type __fill, unsigned long __v) const +std::num_put::do_put cpp_src/locale_facets.tcc /^ do_put(iter_type __s, ios_base& __io, char_type __fill,$/;" f class:std::num_put signature:(iter_type __s, ios_base& __io, char_type __fill, unsigned long long __v) const +std::num_put::id cpp_src/locale_facets.h /^ static locale::id id;$/;" m class:std::num_put access:public +std::num_put::id cpp_src/locale_facets.h /^ locale::id num_put<_CharT, _OutIter>::id;$/;" m class:std::num_put +std::num_put::iter_type cpp_src/locale_facets.h /^ typedef _OutIter iter_type;$/;" t class:std::num_put access:public +std::num_put::num_put cpp_src/locale_facets.h /^ num_put(size_t __refs = 0) : facet(__refs) { }$/;" f class:std::num_put access:public signature:(size_t __refs = 0) +std::num_put::put cpp_src/locale_facets.h /^ put(iter_type __s, ios_base& __f, char_type __fill, bool __v) const$/;" f class:std::num_put access:public signature:(iter_type __s, ios_base& __f, char_type __fill, bool __v) const +std::num_put::put cpp_src/locale_facets.h /^ put(iter_type __s, ios_base& __f, char_type __fill, double __v) const$/;" f class:std::num_put access:public signature:(iter_type __s, ios_base& __f, char_type __fill, double __v) const +std::num_put::put cpp_src/locale_facets.h /^ put(iter_type __s, ios_base& __f, char_type __fill, long __v) const$/;" f class:std::num_put access:public signature:(iter_type __s, ios_base& __f, char_type __fill, long __v) const +std::num_put::put cpp_src/locale_facets.h /^ put(iter_type __s, ios_base& __f, char_type __fill, long long __v) const$/;" f class:std::num_put access:public signature:(iter_type __s, ios_base& __f, char_type __fill, long long __v) const +std::num_put::put cpp_src/locale_facets.h /^ put(iter_type __s, ios_base& __f, char_type __fill,$/;" f class:std::num_put access:public signature:(iter_type __s, ios_base& __f, char_type __fill, const void* __v) const +std::num_put::put cpp_src/locale_facets.h /^ put(iter_type __s, ios_base& __f, char_type __fill,$/;" f class:std::num_put access:public signature:(iter_type __s, ios_base& __f, char_type __fill, long double __v) const +std::num_put::put cpp_src/locale_facets.h /^ put(iter_type __s, ios_base& __f, char_type __fill,$/;" f class:std::num_put access:public signature:(iter_type __s, ios_base& __f, char_type __fill, unsigned long __v) const +std::num_put::put cpp_src/locale_facets.h /^ put(iter_type __s, ios_base& __f, char_type __fill,$/;" f class:std::num_put access:public signature:(iter_type __s, ios_base& __f, char_type __fill, unsigned long long __v) const +std::num_put::~num_put cpp_src/locale_facets.h /^ ~num_put() { };$/;" f class:std::num_put access:protected signature:() +std::numeric_limits cpp_src/limits /^ struct numeric_limits : public __numeric_limits_base$/;" s namespace:std file: inherits:__numeric_limits_base +std::numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +std::numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +std::numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +std::numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +std::numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +std::numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +std::numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +std::numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +std::numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +std::numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +std::numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +std::numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +std::numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +std::numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +std::numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +std::numeric_limits cpp_src/limits /^ struct numeric_limits$/;" s namespace:std file: +std::numeric_limits::denorm_min cpp_src/limits /^ static _Tp denorm_min() throw() { return static_cast<_Tp>(0); }$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::denorm_min cpp_src/limits /^ static bool denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::denorm_min cpp_src/limits /^ static char denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::denorm_min cpp_src/limits /^ static double denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::denorm_min cpp_src/limits /^ static float denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::denorm_min cpp_src/limits /^ static int denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::denorm_min cpp_src/limits /^ static long denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::denorm_min cpp_src/limits /^ static long double denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::denorm_min cpp_src/limits /^ static long long denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::denorm_min cpp_src/limits /^ static short denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::denorm_min cpp_src/limits /^ static signed char denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::denorm_min cpp_src/limits /^ static unsigned char denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::denorm_min cpp_src/limits /^ static unsigned int denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::denorm_min cpp_src/limits /^ static unsigned long denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::denorm_min cpp_src/limits /^ static unsigned long long denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::denorm_min cpp_src/limits /^ static unsigned short denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::denorm_min cpp_src/limits /^ static wchar_t denorm_min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::digits cpp_src/limits /^ static const int digits = 1;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits cpp_src/limits /^ static const int digits = __DBL_MANT_DIG__;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits cpp_src/limits /^ static const int digits = __FLT_MANT_DIG__;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits cpp_src/limits /^ static const int digits = __LDBL_MANT_DIG__;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits cpp_src/limits /^ static const int digits = __glibcxx_digits (char);$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits cpp_src/limits /^ static const int digits = __glibcxx_digits (int);$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits cpp_src/limits /^ static const int digits = __glibcxx_digits (long long);$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits cpp_src/limits /^ static const int digits = __glibcxx_digits (long);$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits cpp_src/limits /^ static const int digits = __glibcxx_digits (short);$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits cpp_src/limits /^ static const int digits = __glibcxx_digits (signed char);$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits cpp_src/limits /^ static const int digits = __glibcxx_digits (unsigned char);$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits cpp_src/limits /^ static const int digits = __glibcxx_digits (unsigned int);$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits cpp_src/limits /^ static const int digits = __glibcxx_digits (unsigned long long);$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits cpp_src/limits /^ static const int digits = __glibcxx_digits (unsigned long);$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits cpp_src/limits /^ static const int digits = __glibcxx_digits (unsigned short);$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits cpp_src/limits /^ static const int digits = __glibcxx_digits (wchar_t);$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits10 cpp_src/limits /^ static const int digits10 = 0;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits10 cpp_src/limits /^ static const int digits10 = __DBL_DIG__;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits10 cpp_src/limits /^ static const int digits10 = __FLT_DIG__;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits10 cpp_src/limits /^ static const int digits10 = __LDBL_DIG__;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits10 cpp_src/limits /^ static const int digits10 = __glibcxx_digits10 (char);$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits10 cpp_src/limits /^ static const int digits10 = __glibcxx_digits10 (int);$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits10 cpp_src/limits /^ static const int digits10 = __glibcxx_digits10 (long long);$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits10 cpp_src/limits /^ static const int digits10 = __glibcxx_digits10 (long);$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits10 cpp_src/limits /^ static const int digits10 = __glibcxx_digits10 (short);$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits10 cpp_src/limits /^ static const int digits10 = __glibcxx_digits10 (signed char);$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits10 cpp_src/limits /^ static const int digits10 = __glibcxx_digits10 (unsigned char);$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits10 cpp_src/limits /^ static const int digits10 = __glibcxx_digits10 (unsigned int);$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits10 cpp_src/limits /^ static const int digits10 = __glibcxx_digits10 (unsigned long long);$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits10 cpp_src/limits /^ static const int digits10 = __glibcxx_digits10 (unsigned long);$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits10 cpp_src/limits /^ static const int digits10 = __glibcxx_digits10 (unsigned short);$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::digits10 cpp_src/limits /^ static const int digits10 = __glibcxx_digits10 (wchar_t);$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::epsilon cpp_src/limits /^ static _Tp epsilon() throw() { return static_cast<_Tp>(0); }$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::epsilon cpp_src/limits /^ static bool epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::epsilon cpp_src/limits /^ static char epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::epsilon cpp_src/limits /^ static double epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::epsilon cpp_src/limits /^ static float epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::epsilon cpp_src/limits /^ static int epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::epsilon cpp_src/limits /^ static long double epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::epsilon cpp_src/limits /^ static long epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::epsilon cpp_src/limits /^ static long long epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::epsilon cpp_src/limits /^ static short epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::epsilon cpp_src/limits /^ static signed char epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::epsilon cpp_src/limits /^ static unsigned char epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::epsilon cpp_src/limits /^ static unsigned int epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::epsilon cpp_src/limits /^ static unsigned long epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::epsilon cpp_src/limits /^ static unsigned long long epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::epsilon cpp_src/limits /^ static unsigned short epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::epsilon cpp_src/limits /^ static wchar_t epsilon() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::has_denorm cpp_src/limits /^ static const float_denorm_style has_denorm = denorm_absent;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::has_denorm cpp_src/limits /^ static const float_denorm_style has_denorm$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::has_denorm_loss cpp_src/limits /^ static const bool has_denorm_loss = __glibcxx_double_has_denorm_loss;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::has_denorm_loss cpp_src/limits /^ static const bool has_denorm_loss = __glibcxx_float_has_denorm_loss;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::has_denorm_loss cpp_src/limits /^ static const bool has_denorm_loss = false;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::has_denorm_loss cpp_src/limits /^ static const bool has_denorm_loss$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::has_infinity cpp_src/limits /^ static const bool has_infinity = __DBL_HAS_INFINITY__;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::has_infinity cpp_src/limits /^ static const bool has_infinity = __FLT_HAS_INFINITY__;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::has_infinity cpp_src/limits /^ static const bool has_infinity = __LDBL_HAS_INFINITY__;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::has_infinity cpp_src/limits /^ static const bool has_infinity = false;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::has_quiet_NaN cpp_src/limits /^ static const bool has_quiet_NaN = __DBL_HAS_QUIET_NAN__;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::has_quiet_NaN cpp_src/limits /^ static const bool has_quiet_NaN = __FLT_HAS_QUIET_NAN__;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::has_quiet_NaN cpp_src/limits /^ static const bool has_quiet_NaN = __LDBL_HAS_QUIET_NAN__;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::has_quiet_NaN cpp_src/limits /^ static const bool has_quiet_NaN = false;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::has_signaling_NaN cpp_src/limits /^ static const bool has_signaling_NaN = false;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::has_signaling_NaN cpp_src/limits /^ static const bool has_signaling_NaN = has_quiet_NaN;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::infinity cpp_src/limits /^ static _Tp infinity() throw() { return static_cast<_Tp>(0); }$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::infinity cpp_src/limits /^ static bool infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::infinity cpp_src/limits /^ static char infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::infinity cpp_src/limits /^ static double infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::infinity cpp_src/limits /^ static float infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::infinity cpp_src/limits /^ static int infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::infinity cpp_src/limits /^ static long double infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::infinity cpp_src/limits /^ static long infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::infinity cpp_src/limits /^ static long long infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::infinity cpp_src/limits /^ static short infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::infinity cpp_src/limits /^ static signed char infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::infinity cpp_src/limits /^ static unsigned char infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::infinity cpp_src/limits /^ static unsigned int infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::infinity cpp_src/limits /^ static unsigned long infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::infinity cpp_src/limits /^ static unsigned long long infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::infinity cpp_src/limits /^ static unsigned short infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::infinity cpp_src/limits /^ static wchar_t infinity() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::is_bounded cpp_src/limits /^ static const bool is_bounded = true;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::is_exact cpp_src/limits /^ static const bool is_exact = false;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::is_exact cpp_src/limits /^ static const bool is_exact = true;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::is_iec559 cpp_src/limits /^ static const bool is_iec559 = false;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::is_iec559 cpp_src/limits /^ static const bool is_iec559$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::is_integer cpp_src/limits /^ static const bool is_integer = false;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::is_integer cpp_src/limits /^ static const bool is_integer = true;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::is_modulo cpp_src/limits /^ static const bool is_modulo = false;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::is_modulo cpp_src/limits /^ static const bool is_modulo = true;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::is_signed cpp_src/limits /^ static const bool is_signed = __glibcxx_signed (char);$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::is_signed cpp_src/limits /^ static const bool is_signed = __glibcxx_signed (wchar_t);$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::is_signed cpp_src/limits /^ static const bool is_signed = false;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::is_signed cpp_src/limits /^ static const bool is_signed = true;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::is_specialized cpp_src/limits /^ static const bool is_specialized = true;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::max cpp_src/limits /^ static _Tp max() throw() { return static_cast<_Tp>(0); }$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::max cpp_src/limits /^ static bool max() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::max cpp_src/limits /^ static char max() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::max cpp_src/limits /^ static double max() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::max cpp_src/limits /^ static float max() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::max cpp_src/limits /^ static int max() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::max cpp_src/limits /^ static long double max() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::max cpp_src/limits /^ static long long max() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::max cpp_src/limits /^ static long max() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::max cpp_src/limits /^ static short max() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::max cpp_src/limits /^ static signed char max() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::max cpp_src/limits /^ static unsigned char max() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::max cpp_src/limits /^ static unsigned int max() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::max cpp_src/limits /^ static unsigned long long max() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::max cpp_src/limits /^ static unsigned long max() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::max cpp_src/limits /^ static unsigned short max() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::max cpp_src/limits /^ static wchar_t max() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::max_exponent cpp_src/limits /^ static const int max_exponent = 0;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::max_exponent cpp_src/limits /^ static const int max_exponent = __DBL_MAX_EXP__;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::max_exponent cpp_src/limits /^ static const int max_exponent = __FLT_MAX_EXP__;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::max_exponent cpp_src/limits /^ static const int max_exponent = __LDBL_MAX_EXP__;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::max_exponent10 cpp_src/limits /^ static const int max_exponent10 = 0;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::max_exponent10 cpp_src/limits /^ static const int max_exponent10 = __DBL_MAX_10_EXP__;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::max_exponent10 cpp_src/limits /^ static const int max_exponent10 = __FLT_MAX_10_EXP__;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::max_exponent10 cpp_src/limits /^ static const int max_exponent10 = __LDBL_MAX_10_EXP__;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::min cpp_src/limits /^ static _Tp min() throw() { return static_cast<_Tp>(0); }$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::min cpp_src/limits /^ static bool min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::min cpp_src/limits /^ static char min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::min cpp_src/limits /^ static double min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::min cpp_src/limits /^ static float min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::min cpp_src/limits /^ static int min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::min cpp_src/limits /^ static long double min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::min cpp_src/limits /^ static long long min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::min cpp_src/limits /^ static long min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::min cpp_src/limits /^ static short min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::min cpp_src/limits /^ static signed char min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::min cpp_src/limits /^ static unsigned char min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::min cpp_src/limits /^ static unsigned int min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::min cpp_src/limits /^ static unsigned long long min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::min cpp_src/limits /^ static unsigned long min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::min cpp_src/limits /^ static unsigned short min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::min cpp_src/limits /^ static wchar_t min() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::min_exponent cpp_src/limits /^ static const int min_exponent = 0;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::min_exponent cpp_src/limits /^ static const int min_exponent = __DBL_MIN_EXP__;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::min_exponent cpp_src/limits /^ static const int min_exponent = __FLT_MIN_EXP__;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::min_exponent cpp_src/limits /^ static const int min_exponent = __LDBL_MIN_EXP__;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::min_exponent10 cpp_src/limits /^ static const int min_exponent10 = 0;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::min_exponent10 cpp_src/limits /^ static const int min_exponent10 = __DBL_MIN_10_EXP__;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::min_exponent10 cpp_src/limits /^ static const int min_exponent10 = __FLT_MIN_10_EXP__;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::min_exponent10 cpp_src/limits /^ static const int min_exponent10 = __LDBL_MIN_10_EXP__;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::quiet_NaN cpp_src/limits /^ static _Tp quiet_NaN() throw() { return static_cast<_Tp>(0); }$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::quiet_NaN cpp_src/limits /^ static bool quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::quiet_NaN cpp_src/limits /^ static char quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::quiet_NaN cpp_src/limits /^ static double quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::quiet_NaN cpp_src/limits /^ static float quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::quiet_NaN cpp_src/limits /^ static int quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::quiet_NaN cpp_src/limits /^ static long double quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::quiet_NaN cpp_src/limits /^ static long long quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::quiet_NaN cpp_src/limits /^ static long quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::quiet_NaN cpp_src/limits /^ static short quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::quiet_NaN cpp_src/limits /^ static signed char quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::quiet_NaN cpp_src/limits /^ static unsigned char quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::quiet_NaN cpp_src/limits /^ static unsigned int quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::quiet_NaN cpp_src/limits /^ static unsigned long long quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::quiet_NaN cpp_src/limits /^ static unsigned long quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::quiet_NaN cpp_src/limits /^ static unsigned short quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::quiet_NaN cpp_src/limits /^ static wchar_t quiet_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::radix cpp_src/limits /^ static const int radix = 2;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::radix cpp_src/limits /^ static const int radix = __FLT_RADIX__;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::round_error cpp_src/limits /^ static _Tp round_error() throw() { return static_cast<_Tp>(0); }$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::round_error cpp_src/limits /^ static bool round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::round_error cpp_src/limits /^ static char round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::round_error cpp_src/limits /^ static double round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::round_error cpp_src/limits /^ static float round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::round_error cpp_src/limits /^ static int round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::round_error cpp_src/limits /^ static long double round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::round_error cpp_src/limits /^ static long long round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::round_error cpp_src/limits /^ static long round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::round_error cpp_src/limits /^ static short round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::round_error cpp_src/limits /^ static signed char round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::round_error cpp_src/limits /^ static unsigned char round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::round_error cpp_src/limits /^ static unsigned int round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::round_error cpp_src/limits /^ static unsigned long long round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::round_error cpp_src/limits /^ static unsigned long round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::round_error cpp_src/limits /^ static unsigned short round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::round_error cpp_src/limits /^ static wchar_t round_error() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::round_style cpp_src/limits /^ static const float_round_style round_style = round_to_nearest;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::round_style cpp_src/limits /^ static const float_round_style round_style = round_toward_zero;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::signaling_NaN cpp_src/limits /^ static _Tp signaling_NaN() throw() { return static_cast<_Tp>(0); }$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::signaling_NaN cpp_src/limits /^ static bool signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::signaling_NaN cpp_src/limits /^ static char signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::signaling_NaN cpp_src/limits /^ static double signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::signaling_NaN cpp_src/limits /^ static float signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::signaling_NaN cpp_src/limits /^ static int signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::signaling_NaN cpp_src/limits /^ static long double signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::signaling_NaN cpp_src/limits /^ static long long signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::signaling_NaN cpp_src/limits /^ static long signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::signaling_NaN cpp_src/limits /^ static short signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::signaling_NaN cpp_src/limits /^ static signed char signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::signaling_NaN cpp_src/limits /^ static unsigned char signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::signaling_NaN cpp_src/limits /^ static unsigned int signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::signaling_NaN cpp_src/limits /^ static unsigned long long signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::signaling_NaN cpp_src/limits /^ static unsigned long signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::signaling_NaN cpp_src/limits /^ static unsigned short signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::signaling_NaN cpp_src/limits /^ static wchar_t signaling_NaN() throw()$/;" f struct:std::numeric_limits access:public signature:() +std::numeric_limits::tinyness_before cpp_src/limits /^ static const bool tinyness_before = __glibcxx_double_tinyness_before;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::tinyness_before cpp_src/limits /^ static const bool tinyness_before = __glibcxx_float_tinyness_before;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::tinyness_before cpp_src/limits /^ static const bool tinyness_before = __glibcxx_long_double_tinyness_before;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::tinyness_before cpp_src/limits /^ static const bool tinyness_before = false;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::traps cpp_src/limits /^ static const bool traps = __glibcxx_double_traps;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::traps cpp_src/limits /^ static const bool traps = __glibcxx_float_traps;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::traps cpp_src/limits /^ static const bool traps = __glibcxx_integral_traps;$/;" m struct:std::numeric_limits file: access:public +std::numeric_limits::traps cpp_src/limits /^ static const bool traps = __glibcxx_long_double_traps;$/;" m struct:std::numeric_limits file: access:public +std::numpunct cpp_src/locale_facets.h /^ class numpunct : public locale::facet$/;" c namespace:std inherits:locale::facet +std::numpunct::_M_data cpp_src/locale_facets.h /^ __cache_type* _M_data;$/;" m class:std::numpunct access:protected +std::numpunct::_M_initialize_numpunct cpp_src/locale_facets.h /^ _M_initialize_numpunct(__c_locale __cloc = NULL);$/;" p class:std::numpunct access:protected signature:(__c_locale __cloc = NULL) +std::numpunct::_M_initialize_numpunct cpp_src/locale_facets.h /^ numpunct::_M_initialize_numpunct(__c_locale __cloc);$/;" p class:std::numpunct signature:(__c_locale __cloc) +std::numpunct::_M_initialize_numpunct cpp_src/locale_facets.h /^ numpunct::_M_initialize_numpunct(__c_locale __cloc);$/;" p class:std::numpunct signature:(__c_locale __cloc) +std::numpunct::__cache_type cpp_src/locale_facets.h /^ typedef __numpunct_cache<_CharT> __cache_type;$/;" t class:std::numpunct access:public +std::numpunct::char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::numpunct access:public +std::numpunct::decimal_point cpp_src/locale_facets.h /^ decimal_point() const$/;" f class:std::numpunct access:public signature:() const +std::numpunct::do_decimal_point cpp_src/locale_facets.h /^ do_decimal_point() const$/;" f class:std::numpunct access:protected signature:() const +std::numpunct::do_falsename cpp_src/locale_facets.h /^ do_falsename() const$/;" f class:std::numpunct access:protected signature:() const +std::numpunct::do_grouping cpp_src/locale_facets.h /^ do_grouping() const$/;" f class:std::numpunct access:protected signature:() const +std::numpunct::do_thousands_sep cpp_src/locale_facets.h /^ do_thousands_sep() const$/;" f class:std::numpunct access:protected signature:() const +std::numpunct::do_truename cpp_src/locale_facets.h /^ do_truename() const$/;" f class:std::numpunct access:protected signature:() const +std::numpunct::falsename cpp_src/locale_facets.h /^ falsename() const$/;" f class:std::numpunct access:public signature:() const +std::numpunct::grouping cpp_src/locale_facets.h /^ grouping() const$/;" f class:std::numpunct access:public signature:() const +std::numpunct::id cpp_src/locale_facets.h /^ static locale::id id;$/;" m class:std::numpunct access:public +std::numpunct::id cpp_src/locale_facets.h /^ locale::id numpunct<_CharT>::id;$/;" m class:std::numpunct +std::numpunct::numpunct cpp_src/locale_facets.h /^ numpunct(__c_locale __cloc, size_t __refs = 0)$/;" f class:std::numpunct access:public signature:(__c_locale __cloc, size_t __refs = 0) +std::numpunct::numpunct cpp_src/locale_facets.h /^ numpunct(__cache_type* __cache, size_t __refs = 0)$/;" f class:std::numpunct access:public signature:(__cache_type* __cache, size_t __refs = 0) +std::numpunct::numpunct cpp_src/locale_facets.h /^ numpunct(size_t __refs = 0) : facet(__refs), _M_data(NULL)$/;" f class:std::numpunct access:public signature:(size_t __refs = 0) +std::numpunct::string_type cpp_src/locale_facets.h /^ typedef basic_string<_CharT> string_type;$/;" t class:std::numpunct access:public +std::numpunct::thousands_sep cpp_src/locale_facets.h /^ thousands_sep() const$/;" f class:std::numpunct access:public signature:() const +std::numpunct::truename cpp_src/locale_facets.h /^ truename() const$/;" f class:std::numpunct access:public signature:() const +std::numpunct::~numpunct cpp_src/locale_facets.h /^ ~numpunct();$/;" p class:std::numpunct access:protected signature:() +std::numpunct::~numpunct cpp_src/locale_facets.h /^ numpunct::~numpunct();$/;" p class:std::numpunct signature:() +std::numpunct::~numpunct cpp_src/locale_facets.h /^ numpunct::~numpunct();$/;" p class:std::numpunct signature:() +std::numpunct_byname cpp_src/locale_facets.h /^ class numpunct_byname : public numpunct<_CharT>$/;" c namespace:std inherits:numpunct +std::numpunct_byname::char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::numpunct_byname access:public +std::numpunct_byname::numpunct_byname cpp_src/locale_facets.h /^ numpunct_byname(const char* __s, size_t __refs = 0)$/;" f class:std::numpunct_byname access:public signature:(const char* __s, size_t __refs = 0) +std::numpunct_byname::string_type cpp_src/locale_facets.h /^ typedef basic_string<_CharT> string_type;$/;" t class:std::numpunct_byname access:public +std::numpunct_byname::~numpunct_byname cpp_src/locale_facets.h /^ ~numpunct_byname() { }$/;" f class:std::numpunct_byname access:protected signature:() +std::oct cpp_src/ios_base.h /^ oct(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +std::ofstream cpp_src/iosfwd /^ typedef basic_ofstream ofstream; \/\/\/< @isiosfwd$/;" t namespace:std file: +std::operator != cpp_src/allocator.h /^ operator!=(const allocator<_T1>&, const allocator<_T2>&)$/;" f namespace:std signature:(const allocator<_T1>&, const allocator<_T2>&) +std::operator != cpp_src/allocator.h /^ operator!=(const allocator<_Tp>&, const allocator<_Tp>&)$/;" f namespace:std signature:(const allocator<_Tp>&, const allocator<_Tp>&) +std::operator != cpp_src/basic_string.h /^ operator!=(const _CharT* __lhs,$/;" f namespace:std signature:(const _CharT* __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) +std::operator != cpp_src/basic_string.h /^ operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,$/;" f namespace:std signature:(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const _CharT* __rhs) +std::operator != cpp_src/basic_string.h /^ operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,$/;" f namespace:std signature:(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) +std::operator != cpp_src/complex /^ operator!=(const _Tp& __x, const complex<_Tp>& __y)$/;" f namespace:std signature:(const _Tp& __x, const complex<_Tp>& __y) +std::operator != cpp_src/complex /^ operator!=(const complex<_Tp>& __x, const _Tp& __y)$/;" f namespace:std signature:(const complex<_Tp>& __x, const _Tp& __y) +std::operator != cpp_src/complex /^ operator!=(const complex<_Tp>& __x, const complex<_Tp>& __y)$/;" f namespace:std signature:(const complex<_Tp>& __x, const complex<_Tp>& __y) +std::operator != cpp_src/postypes.h /^ operator!=(const fpos<_StateT>& __lhs, const fpos<_StateT>& __rhs)$/;" f namespace:std signature:(const fpos<_StateT>& __lhs, const fpos<_StateT>& __rhs) +std::operator != cpp_src/stl_deque.h /^ operator!=(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x,$/;" f namespace:std signature:(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) +std::operator != cpp_src/stl_deque.h /^ operator!=(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x,$/;" f namespace:std signature:(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) +std::operator != cpp_src/stl_deque.h /^ operator!=(const deque<_Tp, _Alloc>& __x,$/;" f namespace:std signature:(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) +std::operator != cpp_src/stl_iterator.h /^ operator!=(const reverse_iterator<_Iterator>& __x,$/;" f namespace:std signature:(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) +std::operator != cpp_src/stl_iterator.h /^ operator!=(const reverse_iterator<_IteratorL>& __x,$/;" f namespace:std signature:(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) +std::operator != cpp_src/stl_list.h /^ operator!=(const _List_iterator<_Val>& __x,$/;" f namespace:std signature:(const _List_iterator<_Val>& __x, const _List_const_iterator<_Val>& __y) +std::operator != cpp_src/stl_list.h /^ operator!=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)$/;" f namespace:std signature:(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) +std::operator != cpp_src/stl_map.h /^ operator!=(const map<_Key, _Tp, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const map<_Key, _Tp, _Compare, _Alloc>& __x, const map<_Key, _Tp, _Compare, _Alloc>& __y) +std::operator != cpp_src/stl_multimap.h /^ operator!=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, const multimap<_Key, _Tp, _Compare, _Alloc>& __y) +std::operator != cpp_src/stl_multiset.h /^ operator!=(const multiset<_Key, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const multiset<_Key, _Compare, _Alloc>& __x, const multiset<_Key, _Compare, _Alloc>& __y) +std::operator != cpp_src/stl_pair.h /^ operator!=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)$/;" f namespace:std signature:(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) +std::operator != cpp_src/stl_queue.h /^ operator!=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)$/;" f namespace:std signature:(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) +std::operator != cpp_src/stl_set.h /^ operator!=(const set<_Key, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const set<_Key, _Compare, _Alloc>& __x, const set<_Key, _Compare, _Alloc>& __y) +std::operator != cpp_src/stl_stack.h /^ operator!=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)$/;" f namespace:std signature:(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) +std::operator != cpp_src/stl_tree.h /^ operator!=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) +std::operator != cpp_src/stl_tree.h /^ operator!=(const _Rb_tree_iterator<_Val>& __x,$/;" f namespace:std signature:(const _Rb_tree_iterator<_Val>& __x, const _Rb_tree_const_iterator<_Val>& __y) +std::operator != cpp_src/stl_vector.h /^ operator!=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)$/;" f namespace:std signature:(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) +std::operator != cpp_src/stream_iterator.h /^ operator!=(const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __x,$/;" f namespace:std signature:(const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __x, const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __y) +std::operator != cpp_src/streambuf_iterator.h /^ operator!=(const istreambuf_iterator<_CharT, _Traits>& __a,$/;" f namespace:std signature:(const istreambuf_iterator<_CharT, _Traits>& __a, const istreambuf_iterator<_CharT, _Traits>& __b) +std::operator & cpp_src/bitset /^ operator&(const bitset<_Nb>& __x, const bitset<_Nb>& __y)$/;" f namespace:std signature:(const bitset<_Nb>& __x, const bitset<_Nb>& __y) +std::operator & cpp_src/ios_base.h /^ operator&(_Ios_Fmtflags __a, _Ios_Fmtflags __b)$/;" f namespace:std signature:(_Ios_Fmtflags __a, _Ios_Fmtflags __b) +std::operator & cpp_src/ios_base.h /^ operator&(_Ios_Iostate __a, _Ios_Iostate __b)$/;" f namespace:std signature:(_Ios_Iostate __a, _Ios_Iostate __b) +std::operator & cpp_src/ios_base.h /^ operator&(_Ios_Openmode __a, _Ios_Openmode __b)$/;" f namespace:std signature:(_Ios_Openmode __a, _Ios_Openmode __b) +std::operator &= cpp_src/ios_base.h /^ operator&=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b)$/;" f namespace:std signature:(_Ios_Fmtflags& __a, _Ios_Fmtflags __b) +std::operator &= cpp_src/ios_base.h /^ operator&=(_Ios_Iostate& __a, _Ios_Iostate __b)$/;" f namespace:std signature:(_Ios_Iostate& __a, _Ios_Iostate __b) +std::operator &= cpp_src/ios_base.h /^ operator&=(_Ios_Openmode& __a, _Ios_Openmode __b)$/;" f namespace:std signature:(_Ios_Openmode& __a, _Ios_Openmode __b) +std::operator * cpp_src/complex /^ operator*(const _Tp& __x, const complex<_Tp>& __y)$/;" f namespace:std signature:(const _Tp& __x, const complex<_Tp>& __y) +std::operator * cpp_src/complex /^ operator*(const complex<_Tp>& __x, const _Tp& __y)$/;" f namespace:std signature:(const complex<_Tp>& __x, const _Tp& __y) +std::operator * cpp_src/complex /^ operator*(const complex<_Tp>& __x, const complex<_Tp>& __y)$/;" f namespace:std signature:(const complex<_Tp>& __x, const complex<_Tp>& __y) +std::operator + cpp_src/basic_string.h /^ operator+(_CharT __lhs, const basic_string<_CharT,_Traits,_Alloc>& __rhs);$/;" p namespace:std signature:(_CharT __lhs, const basic_string<_CharT,_Traits,_Alloc>& __rhs) +std::operator + cpp_src/basic_string.h /^ operator+(const _CharT* __lhs,$/;" p namespace:std signature:(const _CharT* __lhs, const basic_string<_CharT,_Traits,_Alloc>& __rhs) +std::operator + cpp_src/basic_string.h /^ operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs, _CharT __rhs)$/;" f namespace:std signature:(const basic_string<_CharT, _Traits, _Alloc>& __lhs, _CharT __rhs) +std::operator + cpp_src/basic_string.h /^ operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs,$/;" f namespace:std signature:(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const _CharT* __rhs) +std::operator + cpp_src/basic_string.h /^ operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs,$/;" f namespace:std signature:(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) +std::operator + cpp_src/basic_string.tcc /^ operator+(_CharT __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs)$/;" f namespace:std signature:(_CharT __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) +std::operator + cpp_src/basic_string.tcc /^ operator+(const _CharT* __lhs,$/;" f namespace:std signature:(const _CharT* __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) +std::operator + cpp_src/complex /^ operator+(const _Tp& __x, const complex<_Tp>& __y)$/;" f namespace:std signature:(const _Tp& __x, const complex<_Tp>& __y) +std::operator + cpp_src/complex /^ operator+(const complex<_Tp>& __x)$/;" f namespace:std signature:(const complex<_Tp>& __x) +std::operator + cpp_src/complex /^ operator+(const complex<_Tp>& __x, const _Tp& __y)$/;" f namespace:std signature:(const complex<_Tp>& __x, const _Tp& __y) +std::operator + cpp_src/complex /^ operator+(const complex<_Tp>& __x, const complex<_Tp>& __y)$/;" f namespace:std signature:(const complex<_Tp>& __x, const complex<_Tp>& __y) +std::operator + cpp_src/stl_bvector.h /^ operator+(ptrdiff_t __n, const _Bit_const_iterator& __x)$/;" f namespace:std signature:(ptrdiff_t __n, const _Bit_const_iterator& __x) +std::operator + cpp_src/stl_bvector.h /^ operator+(ptrdiff_t __n, const _Bit_iterator& __x)$/;" f namespace:std signature:(ptrdiff_t __n, const _Bit_iterator& __x) +std::operator + cpp_src/stl_deque.h /^ operator+(ptrdiff_t __n, const _Deque_iterator<_Tp, _Ref, _Ptr>& __x)$/;" f namespace:std signature:(ptrdiff_t __n, const _Deque_iterator<_Tp, _Ref, _Ptr>& __x) +std::operator + cpp_src/stl_iterator.h /^ operator+(typename reverse_iterator<_Iterator>::difference_type __n,$/;" f namespace:std signature:(typename reverse_iterator<_Iterator>::difference_type __n, const reverse_iterator<_Iterator>& __x) +std::operator - cpp_src/complex /^ operator-(const _Tp& __x, const complex<_Tp>& __y)$/;" f namespace:std signature:(const _Tp& __x, const complex<_Tp>& __y) +std::operator - cpp_src/complex /^ operator-(const complex<_Tp>& __x)$/;" f namespace:std signature:(const complex<_Tp>& __x) +std::operator - cpp_src/complex /^ operator-(const complex<_Tp>& __x, const _Tp& __y)$/;" f namespace:std signature:(const complex<_Tp>& __x, const _Tp& __y) +std::operator - cpp_src/complex /^ operator-(const complex<_Tp>& __x, const complex<_Tp>& __y)$/;" f namespace:std signature:(const complex<_Tp>& __x, const complex<_Tp>& __y) +std::operator - cpp_src/stl_bvector.h /^ operator-(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y)$/;" f namespace:std signature:(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y) +std::operator - cpp_src/stl_deque.h /^ operator-(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x,$/;" f namespace:std signature:(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) +std::operator - cpp_src/stl_deque.h /^ operator-(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x,$/;" f namespace:std signature:(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) +std::operator - cpp_src/stl_iterator.h /^ operator-(const reverse_iterator<_Iterator>& __x,$/;" f namespace:std signature:(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) +std::operator - cpp_src/stl_iterator.h /^ operator-(const reverse_iterator<_IteratorL>& __x,$/;" f namespace:std signature:(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) +std::operator / cpp_src/complex /^ operator\/(const _Tp& __x, const complex<_Tp>& __y)$/;" f namespace:std signature:(const _Tp& __x, const complex<_Tp>& __y) +std::operator / cpp_src/complex /^ operator\/(const complex<_Tp>& __x, const _Tp& __y)$/;" f namespace:std signature:(const complex<_Tp>& __x, const _Tp& __y) +std::operator / cpp_src/complex /^ operator\/(const complex<_Tp>& __x, const complex<_Tp>& __y)$/;" f namespace:std signature:(const complex<_Tp>& __x, const complex<_Tp>& __y) +std::operator < cpp_src/basic_string.h /^ operator<(const _CharT* __lhs,$/;" f namespace:std signature:(const _CharT* __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) +std::operator < cpp_src/basic_string.h /^ operator<(const basic_string<_CharT, _Traits, _Alloc>& __lhs,$/;" f namespace:std signature:(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const _CharT* __rhs) +std::operator < cpp_src/basic_string.h /^ operator<(const basic_string<_CharT, _Traits, _Alloc>& __lhs,$/;" f namespace:std signature:(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) +std::operator < cpp_src/stl_deque.h /^ operator<(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x,$/;" f namespace:std signature:(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) +std::operator < cpp_src/stl_deque.h /^ operator<(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x,$/;" f namespace:std signature:(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) +std::operator < cpp_src/stl_deque.h /^ operator<(const deque<_Tp, _Alloc>& __x,$/;" f namespace:std signature:(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) +std::operator < cpp_src/stl_iterator.h /^ operator<(const reverse_iterator<_Iterator>& __x,$/;" f namespace:std signature:(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) +std::operator < cpp_src/stl_iterator.h /^ operator<(const reverse_iterator<_IteratorL>& __x,$/;" f namespace:std signature:(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) +std::operator < cpp_src/stl_list.h /^ operator<(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)$/;" f namespace:std signature:(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) +std::operator < cpp_src/stl_map.h /^ operator<(const map<_Key, _Tp, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const map<_Key, _Tp, _Compare, _Alloc>& __x, const map<_Key, _Tp, _Compare, _Alloc>& __y) +std::operator < cpp_src/stl_multimap.h /^ operator<(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, const multimap<_Key, _Tp, _Compare, _Alloc>& __y) +std::operator < cpp_src/stl_multiset.h /^ operator<(const multiset<_Key, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const multiset<_Key, _Compare, _Alloc>& __x, const multiset<_Key, _Compare, _Alloc>& __y) +std::operator < cpp_src/stl_pair.h /^ operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)$/;" f namespace:std signature:(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) +std::operator < cpp_src/stl_queue.h /^ operator<(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)$/;" f namespace:std signature:(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) +std::operator < cpp_src/stl_set.h /^ operator<(const set<_Key, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const set<_Key, _Compare, _Alloc>& __x, const set<_Key, _Compare, _Alloc>& __y) +std::operator < cpp_src/stl_stack.h /^ operator<(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)$/;" f namespace:std signature:(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) +std::operator < cpp_src/stl_tree.h /^ operator<(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) +std::operator < cpp_src/stl_vector.h /^ operator<(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)$/;" f namespace:std signature:(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) +std::operator << cpp_src/basic_string.h /^ operator<<(basic_ostream<_CharT, _Traits>& __os,$/;" f namespace:std signature:(basic_ostream<_CharT, _Traits>& __os, const basic_string<_CharT, _Traits, _Alloc>& __str) +std::operator << cpp_src/basic_string.tcc /^ operator<<(basic_ostream&, const string&);$/;" p namespace:std file: signature:(basic_ostream&, const string&) +std::operator << cpp_src/basic_string.tcc /^ operator<<(basic_ostream&, const wstring&);$/;" p namespace:std file: signature:(basic_ostream&, const wstring&) +std::operator << cpp_src/bitset /^ operator<<(std::basic_ostream<_CharT, _Traits>& __os,$/;" f namespace:std signature:(std::basic_ostream<_CharT, _Traits>& __os, const bitset<_Nb>& __x) +std::operator << cpp_src/complex /^ operator<<(basic_ostream<_CharT, _Traits>& __os, const complex<_Tp>& __x)$/;" f namespace:std signature:(basic_ostream<_CharT, _Traits>& __os, const complex<_Tp>& __x) +std::operator << cpp_src/iomanip /^ operator<<(basic_ostream<_CharT,_Traits>& __os, _Resetiosflags __f)$/;" f namespace:std signature:(basic_ostream<_CharT,_Traits>& __os, _Resetiosflags __f) +std::operator << cpp_src/iomanip /^ operator<<(basic_ostream<_CharT,_Traits>& __os, _Setbase __f)$/;" f namespace:std signature:(basic_ostream<_CharT,_Traits>& __os, _Setbase __f) +std::operator << cpp_src/iomanip /^ operator<<(basic_ostream<_CharT,_Traits>& __os, _Setfill<_CharT> __f)$/;" f namespace:std signature:(basic_ostream<_CharT,_Traits>& __os, _Setfill<_CharT> __f) +std::operator << cpp_src/iomanip /^ operator<<(basic_ostream<_CharT,_Traits>& __os, _Setiosflags __f)$/;" f namespace:std signature:(basic_ostream<_CharT,_Traits>& __os, _Setiosflags __f) +std::operator << cpp_src/iomanip /^ operator<<(basic_ostream<_CharT,_Traits>& __os, _Setprecision __f)$/;" f namespace:std signature:(basic_ostream<_CharT,_Traits>& __os, _Setprecision __f) +std::operator << cpp_src/iomanip /^ operator<<(basic_ostream<_CharT,_Traits>& __os, _Setw __f)$/;" f namespace:std signature:(basic_ostream<_CharT,_Traits>& __os, _Setw __f) +std::operator << cpp_src/iomanip /^ extern template ostream& operator<<(ostream&, _Resetiosflags);$/;" p namespace:std file: signature:(ostream&, _Resetiosflags) +std::operator << cpp_src/iomanip /^ extern template ostream& operator<<(ostream&, _Setbase);$/;" p namespace:std file: signature:(ostream&, _Setbase) +std::operator << cpp_src/iomanip /^ extern template ostream& operator<<(ostream&, _Setfill);$/;" p namespace:std file: signature:(ostream&, _Setfill) +std::operator << cpp_src/iomanip /^ extern template ostream& operator<<(ostream&, _Setiosflags);$/;" p namespace:std file: signature:(ostream&, _Setiosflags) +std::operator << cpp_src/iomanip /^ extern template ostream& operator<<(ostream&, _Setprecision);$/;" p namespace:std file: signature:(ostream&, _Setprecision) +std::operator << cpp_src/iomanip /^ extern template ostream& operator<<(ostream&, _Setw);$/;" p namespace:std file: signature:(ostream&, _Setw) +std::operator << cpp_src/iomanip /^ extern template wostream& operator<<(wostream&, _Resetiosflags);$/;" p namespace:std file: signature:(wostream&, _Resetiosflags) +std::operator << cpp_src/iomanip /^ extern template wostream& operator<<(wostream&, _Setbase);$/;" p namespace:std file: signature:(wostream&, _Setbase) +std::operator << cpp_src/iomanip /^ extern template wostream& operator<<(wostream&, _Setfill);$/;" p namespace:std file: signature:(wostream&, _Setfill) +std::operator << cpp_src/iomanip /^ extern template wostream& operator<<(wostream&, _Setiosflags);$/;" p namespace:std file: signature:(wostream&, _Setiosflags) +std::operator << cpp_src/iomanip /^ extern template wostream& operator<<(wostream&, _Setprecision);$/;" p namespace:std file: signature:(wostream&, _Setprecision) +std::operator << cpp_src/iomanip /^ extern template wostream& operator<<(wostream&, _Setw);$/;" p namespace:std file: signature:(wostream&, _Setw) +std::operator << cpp_src/ostream /^ operator<<(basic_ostream<_CharT, _Traits>& __out, _CharT __c)$/;" f namespace:std signature:(basic_ostream<_CharT, _Traits>& __out, _CharT __c) +std::operator << cpp_src/ostream /^ operator<<(basic_ostream<_CharT, _Traits>& __out, char __c)$/;" f namespace:std signature:(basic_ostream<_CharT, _Traits>& __out, char __c) +std::operator << cpp_src/ostream /^ operator<<(basic_ostream<_CharT, _Traits>& __out, const _CharT* __s)$/;" f namespace:std signature:(basic_ostream<_CharT, _Traits>& __out, const _CharT* __s) +std::operator << cpp_src/ostream /^ operator<<(basic_ostream<_CharT, _Traits>& __out, const char* __s);$/;" p namespace:std file: signature:(basic_ostream<_CharT, _Traits>& __out, const char* __s) +std::operator << cpp_src/ostream /^ operator<<(basic_ostream& __out, char __c)$/;" f namespace:std signature:(basic_ostream& __out, char __c) +std::operator << cpp_src/ostream /^ operator<<(basic_ostream& __out, const char* __s)$/;" f namespace:std signature:(basic_ostream& __out, const char* __s) +std::operator << cpp_src/ostream /^ operator<<(basic_ostream& __out, const signed char* __s)$/;" f namespace:std signature:(basic_ostream& __out, const signed char* __s) +std::operator << cpp_src/ostream /^ operator<<(basic_ostream& __out, const unsigned char* __s)$/;" f namespace:std signature:(basic_ostream& __out, const unsigned char* __s) +std::operator << cpp_src/ostream /^ operator<<(basic_ostream& __out, signed char __c)$/;" f namespace:std signature:(basic_ostream& __out, signed char __c) +std::operator << cpp_src/ostream /^ operator<<(basic_ostream& __out, unsigned char __c)$/;" f namespace:std signature:(basic_ostream& __out, unsigned char __c) +std::operator << cpp_src/ostream.tcc /^ operator<<(basic_ostream<_CharT, _Traits>& __out, const char* __s)$/;" f namespace:std signature:(basic_ostream<_CharT, _Traits>& __out, const char* __s) +std::operator << cpp_src/ostream.tcc /^ extern template ostream& operator<<(ostream&, char);$/;" p namespace:std file: signature:(ostream&, char) +std::operator << cpp_src/ostream.tcc /^ extern template ostream& operator<<(ostream&, const char*);$/;" p namespace:std file: signature:(ostream&, const char*) +std::operator << cpp_src/ostream.tcc /^ extern template ostream& operator<<(ostream&, const signed char*);$/;" p namespace:std file: signature:(ostream&, const signed char*) +std::operator << cpp_src/ostream.tcc /^ extern template ostream& operator<<(ostream&, const unsigned char*);$/;" p namespace:std file: signature:(ostream&, const unsigned char*) +std::operator << cpp_src/ostream.tcc /^ extern template ostream& operator<<(ostream&, signed char);$/;" p namespace:std file: signature:(ostream&, signed char) +std::operator << cpp_src/ostream.tcc /^ extern template ostream& operator<<(ostream&, unsigned char);$/;" p namespace:std file: signature:(ostream&, unsigned char) +std::operator << cpp_src/ostream.tcc /^ extern template wostream& operator<<(wostream&, char);$/;" p namespace:std file: signature:(wostream&, char) +std::operator << cpp_src/ostream.tcc /^ extern template wostream& operator<<(wostream&, const char*);$/;" p namespace:std file: signature:(wostream&, const char*) +std::operator << cpp_src/ostream.tcc /^ extern template wostream& operator<<(wostream&, const wchar_t*);$/;" p namespace:std file: signature:(wostream&, const wchar_t*) +std::operator << cpp_src/ostream.tcc /^ extern template wostream& operator<<(wostream&, wchar_t);$/;" p namespace:std file: signature:(wostream&, wchar_t) +std::operator <= cpp_src/basic_string.h /^ operator<=(const _CharT* __lhs,$/;" f namespace:std signature:(const _CharT* __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) +std::operator <= cpp_src/basic_string.h /^ operator<=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,$/;" f namespace:std signature:(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const _CharT* __rhs) +std::operator <= cpp_src/basic_string.h /^ operator<=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,$/;" f namespace:std signature:(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) +std::operator <= cpp_src/stl_deque.h /^ operator<=(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x,$/;" f namespace:std signature:(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) +std::operator <= cpp_src/stl_deque.h /^ operator<=(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x,$/;" f namespace:std signature:(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) +std::operator <= cpp_src/stl_deque.h /^ operator<=(const deque<_Tp, _Alloc>& __x,$/;" f namespace:std signature:(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) +std::operator <= cpp_src/stl_iterator.h /^ operator<=(const reverse_iterator<_Iterator>& __x,$/;" f namespace:std signature:(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) +std::operator <= cpp_src/stl_iterator.h /^ operator<=(const reverse_iterator<_IteratorL>& __x,$/;" f namespace:std signature:(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) +std::operator <= cpp_src/stl_list.h /^ operator<=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)$/;" f namespace:std signature:(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) +std::operator <= cpp_src/stl_map.h /^ operator<=(const map<_Key, _Tp, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const map<_Key, _Tp, _Compare, _Alloc>& __x, const map<_Key, _Tp, _Compare, _Alloc>& __y) +std::operator <= cpp_src/stl_multimap.h /^ operator<=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, const multimap<_Key, _Tp, _Compare, _Alloc>& __y) +std::operator <= cpp_src/stl_multiset.h /^ operator<=(const multiset<_Key, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const multiset<_Key, _Compare, _Alloc>& __x, const multiset<_Key, _Compare, _Alloc>& __y) +std::operator <= cpp_src/stl_pair.h /^ operator<=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)$/;" f namespace:std signature:(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) +std::operator <= cpp_src/stl_queue.h /^ operator<=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)$/;" f namespace:std signature:(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) +std::operator <= cpp_src/stl_set.h /^ operator<=(const set<_Key, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const set<_Key, _Compare, _Alloc>& __x, const set<_Key, _Compare, _Alloc>& __y) +std::operator <= cpp_src/stl_stack.h /^ operator<=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)$/;" f namespace:std signature:(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) +std::operator <= cpp_src/stl_tree.h /^ operator<=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) +std::operator <= cpp_src/stl_vector.h /^ operator<=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)$/;" f namespace:std signature:(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) +std::operator == cpp_src/allocator.h /^ operator==(const allocator<_T1>&, const allocator<_T2>&)$/;" f namespace:std signature:(const allocator<_T1>&, const allocator<_T2>&) +std::operator == cpp_src/allocator.h /^ operator==(const allocator<_Tp>&, const allocator<_Tp>&)$/;" f namespace:std signature:(const allocator<_Tp>&, const allocator<_Tp>&) +std::operator == cpp_src/basic_string.h /^ operator==(const _CharT* __lhs,$/;" f namespace:std signature:(const _CharT* __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) +std::operator == cpp_src/basic_string.h /^ operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs,$/;" f namespace:std signature:(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const _CharT* __rhs) +std::operator == cpp_src/basic_string.h /^ operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs,$/;" f namespace:std signature:(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) +std::operator == cpp_src/complex /^ operator==(const _Tp& __x, const complex<_Tp>& __y)$/;" f namespace:std signature:(const _Tp& __x, const complex<_Tp>& __y) +std::operator == cpp_src/complex /^ operator==(const complex<_Tp>& __x, const _Tp& __y)$/;" f namespace:std signature:(const complex<_Tp>& __x, const _Tp& __y) +std::operator == cpp_src/complex /^ operator==(const complex<_Tp>& __x, const complex<_Tp>& __y)$/;" f namespace:std signature:(const complex<_Tp>& __x, const complex<_Tp>& __y) +std::operator == cpp_src/postypes.h /^ operator==(const fpos<_StateT>& __lhs, const fpos<_StateT>& __rhs)$/;" f namespace:std signature:(const fpos<_StateT>& __lhs, const fpos<_StateT>& __rhs) +std::operator == cpp_src/stl_deque.h /^ operator==(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x,$/;" f namespace:std signature:(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) +std::operator == cpp_src/stl_deque.h /^ operator==(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x,$/;" f namespace:std signature:(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) +std::operator == cpp_src/stl_deque.h /^ operator==(const deque<_Tp, _Alloc>& __x,$/;" f namespace:std signature:(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) +std::operator == cpp_src/stl_iterator.h /^ operator==(const reverse_iterator<_Iterator>& __x,$/;" f namespace:std signature:(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) +std::operator == cpp_src/stl_iterator.h /^ operator==(const reverse_iterator<_IteratorL>& __x,$/;" f namespace:std signature:(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) +std::operator == cpp_src/stl_list.h /^ operator==(const _List_iterator<_Val>& __x,$/;" f namespace:std signature:(const _List_iterator<_Val>& __x, const _List_const_iterator<_Val>& __y) +std::operator == cpp_src/stl_list.h /^ operator==(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)$/;" f namespace:std signature:(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) +std::operator == cpp_src/stl_map.h /^ operator==(const map<_Key, _Tp, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const map<_Key, _Tp, _Compare, _Alloc>& __x, const map<_Key, _Tp, _Compare, _Alloc>& __y) +std::operator == cpp_src/stl_multimap.h /^ operator==(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, const multimap<_Key, _Tp, _Compare, _Alloc>& __y) +std::operator == cpp_src/stl_multiset.h /^ operator==(const multiset<_Key, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const multiset<_Key, _Compare, _Alloc>& __x, const multiset<_Key, _Compare, _Alloc>& __y) +std::operator == cpp_src/stl_pair.h /^ operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)$/;" f namespace:std signature:(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) +std::operator == cpp_src/stl_queue.h /^ operator==(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)$/;" f namespace:std signature:(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) +std::operator == cpp_src/stl_set.h /^ operator==(const set<_Key, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const set<_Key, _Compare, _Alloc>& __x, const set<_Key, _Compare, _Alloc>& __y) +std::operator == cpp_src/stl_stack.h /^ operator==(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)$/;" f namespace:std signature:(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) +std::operator == cpp_src/stl_tree.h /^ operator==(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) +std::operator == cpp_src/stl_tree.h /^ operator==(const _Rb_tree_iterator<_Val>& __x,$/;" f namespace:std signature:(const _Rb_tree_iterator<_Val>& __x, const _Rb_tree_const_iterator<_Val>& __y) +std::operator == cpp_src/stl_vector.h /^ operator==(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)$/;" f namespace:std signature:(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) +std::operator == cpp_src/stream_iterator.h /^ operator==(const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __x,$/;" f namespace:std signature:(const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __x, const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __y) +std::operator == cpp_src/streambuf_iterator.h /^ operator==(const istreambuf_iterator<_CharT, _Traits>& __a,$/;" f namespace:std signature:(const istreambuf_iterator<_CharT, _Traits>& __a, const istreambuf_iterator<_CharT, _Traits>& __b) +std::operator > cpp_src/basic_string.h /^ operator>(const _CharT* __lhs,$/;" f namespace:std signature:(const _CharT* __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) +std::operator > cpp_src/basic_string.h /^ operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs,$/;" f namespace:std signature:(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const _CharT* __rhs) +std::operator > cpp_src/basic_string.h /^ operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs,$/;" f namespace:std signature:(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) +std::operator > cpp_src/stl_deque.h /^ operator>(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x,$/;" f namespace:std signature:(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) +std::operator > cpp_src/stl_deque.h /^ operator>(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x,$/;" f namespace:std signature:(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) +std::operator > cpp_src/stl_deque.h /^ operator>(const deque<_Tp, _Alloc>& __x,$/;" f namespace:std signature:(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) +std::operator > cpp_src/stl_iterator.h /^ operator>(const reverse_iterator<_Iterator>& __x,$/;" f namespace:std signature:(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) +std::operator > cpp_src/stl_iterator.h /^ operator>(const reverse_iterator<_IteratorL>& __x,$/;" f namespace:std signature:(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) +std::operator > cpp_src/stl_list.h /^ operator>(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)$/;" f namespace:std signature:(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) +std::operator > cpp_src/stl_map.h /^ operator>(const map<_Key, _Tp, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const map<_Key, _Tp, _Compare, _Alloc>& __x, const map<_Key, _Tp, _Compare, _Alloc>& __y) +std::operator > cpp_src/stl_multimap.h /^ operator>(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, const multimap<_Key, _Tp, _Compare, _Alloc>& __y) +std::operator > cpp_src/stl_multiset.h /^ operator>(const multiset<_Key,_Compare,_Alloc>& __x,$/;" f namespace:std signature:(const multiset<_Key,_Compare,_Alloc>& __x, const multiset<_Key,_Compare,_Alloc>& __y) +std::operator > cpp_src/stl_pair.h /^ operator>(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)$/;" f namespace:std signature:(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) +std::operator > cpp_src/stl_queue.h /^ operator>(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)$/;" f namespace:std signature:(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) +std::operator > cpp_src/stl_set.h /^ operator>(const set<_Key, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const set<_Key, _Compare, _Alloc>& __x, const set<_Key, _Compare, _Alloc>& __y) +std::operator > cpp_src/stl_stack.h /^ operator>(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)$/;" f namespace:std signature:(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) +std::operator > cpp_src/stl_tree.h /^ operator>(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) +std::operator > cpp_src/stl_vector.h /^ operator>(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)$/;" f namespace:std signature:(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) +std::operator >= cpp_src/basic_string.h /^ operator>=(const _CharT* __lhs,$/;" f namespace:std signature:(const _CharT* __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) +std::operator >= cpp_src/basic_string.h /^ operator>=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,$/;" f namespace:std signature:(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const _CharT* __rhs) +std::operator >= cpp_src/basic_string.h /^ operator>=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,$/;" f namespace:std signature:(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) +std::operator >= cpp_src/stl_deque.h /^ operator>=(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x,$/;" f namespace:std signature:(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) +std::operator >= cpp_src/stl_deque.h /^ operator>=(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x,$/;" f namespace:std signature:(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) +std::operator >= cpp_src/stl_deque.h /^ operator>=(const deque<_Tp, _Alloc>& __x,$/;" f namespace:std signature:(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) +std::operator >= cpp_src/stl_iterator.h /^ operator>=(const reverse_iterator<_Iterator>& __x,$/;" f namespace:std signature:(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) +std::operator >= cpp_src/stl_iterator.h /^ operator>=(const reverse_iterator<_IteratorL>& __x,$/;" f namespace:std signature:(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) +std::operator >= cpp_src/stl_list.h /^ operator>=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)$/;" f namespace:std signature:(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) +std::operator >= cpp_src/stl_map.h /^ operator>=(const map<_Key, _Tp, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const map<_Key, _Tp, _Compare, _Alloc>& __x, const map<_Key, _Tp, _Compare, _Alloc>& __y) +std::operator >= cpp_src/stl_multimap.h /^ operator>=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, const multimap<_Key, _Tp, _Compare, _Alloc>& __y) +std::operator >= cpp_src/stl_multiset.h /^ operator>=(const multiset<_Key, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const multiset<_Key, _Compare, _Alloc>& __x, const multiset<_Key, _Compare, _Alloc>& __y) +std::operator >= cpp_src/stl_pair.h /^ operator>=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)$/;" f namespace:std signature:(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) +std::operator >= cpp_src/stl_queue.h /^ operator>=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)$/;" f namespace:std signature:(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) +std::operator >= cpp_src/stl_set.h /^ operator>=(const set<_Key, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const set<_Key, _Compare, _Alloc>& __x, const set<_Key, _Compare, _Alloc>& __y) +std::operator >= cpp_src/stl_stack.h /^ operator>=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)$/;" f namespace:std signature:(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) +std::operator >= cpp_src/stl_tree.h /^ operator>=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) +std::operator >= cpp_src/stl_vector.h /^ operator>=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)$/;" f namespace:std signature:(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) +std::operator >> cpp_src/basic_string.h /^ operator>>(basic_istream<_CharT, _Traits>& __is,$/;" p namespace:std signature:(basic_istream<_CharT, _Traits>& __is, basic_string<_CharT, _Traits, _Alloc>& __str) +std::operator >> cpp_src/basic_string.h /^ operator>>(basic_istream& __is, basic_string& __str);$/;" p namespace:std signature:(basic_istream& __is, basic_string& __str) +std::operator >> cpp_src/basic_string.tcc /^ operator>>(basic_istream&, string&);$/;" p namespace:std file: signature:(basic_istream&, string&) +std::operator >> cpp_src/basic_string.tcc /^ operator>>(basic_istream&, wstring&);$/;" p namespace:std file: signature:(basic_istream&, wstring&) +std::operator >> cpp_src/bitset /^ operator>>(std::basic_istream<_CharT, _Traits>& __is, bitset<_Nb>& __x)$/;" f namespace:std signature:(std::basic_istream<_CharT, _Traits>& __is, bitset<_Nb>& __x) +std::operator >> cpp_src/complex /^ operator>>(basic_istream<_CharT, _Traits>& __is, complex<_Tp>& __x)$/;" f namespace:std signature:(basic_istream<_CharT, _Traits>& __is, complex<_Tp>& __x) +std::operator >> cpp_src/iomanip /^ operator>>(basic_istream<_CharT,_Traits>& __is, _Resetiosflags __f)$/;" f namespace:std signature:(basic_istream<_CharT,_Traits>& __is, _Resetiosflags __f) +std::operator >> cpp_src/iomanip /^ operator>>(basic_istream<_CharT,_Traits>& __is, _Setbase __f)$/;" f namespace:std signature:(basic_istream<_CharT,_Traits>& __is, _Setbase __f) +std::operator >> cpp_src/iomanip /^ operator>>(basic_istream<_CharT,_Traits>& __is, _Setfill<_CharT> __f)$/;" f namespace:std signature:(basic_istream<_CharT,_Traits>& __is, _Setfill<_CharT> __f) +std::operator >> cpp_src/iomanip /^ operator>>(basic_istream<_CharT,_Traits>& __is, _Setiosflags __f)$/;" f namespace:std signature:(basic_istream<_CharT,_Traits>& __is, _Setiosflags __f) +std::operator >> cpp_src/iomanip /^ operator>>(basic_istream<_CharT,_Traits>& __is, _Setprecision __f)$/;" f namespace:std signature:(basic_istream<_CharT,_Traits>& __is, _Setprecision __f) +std::operator >> cpp_src/iomanip /^ operator>>(basic_istream<_CharT,_Traits>& __is, _Setw __f)$/;" f namespace:std signature:(basic_istream<_CharT,_Traits>& __is, _Setw __f) +std::operator >> cpp_src/iomanip /^ extern template istream& operator>>(istream&, _Resetiosflags);$/;" p namespace:std file: signature:(istream&, _Resetiosflags) +std::operator >> cpp_src/iomanip /^ extern template istream& operator>>(istream&, _Setbase);$/;" p namespace:std file: signature:(istream&, _Setbase) +std::operator >> cpp_src/iomanip /^ extern template istream& operator>>(istream&, _Setfill);$/;" p namespace:std file: signature:(istream&, _Setfill) +std::operator >> cpp_src/iomanip /^ extern template istream& operator>>(istream&, _Setiosflags);$/;" p namespace:std file: signature:(istream&, _Setiosflags) +std::operator >> cpp_src/iomanip /^ extern template istream& operator>>(istream&, _Setprecision);$/;" p namespace:std file: signature:(istream&, _Setprecision) +std::operator >> cpp_src/iomanip /^ extern template istream& operator>>(istream&, _Setw);$/;" p namespace:std file: signature:(istream&, _Setw) +std::operator >> cpp_src/iomanip /^ extern template wistream& operator>>(wistream&, _Resetiosflags);$/;" p namespace:std file: signature:(wistream&, _Resetiosflags) +std::operator >> cpp_src/iomanip /^ extern template wistream& operator>>(wistream&, _Setbase);$/;" p namespace:std file: signature:(wistream&, _Setbase) +std::operator >> cpp_src/iomanip /^ extern template wistream& operator>>(wistream&, _Setfill);$/;" p namespace:std file: signature:(wistream&, _Setfill) +std::operator >> cpp_src/iomanip /^ extern template wistream& operator>>(wistream&, _Setiosflags);$/;" p namespace:std file: signature:(wistream&, _Setiosflags) +std::operator >> cpp_src/iomanip /^ extern template wistream& operator>>(wistream&, _Setprecision);$/;" p namespace:std file: signature:(wistream&, _Setprecision) +std::operator >> cpp_src/iomanip /^ extern template wistream& operator>>(wistream&, _Setw);$/;" p namespace:std file: signature:(wistream&, _Setw) +std::operator >> cpp_src/istream /^ operator>>(basic_istream<_CharT, _Traits>& __in, _CharT& __c);$/;" p namespace:std file: signature:(basic_istream<_CharT, _Traits>& __in, _CharT& __c) +std::operator >> cpp_src/istream /^ operator>>(basic_istream<_CharT, _Traits>& __in, _CharT* __s);$/;" p namespace:std file: signature:(basic_istream<_CharT, _Traits>& __in, _CharT* __s) +std::operator >> cpp_src/istream /^ operator>>(basic_istream& __in, signed char& __c)$/;" f namespace:std signature:(basic_istream& __in, signed char& __c) +std::operator >> cpp_src/istream /^ operator>>(basic_istream& __in, signed char* __s)$/;" f namespace:std signature:(basic_istream& __in, signed char* __s) +std::operator >> cpp_src/istream /^ operator>>(basic_istream& __in, unsigned char& __c)$/;" f namespace:std signature:(basic_istream& __in, unsigned char& __c) +std::operator >> cpp_src/istream /^ operator>>(basic_istream& __in, unsigned char* __s)$/;" f namespace:std signature:(basic_istream& __in, unsigned char* __s) +std::operator >> cpp_src/istream /^ operator>>(basic_istream& __in, char* __s);$/;" p namespace:std file: signature:(basic_istream& __in, char* __s) +std::operator >> cpp_src/istream.tcc /^ operator>>(basic_istream<_CharT, _Traits>& __in, _CharT& __c)$/;" f namespace:std signature:(basic_istream<_CharT, _Traits>& __in, _CharT& __c) +std::operator >> cpp_src/istream.tcc /^ operator>>(basic_istream<_CharT, _Traits>& __in, _CharT* __s)$/;" f namespace:std signature:(basic_istream<_CharT, _Traits>& __in, _CharT* __s) +std::operator >> cpp_src/istream.tcc /^ operator>>(basic_istream<_CharT, _Traits>& __in,$/;" f namespace:std signature:(basic_istream<_CharT, _Traits>& __in, basic_string<_CharT, _Traits, _Alloc>& __str) +std::operator >> cpp_src/istream.tcc /^ extern template istream& operator>>(istream&, char&);$/;" p namespace:std file: signature:(istream&, char&) +std::operator >> cpp_src/istream.tcc /^ extern template istream& operator>>(istream&, char*);$/;" p namespace:std file: signature:(istream&, char*) +std::operator >> cpp_src/istream.tcc /^ extern template istream& operator>>(istream&, signed char&);$/;" p namespace:std file: signature:(istream&, signed char&) +std::operator >> cpp_src/istream.tcc /^ extern template istream& operator>>(istream&, signed char*);$/;" p namespace:std file: signature:(istream&, signed char*) +std::operator >> cpp_src/istream.tcc /^ extern template istream& operator>>(istream&, unsigned char&);$/;" p namespace:std file: signature:(istream&, unsigned char&) +std::operator >> cpp_src/istream.tcc /^ extern template istream& operator>>(istream&, unsigned char*);$/;" p namespace:std file: signature:(istream&, unsigned char*) +std::operator >> cpp_src/istream.tcc /^ extern template wistream& operator>>(wistream&, wchar_t&);$/;" p namespace:std file: signature:(wistream&, wchar_t&) +std::operator >> cpp_src/istream.tcc /^ extern template wistream& operator>>(wistream&, wchar_t*);$/;" p namespace:std file: signature:(wistream&, wchar_t*) +std::operator ^ cpp_src/bitset /^ operator^(const bitset<_Nb>& __x, const bitset<_Nb>& __y)$/;" f namespace:std signature:(const bitset<_Nb>& __x, const bitset<_Nb>& __y) +std::operator ^ cpp_src/ios_base.h /^ operator^(_Ios_Fmtflags __a, _Ios_Fmtflags __b)$/;" f namespace:std signature:(_Ios_Fmtflags __a, _Ios_Fmtflags __b) +std::operator ^ cpp_src/ios_base.h /^ operator^(_Ios_Iostate __a, _Ios_Iostate __b)$/;" f namespace:std signature:(_Ios_Iostate __a, _Ios_Iostate __b) +std::operator ^ cpp_src/ios_base.h /^ operator^(_Ios_Openmode __a, _Ios_Openmode __b)$/;" f namespace:std signature:(_Ios_Openmode __a, _Ios_Openmode __b) +std::operator ^= cpp_src/ios_base.h /^ operator^=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b)$/;" f namespace:std signature:(_Ios_Fmtflags& __a, _Ios_Fmtflags __b) +std::operator ^= cpp_src/ios_base.h /^ operator^=(_Ios_Iostate& __a, _Ios_Iostate __b)$/;" f namespace:std signature:(_Ios_Iostate& __a, _Ios_Iostate __b) +std::operator ^= cpp_src/ios_base.h /^ operator^=(_Ios_Openmode& __a, _Ios_Openmode __b)$/;" f namespace:std signature:(_Ios_Openmode& __a, _Ios_Openmode __b) +std::operator | cpp_src/bitset /^ operator|(const bitset<_Nb>& __x, const bitset<_Nb>& __y)$/;" f namespace:std signature:(const bitset<_Nb>& __x, const bitset<_Nb>& __y) +std::operator | cpp_src/ios_base.h /^ operator|(_Ios_Fmtflags __a, _Ios_Fmtflags __b)$/;" f namespace:std signature:(_Ios_Fmtflags __a, _Ios_Fmtflags __b) +std::operator | cpp_src/ios_base.h /^ operator|(_Ios_Iostate __a, _Ios_Iostate __b)$/;" f namespace:std signature:(_Ios_Iostate __a, _Ios_Iostate __b) +std::operator | cpp_src/ios_base.h /^ operator|(_Ios_Openmode __a, _Ios_Openmode __b)$/;" f namespace:std signature:(_Ios_Openmode __a, _Ios_Openmode __b) +std::operator |= cpp_src/ios_base.h /^ operator|=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b)$/;" f namespace:std signature:(_Ios_Fmtflags& __a, _Ios_Fmtflags __b) +std::operator |= cpp_src/ios_base.h /^ operator|=(_Ios_Iostate& __a, _Ios_Iostate __b)$/;" f namespace:std signature:(_Ios_Iostate& __a, _Ios_Iostate __b) +std::operator |= cpp_src/ios_base.h /^ operator|=(_Ios_Openmode& __a, _Ios_Openmode __b)$/;" f namespace:std signature:(_Ios_Openmode& __a, _Ios_Openmode __b) +std::operator ~ cpp_src/ios_base.h /^ operator~(_Ios_Fmtflags __a)$/;" f namespace:std signature:(_Ios_Fmtflags __a) +std::operator ~ cpp_src/ios_base.h /^ operator~(_Ios_Iostate __a)$/;" f namespace:std signature:(_Ios_Iostate __a) +std::operator ~ cpp_src/ios_base.h /^ operator~(_Ios_Openmode __a)$/;" f namespace:std signature:(_Ios_Openmode __a) +std::ostream cpp_src/iosfwd /^ typedef basic_ostream ostream; \/\/\/< @isiosfwd$/;" t namespace:std file: +std::ostream::_M_insert cpp_src/ostream.tcc /^ extern template ostream& ostream::_M_insert(bool);$/;" p class:std::ostream file: signature:(bool) +std::ostream::_M_insert cpp_src/ostream.tcc /^ extern template ostream& ostream::_M_insert(const void*);$/;" p class:std::ostream file: signature:(const void*) +std::ostream::_M_insert cpp_src/ostream.tcc /^ extern template ostream& ostream::_M_insert(double);$/;" p class:std::ostream file: signature:(double) +std::ostream::_M_insert cpp_src/ostream.tcc /^ extern template ostream& ostream::_M_insert(long double);$/;" p class:std::ostream file: signature:(long double) +std::ostream::_M_insert cpp_src/ostream.tcc /^ extern template ostream& ostream::_M_insert(long long);$/;" p class:std::ostream file: signature:(long long) +std::ostream::_M_insert cpp_src/ostream.tcc /^ extern template ostream& ostream::_M_insert(long);$/;" p class:std::ostream file: signature:(long) +std::ostream::_M_insert cpp_src/ostream.tcc /^ extern template ostream& ostream::_M_insert(unsigned long long);$/;" p class:std::ostream file: signature:(unsigned long long) +std::ostream::_M_insert cpp_src/ostream.tcc /^ extern template ostream& ostream::_M_insert(unsigned long);$/;" p class:std::ostream file: signature:(unsigned long) +std::ostream_iterator cpp_src/stream_iterator.h /^ class ostream_iterator$/;" c namespace:std inherits:iterator +std::ostream_iterator::_M_stream cpp_src/stream_iterator.h /^ ostream_type* _M_stream;$/;" m class:std::ostream_iterator access:private +std::ostream_iterator::_M_string cpp_src/stream_iterator.h /^ const _CharT* _M_string;$/;" m class:std::ostream_iterator access:private +std::ostream_iterator::char_type cpp_src/stream_iterator.h /^ typedef _CharT char_type;$/;" t class:std::ostream_iterator access:public +std::ostream_iterator::operator * cpp_src/stream_iterator.h /^ operator*()$/;" f class:std::ostream_iterator access:public signature:() +std::ostream_iterator::operator ++ cpp_src/stream_iterator.h /^ operator++()$/;" f class:std::ostream_iterator access:public signature:() +std::ostream_iterator::operator ++ cpp_src/stream_iterator.h /^ operator++(int)$/;" f class:std::ostream_iterator access:public signature:(int) +std::ostream_iterator::operator = cpp_src/stream_iterator.h /^ operator=(const _Tp& __value)$/;" f class:std::ostream_iterator access:public signature:(const _Tp& __value) +std::ostream_iterator::ostream_iterator cpp_src/stream_iterator.h /^ ostream_iterator(const ostream_iterator& __obj)$/;" f class:std::ostream_iterator access:public signature:(const ostream_iterator& __obj) +std::ostream_iterator::ostream_iterator cpp_src/stream_iterator.h /^ ostream_iterator(ostream_type& __s) : _M_stream(&__s), _M_string(0) {}$/;" f class:std::ostream_iterator access:public signature:(ostream_type& __s) +std::ostream_iterator::ostream_iterator cpp_src/stream_iterator.h /^ ostream_iterator(ostream_type& __s, const _CharT* __c)$/;" f class:std::ostream_iterator access:public signature:(ostream_type& __s, const _CharT* __c) +std::ostream_iterator::ostream_type cpp_src/stream_iterator.h /^ typedef basic_ostream<_CharT, _Traits> ostream_type;$/;" t class:std::ostream_iterator access:public +std::ostream_iterator::traits_type cpp_src/stream_iterator.h /^ typedef _Traits traits_type;$/;" t class:std::ostream_iterator access:public +std::ostreambuf_iterator cpp_src/streambuf_iterator.h /^ class ostreambuf_iterator$/;" c namespace:std inherits:iterator +std::ostreambuf_iterator::_M_failed cpp_src/streambuf_iterator.h /^ bool _M_failed;$/;" m class:std::ostreambuf_iterator access:private +std::ostreambuf_iterator::_M_put cpp_src/streambuf_iterator.h /^ _M_put(const _CharT* __ws, streamsize __len)$/;" f class:std::ostreambuf_iterator access:public signature:(const _CharT* __ws, streamsize __len) +std::ostreambuf_iterator::_M_sbuf cpp_src/streambuf_iterator.h /^ streambuf_type* _M_sbuf;$/;" m class:std::ostreambuf_iterator access:private +std::ostreambuf_iterator::char_type cpp_src/streambuf_iterator.h /^ typedef _CharT char_type;$/;" t class:std::ostreambuf_iterator access:public +std::ostreambuf_iterator::copy cpp_src/streambuf_iterator.h /^ copy(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>,$/;" p class:std::ostreambuf_iterator access:friend signature:(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, ostreambuf_iterator<_CharT2>) +std::ostreambuf_iterator::failed cpp_src/streambuf_iterator.h /^ failed() const throw()$/;" f class:std::ostreambuf_iterator access:public signature:() const +std::ostreambuf_iterator::operator * cpp_src/streambuf_iterator.h /^ operator*()$/;" f class:std::ostreambuf_iterator access:public signature:() +std::ostreambuf_iterator::operator ++ cpp_src/streambuf_iterator.h /^ operator++()$/;" f class:std::ostreambuf_iterator access:public signature:() +std::ostreambuf_iterator::operator ++ cpp_src/streambuf_iterator.h /^ operator++(int)$/;" f class:std::ostreambuf_iterator access:public signature:(int) +std::ostreambuf_iterator::operator = cpp_src/streambuf_iterator.h /^ operator=(_CharT __c)$/;" f class:std::ostreambuf_iterator access:public signature:(_CharT __c) +std::ostreambuf_iterator::ostream_type cpp_src/streambuf_iterator.h /^ typedef basic_ostream<_CharT, _Traits> ostream_type;$/;" t class:std::ostreambuf_iterator access:public +std::ostreambuf_iterator::ostreambuf_iterator cpp_src/streambuf_iterator.h /^ ostreambuf_iterator(ostream_type& __s) throw ()$/;" f class:std::ostreambuf_iterator access:public signature:(ostream_type& __s) +std::ostreambuf_iterator::ostreambuf_iterator cpp_src/streambuf_iterator.h /^ ostreambuf_iterator(streambuf_type* __s) throw ()$/;" f class:std::ostreambuf_iterator access:public signature:(streambuf_type* __s) +std::ostreambuf_iterator::streambuf_type cpp_src/streambuf_iterator.h /^ typedef basic_streambuf<_CharT, _Traits> streambuf_type;$/;" t class:std::ostreambuf_iterator access:public +std::ostreambuf_iterator::traits_type cpp_src/streambuf_iterator.h /^ typedef _Traits traits_type;$/;" t class:std::ostreambuf_iterator access:public +std::ostringstream cpp_src/iosfwd /^ typedef basic_ostringstream ostringstream; \/\/\/< @isiosfwd$/;" t namespace:std file: +std::out_of_range cpp_src/stdexcept /^ class out_of_range : public logic_error $/;" c namespace:std file: inherits:logic_error +std::out_of_range::out_of_range cpp_src/stdexcept /^ explicit out_of_range(const string& __arg);$/;" p class:std::out_of_range file: access:public signature:(const string& __arg) +std::output_iterator_tag cpp_src/stl_iterator_base_types.h /^ struct output_iterator_tag {};$/;" s namespace:std +std::overflow_error cpp_src/stdexcept /^ class overflow_error : public runtime_error $/;" c namespace:std file: inherits:runtime_error +std::overflow_error::overflow_error cpp_src/stdexcept /^ explicit overflow_error(const string& __arg);$/;" p class:std::overflow_error file: access:public signature:(const string& __arg) +std::pair cpp_src/stl_pair.h /^ struct pair$/;" s namespace:std +std::pair::first cpp_src/stl_pair.h /^ _T1 first; \/\/\/< @c first is a copy of the first object$/;" m struct:std::pair access:public +std::pair::first_type cpp_src/stl_pair.h /^ typedef _T1 first_type; \/\/\/< @c first_type is the first bound type$/;" t struct:std::pair access:public +std::pair::pair cpp_src/stl_pair.h /^ pair(const pair<_U1, _U2>& __p)$/;" f struct:std::pair access:public signature:(const pair<_U1, _U2>& __p) +std::pair::pair cpp_src/stl_pair.h /^ pair()$/;" f struct:std::pair access:public signature:() +std::pair::pair cpp_src/stl_pair.h /^ pair(const _T1& __a, const _T2& __b)$/;" f struct:std::pair access:public signature:(const _T1& __a, const _T2& __b) +std::pair::second cpp_src/stl_pair.h /^ _T2 second; \/\/\/< @c second is a copy of the second object$/;" m struct:std::pair access:public +std::pair::second_type cpp_src/stl_pair.h /^ typedef _T2 second_type; \/\/\/< @c second_type is the second bound type$/;" t struct:std::pair access:public +std::partial_sort cpp_src/stl_algo.h /^ partial_sort(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) +std::partial_sort cpp_src/stl_algo.h /^ partial_sort(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, _Compare __comp) +std::partial_sort_copy cpp_src/stl_algo.h /^ partial_sort_copy(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) +std::partial_sort_copy cpp_src/stl_algo.h /^ partial_sort_copy(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) +std::partial_sum cpp_src/stl_numeric.h /^ partial_sum(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _OutputIterator __result) +std::partial_sum cpp_src/stl_numeric.h /^ partial_sum(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryOperation __binary_op) +std::partition cpp_src/stl_algo.h /^ partition(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) +std::plus cpp_src/stl_function.h /^ struct plus : public binary_function<_Tp, _Tp, _Tp>$/;" s namespace:std inherits:binary_function +std::plus::operator () cpp_src/stl_function.h /^ operator()(const _Tp& __x, const _Tp& __y) const$/;" f struct:std::plus access:public signature:(const _Tp& __x, const _Tp& __y) const +std::pointer_to_binary_function cpp_src/stl_function.h /^ class pointer_to_binary_function$/;" c namespace:std inherits:binary_function +std::pointer_to_binary_function::_M_ptr cpp_src/stl_function.h /^ _Result (*_M_ptr)(_Arg1, _Arg2);$/;" m class:std::pointer_to_binary_function access:protected +std::pointer_to_binary_function::operator () cpp_src/stl_function.h /^ operator()(_Arg1 __x, _Arg2 __y) const$/;" f class:std::pointer_to_binary_function access:public signature:(_Arg1 __x, _Arg2 __y) const +std::pointer_to_binary_function::pointer_to_binary_function cpp_src/stl_function.h /^ pointer_to_binary_function() {}$/;" f class:std::pointer_to_binary_function access:public signature:() +std::pointer_to_binary_function::pointer_to_binary_function cpp_src/stl_function.h /^ pointer_to_binary_function(_Result (*__x)(_Arg1, _Arg2))$/;" f class:std::pointer_to_binary_function access:public signature:(_Result (__x)_Arg1, _Arg2)) +std::pointer_to_unary_function cpp_src/stl_function.h /^ class pointer_to_unary_function : public unary_function<_Arg, _Result>$/;" c namespace:std inherits:unary_function +std::pointer_to_unary_function::_M_ptr cpp_src/stl_function.h /^ _Result (*_M_ptr)(_Arg);$/;" m class:std::pointer_to_unary_function access:protected +std::pointer_to_unary_function::operator () cpp_src/stl_function.h /^ operator()(_Arg __x) const$/;" f class:std::pointer_to_unary_function access:public signature:(_Arg __x) const +std::pointer_to_unary_function::pointer_to_unary_function cpp_src/stl_function.h /^ pointer_to_unary_function() {}$/;" f class:std::pointer_to_unary_function access:public signature:() +std::pointer_to_unary_function::pointer_to_unary_function cpp_src/stl_function.h /^ pointer_to_unary_function(_Result (*__x)(_Arg))$/;" f class:std::pointer_to_unary_function access:public signature:(_Result (__x)_Arg)) +std::polar cpp_src/complex /^ polar(const _Tp& __rho, const _Tp& __theta)$/;" f namespace:std signature:(const _Tp& __rho, const _Tp& __theta) +std::polar cpp_src/complex /^ template complex<_Tp> polar(const _Tp&, const _Tp& = 0);$/;" p namespace:std file: signature:(const _Tp&, const _Tp& = 0) +std::pop_heap cpp_src/stl_heap.h /^ pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last) +std::pop_heap cpp_src/stl_heap.h /^ pop_heap(_RandomAccessIterator __first,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) +std::pow cpp_src/cmath /^ pow(double __x, int __i)$/;" f namespace:std signature:(double __x, int __i) +std::pow cpp_src/cmath /^ pow(float __x, float __y)$/;" f namespace:std signature:(float __x, float __y) +std::pow cpp_src/cmath /^ pow(float __x, int __n)$/;" f namespace:std signature:(float __x, int __n) +std::pow cpp_src/cmath /^ pow(long double __x, int __n)$/;" f namespace:std signature:(long double __x, int __n) +std::pow cpp_src/cmath /^ pow(long double __x, long double __y)$/;" f namespace:std signature:(long double __x, long double __y) +std::pow cpp_src/complex /^ pow(const _Tp& __x, const complex<_Tp>& __y)$/;" f namespace:std signature:(const _Tp& __x, const complex<_Tp>& __y) +std::pow cpp_src/complex /^ pow(const complex<_Tp>& __x, const _Tp& __y)$/;" f namespace:std signature:(const complex<_Tp>& __x, const _Tp& __y) +std::pow cpp_src/complex /^ pow(const complex<_Tp>& __x, const complex<_Tp>& __y)$/;" f namespace:std signature:(const complex<_Tp>& __x, const complex<_Tp>& __y) +std::pow cpp_src/complex /^ pow(const complex<_Tp>& __z, int __n)$/;" f namespace:std signature:(const complex<_Tp>& __z, int __n) +std::pow cpp_src/complex /^ template complex<_Tp> pow(const _Tp&, const complex<_Tp>&);$/;" p namespace:std file: signature:(const _Tp&, const complex<_Tp>&) +std::pow cpp_src/complex /^ template complex<_Tp> pow(const complex<_Tp>&, $/;" p namespace:std file: signature:(const complex<_Tp>&, const complex<_Tp>&) +std::pow cpp_src/complex /^ template complex<_Tp> pow(const complex<_Tp>&, const _Tp&);$/;" p namespace:std file: signature:(const complex<_Tp>&, const _Tp&) +std::pow cpp_src/complex /^ template complex<_Tp> pow(const complex<_Tp>&, int);$/;" p namespace:std file: signature:(const complex<_Tp>&, int) +std::prev_permutation cpp_src/stl_algo.h /^ prev_permutation(_BidirectionalIterator __first,$/;" f namespace:std signature:(_BidirectionalIterator __first, _BidirectionalIterator __last) +std::prev_permutation cpp_src/stl_algo.h /^ prev_permutation(_BidirectionalIterator __first,$/;" f namespace:std signature:(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) +std::priority_queue cpp_src/stl_queue.h /^ class priority_queue$/;" c namespace:std +std::priority_queue::_Sequence_value_type cpp_src/stl_queue.h /^ typedef typename _Sequence::value_type _Sequence_value_type;$/;" t class:std::priority_queue access:private +std::priority_queue::c cpp_src/stl_queue.h /^ _Sequence c;$/;" m class:std::priority_queue access:protected +std::priority_queue::comp cpp_src/stl_queue.h /^ _Compare comp;$/;" m class:std::priority_queue access:protected +std::priority_queue::const_reference cpp_src/stl_queue.h /^ typedef typename _Sequence::const_reference const_reference;$/;" t class:std::priority_queue access:public +std::priority_queue::container_type cpp_src/stl_queue.h /^ typedef _Sequence container_type;$/;" t class:std::priority_queue access:public +std::priority_queue::empty cpp_src/stl_queue.h /^ empty() const$/;" f class:std::priority_queue access:public signature:() const +std::priority_queue::pop cpp_src/stl_queue.h /^ pop()$/;" f class:std::priority_queue access:public signature:() +std::priority_queue::priority_queue cpp_src/stl_queue.h /^ priority_queue(_InputIterator __first, _InputIterator __last,$/;" f class:std::priority_queue access:public signature:(_InputIterator __first, _InputIterator __last, const _Compare& __x = _Compare(), const _Sequence& __s = _Sequence()) +std::priority_queue::priority_queue cpp_src/stl_queue.h /^ priority_queue(const _Compare& __x = _Compare(),$/;" f class:std::priority_queue access:public signature:(const _Compare& __x = _Compare(), const _Sequence& __s = _Sequence()) +std::priority_queue::push cpp_src/stl_queue.h /^ push(const value_type& __x)$/;" f class:std::priority_queue access:public signature:(const value_type& __x) +std::priority_queue::reference cpp_src/stl_queue.h /^ typedef typename _Sequence::reference reference;$/;" t class:std::priority_queue access:public +std::priority_queue::size cpp_src/stl_queue.h /^ size() const$/;" f class:std::priority_queue access:public signature:() const +std::priority_queue::size_type cpp_src/stl_queue.h /^ typedef typename _Sequence::size_type size_type;$/;" t class:std::priority_queue access:public +std::priority_queue::top cpp_src/stl_queue.h /^ top() const$/;" f class:std::priority_queue access:public signature:() const +std::priority_queue::value_type cpp_src/stl_queue.h /^ typedef typename _Sequence::value_type value_type;$/;" t class:std::priority_queue access:public +std::ptr_fun cpp_src/stl_function.h /^ ptr_fun(_Result (*__x)(_Arg))$/;" f namespace:std signature:(_Result (__x)_Arg)) +std::ptr_fun cpp_src/stl_function.h /^ ptr_fun(_Result (*__x)(_Arg1, _Arg2))$/;" f namespace:std signature:(_Result (__x)_Arg1, _Arg2)) +std::push_heap cpp_src/stl_heap.h /^ push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last) +std::push_heap cpp_src/stl_heap.h /^ push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) +std::queue cpp_src/stl_queue.h /^ class queue$/;" c namespace:std +std::queue::_Sequence_value_type cpp_src/stl_queue.h /^ typedef typename _Sequence::value_type _Sequence_value_type;$/;" t class:std::queue access:private +std::queue::back cpp_src/stl_queue.h /^ back() const$/;" f class:std::queue access:public signature:() const +std::queue::back cpp_src/stl_queue.h /^ back()$/;" f class:std::queue access:public signature:() +std::queue::c cpp_src/stl_queue.h /^ _Sequence c;$/;" m class:std::queue access:protected +std::queue::const_reference cpp_src/stl_queue.h /^ typedef typename _Sequence::const_reference const_reference;$/;" t class:std::queue access:public +std::queue::container_type cpp_src/stl_queue.h /^ typedef _Sequence container_type;$/;" t class:std::queue access:public +std::queue::empty cpp_src/stl_queue.h /^ empty() const$/;" f class:std::queue access:public signature:() const +std::queue::front cpp_src/stl_queue.h /^ front() const$/;" f class:std::queue access:public signature:() const +std::queue::front cpp_src/stl_queue.h /^ front()$/;" f class:std::queue access:public signature:() +std::queue::operator < cpp_src/stl_queue.h /^ operator<(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);$/;" p class:std::queue access:friend signature:(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&) +std::queue::operator == cpp_src/stl_queue.h /^ operator==(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);$/;" p class:std::queue access:friend signature:(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&) +std::queue::pop cpp_src/stl_queue.h /^ pop()$/;" f class:std::queue access:public signature:() +std::queue::push cpp_src/stl_queue.h /^ push(const value_type& __x)$/;" f class:std::queue access:public signature:(const value_type& __x) +std::queue::queue cpp_src/stl_queue.h /^ queue(const _Sequence& __c = _Sequence()) : c(__c) {}$/;" f class:std::queue access:public signature:(const _Sequence& __c = _Sequence()) +std::queue::reference cpp_src/stl_queue.h /^ typedef typename _Sequence::reference reference;$/;" t class:std::queue access:public +std::queue::size cpp_src/stl_queue.h /^ size() const$/;" f class:std::queue access:public signature:() const +std::queue::size_type cpp_src/stl_queue.h /^ typedef typename _Sequence::size_type size_type;$/;" t class:std::queue access:public +std::queue::value_type cpp_src/stl_queue.h /^ typedef typename _Sequence::value_type value_type;$/;" t class:std::queue access:public +std::random_access_iterator_tag cpp_src/stl_iterator_base_types.h /^ struct random_access_iterator_tag : public bidirectional_iterator_tag {};$/;" s namespace:std inherits:bidirectional_iterator_tag +std::random_shuffle cpp_src/stl_algo.h /^ random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last)$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last) +std::random_shuffle cpp_src/stl_algo.h /^ random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomNumberGenerator& __rand) +std::range_error cpp_src/stdexcept /^ class range_error : public runtime_error $/;" c namespace:std file: inherits:runtime_error +std::range_error::range_error cpp_src/stdexcept /^ explicit range_error(const string& __arg);$/;" p class:std::range_error file: access:public signature:(const string& __arg) +std::raw_storage_iterator cpp_src/stl_raw_storage_iter.h /^ class raw_storage_iterator$/;" c namespace:std inherits:iterator +std::raw_storage_iterator::_M_iter cpp_src/stl_raw_storage_iter.h /^ _ForwardIterator _M_iter;$/;" m class:std::raw_storage_iterator access:protected +std::raw_storage_iterator::operator * cpp_src/stl_raw_storage_iter.h /^ operator*() { return *this; }$/;" f class:std::raw_storage_iterator access:public signature:() +std::raw_storage_iterator::operator ++ cpp_src/stl_raw_storage_iter.h /^ operator++()$/;" f class:std::raw_storage_iterator access:public signature:() +std::raw_storage_iterator::operator ++ cpp_src/stl_raw_storage_iter.h /^ operator++(int)$/;" f class:std::raw_storage_iterator access:public signature:(int) +std::raw_storage_iterator::operator = cpp_src/stl_raw_storage_iter.h /^ operator=(const _Tp& __element)$/;" f class:std::raw_storage_iterator access:public signature:(const _Tp& __element) +std::raw_storage_iterator::raw_storage_iterator cpp_src/stl_raw_storage_iter.h /^ raw_storage_iterator(_ForwardIterator __x)$/;" f class:std::raw_storage_iterator access:public signature:(_ForwardIterator __x) +std::real cpp_src/complex /^ real(complex<_Tp>& __z)$/;" f namespace:std signature:(complex<_Tp>& __z) +std::real cpp_src/complex /^ real(const complex<_Tp>& __z)$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::rel_ops cpp_src/stl_relops.h /^ namespace rel_ops$/;" n namespace:std +std::rel_ops::operator != cpp_src/stl_relops.h /^ operator!=(const _Tp& __x, const _Tp& __y)$/;" f namespace:std::rel_ops signature:(const _Tp& __x, const _Tp& __y) +std::rel_ops::operator <= cpp_src/stl_relops.h /^ operator<=(const _Tp& __x, const _Tp& __y)$/;" f namespace:std::rel_ops signature:(const _Tp& __x, const _Tp& __y) +std::rel_ops::operator > cpp_src/stl_relops.h /^ operator>(const _Tp& __x, const _Tp& __y)$/;" f namespace:std::rel_ops signature:(const _Tp& __x, const _Tp& __y) +std::rel_ops::operator >= cpp_src/stl_relops.h /^ operator>=(const _Tp& __x, const _Tp& __y)$/;" f namespace:std::rel_ops signature:(const _Tp& __x, const _Tp& __y) +std::remove cpp_src/stl_algo.h /^ remove(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) +std::remove_copy cpp_src/stl_algo.h /^ remove_copy(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value) +std::remove_copy_if cpp_src/stl_algo.h /^ remove_copy_if(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) +std::remove_if cpp_src/stl_algo.h /^ remove_if(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) +std::replace cpp_src/stl_algo.h /^ replace(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) +std::replace_copy cpp_src/stl_algo.h /^ replace_copy(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __old_value, const _Tp& __new_value) +std::replace_copy_if cpp_src/stl_algo.h /^ replace_copy_if(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred, const _Tp& __new_value) +std::replace_if cpp_src/stl_algo.h /^ replace_if(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) +std::resetiosflags cpp_src/iomanip /^ resetiosflags(ios_base::fmtflags __mask)$/;" f namespace:std signature:(ios_base::fmtflags __mask) +std::return_temporary_buffer cpp_src/memory /^ return_temporary_buffer(_Tp* __p)$/;" f namespace:std signature:(_Tp* __p) +std::reverse cpp_src/stl_algo.h /^ reverse(_BidirectionalIterator __first, _BidirectionalIterator __last)$/;" f namespace:std signature:(_BidirectionalIterator __first, _BidirectionalIterator __last) +std::reverse_copy cpp_src/stl_algo.h /^ reverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last,$/;" f namespace:std signature:(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) +std::reverse_iterator cpp_src/stl_iterator.h /^ class reverse_iterator$/;" c namespace:std inherits:iterator +std::reverse_iterator::base cpp_src/stl_iterator.h /^ base() const$/;" f class:std::reverse_iterator access:public signature:() const +std::reverse_iterator::current cpp_src/stl_iterator.h /^ _Iterator current;$/;" m class:std::reverse_iterator access:protected +std::reverse_iterator::difference_type cpp_src/stl_iterator.h /^ difference_type;$/;" t class:std::reverse_iterator access:public +std::reverse_iterator::iterator_type cpp_src/stl_iterator.h /^ typedef _Iterator iterator_type;$/;" t class:std::reverse_iterator access:public +std::reverse_iterator::operator * cpp_src/stl_iterator.h /^ operator*() const$/;" f class:std::reverse_iterator access:public signature:() const +std::reverse_iterator::operator + cpp_src/stl_iterator.h /^ operator+(difference_type __n) const$/;" f class:std::reverse_iterator access:public signature:(difference_type __n) const +std::reverse_iterator::operator ++ cpp_src/stl_iterator.h /^ operator++()$/;" f class:std::reverse_iterator access:public signature:() +std::reverse_iterator::operator ++ cpp_src/stl_iterator.h /^ operator++(int)$/;" f class:std::reverse_iterator access:public signature:(int) +std::reverse_iterator::operator += cpp_src/stl_iterator.h /^ operator+=(difference_type __n)$/;" f class:std::reverse_iterator access:public signature:(difference_type __n) +std::reverse_iterator::operator - cpp_src/stl_iterator.h /^ operator-(difference_type __n) const$/;" f class:std::reverse_iterator access:public signature:(difference_type __n) const +std::reverse_iterator::operator -- cpp_src/stl_iterator.h /^ operator--()$/;" f class:std::reverse_iterator access:public signature:() +std::reverse_iterator::operator -- cpp_src/stl_iterator.h /^ operator--(int)$/;" f class:std::reverse_iterator access:public signature:(int) +std::reverse_iterator::operator -= cpp_src/stl_iterator.h /^ operator-=(difference_type __n)$/;" f class:std::reverse_iterator access:public signature:(difference_type __n) +std::reverse_iterator::operator -> cpp_src/stl_iterator.h /^ operator->() const$/;" f class:std::reverse_iterator access:public signature:() const +std::reverse_iterator::operator [] cpp_src/stl_iterator.h /^ operator[](difference_type __n) const$/;" f class:std::reverse_iterator access:public signature:(difference_type __n) const +std::reverse_iterator::pointer cpp_src/stl_iterator.h /^ typedef typename iterator_traits<_Iterator>::pointer pointer;$/;" t class:std::reverse_iterator access:public +std::reverse_iterator::reference cpp_src/stl_iterator.h /^ typedef typename iterator_traits<_Iterator>::reference reference;$/;" t class:std::reverse_iterator access:public +std::reverse_iterator::reverse_iterator cpp_src/stl_iterator.h /^ reverse_iterator(const reverse_iterator<_Iter>& __x)$/;" f class:std::reverse_iterator access:public signature:(const reverse_iterator<_Iter>& __x) +std::reverse_iterator::reverse_iterator cpp_src/stl_iterator.h /^ reverse_iterator() : current() { }$/;" f class:std::reverse_iterator access:public signature:() +std::reverse_iterator::reverse_iterator cpp_src/stl_iterator.h /^ reverse_iterator(const reverse_iterator& __x)$/;" f class:std::reverse_iterator access:public signature:(const reverse_iterator& __x) +std::reverse_iterator::reverse_iterator cpp_src/stl_iterator.h /^ reverse_iterator(iterator_type __x) : current(__x) { }$/;" f class:std::reverse_iterator access:public signature:(iterator_type __x) +std::right cpp_src/ios_base.h /^ right(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +std::rotate cpp_src/stl_algo.h /^ rotate(_ForwardIterator __first, _ForwardIterator __middle,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) +std::rotate_copy cpp_src/stl_algo.h /^ rotate_copy(_ForwardIterator __first, _ForwardIterator __middle,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) +std::round_indeterminate cpp_src/limits /^ round_indeterminate = -1, \/\/\/< Self-explanatory.$/;" e enum:std::float_round_style file: +std::round_to_nearest cpp_src/limits /^ round_to_nearest = 1, \/\/\/< To the nearest representable value.$/;" e enum:std::float_round_style file: +std::round_toward_infinity cpp_src/limits /^ round_toward_infinity = 2, \/\/\/< Self-explanatory.$/;" e enum:std::float_round_style file: +std::round_toward_neg_infinity cpp_src/limits /^ round_toward_neg_infinity = 3 \/\/\/< Self-explanatory.$/;" e enum:std::float_round_style file: +std::round_toward_zero cpp_src/limits /^ round_toward_zero = 0, \/\/\/< Self-explanatory.$/;" e enum:std::float_round_style file: +std::runtime_error cpp_src/stdexcept /^ class runtime_error : public exception $/;" c namespace:std file: inherits:exception +std::runtime_error::_M_msg cpp_src/stdexcept /^ string _M_msg;$/;" m class:std::runtime_error file: access:private +std::runtime_error::runtime_error cpp_src/stdexcept /^ runtime_error(const string& __arg);$/;" p class:std::runtime_error file: access:public signature:(const string& __arg) +std::runtime_error::what cpp_src/stdexcept /^ what() const throw();$/;" p class:std::runtime_error file: access:public signature:() const +std::runtime_error::~runtime_error cpp_src/stdexcept /^ ~runtime_error() throw();$/;" p class:std::runtime_error file: access:public signature:() +std::scientific cpp_src/ios_base.h /^ scientific(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +std::search cpp_src/stl_algo.h /^ search(_ForwardIterator1 __first1, _ForwardIterator1 __last1,$/;" f namespace:std signature:(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2) +std::search cpp_src/stl_algo.h /^ search(_ForwardIterator1 __first1, _ForwardIterator1 __last1,$/;" f namespace:std signature:(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __predicate) +std::search_n cpp_src/stl_algo.h /^ search_n(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _Integer __count, const _Tp& __val) +std::search_n cpp_src/stl_algo.h /^ search_n(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _Integer __count, const _Tp& __val, _BinaryPredicate __binary_pred) +std::set cpp_src/stl_set.h /^ class set$/;" c namespace:std +std::set::_Alloc_value_type cpp_src/stl_set.h /^ typedef typename _Alloc::value_type _Alloc_value_type;$/;" t class:std::set access:private +std::set::_Key_alloc_type cpp_src/stl_set.h /^ typedef typename _Alloc::template rebind<_Key>::other _Key_alloc_type;$/;" t class:std::set access:private +std::set::_M_t cpp_src/stl_set.h /^ _Rep_type _M_t; \/\/ red-black tree representing set$/;" m class:std::set access:private +std::set::_Rep_type cpp_src/stl_set.h /^ key_compare, _Key_alloc_type> _Rep_type;$/;" t class:std::set access:private +std::set::allocator_type cpp_src/stl_set.h /^ typedef _Alloc allocator_type;$/;" t class:std::set access:public +std::set::begin cpp_src/stl_set.h /^ begin() const$/;" f class:std::set access:public signature:() const +std::set::clear cpp_src/stl_set.h /^ clear()$/;" f class:std::set access:public signature:() +std::set::const_iterator cpp_src/stl_set.h /^ typedef typename _Rep_type::const_iterator const_iterator;$/;" t class:std::set access:public +std::set::const_pointer cpp_src/stl_set.h /^ typedef typename _Key_alloc_type::const_pointer const_pointer;$/;" t class:std::set access:public +std::set::const_reference cpp_src/stl_set.h /^ typedef typename _Key_alloc_type::const_reference const_reference;$/;" t class:std::set access:public +std::set::const_reverse_iterator cpp_src/stl_set.h /^ typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator;$/;" t class:std::set access:public +std::set::count cpp_src/stl_set.h /^ count(const key_type& __x) const$/;" f class:std::set access:public signature:(const key_type& __x) const +std::set::difference_type cpp_src/stl_set.h /^ typedef typename _Rep_type::difference_type difference_type;$/;" t class:std::set access:public +std::set::empty cpp_src/stl_set.h /^ empty() const$/;" f class:std::set access:public signature:() const +std::set::end cpp_src/stl_set.h /^ end() const$/;" f class:std::set access:public signature:() const +std::set::equal_range cpp_src/stl_set.h /^ equal_range(const key_type& __x) const$/;" f class:std::set access:public signature:(const key_type& __x) const +std::set::equal_range cpp_src/stl_set.h /^ equal_range(const key_type& __x)$/;" f class:std::set access:public signature:(const key_type& __x) +std::set::erase cpp_src/stl_set.h /^ erase(const key_type& __x)$/;" f class:std::set access:public signature:(const key_type& __x) +std::set::erase cpp_src/stl_set.h /^ erase(iterator __first, iterator __last)$/;" f class:std::set access:public signature:(iterator __first, iterator __last) +std::set::erase cpp_src/stl_set.h /^ erase(iterator __position)$/;" f class:std::set access:public signature:(iterator __position) +std::set::find cpp_src/stl_set.h /^ find(const key_type& __x) const$/;" f class:std::set access:public signature:(const key_type& __x) const +std::set::find cpp_src/stl_set.h /^ find(const key_type& __x)$/;" f class:std::set access:public signature:(const key_type& __x) +std::set::get_allocator cpp_src/stl_set.h /^ get_allocator() const$/;" f class:std::set access:public signature:() const +std::set::insert cpp_src/stl_set.h /^ insert(_InputIterator __first, _InputIterator __last)$/;" f class:std::set access:public signature:(_InputIterator __first, _InputIterator __last) +std::set::insert cpp_src/stl_set.h /^ insert(const value_type& __x)$/;" f class:std::set access:public signature:(const value_type& __x) +std::set::insert cpp_src/stl_set.h /^ insert(iterator __position, const value_type& __x)$/;" f class:std::set access:public signature:(iterator __position, const value_type& __x) +std::set::iterator cpp_src/stl_set.h /^ typedef typename _Rep_type::const_iterator iterator;$/;" t class:std::set access:public +std::set::key_comp cpp_src/stl_set.h /^ key_comp() const$/;" f class:std::set access:public signature:() const +std::set::key_compare cpp_src/stl_set.h /^ typedef _Compare key_compare;$/;" t class:std::set access:public +std::set::key_type cpp_src/stl_set.h /^ typedef _Key key_type;$/;" t class:std::set access:public +std::set::lower_bound cpp_src/stl_set.h /^ lower_bound(const key_type& __x) const$/;" f class:std::set access:public signature:(const key_type& __x) const +std::set::lower_bound cpp_src/stl_set.h /^ lower_bound(const key_type& __x)$/;" f class:std::set access:public signature:(const key_type& __x) +std::set::max_size cpp_src/stl_set.h /^ max_size() const$/;" f class:std::set access:public signature:() const +std::set::operator < cpp_src/stl_set.h /^ operator< (const set<_K1, _C1, _A1>&, const set<_K1, _C1, _A1>&);$/;" p class:std::set access:friend signature:(const set<_K1, _C1, _A1>&, const set<_K1, _C1, _A1>&) +std::set::operator = cpp_src/stl_set.h /^ operator=(const set<_Key, _Compare, _Alloc>& __x)$/;" f class:std::set access:public signature:(const set<_Key, _Compare, _Alloc>& __x) +std::set::operator == cpp_src/stl_set.h /^ operator== (const set<_K1, _C1, _A1>&, const set<_K1, _C1, _A1>&);$/;" p class:std::set access:friend signature:(const set<_K1, _C1, _A1>&, const set<_K1, _C1, _A1>&) +std::set::pointer cpp_src/stl_set.h /^ typedef typename _Key_alloc_type::pointer pointer;$/;" t class:std::set access:public +std::set::rbegin cpp_src/stl_set.h /^ rbegin() const$/;" f class:std::set access:public signature:() const +std::set::reference cpp_src/stl_set.h /^ typedef typename _Key_alloc_type::reference reference;$/;" t class:std::set access:public +std::set::rend cpp_src/stl_set.h /^ rend() const$/;" f class:std::set access:public signature:() const +std::set::reverse_iterator cpp_src/stl_set.h /^ typedef typename _Rep_type::const_reverse_iterator reverse_iterator;$/;" t class:std::set access:public +std::set::set cpp_src/stl_set.h /^ set(_InputIterator __first, _InputIterator __last)$/;" f class:std::set access:public signature:(_InputIterator __first, _InputIterator __last) +std::set::set cpp_src/stl_set.h /^ set(_InputIterator __first, _InputIterator __last,$/;" f class:std::set access:public signature:(_InputIterator __first, _InputIterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) +std::set::set cpp_src/stl_set.h /^ set()$/;" f class:std::set access:public signature:() +std::set::set cpp_src/stl_set.h /^ set(const _Compare& __comp,$/;" f class:std::set access:public signature:(const _Compare& __comp, const allocator_type& __a = allocator_type()) +std::set::set cpp_src/stl_set.h /^ set(const set<_Key,_Compare,_Alloc>& __x)$/;" f class:std::set access:public signature:(const set<_Key,_Compare,_Alloc>& __x) +std::set::size cpp_src/stl_set.h /^ size() const$/;" f class:std::set access:public signature:() const +std::set::size_type cpp_src/stl_set.h /^ typedef typename _Rep_type::size_type size_type;$/;" t class:std::set access:public +std::set::swap cpp_src/stl_set.h /^ swap(set<_Key,_Compare,_Alloc>& __x)$/;" f class:std::set access:public signature:(set<_Key,_Compare,_Alloc>& __x) +std::set::upper_bound cpp_src/stl_set.h /^ upper_bound(const key_type& __x) const$/;" f class:std::set access:public signature:(const key_type& __x) const +std::set::upper_bound cpp_src/stl_set.h /^ upper_bound(const key_type& __x)$/;" f class:std::set access:public signature:(const key_type& __x) +std::set::value_comp cpp_src/stl_set.h /^ value_comp() const$/;" f class:std::set access:public signature:() const +std::set::value_compare cpp_src/stl_set.h /^ typedef _Compare value_compare;$/;" t class:std::set access:public +std::set::value_type cpp_src/stl_set.h /^ typedef _Key value_type;$/;" t class:std::set access:public +std::set_difference cpp_src/stl_algo.h /^ set_difference(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) +std::set_difference cpp_src/stl_algo.h /^ set_difference(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) +std::set_intersection cpp_src/stl_algo.h /^ set_intersection(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) +std::set_intersection cpp_src/stl_algo.h /^ set_intersection(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) +std::set_new_handler cpp_src/new /^ new_handler set_new_handler(new_handler) throw();$/;" p namespace:std file: signature:(new_handler) +std::set_symmetric_difference cpp_src/stl_algo.h /^ set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) +std::set_symmetric_difference cpp_src/stl_algo.h /^ set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) +std::set_terminate cpp_src/exception /^ terminate_handler set_terminate(terminate_handler) throw();$/;" p namespace:std file: signature:(terminate_handler) +std::set_unexpected cpp_src/exception /^ unexpected_handler set_unexpected(unexpected_handler) throw();$/;" p namespace:std file: signature:(unexpected_handler) +std::set_union cpp_src/stl_algo.h /^ set_union(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) +std::set_union cpp_src/stl_algo.h /^ set_union(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) +std::setbase cpp_src/iomanip /^ setbase(int __base)$/;" f namespace:std signature:(int __base) +std::setfill cpp_src/iomanip /^ setfill(_CharT __c)$/;" f namespace:std signature:(_CharT __c) +std::setiosflags cpp_src/iomanip /^ setiosflags(ios_base::fmtflags __mask)$/;" f namespace:std signature:(ios_base::fmtflags __mask) +std::setprecision cpp_src/iomanip /^ setprecision(int __n)$/;" f namespace:std signature:(int __n) +std::setw cpp_src/iomanip /^ setw(int __n)$/;" f namespace:std signature:(int __n) +std::showbase cpp_src/ios_base.h /^ showbase(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +std::showpoint cpp_src/ios_base.h /^ showpoint(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +std::showpos cpp_src/ios_base.h /^ showpos(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +std::sin cpp_src/cmath /^ sin(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +std::sin cpp_src/cmath /^ sin(float __x)$/;" f namespace:std signature:(float __x) +std::sin cpp_src/cmath /^ sin(long double __x)$/;" f namespace:std signature:(long double __x) +std::sin cpp_src/complex /^ sin(const complex<_Tp>& __z) { return __complex_sin(__z); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::sin cpp_src/complex /^ sin(const complex<_Tp>& __z) { return __complex_sin(__z.__rep()); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::sin cpp_src/complex /^ template complex<_Tp> sin(const complex<_Tp>&);$/;" p namespace:std file: signature:(const complex<_Tp>&) +std::sinh cpp_src/cmath /^ sinh(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +std::sinh cpp_src/cmath /^ sinh(float __x)$/;" f namespace:std signature:(float __x) +std::sinh cpp_src/cmath /^ sinh(long double __x)$/;" f namespace:std signature:(long double __x) +std::sinh cpp_src/complex /^ sinh(const complex<_Tp>& __z) { return __complex_sinh(__z); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::sinh cpp_src/complex /^ sinh(const complex<_Tp>& __z) { return __complex_sinh(__z.__rep()); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::sinh cpp_src/complex /^ template complex<_Tp> sinh(const complex<_Tp>&);$/;" p namespace:std file: signature:(const complex<_Tp>&) +std::skipws cpp_src/ios_base.h /^ skipws(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +std::slice cpp_src/slice_array.h /^ class slice$/;" c namespace:std +std::slice::_M_off cpp_src/slice_array.h /^ size_t _M_off; \/\/ offset$/;" m class:std::slice access:private +std::slice::_M_st cpp_src/slice_array.h /^ size_t _M_st; \/\/ stride unit$/;" m class:std::slice access:private +std::slice::_M_sz cpp_src/slice_array.h /^ size_t _M_sz; \/\/ size$/;" m class:std::slice access:private +std::slice::size cpp_src/slice_array.h /^ size_t size() const;$/;" p class:std::slice access:public signature:() const +std::slice::size cpp_src/slice_array.h /^ slice::size() const$/;" f class:std::slice signature:() const +std::slice::slice cpp_src/slice_array.h /^ slice();$/;" p class:std::slice access:public signature:() +std::slice::slice cpp_src/slice_array.h /^ slice(size_t, size_t, size_t);$/;" p class:std::slice access:public signature:(size_t, size_t, size_t) +std::slice::slice cpp_src/slice_array.h /^ slice::slice() {}$/;" f class:std::slice signature:() +std::slice::slice cpp_src/slice_array.h /^ slice::slice(size_t __o, size_t __d, size_t __s)$/;" f class:std::slice signature:(size_t __o, size_t __d, size_t __s) +std::slice::start cpp_src/slice_array.h /^ size_t start() const;$/;" p class:std::slice access:public signature:() const +std::slice::start cpp_src/slice_array.h /^ slice::start() const$/;" f class:std::slice signature:() const +std::slice::stride cpp_src/slice_array.h /^ size_t stride() const;$/;" p class:std::slice access:public signature:() const +std::slice::stride cpp_src/slice_array.h /^ slice::stride() const$/;" f class:std::slice signature:() const +std::slice_array cpp_src/slice_array.h /^ class slice_array$/;" c namespace:std +std::slice_array::_M_array cpp_src/slice_array.h /^ const _Array<_Tp> _M_array;$/;" m class:std::slice_array access:private +std::slice_array::_M_stride cpp_src/slice_array.h /^ const size_t _M_stride;$/;" m class:std::slice_array access:private +std::slice_array::_M_sz cpp_src/slice_array.h /^ const size_t _M_sz;$/;" m class:std::slice_array access:private +std::slice_array::operator %= cpp_src/slice_array.h /^ void operator%=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::slice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::slice_array::operator %= cpp_src/slice_array.h /^ void operator%=(const valarray<_Tp>&) const;$/;" p class:std::slice_array access:public signature:(const valarray<_Tp>&) const +std::slice_array::operator &= cpp_src/slice_array.h /^ void operator&=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::slice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::slice_array::operator &= cpp_src/slice_array.h /^ void operator&=(const valarray<_Tp>&) const;$/;" p class:std::slice_array access:public signature:(const valarray<_Tp>&) const +std::slice_array::operator *= cpp_src/slice_array.h /^ void operator*=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::slice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::slice_array::operator *= cpp_src/slice_array.h /^ void operator*=(const valarray<_Tp>&) const;$/;" p class:std::slice_array access:public signature:(const valarray<_Tp>&) const +std::slice_array::operator += cpp_src/slice_array.h /^ void operator+=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::slice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::slice_array::operator += cpp_src/slice_array.h /^ void operator+=(const valarray<_Tp>&) const;$/;" p class:std::slice_array access:public signature:(const valarray<_Tp>&) const +std::slice_array::operator -= cpp_src/slice_array.h /^ void operator-=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::slice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::slice_array::operator -= cpp_src/slice_array.h /^ void operator-=(const valarray<_Tp>&) const;$/;" p class:std::slice_array access:public signature:(const valarray<_Tp>&) const +std::slice_array::operator /= cpp_src/slice_array.h /^ void operator\/=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::slice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::slice_array::operator /= cpp_src/slice_array.h /^ void operator\/=(const valarray<_Tp>&) const;$/;" p class:std::slice_array access:public signature:(const valarray<_Tp>&) const +std::slice_array::operator <<= cpp_src/slice_array.h /^ void operator<<=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::slice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::slice_array::operator <<= cpp_src/slice_array.h /^ void operator<<=(const valarray<_Tp>&) const;$/;" p class:std::slice_array access:public signature:(const valarray<_Tp>&) const +std::slice_array::operator = cpp_src/slice_array.h /^ void operator=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::slice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::slice_array::operator = cpp_src/slice_array.h /^ slice_array& operator=(const slice_array&);$/;" p class:std::slice_array access:public signature:(const slice_array&) +std::slice_array::operator = cpp_src/slice_array.h /^ void operator=(const _Tp &) const;$/;" p class:std::slice_array access:public signature:(const _Tp &) const +std::slice_array::operator = cpp_src/slice_array.h /^ void operator=(const valarray<_Tp>&) const;$/;" p class:std::slice_array access:public signature:(const valarray<_Tp>&) const +std::slice_array::operator = cpp_src/slice_array.h /^ slice_array<_Tp>::operator=(const _Expr<_Dom,_Tp>& __e) const$/;" f class:std::slice_array signature:(const _Expr<_Dom,_Tp>& __e) const +std::slice_array::operator = cpp_src/slice_array.h /^ slice_array<_Tp>::operator=(const _Tp& __t) const$/;" f class:std::slice_array signature:(const _Tp& __t) const +std::slice_array::operator = cpp_src/slice_array.h /^ slice_array<_Tp>::operator=(const slice_array<_Tp>& __a)$/;" f class:std::slice_array signature:(const slice_array<_Tp>& __a) +std::slice_array::operator = cpp_src/slice_array.h /^ slice_array<_Tp>::operator=(const valarray<_Tp>& __v) const$/;" f class:std::slice_array signature:(const valarray<_Tp>& __v) const +std::slice_array::operator >>= cpp_src/slice_array.h /^ void operator>>=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::slice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::slice_array::operator >>= cpp_src/slice_array.h /^ void operator>>=(const valarray<_Tp>&) const;$/;" p class:std::slice_array access:public signature:(const valarray<_Tp>&) const +std::slice_array::operator ^= cpp_src/slice_array.h /^ void operator^=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::slice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::slice_array::operator ^= cpp_src/slice_array.h /^ void operator^=(const valarray<_Tp>&) const;$/;" p class:std::slice_array access:public signature:(const valarray<_Tp>&) const +std::slice_array::operator |= cpp_src/slice_array.h /^ void operator|=(const _Expr<_Dom, _Tp>&) const;$/;" p class:std::slice_array access:public signature:(const _Expr<_Dom, _Tp>&) const +std::slice_array::operator |= cpp_src/slice_array.h /^ void operator|=(const valarray<_Tp>&) const;$/;" p class:std::slice_array access:public signature:(const valarray<_Tp>&) const +std::slice_array::slice_array cpp_src/slice_array.h /^ slice_array();$/;" p class:std::slice_array access:private signature:() +std::slice_array::slice_array cpp_src/slice_array.h /^ slice_array(_Array<_Tp>, const slice&);$/;" p class:std::slice_array access:private signature:(_Array<_Tp>, const slice&) +std::slice_array::slice_array cpp_src/slice_array.h /^ slice_array(const slice_array&);$/;" p class:std::slice_array access:public signature:(const slice_array&) +std::slice_array::slice_array cpp_src/slice_array.h /^ slice_array<_Tp>::slice_array(_Array<_Tp> __a, const slice& __s)$/;" f class:std::slice_array signature:(_Array<_Tp> __a, const slice& __s) +std::slice_array::slice_array cpp_src/slice_array.h /^ slice_array<_Tp>::slice_array(const slice_array<_Tp>& a)$/;" f class:std::slice_array signature:(const slice_array<_Tp>& a) +std::slice_array::value_type cpp_src/slice_array.h /^ typedef _Tp value_type;$/;" t class:std::slice_array access:public +std::sort cpp_src/stl_algo.h /^ sort(_RandomAccessIterator __first, _RandomAccessIterator __last)$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last) +std::sort cpp_src/stl_algo.h /^ sort(_RandomAccessIterator __first, _RandomAccessIterator __last,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) +std::sort_heap cpp_src/stl_heap.h /^ sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last) +std::sort_heap cpp_src/stl_heap.h /^ sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) +std::sqrt cpp_src/cmath /^ sqrt(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +std::sqrt cpp_src/cmath /^ sqrt(float __x)$/;" f namespace:std signature:(float __x) +std::sqrt cpp_src/cmath /^ sqrt(long double __x)$/;" f namespace:std signature:(long double __x) +std::sqrt cpp_src/complex /^ sqrt(const complex<_Tp>& __z) { return __complex_sqrt(__z); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::sqrt cpp_src/complex /^ sqrt(const complex<_Tp>& __z) { return __complex_sqrt(__z.__rep()); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::sqrt cpp_src/complex /^ template complex<_Tp> sqrt(const complex<_Tp>&);$/;" p namespace:std file: signature:(const complex<_Tp>&) +std::stable_partition cpp_src/stl_algo.h /^ stable_partition(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) +std::stable_sort cpp_src/stl_algo.h /^ stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last)$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last) +std::stable_sort cpp_src/stl_algo.h /^ stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last,$/;" f namespace:std signature:(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) +std::stack cpp_src/stl_stack.h /^ class stack$/;" c namespace:std +std::stack::_Sequence_value_type cpp_src/stl_stack.h /^ typedef typename _Sequence::value_type _Sequence_value_type;$/;" t class:std::stack access:private +std::stack::c cpp_src/stl_stack.h /^ _Sequence c;$/;" m class:std::stack access:protected +std::stack::const_reference cpp_src/stl_stack.h /^ typedef typename _Sequence::const_reference const_reference;$/;" t class:std::stack access:public +std::stack::container_type cpp_src/stl_stack.h /^ typedef _Sequence container_type;$/;" t class:std::stack access:public +std::stack::empty cpp_src/stl_stack.h /^ empty() const$/;" f class:std::stack access:public signature:() const +std::stack::operator < cpp_src/stl_stack.h /^ operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);$/;" p class:std::stack access:friend signature:(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&) +std::stack::operator == cpp_src/stl_stack.h /^ operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);$/;" p class:std::stack access:friend signature:(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&) +std::stack::pop cpp_src/stl_stack.h /^ pop()$/;" f class:std::stack access:public signature:() +std::stack::push cpp_src/stl_stack.h /^ push(const value_type& __x)$/;" f class:std::stack access:public signature:(const value_type& __x) +std::stack::reference cpp_src/stl_stack.h /^ typedef typename _Sequence::reference reference;$/;" t class:std::stack access:public +std::stack::size cpp_src/stl_stack.h /^ size() const$/;" f class:std::stack access:public signature:() const +std::stack::size_type cpp_src/stl_stack.h /^ typedef typename _Sequence::size_type size_type;$/;" t class:std::stack access:public +std::stack::stack cpp_src/stl_stack.h /^ stack(const _Sequence& __c = _Sequence())$/;" f class:std::stack access:public signature:(const _Sequence& __c = _Sequence()) +std::stack::top cpp_src/stl_stack.h /^ top() const$/;" f class:std::stack access:public signature:() const +std::stack::top cpp_src/stl_stack.h /^ top()$/;" f class:std::stack access:public signature:() +std::stack::value_type cpp_src/stl_stack.h /^ typedef typename _Sequence::value_type value_type;$/;" t class:std::stack access:public +std::strchr cpp_src/cstring /^ strchr(char* __s1, int __n)$/;" f namespace:std signature:(char* __s1, int __n) +std::streambuf cpp_src/iosfwd /^ typedef basic_streambuf streambuf; \/\/\/< @isiosfwd$/;" t namespace:std file: +std::streamoff cpp_src/postypes.h /^ typedef int64_t streamoff;$/;" t namespace:std +std::streampos cpp_src/postypes.h /^ typedef fpos streampos;$/;" t namespace:std +std::streamsize cpp_src/postypes.h /^ typedef ptrdiff_t streamsize; \/\/ Signed integral type$/;" t namespace:std +std::string cpp_src/stringfwd.h /^ typedef basic_string string;$/;" t namespace:std +std::stringbuf cpp_src/iosfwd /^ typedef basic_stringbuf stringbuf; \/\/\/< @isiosfwd$/;" t namespace:std file: +std::stringstream cpp_src/iosfwd /^ typedef basic_stringstream stringstream; \/\/\/< @isiosfwd$/;" t namespace:std file: +std::strpbrk cpp_src/cstring /^ strpbrk(char* __s1, const char* __s2)$/;" f namespace:std signature:(char* __s1, const char* __s2) +std::strrchr cpp_src/cstring /^ strrchr(char* __s1, int __n)$/;" f namespace:std signature:(char* __s1, int __n) +std::strstr cpp_src/cstring /^ strstr(char* __s1, const char* __s2)$/;" f namespace:std signature:(char* __s1, const char* __s2) +std::swap cpp_src/basic_string.h /^ swap(basic_string<_CharT, _Traits, _Alloc>& __lhs,$/;" f namespace:std signature:(basic_string<_CharT, _Traits, _Alloc>& __lhs, basic_string<_CharT, _Traits, _Alloc>& __rhs) +std::swap cpp_src/stl_algobase.h /^ swap(_Tp& __a, _Tp& __b)$/;" f namespace:std signature:(_Tp& __a, _Tp& __b) +std::swap cpp_src/stl_deque.h /^ swap(deque<_Tp,_Alloc>& __x, deque<_Tp,_Alloc>& __y)$/;" f namespace:std signature:(deque<_Tp,_Alloc>& __x, deque<_Tp,_Alloc>& __y) +std::swap cpp_src/stl_list.h /^ swap(list<_Tp, _Alloc>& __x, list<_Tp, _Alloc>& __y)$/;" f namespace:std signature:(list<_Tp, _Alloc>& __x, list<_Tp, _Alloc>& __y) +std::swap cpp_src/stl_map.h /^ swap(map<_Key, _Tp, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(map<_Key, _Tp, _Compare, _Alloc>& __x, map<_Key, _Tp, _Compare, _Alloc>& __y) +std::swap cpp_src/stl_multimap.h /^ swap(multimap<_Key, _Tp, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(multimap<_Key, _Tp, _Compare, _Alloc>& __x, multimap<_Key, _Tp, _Compare, _Alloc>& __y) +std::swap cpp_src/stl_multiset.h /^ swap(multiset<_Key, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(multiset<_Key, _Compare, _Alloc>& __x, multiset<_Key, _Compare, _Alloc>& __y) +std::swap cpp_src/stl_set.h /^ swap(set<_Key, _Compare, _Alloc>& __x, set<_Key, _Compare, _Alloc>& __y)$/;" f namespace:std signature:(set<_Key, _Compare, _Alloc>& __x, set<_Key, _Compare, _Alloc>& __y) +std::swap cpp_src/stl_tree.h /^ swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) +std::swap cpp_src/stl_vector.h /^ swap(vector<_Tp, _Alloc>& __x, vector<_Tp, _Alloc>& __y)$/;" f namespace:std signature:(vector<_Tp, _Alloc>& __x, vector<_Tp, _Alloc>& __y) +std::swap_ranges cpp_src/stl_algo.h /^ swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1,$/;" f namespace:std signature:(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2) +std::tan cpp_src/cmath /^ tan(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +std::tan cpp_src/cmath /^ tan(float __x)$/;" f namespace:std signature:(float __x) +std::tan cpp_src/cmath /^ tan(long double __x)$/;" f namespace:std signature:(long double __x) +std::tan cpp_src/complex /^ tan(const complex<_Tp>& __z) { return __complex_tan(__z); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::tan cpp_src/complex /^ tan(const complex<_Tp>& __z) { return __complex_tan(__z.__rep()); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::tan cpp_src/complex /^ template complex<_Tp> tan(const complex<_Tp>&);$/;" p namespace:std file: signature:(const complex<_Tp>&) +std::tanh cpp_src/cmath /^ tanh(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +std::tanh cpp_src/cmath /^ tanh(float __x)$/;" f namespace:std signature:(float __x) +std::tanh cpp_src/cmath /^ tanh(long double __x)$/;" f namespace:std signature:(long double __x) +std::tanh cpp_src/complex /^ tanh(const complex<_Tp>& __z) { return __complex_tanh(__z); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::tanh cpp_src/complex /^ tanh(const complex<_Tp>& __z) { return __complex_tanh(__z.__rep()); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +std::tanh cpp_src/complex /^ template complex<_Tp> tanh(const complex<_Tp>&);$/;" p namespace:std file: signature:(const complex<_Tp>&) +std::terminate cpp_src/exception /^ void terminate() __attribute__ ((__noreturn__));$/;" p namespace:std file: signature:() +std::terminate_handler cpp_src/exception /^ typedef void (*terminate_handler) ();$/;" t namespace:std file: +std::time_base cpp_src/locale_facets.h /^ class time_base$/;" c namespace:std +std::time_base::dateorder cpp_src/locale_facets.h /^ enum dateorder { no_order, dmy, mdy, ymd, ydm };$/;" g class:std::time_base access:public +std::time_base::dmy cpp_src/locale_facets.h /^ enum dateorder { no_order, dmy, mdy, ymd, ydm };$/;" e enum:std::time_base::dateorder +std::time_base::mdy cpp_src/locale_facets.h /^ enum dateorder { no_order, dmy, mdy, ymd, ydm };$/;" e enum:std::time_base::dateorder +std::time_base::no_order cpp_src/locale_facets.h /^ enum dateorder { no_order, dmy, mdy, ymd, ydm };$/;" e enum:std::time_base::dateorder +std::time_base::ydm cpp_src/locale_facets.h /^ enum dateorder { no_order, dmy, mdy, ymd, ydm };$/;" e enum:std::time_base::dateorder +std::time_base::ymd cpp_src/locale_facets.h /^ enum dateorder { no_order, dmy, mdy, ymd, ydm };$/;" e enum:std::time_base::dateorder +std::time_get cpp_src/locale_facets.h /^ class time_get : public locale::facet, public time_base$/;" c namespace:std inherits:locale::facet,time_base +std::time_get::_M_extract_name cpp_src/locale_facets.h /^ _M_extract_name(iter_type __beg, iter_type __end, int& __member,$/;" p class:std::time_get access:protected signature:(iter_type __beg, iter_type __end, int& __member, const _CharT** __names, size_t __indexlen, ios_base& __io, ios_base::iostate& __err) const +std::time_get::_M_extract_name cpp_src/locale_facets.tcc /^ _M_extract_name(iter_type __beg, iter_type __end, int& __member,$/;" f class:std::time_get signature:(iter_type __beg, iter_type __end, int& __member, const _CharT** __names, size_t __indexlen, ios_base& __io, ios_base::iostate& __err) const +std::time_get::_M_extract_num cpp_src/locale_facets.h /^ _M_extract_num(iter_type __beg, iter_type __end, int& __member,$/;" p class:std::time_get access:protected signature:(iter_type __beg, iter_type __end, int& __member, int __min, int __max, size_t __len, ios_base& __io, ios_base::iostate& __err) const +std::time_get::_M_extract_num cpp_src/locale_facets.tcc /^ _M_extract_num(iter_type __beg, iter_type __end, int& __member,$/;" f class:std::time_get signature:(iter_type __beg, iter_type __end, int& __member, int __min, int __max, size_t __len, ios_base& __io, ios_base::iostate& __err) const +std::time_get::_M_extract_via_format cpp_src/locale_facets.h /^ _M_extract_via_format(iter_type __beg, iter_type __end, ios_base& __io,$/;" p class:std::time_get access:protected signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, tm* __tm, const _CharT* __format) const +std::time_get::_M_extract_via_format cpp_src/locale_facets.tcc /^ _M_extract_via_format(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::time_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, tm* __tm, const _CharT* __format) const +std::time_get::__string_type cpp_src/locale_facets.h /^ typedef basic_string<_CharT> __string_type;$/;" t class:std::time_get access:public +std::time_get::char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::time_get access:public +std::time_get::date_order cpp_src/locale_facets.h /^ date_order() const$/;" f class:std::time_get access:public signature:() const +std::time_get::do_date_order cpp_src/locale_facets.h /^ do_date_order() const;$/;" p class:std::time_get access:protected signature:() const +std::time_get::do_date_order cpp_src/locale_facets.tcc /^ time_get<_CharT, _InIter>::do_date_order() const$/;" f class:std::time_get signature:() const +std::time_get::do_get_date cpp_src/locale_facets.h /^ do_get_date(iter_type __beg, iter_type __end, ios_base& __io,$/;" p class:std::time_get access:protected signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, tm* __tm) const +std::time_get::do_get_date cpp_src/locale_facets.tcc /^ do_get_date(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::time_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, tm* __tm) const +std::time_get::do_get_monthname cpp_src/locale_facets.h /^ do_get_monthname(iter_type __beg, iter_type __end, ios_base&,$/;" p class:std::time_get access:protected signature:(iter_type __beg, iter_type __end, ios_base&, ios_base::iostate& __err, tm* __tm) const +std::time_get::do_get_monthname cpp_src/locale_facets.tcc /^ do_get_monthname(iter_type __beg, iter_type __end,$/;" f class:std::time_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, tm* __tm) const +std::time_get::do_get_time cpp_src/locale_facets.h /^ do_get_time(iter_type __beg, iter_type __end, ios_base& __io,$/;" p class:std::time_get access:protected signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, tm* __tm) const +std::time_get::do_get_time cpp_src/locale_facets.tcc /^ do_get_time(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::time_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, tm* __tm) const +std::time_get::do_get_weekday cpp_src/locale_facets.h /^ do_get_weekday(iter_type __beg, iter_type __end, ios_base&,$/;" p class:std::time_get access:protected signature:(iter_type __beg, iter_type __end, ios_base&, ios_base::iostate& __err, tm* __tm) const +std::time_get::do_get_weekday cpp_src/locale_facets.tcc /^ do_get_weekday(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::time_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, tm* __tm) const +std::time_get::do_get_year cpp_src/locale_facets.h /^ do_get_year(iter_type __beg, iter_type __end, ios_base& __io,$/;" p class:std::time_get access:protected signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, tm* __tm) const +std::time_get::do_get_year cpp_src/locale_facets.tcc /^ do_get_year(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::time_get signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, tm* __tm) const +std::time_get::get_date cpp_src/locale_facets.h /^ get_date(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::time_get access:public signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, tm* __tm) const +std::time_get::get_monthname cpp_src/locale_facets.h /^ get_monthname(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::time_get access:public signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, tm* __tm) const +std::time_get::get_time cpp_src/locale_facets.h /^ get_time(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::time_get access:public signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, tm* __tm) const +std::time_get::get_weekday cpp_src/locale_facets.h /^ get_weekday(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::time_get access:public signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, tm* __tm) const +std::time_get::get_year cpp_src/locale_facets.h /^ get_year(iter_type __beg, iter_type __end, ios_base& __io,$/;" f class:std::time_get access:public signature:(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, tm* __tm) const +std::time_get::id cpp_src/locale_facets.h /^ static locale::id id;$/;" m class:std::time_get access:public +std::time_get::id cpp_src/locale_facets.h /^ locale::id time_get<_CharT, _InIter>::id;$/;" m class:std::time_get +std::time_get::iter_type cpp_src/locale_facets.h /^ typedef _InIter iter_type;$/;" t class:std::time_get access:public +std::time_get::time_get cpp_src/locale_facets.h /^ time_get(size_t __refs = 0)$/;" f class:std::time_get access:public signature:(size_t __refs = 0) +std::time_get::~time_get cpp_src/locale_facets.h /^ ~time_get() { }$/;" f class:std::time_get access:protected signature:() +std::time_get_byname cpp_src/locale_facets.h /^ class time_get_byname : public time_get<_CharT, _InIter>$/;" c namespace:std inherits:time_get +std::time_get_byname::char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::time_get_byname access:public +std::time_get_byname::iter_type cpp_src/locale_facets.h /^ typedef _InIter iter_type;$/;" t class:std::time_get_byname access:public +std::time_get_byname::time_get_byname cpp_src/locale_facets.h /^ time_get_byname(const char*, size_t __refs = 0)$/;" f class:std::time_get_byname access:public signature:(const char*, size_t __refs = 0) +std::time_get_byname::~time_get_byname cpp_src/locale_facets.h /^ ~time_get_byname() { }$/;" f class:std::time_get_byname access:protected signature:() +std::time_put cpp_src/locale_facets.h /^ class time_put : public locale::facet$/;" c namespace:std inherits:locale::facet +std::time_put::char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::time_put access:public +std::time_put::do_put cpp_src/locale_facets.h /^ do_put(iter_type __s, ios_base& __io, char_type __fill, const tm* __tm,$/;" p class:std::time_put access:protected signature:(iter_type __s, ios_base& __io, char_type __fill, const tm* __tm, char __format, char __mod) const +std::time_put::do_put cpp_src/locale_facets.tcc /^ do_put(iter_type __s, ios_base& __io, char_type, const tm* __tm,$/;" f class:std::time_put signature:(iter_type __s, ios_base& __io, char_type, const tm* __tm, char __format, char __mod) const +std::time_put::id cpp_src/locale_facets.h /^ static locale::id id;$/;" m class:std::time_put access:public +std::time_put::id cpp_src/locale_facets.h /^ locale::id time_put<_CharT, _OutIter>::id;$/;" m class:std::time_put +std::time_put::iter_type cpp_src/locale_facets.h /^ typedef _OutIter iter_type;$/;" t class:std::time_put access:public +std::time_put::put cpp_src/locale_facets.h /^ put(iter_type __s, ios_base& __io, char_type __fill, const tm* __tm,$/;" p class:std::time_put access:public signature:(iter_type __s, ios_base& __io, char_type __fill, const tm* __tm, const _CharT* __beg, const _CharT* __end) const +std::time_put::put cpp_src/locale_facets.h /^ put(iter_type __s, ios_base& __io, char_type __fill,$/;" f class:std::time_put access:public signature:(iter_type __s, ios_base& __io, char_type __fill, const tm* __tm, char __format, char __mod = 0) const +std::time_put::put cpp_src/locale_facets.tcc /^ put(iter_type __s, ios_base& __io, char_type __fill, const tm* __tm,$/;" f class:std::time_put signature:(iter_type __s, ios_base& __io, char_type __fill, const tm* __tm, const _CharT* __beg, const _CharT* __end) const +std::time_put::time_put cpp_src/locale_facets.h /^ time_put(size_t __refs = 0)$/;" f class:std::time_put access:public signature:(size_t __refs = 0) +std::time_put::~time_put cpp_src/locale_facets.h /^ ~time_put()$/;" f class:std::time_put access:protected signature:() +std::time_put_byname cpp_src/locale_facets.h /^ class time_put_byname : public time_put<_CharT, _OutIter>$/;" c namespace:std inherits:time_put +std::time_put_byname::char_type cpp_src/locale_facets.h /^ typedef _CharT char_type;$/;" t class:std::time_put_byname access:public +std::time_put_byname::iter_type cpp_src/locale_facets.h /^ typedef _OutIter iter_type;$/;" t class:std::time_put_byname access:public +std::time_put_byname::time_put_byname cpp_src/locale_facets.h /^ time_put_byname(const char*, size_t __refs = 0)$/;" f class:std::time_put_byname access:public signature:(const char*, size_t __refs = 0) +std::time_put_byname::~time_put_byname cpp_src/locale_facets.h /^ ~time_put_byname() { }$/;" f class:std::time_put_byname access:protected signature:() +std::tolower cpp_src/locale_facets.h /^ tolower(_CharT __c, const locale& __loc)$/;" f namespace:std signature:(_CharT __c, const locale& __loc) +std::tolower cpp_src/localefwd.h /^ tolower(_CharT, const locale&);$/;" p namespace:std signature:(_CharT, const locale&) +std::toupper cpp_src/locale_facets.h /^ toupper(_CharT __c, const locale& __loc)$/;" f namespace:std signature:(_CharT __c, const locale& __loc) +std::toupper cpp_src/localefwd.h /^ toupper(_CharT, const locale&);$/;" p namespace:std signature:(_CharT, const locale&) +std::transform cpp_src/stl_algo.h /^ transform(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __unary_op) +std::transform cpp_src/stl_algo.h /^ transform(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _OutputIterator __result, _BinaryOperation __binary_op) +std::type_info cpp_src/typeinfo /^ class type_info $/;" c namespace:std file: +std::type_info::__do_catch cpp_src/typeinfo /^ virtual bool __do_catch(const type_info *__thr_type, void **__thr_obj,$/;" p class:std::type_info file: access:public signature:(const type_info *__thr_type, void **__thr_obj, unsigned __outer) const +std::type_info::__do_upcast cpp_src/typeinfo /^ virtual bool __do_upcast(const __cxxabiv1::__class_type_info *__target,$/;" p class:std::type_info file: access:public signature:(const __cxxabiv1::__class_type_info *__target, void **__obj_ptr) const +std::type_info::__is_function_p cpp_src/typeinfo /^ virtual bool __is_function_p() const;$/;" p class:std::type_info file: access:public signature:() const +std::type_info::__is_pointer_p cpp_src/typeinfo /^ virtual bool __is_pointer_p() const;$/;" p class:std::type_info file: access:public signature:() const +std::type_info::__name cpp_src/typeinfo /^ const char *__name;$/;" m class:std::type_info file: access:protected +std::type_info::before cpp_src/typeinfo /^ bool before(const type_info& __arg) const$/;" f class:std::type_info access:public signature:(const type_info& __arg) const +std::type_info::before cpp_src/typeinfo /^ bool before(const type_info& __arg) const;$/;" p class:std::type_info file: access:public signature:(const type_info& __arg) const +std::type_info::name cpp_src/typeinfo /^ const char* name() const$/;" f class:std::type_info access:public signature:() const +std::type_info::operator != cpp_src/typeinfo /^ bool operator!=(const type_info& __arg) const$/;" f class:std::type_info access:public signature:(const type_info& __arg) const +std::type_info::operator = cpp_src/typeinfo /^ type_info& operator=(const type_info&);$/;" p class:std::type_info file: access:private signature:(const type_info&) +std::type_info::operator == cpp_src/typeinfo /^ bool operator==(const type_info& __arg) const$/;" f class:std::type_info access:public signature:(const type_info& __arg) const +std::type_info::operator == cpp_src/typeinfo /^ bool operator==(const type_info& __arg) const;$/;" p class:std::type_info file: access:public signature:(const type_info& __arg) const +std::type_info::type_info cpp_src/typeinfo /^ explicit type_info(const char *__n): __name(__n) { }$/;" f class:std::type_info access:protected signature:(const char *__n) +std::type_info::type_info cpp_src/typeinfo /^ type_info(const type_info&);$/;" p class:std::type_info file: access:private signature:(const type_info&) +std::type_info::~type_info cpp_src/typeinfo /^ virtual ~type_info();$/;" p class:std::type_info file: access:public signature:() +std::unary_function cpp_src/stl_function.h /^ struct unary_function$/;" s namespace:std +std::unary_function::argument_type cpp_src/stl_function.h /^ typedef _Arg argument_type; \/\/\/< @c argument_type is the type of the$/;" t struct:std::unary_function access:public +std::unary_function::result_type cpp_src/stl_function.h /^ typedef _Result result_type; \/\/\/< @c result_type is the return type$/;" t struct:std::unary_function access:public +std::unary_negate cpp_src/stl_function.h /^ class unary_negate$/;" c namespace:std inherits:unary_function +std::unary_negate::_M_pred cpp_src/stl_function.h /^ _Predicate _M_pred;$/;" m class:std::unary_negate access:protected +std::unary_negate::operator () cpp_src/stl_function.h /^ operator()(const typename _Predicate::argument_type& __x) const$/;" f class:std::unary_negate access:public signature:(const typename _Predicate::argument_type& __x) const +std::unary_negate::unary_negate cpp_src/stl_function.h /^ unary_negate(const _Predicate& __x) : _M_pred(__x) {}$/;" f class:std::unary_negate access:public signature:(const _Predicate& __x) +std::uncaught_exception cpp_src/exception /^ bool uncaught_exception() throw();$/;" p namespace:std file: signature:() +std::underflow_error cpp_src/stdexcept /^ class underflow_error : public runtime_error $/;" c namespace:std file: inherits:runtime_error +std::underflow_error::underflow_error cpp_src/stdexcept /^ explicit underflow_error(const string& __arg);$/;" p class:std::underflow_error file: access:public signature:(const string& __arg) +std::unexpected cpp_src/exception /^ void unexpected() __attribute__ ((__noreturn__));$/;" p namespace:std file: signature:() +std::unexpected_handler cpp_src/exception /^ typedef void (*unexpected_handler) ();$/;" t namespace:std file: +std::uninitialized_copy cpp_src/stl_uninitialized.h /^ uninitialized_copy(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _ForwardIterator __result) +std::uninitialized_copy cpp_src/stl_uninitialized.h /^ uninitialized_copy(const char* __first, const char* __last, char* __result)$/;" f namespace:std signature:(const char* __first, const char* __last, char* __result) +std::uninitialized_copy cpp_src/stl_uninitialized.h /^ uninitialized_copy(const wchar_t* __first, const wchar_t* __last,$/;" f namespace:std signature:(const wchar_t* __first, const wchar_t* __last, wchar_t* __result) +std::uninitialized_fill cpp_src/stl_uninitialized.h /^ uninitialized_fill(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x) +std::uninitialized_fill_n cpp_src/stl_uninitialized.h /^ uninitialized_fill_n(_ForwardIterator __first, _Size __n, const _Tp& __x)$/;" f namespace:std signature:(_ForwardIterator __first, _Size __n, const _Tp& __x) +std::unique cpp_src/stl_algo.h /^ unique(_ForwardIterator __first, _ForwardIterator __last)$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last) +std::unique cpp_src/stl_algo.h /^ unique(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __binary_pred) +std::unique_copy cpp_src/stl_algo.h /^ unique_copy(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _OutputIterator __result) +std::unique_copy cpp_src/stl_algo.h /^ unique_copy(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __binary_pred) +std::unitbuf cpp_src/ios_base.h /^ unitbuf(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +std::upper_bound cpp_src/stl_algo.h /^ upper_bound(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val) +std::upper_bound cpp_src/stl_algo.h /^ upper_bound(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val, _Compare __comp) +std::uppercase cpp_src/ios_base.h /^ uppercase(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +std::use_facet cpp_src/locale_facets.h /^ use_facet >(const locale& __loc);$/;" p namespace:std signature:(const locale& __loc) +std::use_facet cpp_src/locale_facets.h /^ use_facet >(const locale& __loc);$/;" p namespace:std signature:(const locale& __loc) +std::use_facet cpp_src/locale_facets.tcc /^ use_facet(const locale& __loc)$/;" f namespace:std signature:(const locale& __loc) +std::use_facet cpp_src/locale_facets.tcc /^ use_facet<__timepunct >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::use_facet cpp_src/locale_facets.tcc /^ use_facet<__timepunct >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::use_facet cpp_src/locale_facets.tcc /^ use_facet >(locale const&);$/;" p namespace:std file: signature:(locale const&) +std::use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +std::use_facet cpp_src/localefwd.h /^ use_facet(const locale& __loc);$/;" p namespace:std signature:(const locale& __loc) +std::valarray cpp_src/valarray /^ class valarray$/;" c namespace:std file: +std::valarray::_M_data cpp_src/valarray /^ _Tp* __restrict__ _M_data;$/;" m class:std::valarray file: access:private +std::valarray::_M_size cpp_src/valarray /^ size_t _M_size;$/;" m class:std::valarray file: access:private +std::valarray::_UnaryOp cpp_src/valarray /^ struct _UnaryOp $/;" s class:std::valarray file: access:private +std::valarray::_UnaryOp::_Rt cpp_src/valarray /^ typedef _Expr<_UnClos<_Op, _ValArray, _Tp>, __rt> _Rt;$/;" t struct:std::valarray::_UnaryOp file: access:public +std::valarray::_UnaryOp::__rt cpp_src/valarray /^ typedef typename __fun<_Op, _Tp>::result_type __rt;$/;" t struct:std::valarray::_UnaryOp file: access:public +std::valarray::cshift cpp_src/valarray /^ valarray<_Tp> cshift(int) const;$/;" p class:std::valarray file: access:public signature:(int) const +std::valarray::cshift cpp_src/valarray /^ valarray<_Tp>::cshift(int __n) const$/;" f class:std::valarray signature:(int __n) const +std::valarray::func cpp_src/valarray /^ _Expr<_RefFunClos<_ValArray, _Tp>, _Tp> apply(_Tp func(const _Tp&)) const;$/;" p class:std::valarray file: access:public signature:(const _Tp&) const +std::valarray::func cpp_src/valarray /^ _Expr<_ValFunClos<_ValArray, _Tp>, _Tp> apply(_Tp func(_Tp)) const;$/;" p class:std::valarray file: access:public signature:(_Tp) const +std::valarray::func cpp_src/valarray /^ valarray<_Tp>::apply(_Tp func(_Tp)) const$/;" f class:std::valarray signature:(_Tp) const +std::valarray::func cpp_src/valarray /^ valarray<_Tp>::apply(_Tp func(const _Tp &)) const$/;" f class:std::valarray signature:(const _Tp &) const +std::valarray::max cpp_src/valarray /^ _Tp max() const; $/;" p class:std::valarray file: access:public signature:() const +std::valarray::max cpp_src/valarray /^ valarray<_Tp>::max() const$/;" f class:std::valarray signature:() const +std::valarray::min cpp_src/valarray /^ _Tp min() const; $/;" p class:std::valarray file: access:public signature:() const +std::valarray::min cpp_src/valarray /^ valarray<_Tp>::min() const$/;" f class:std::valarray signature:() const +std::valarray::operator ! cpp_src/valarray /^ typename _UnaryOp<__logical_not>::_Rt operator!() const;$/;" p class:std::valarray file: access:public signature:() const +std::valarray::operator %= cpp_src/valarray /^ valarray<_Tp>& operator%=(const _Expr<_Dom, _Tp>&);$/;" p class:std::valarray file: access:public signature:(const _Expr<_Dom, _Tp>&) +std::valarray::operator %= cpp_src/valarray /^ valarray<_Tp>& operator%=(const _Tp&);$/;" p class:std::valarray file: access:public signature:(const _Tp&) +std::valarray::operator %= cpp_src/valarray /^ valarray<_Tp>& operator%=(const valarray<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const valarray<_Tp>&) +std::valarray::operator &= cpp_src/valarray /^ valarray<_Tp>& operator&=(const _Expr<_Dom, _Tp>&);$/;" p class:std::valarray file: access:public signature:(const _Expr<_Dom, _Tp>&) +std::valarray::operator &= cpp_src/valarray /^ valarray<_Tp>& operator&=(const _Tp&);$/;" p class:std::valarray file: access:public signature:(const _Tp&) +std::valarray::operator &= cpp_src/valarray /^ valarray<_Tp>& operator&=(const valarray<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const valarray<_Tp>&) +std::valarray::operator *= cpp_src/valarray /^ valarray<_Tp>& operator*=(const _Expr<_Dom, _Tp>&);$/;" p class:std::valarray file: access:public signature:(const _Expr<_Dom, _Tp>&) +std::valarray::operator *= cpp_src/valarray /^ valarray<_Tp>& operator*=(const _Tp&);$/;" p class:std::valarray file: access:public signature:(const _Tp&) +std::valarray::operator *= cpp_src/valarray /^ valarray<_Tp>& operator*=(const valarray<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const valarray<_Tp>&) +std::valarray::operator + cpp_src/valarray /^ typename _UnaryOp<__unary_plus>::_Rt operator+() const;$/;" p class:std::valarray file: access:public signature:() const +std::valarray::operator += cpp_src/valarray /^ valarray<_Tp>& operator+=(const _Expr<_Dom, _Tp>&);$/;" p class:std::valarray file: access:public signature:(const _Expr<_Dom, _Tp>&) +std::valarray::operator += cpp_src/valarray /^ valarray<_Tp>& operator+=(const _Tp&);$/;" p class:std::valarray file: access:public signature:(const _Tp&) +std::valarray::operator += cpp_src/valarray /^ valarray<_Tp>& operator+=(const valarray<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const valarray<_Tp>&) +std::valarray::operator - cpp_src/valarray /^ typename _UnaryOp<__negate>::_Rt operator-() const;$/;" p class:std::valarray file: access:public signature:() const +std::valarray::operator -= cpp_src/valarray /^ valarray<_Tp>& operator-=(const _Expr<_Dom, _Tp>&);$/;" p class:std::valarray file: access:public signature:(const _Expr<_Dom, _Tp>&) +std::valarray::operator -= cpp_src/valarray /^ valarray<_Tp>& operator-=(const _Tp&);$/;" p class:std::valarray file: access:public signature:(const _Tp&) +std::valarray::operator -= cpp_src/valarray /^ valarray<_Tp>& operator-=(const valarray<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const valarray<_Tp>&) +std::valarray::operator /= cpp_src/valarray /^ valarray<_Tp>& operator\/=(const _Expr<_Dom, _Tp>&);$/;" p class:std::valarray file: access:public signature:(const _Expr<_Dom, _Tp>&) +std::valarray::operator /= cpp_src/valarray /^ valarray<_Tp>& operator\/=(const _Tp&);$/;" p class:std::valarray file: access:public signature:(const _Tp&) +std::valarray::operator /= cpp_src/valarray /^ valarray<_Tp>& operator\/=(const valarray<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const valarray<_Tp>&) +std::valarray::operator <<= cpp_src/valarray /^ valarray<_Tp>& operator<<=(const _Expr<_Dom, _Tp>&);$/;" p class:std::valarray file: access:public signature:(const _Expr<_Dom, _Tp>&) +std::valarray::operator <<= cpp_src/valarray /^ valarray<_Tp>& operator<<=(const _Tp&);$/;" p class:std::valarray file: access:public signature:(const _Tp&) +std::valarray::operator <<= cpp_src/valarray /^ valarray<_Tp>& operator<<=(const valarray<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const valarray<_Tp>&) +std::valarray::operator = cpp_src/valarray /^ operator= (const _Expr<_Dom, _Tp>&);$/;" p class:std::valarray file: access:public signature:(const _Expr<_Dom, _Tp>&) +std::valarray::operator = cpp_src/valarray /^ valarray<_Tp>& operator=(const _Tp&);$/;" p class:std::valarray file: access:public signature:(const _Tp&) +std::valarray::operator = cpp_src/valarray /^ valarray<_Tp>& operator=(const gslice_array<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const gslice_array<_Tp>&) +std::valarray::operator = cpp_src/valarray /^ valarray<_Tp>& operator=(const indirect_array<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const indirect_array<_Tp>&) +std::valarray::operator = cpp_src/valarray /^ valarray<_Tp>& operator=(const mask_array<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const mask_array<_Tp>&) +std::valarray::operator = cpp_src/valarray /^ valarray<_Tp>& operator=(const slice_array<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const slice_array<_Tp>&) +std::valarray::operator = cpp_src/valarray /^ valarray<_Tp>& operator=(const valarray<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const valarray<_Tp>&) +std::valarray::operator = cpp_src/valarray /^ valarray<_Tp>::operator=(const _Expr<_Dom, _Tp>& __e)$/;" f class:std::valarray signature:(const _Expr<_Dom, _Tp>& __e) +std::valarray::operator = cpp_src/valarray /^ valarray<_Tp>::operator=(const _Tp& __t)$/;" f class:std::valarray signature:(const _Tp& __t) +std::valarray::operator = cpp_src/valarray /^ valarray<_Tp>::operator=(const gslice_array<_Tp>& __ga)$/;" f class:std::valarray signature:(const gslice_array<_Tp>& __ga) +std::valarray::operator = cpp_src/valarray /^ valarray<_Tp>::operator=(const indirect_array<_Tp>& __ia)$/;" f class:std::valarray signature:(const indirect_array<_Tp>& __ia) +std::valarray::operator = cpp_src/valarray /^ valarray<_Tp>::operator=(const mask_array<_Tp>& __ma)$/;" f class:std::valarray signature:(const mask_array<_Tp>& __ma) +std::valarray::operator = cpp_src/valarray /^ valarray<_Tp>::operator=(const slice_array<_Tp>& __sa)$/;" f class:std::valarray signature:(const slice_array<_Tp>& __sa) +std::valarray::operator = cpp_src/valarray /^ valarray<_Tp>::operator=(const valarray<_Tp>& __v)$/;" f class:std::valarray signature:(const valarray<_Tp>& __v) +std::valarray::operator >>= cpp_src/valarray /^ valarray<_Tp>& operator>>=(const _Expr<_Dom, _Tp>&);$/;" p class:std::valarray file: access:public signature:(const _Expr<_Dom, _Tp>&) +std::valarray::operator >>= cpp_src/valarray /^ valarray<_Tp>& operator>>=(const _Tp&);$/;" p class:std::valarray file: access:public signature:(const _Tp&) +std::valarray::operator >>= cpp_src/valarray /^ valarray<_Tp>& operator>>=(const valarray<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const valarray<_Tp>&) +std::valarray::operator [] cpp_src/valarray /^ operator[](const valarray&) const;$/;" p class:std::valarray file: access:public signature:(const valarray&) const +std::valarray::operator [] cpp_src/valarray /^ _Expr<_GClos<_ValArray, _Tp>, _Tp> operator[](const gslice&) const;$/;" p class:std::valarray file: access:public signature:(const gslice&) const +std::valarray::operator [] cpp_src/valarray /^ _Expr<_SClos<_ValArray, _Tp>, _Tp> operator[](slice) const;$/;" p class:std::valarray file: access:public signature:(slice) const +std::valarray::operator [] cpp_src/valarray /^ _Tp& operator[](size_t);$/;" p class:std::valarray file: access:public signature:(size_t) +std::valarray::operator [] cpp_src/valarray /^ const _Tp& operator[](size_t) const;$/;" p class:std::valarray file: access:public signature:(size_t) const +std::valarray::operator [] cpp_src/valarray /^ gslice_array<_Tp> operator[](const gslice&);$/;" p class:std::valarray file: access:public signature:(const gslice&) +std::valarray::operator [] cpp_src/valarray /^ indirect_array<_Tp> operator[](const valarray&);$/;" p class:std::valarray file: access:public signature:(const valarray&) +std::valarray::operator [] cpp_src/valarray /^ mask_array<_Tp> operator[](const valarray&);$/;" p class:std::valarray file: access:public signature:(const valarray&) +std::valarray::operator [] cpp_src/valarray /^ slice_array<_Tp> operator[](slice);$/;" p class:std::valarray file: access:public signature:(slice) +std::valarray::operator [] cpp_src/valarray /^ valarray<_Tp> operator[](const valarray&) const;$/;" p class:std::valarray file: access:public signature:(const valarray&) const +std::valarray::operator [] cpp_src/valarray /^ valarray<_Tp>::operator[](const gslice& __gs) const$/;" f class:std::valarray signature:(const gslice& __gs) const +std::valarray::operator [] cpp_src/valarray /^ valarray<_Tp>::operator[](const gslice& __gs)$/;" f class:std::valarray signature:(const gslice& __gs) +std::valarray::operator [] cpp_src/valarray /^ valarray<_Tp>::operator[](const valarray& __m) const$/;" f class:std::valarray signature:(const valarray& __m) const +std::valarray::operator [] cpp_src/valarray /^ valarray<_Tp>::operator[](const valarray& __m)$/;" f class:std::valarray signature:(const valarray& __m) +std::valarray::operator [] cpp_src/valarray /^ valarray<_Tp>::operator[](const valarray& __i) const$/;" f class:std::valarray signature:(const valarray& __i) const +std::valarray::operator [] cpp_src/valarray /^ valarray<_Tp>::operator[](const valarray& __i)$/;" f class:std::valarray signature:(const valarray& __i) +std::valarray::operator [] cpp_src/valarray /^ valarray<_Tp>::operator[](size_t __i) const$/;" f class:std::valarray signature:(size_t __i) const +std::valarray::operator [] cpp_src/valarray /^ valarray<_Tp>::operator[](size_t __i)$/;" f class:std::valarray signature:(size_t __i) +std::valarray::operator [] cpp_src/valarray /^ valarray<_Tp>::operator[](slice __s) const$/;" f class:std::valarray signature:(slice __s) const +std::valarray::operator [] cpp_src/valarray /^ valarray<_Tp>::operator[](slice __s)$/;" f class:std::valarray signature:(slice __s) +std::valarray::operator ^= cpp_src/valarray /^ valarray<_Tp>& operator^=(const _Expr<_Dom, _Tp>&);$/;" p class:std::valarray file: access:public signature:(const _Expr<_Dom, _Tp>&) +std::valarray::operator ^= cpp_src/valarray /^ valarray<_Tp>& operator^=(const _Tp&);$/;" p class:std::valarray file: access:public signature:(const _Tp&) +std::valarray::operator ^= cpp_src/valarray /^ valarray<_Tp>& operator^=(const valarray<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const valarray<_Tp>&) +std::valarray::operator |= cpp_src/valarray /^ valarray<_Tp>& operator|=(const _Expr<_Dom, _Tp>&);$/;" p class:std::valarray file: access:public signature:(const _Expr<_Dom, _Tp>&) +std::valarray::operator |= cpp_src/valarray /^ valarray<_Tp>& operator|=(const _Tp&);$/;" p class:std::valarray file: access:public signature:(const _Tp&) +std::valarray::operator |= cpp_src/valarray /^ valarray<_Tp>& operator|=(const valarray<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const valarray<_Tp>&) +std::valarray::operator ~ cpp_src/valarray /^ typename _UnaryOp<__bitwise_not>::_Rt operator~() const;$/;" p class:std::valarray file: access:public signature:() const +std::valarray::resize cpp_src/valarray /^ void resize(size_t __size, _Tp __c = _Tp());$/;" p class:std::valarray file: access:public signature:(size_t __size, _Tp __c = _Tp()) +std::valarray::resize cpp_src/valarray /^ valarray<_Tp>::resize(size_t __n, _Tp __c)$/;" f class:std::valarray signature:(size_t __n, _Tp __c) +std::valarray::shift cpp_src/valarray /^ valarray<_Tp> shift (int) const;$/;" p class:std::valarray file: access:public signature:(int) const +std::valarray::shift cpp_src/valarray /^ valarray<_Tp>::shift(int __n) const$/;" f class:std::valarray signature:(int __n) const +std::valarray::size cpp_src/valarray /^ size_t size() const;$/;" p class:std::valarray file: access:public signature:() const +std::valarray::size cpp_src/valarray /^ valarray<_Tp>::size() const$/;" f class:std::valarray signature:() const +std::valarray::sum cpp_src/valarray /^ _Tp sum() const;$/;" p class:std::valarray file: access:public signature:() const +std::valarray::sum cpp_src/valarray /^ valarray<_Tp>::sum() const$/;" f class:std::valarray signature:() const +std::valarray::valarray cpp_src/valarray /^ valarray(const _Expr<_Dom, _Tp>& __e);$/;" p class:std::valarray file: access:public signature:(const _Expr<_Dom, _Tp>& __e) +std::valarray::valarray cpp_src/valarray /^ explicit valarray(size_t);$/;" p class:std::valarray file: access:public signature:(size_t) +std::valarray::valarray cpp_src/valarray /^ valarray();$/;" p class:std::valarray file: access:public signature:() +std::valarray::valarray cpp_src/valarray /^ valarray(const _Tp&, size_t);$/;" p class:std::valarray file: access:public signature:(const _Tp&, size_t) +std::valarray::valarray cpp_src/valarray /^ valarray(const _Tp* __restrict__, size_t);$/;" p class:std::valarray file: access:public signature:(const _Tp* __restrict__, size_t) +std::valarray::valarray cpp_src/valarray /^ valarray(const gslice_array<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const gslice_array<_Tp>&) +std::valarray::valarray cpp_src/valarray /^ valarray(const indirect_array<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const indirect_array<_Tp>&) +std::valarray::valarray cpp_src/valarray /^ valarray(const mask_array<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const mask_array<_Tp>&) +std::valarray::valarray cpp_src/valarray /^ valarray(const slice_array<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const slice_array<_Tp>&) +std::valarray::valarray cpp_src/valarray /^ valarray(const valarray&);$/;" p class:std::valarray file: access:public signature:(const valarray&) +std::valarray::valarray cpp_src/valarray /^ valarray<_Tp>::valarray() : _M_size(0), _M_data(0) {}$/;" f class:std::valarray signature:() +std::valarray::valarray cpp_src/valarray /^ valarray<_Tp>::valarray(const _Expr<_Dom, _Tp>& __e)$/;" f class:std::valarray signature:(const _Expr<_Dom, _Tp>& __e) +std::valarray::valarray cpp_src/valarray /^ valarray<_Tp>::valarray(const _Tp& __t, size_t __n)$/;" f class:std::valarray signature:(const _Tp& __t, size_t __n) +std::valarray::valarray cpp_src/valarray /^ valarray<_Tp>::valarray(const _Tp* __restrict__ __p, size_t __n)$/;" f class:std::valarray signature:(const _Tp* __restrict__ __p, size_t __n) +std::valarray::valarray cpp_src/valarray /^ valarray<_Tp>::valarray(const gslice_array<_Tp>& __ga)$/;" f class:std::valarray signature:(const gslice_array<_Tp>& __ga) +std::valarray::valarray cpp_src/valarray /^ valarray<_Tp>::valarray(const indirect_array<_Tp>& __ia)$/;" f class:std::valarray signature:(const indirect_array<_Tp>& __ia) +std::valarray::valarray cpp_src/valarray /^ valarray<_Tp>::valarray(const mask_array<_Tp>& __ma)$/;" f class:std::valarray signature:(const mask_array<_Tp>& __ma) +std::valarray::valarray cpp_src/valarray /^ valarray<_Tp>::valarray(const slice_array<_Tp>& __sa)$/;" f class:std::valarray signature:(const slice_array<_Tp>& __sa) +std::valarray::valarray cpp_src/valarray /^ valarray<_Tp>::valarray(const valarray<_Tp>& __v)$/;" f class:std::valarray signature:(const valarray<_Tp>& __v) +std::valarray::valarray cpp_src/valarray /^ valarray<_Tp>::valarray(size_t __n) $/;" f class:std::valarray signature:(size_t __n) +std::valarray::value_type cpp_src/valarray /^ typedef _Tp value_type;$/;" t class:std::valarray file: access:public +std::valarray::~valarray cpp_src/valarray /^ ~valarray();$/;" p class:std::valarray file: access:public signature:() +std::valarray::~valarray cpp_src/valarray /^ valarray<_Tp>::~valarray()$/;" f class:std::valarray signature:() +std::vector cpp_src/stl_bvector.h /^ class vector : protected _Bvector_base<_Alloc>$/;" c namespace:std inherits:_Bvector_base +std::vector cpp_src/stl_vector.h /^ class vector : protected _Vector_base<_Tp, _Alloc>$/;" c namespace:std inherits:_Vector_base +std::vector::_Alloc_value_type cpp_src/stl_vector.h /^ typedef typename _Alloc::value_type _Alloc_value_type;$/;" t class:std::vector access:private +std::vector::_Base cpp_src/stl_bvector.h /^ typedef _Bvector_base<_Alloc> _Base;$/;" t class:std::vector access:private +std::vector::_Base cpp_src/stl_vector.h /^ typedef _Vector_base<_Tp, _Alloc> _Base;$/;" t class:std::vector access:private +std::vector::_M_allocate_and_copy cpp_src/stl_vector.h /^ _M_allocate_and_copy(size_type __n,$/;" f class:std::vector access:protected signature:(size_type __n, _ForwardIterator __first, _ForwardIterator __last) +std::vector::_M_assign_aux cpp_src/stl_bvector.h /^ _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,$/;" f class:std::vector access:protected signature:(_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) +std::vector::_M_assign_aux cpp_src/stl_bvector.h /^ _M_assign_aux(_InputIterator __first, _InputIterator __last,$/;" f class:std::vector access:protected signature:(_InputIterator __first, _InputIterator __last, std::input_iterator_tag) +std::vector::_M_assign_aux cpp_src/stl_vector.h /^ _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,$/;" p class:std::vector access:protected signature:(_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) +std::vector::_M_assign_aux cpp_src/stl_vector.h /^ _M_assign_aux(_InputIterator __first, _InputIterator __last,$/;" p class:std::vector access:protected signature:(_InputIterator __first, _InputIterator __last, std::input_iterator_tag) +std::vector::_M_assign_aux cpp_src/vector.tcc /^ _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,$/;" f class:std::vector signature:(_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) +std::vector::_M_assign_aux cpp_src/vector.tcc /^ _M_assign_aux(_InputIterator __first, _InputIterator __last,$/;" f class:std::vector signature:(_InputIterator __first, _InputIterator __last, std::input_iterator_tag) +std::vector::_M_assign_dispatch cpp_src/stl_bvector.h /^ _M_assign_dispatch(_InputIterator __first, _InputIterator __last,$/;" f class:std::vector access:protected signature:(_InputIterator __first, _InputIterator __last, __false_type) +std::vector::_M_assign_dispatch cpp_src/stl_bvector.h /^ _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)$/;" f class:std::vector access:protected signature:(_Integer __n, _Integer __val, __true_type) +std::vector::_M_assign_dispatch cpp_src/stl_vector.h /^ _M_assign_dispatch(_InputIterator __first, _InputIterator __last,$/;" f class:std::vector access:protected signature:(_InputIterator __first, _InputIterator __last, __false_type) +std::vector::_M_assign_dispatch cpp_src/stl_vector.h /^ _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)$/;" f class:std::vector access:protected signature:(_Integer __n, _Integer __val, __true_type) +std::vector::_M_copy_aligned cpp_src/stl_bvector.h /^ _M_copy_aligned(const_iterator __first, const_iterator __last,$/;" f class:std::vector access:protected signature:(const_iterator __first, const_iterator __last, iterator __result) +std::vector::_M_erase_at_end cpp_src/stl_bvector.h /^ _M_erase_at_end(iterator __pos)$/;" f class:std::vector access:protected signature:(iterator __pos) +std::vector::_M_erase_at_end cpp_src/stl_vector.h /^ _M_erase_at_end(pointer __pos)$/;" f class:std::vector access:protected signature:(pointer __pos) +std::vector::_M_fill_assign cpp_src/stl_bvector.h /^ _M_fill_assign(size_t __n, bool __x)$/;" f class:std::vector access:protected signature:(size_t __n, bool __x) +std::vector::_M_fill_assign cpp_src/stl_vector.h /^ _M_fill_assign(size_type __n, const value_type& __val);$/;" p class:std::vector access:protected signature:(size_type __n, const value_type& __val) +std::vector::_M_fill_assign cpp_src/vector.tcc /^ _M_fill_assign(size_t __n, const value_type& __val)$/;" f class:std::vector signature:(size_t __n, const value_type& __val) +std::vector::_M_fill_insert cpp_src/stl_bvector.h /^ _M_fill_insert(iterator __position, size_type __n, bool __x)$/;" f class:std::vector access:protected signature:(iterator __position, size_type __n, bool __x) +std::vector::_M_fill_insert cpp_src/stl_vector.h /^ _M_fill_insert(iterator __pos, size_type __n, const value_type& __x);$/;" p class:std::vector access:protected signature:(iterator __pos, size_type __n, const value_type& __x) +std::vector::_M_fill_insert cpp_src/vector.tcc /^ _M_fill_insert(iterator __position, size_type __n, const value_type& __x)$/;" f class:std::vector signature:(iterator __position, size_type __n, const value_type& __x) +std::vector::_M_initialize cpp_src/stl_bvector.h /^ _M_initialize(size_type __n)$/;" f class:std::vector access:protected signature:(size_type __n) +std::vector::_M_initialize_dispatch cpp_src/stl_bvector.h /^ _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,$/;" f class:std::vector access:protected signature:(_InputIterator __first, _InputIterator __last, __false_type) +std::vector::_M_initialize_dispatch cpp_src/stl_bvector.h /^ _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type)$/;" f class:std::vector access:protected signature:(_Integer __n, _Integer __x, __true_type) +std::vector::_M_initialize_dispatch cpp_src/stl_vector.h /^ _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,$/;" f class:std::vector access:protected signature:(_InputIterator __first, _InputIterator __last, __false_type) +std::vector::_M_initialize_dispatch cpp_src/stl_vector.h /^ _M_initialize_dispatch(_Integer __n, _Integer __value, __true_type)$/;" f class:std::vector access:protected signature:(_Integer __n, _Integer __value, __true_type) +std::vector::_M_initialize_range cpp_src/stl_bvector.h /^ _M_initialize_range(_ForwardIterator __first, _ForwardIterator __last,$/;" f class:std::vector access:protected signature:(_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) +std::vector::_M_initialize_range cpp_src/stl_bvector.h /^ _M_initialize_range(_InputIterator __first, _InputIterator __last,$/;" f class:std::vector access:protected signature:(_InputIterator __first, _InputIterator __last, std::input_iterator_tag) +std::vector::_M_insert_aux cpp_src/stl_bvector.h /^ _M_insert_aux(iterator __position, bool __x)$/;" f class:std::vector access:protected signature:(iterator __position, bool __x) +std::vector::_M_insert_aux cpp_src/stl_vector.h /^ _M_insert_aux(iterator __position, const value_type& __x);$/;" p class:std::vector access:protected signature:(iterator __position, const value_type& __x) +std::vector::_M_insert_aux cpp_src/vector.tcc /^ _M_insert_aux(iterator __position, const _Tp& __x)$/;" f class:std::vector signature:(iterator __position, const _Tp& __x) +std::vector::_M_insert_dispatch cpp_src/stl_bvector.h /^ _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x,$/;" f class:std::vector access:protected signature:(iterator __pos, _Integer __n, _Integer __x, __true_type) +std::vector::_M_insert_dispatch cpp_src/stl_bvector.h /^ _M_insert_dispatch(iterator __pos,$/;" f class:std::vector access:protected signature:(iterator __pos, _InputIterator __first, _InputIterator __last, __false_type) +std::vector::_M_insert_dispatch cpp_src/stl_vector.h /^ _M_insert_dispatch(iterator __pos, _InputIterator __first,$/;" f class:std::vector access:protected signature:(iterator __pos, _InputIterator __first, _InputIterator __last, __false_type) +std::vector::_M_insert_dispatch cpp_src/stl_vector.h /^ _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val,$/;" f class:std::vector access:protected signature:(iterator __pos, _Integer __n, _Integer __val, __true_type) +std::vector::_M_insert_range cpp_src/stl_bvector.h /^ _M_insert_range(iterator __pos, _InputIterator __first, $/;" f class:std::vector access:protected signature:(iterator __pos, _InputIterator __first, _InputIterator __last, std::input_iterator_tag) +std::vector::_M_insert_range cpp_src/stl_bvector.h /^ _M_insert_range(iterator __position, _ForwardIterator __first, $/;" f class:std::vector access:protected signature:(iterator __position, _ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) +std::vector::_M_range_check cpp_src/stl_bvector.h /^ _M_range_check(size_type __n) const$/;" f class:std::vector access:protected signature:(size_type __n) const +std::vector::_M_range_check cpp_src/stl_vector.h /^ _M_range_check(size_type __n) const$/;" f class:std::vector access:protected signature:(size_type __n) const +std::vector::_M_range_initialize cpp_src/stl_vector.h /^ _M_range_initialize(_ForwardIterator __first,$/;" f class:std::vector access:protected signature:(_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) +std::vector::_M_range_initialize cpp_src/stl_vector.h /^ _M_range_initialize(_InputIterator __first,$/;" f class:std::vector access:protected signature:(_InputIterator __first, _InputIterator __last, std::input_iterator_tag) +std::vector::_M_range_insert cpp_src/stl_vector.h /^ _M_range_insert(iterator __pos, _ForwardIterator __first,$/;" p class:std::vector access:protected signature:(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) +std::vector::_M_range_insert cpp_src/stl_vector.h /^ _M_range_insert(iterator __pos, _InputIterator __first,$/;" p class:std::vector access:protected signature:(iterator __pos, _InputIterator __first, _InputIterator __last, std::input_iterator_tag) +std::vector::_M_range_insert cpp_src/vector.tcc /^ _M_range_insert(iterator __position, _ForwardIterator __first,$/;" f class:std::vector signature:(iterator __position, _ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) +std::vector::_M_range_insert cpp_src/vector.tcc /^ _M_range_insert(iterator __pos, _InputIterator __first,$/;" f class:std::vector signature:(iterator __pos, _InputIterator __first, _InputIterator __last, std::input_iterator_tag) +std::vector::_Tp_alloc_type cpp_src/stl_vector.h /^ typedef typename _Base::_Tp_alloc_type _Tp_alloc_type;$/;" t class:std::vector access:private +std::vector::allocator_type cpp_src/stl_bvector.h /^ typedef _Alloc allocator_type;$/;" t class:std::vector access:public +std::vector::allocator_type cpp_src/stl_vector.h /^ typedef _Alloc allocator_type;$/;" t class:std::vector access:public +std::vector::assign cpp_src/stl_bvector.h /^ assign(_InputIterator __first, _InputIterator __last)$/;" f class:std::vector access:public signature:(_InputIterator __first, _InputIterator __last) +std::vector::assign cpp_src/stl_bvector.h /^ assign(size_type __n, const bool& __x)$/;" f class:std::vector access:public signature:(size_type __n, const bool& __x) +std::vector::assign cpp_src/stl_vector.h /^ assign(_InputIterator __first, _InputIterator __last)$/;" f class:std::vector access:public signature:(_InputIterator __first, _InputIterator __last) +std::vector::assign cpp_src/stl_vector.h /^ assign(size_type __n, const value_type& __val)$/;" f class:std::vector access:public signature:(size_type __n, const value_type& __val) +std::vector::at cpp_src/stl_bvector.h /^ at(size_type __n) const$/;" f class:std::vector access:public signature:(size_type __n) const +std::vector::at cpp_src/stl_bvector.h /^ at(size_type __n)$/;" f class:std::vector access:public signature:(size_type __n) +std::vector::at cpp_src/stl_vector.h /^ at(size_type __n) const$/;" f class:std::vector access:public signature:(size_type __n) const +std::vector::at cpp_src/stl_vector.h /^ at(size_type __n)$/;" f class:std::vector access:public signature:(size_type __n) +std::vector::back cpp_src/stl_bvector.h /^ back() const$/;" f class:std::vector access:public signature:() const +std::vector::back cpp_src/stl_bvector.h /^ back()$/;" f class:std::vector access:public signature:() +std::vector::back cpp_src/stl_vector.h /^ back() const$/;" f class:std::vector access:public signature:() const +std::vector::back cpp_src/stl_vector.h /^ back()$/;" f class:std::vector access:public signature:() +std::vector::begin cpp_src/stl_bvector.h /^ begin() const$/;" f class:std::vector access:public signature:() const +std::vector::begin cpp_src/stl_bvector.h /^ begin()$/;" f class:std::vector access:public signature:() +std::vector::begin cpp_src/stl_vector.h /^ begin() const$/;" f class:std::vector access:public signature:() const +std::vector::begin cpp_src/stl_vector.h /^ begin()$/;" f class:std::vector access:public signature:() +std::vector::capacity cpp_src/stl_bvector.h /^ capacity() const$/;" f class:std::vector access:public signature:() const +std::vector::capacity cpp_src/stl_vector.h /^ capacity() const$/;" f class:std::vector access:public signature:() const +std::vector::clear cpp_src/stl_bvector.h /^ clear()$/;" f class:std::vector access:public signature:() +std::vector::clear cpp_src/stl_vector.h /^ clear()$/;" f class:std::vector access:public signature:() +std::vector::const_iterator cpp_src/stl_bvector.h /^ typedef _Bit_const_iterator const_iterator;$/;" t class:std::vector access:public +std::vector::const_iterator cpp_src/stl_vector.h /^ const_iterator;$/;" t class:std::vector access:public +std::vector::const_pointer cpp_src/stl_bvector.h /^ typedef const bool* const_pointer;$/;" t class:std::vector access:public +std::vector::const_pointer cpp_src/stl_vector.h /^ typedef typename _Tp_alloc_type::const_pointer const_pointer;$/;" t class:std::vector access:public +std::vector::const_reference cpp_src/stl_bvector.h /^ typedef bool const_reference;$/;" t class:std::vector access:public +std::vector::const_reference cpp_src/stl_vector.h /^ typedef typename _Tp_alloc_type::const_reference const_reference;$/;" t class:std::vector access:public +std::vector::const_reverse_iterator cpp_src/stl_bvector.h /^ typedef std::reverse_iterator const_reverse_iterator;$/;" t class:std::vector access:public +std::vector::const_reverse_iterator cpp_src/stl_vector.h /^ typedef std::reverse_iterator const_reverse_iterator;$/;" t class:std::vector access:public +std::vector::data cpp_src/stl_bvector.h /^ data() { }$/;" f class:std::vector access:public signature:() +std::vector::data cpp_src/stl_vector.h /^ data() const$/;" f class:std::vector access:public signature:() const +std::vector::data cpp_src/stl_vector.h /^ data()$/;" f class:std::vector access:public signature:() +std::vector::difference_type cpp_src/stl_bvector.h /^ typedef ptrdiff_t difference_type;$/;" t class:std::vector access:public +std::vector::difference_type cpp_src/stl_vector.h /^ typedef ptrdiff_t difference_type;$/;" t class:std::vector access:public +std::vector::empty cpp_src/stl_bvector.h /^ empty() const$/;" f class:std::vector access:public signature:() const +std::vector::empty cpp_src/stl_vector.h /^ empty() const$/;" f class:std::vector access:public signature:() const +std::vector::end cpp_src/stl_bvector.h /^ end() const$/;" f class:std::vector access:public signature:() const +std::vector::end cpp_src/stl_bvector.h /^ end()$/;" f class:std::vector access:public signature:() +std::vector::end cpp_src/stl_vector.h /^ end() const$/;" f class:std::vector access:public signature:() const +std::vector::end cpp_src/stl_vector.h /^ end()$/;" f class:std::vector access:public signature:() +std::vector::erase cpp_src/stl_bvector.h /^ erase(iterator __first, iterator __last)$/;" f class:std::vector access:public signature:(iterator __first, iterator __last) +std::vector::erase cpp_src/stl_bvector.h /^ erase(iterator __position)$/;" f class:std::vector access:public signature:(iterator __position) +std::vector::erase cpp_src/stl_vector.h /^ erase(iterator __first, iterator __last);$/;" p class:std::vector access:public signature:(iterator __first, iterator __last) +std::vector::erase cpp_src/stl_vector.h /^ erase(iterator __position);$/;" p class:std::vector access:public signature:(iterator __position) +std::vector::erase cpp_src/vector.tcc /^ erase(iterator __first, iterator __last)$/;" f class:std::vector signature:(iterator __first, iterator __last) +std::vector::erase cpp_src/vector.tcc /^ erase(iterator __position)$/;" f class:std::vector signature:(iterator __position) +std::vector::flip cpp_src/stl_bvector.h /^ flip()$/;" f class:std::vector access:public signature:() +std::vector::front cpp_src/stl_bvector.h /^ front() const$/;" f class:std::vector access:public signature:() const +std::vector::front cpp_src/stl_bvector.h /^ front()$/;" f class:std::vector access:public signature:() +std::vector::front cpp_src/stl_vector.h /^ front() const$/;" f class:std::vector access:public signature:() const +std::vector::front cpp_src/stl_vector.h /^ front()$/;" f class:std::vector access:public signature:() +std::vector::get_allocator cpp_src/stl_bvector.h /^ allocator_type get_allocator() const$/;" f class:std::vector access:public signature:() const +std::vector::insert cpp_src/stl_bvector.h /^ insert(iterator __position,$/;" f class:std::vector access:public signature:(iterator __position, _InputIterator __first, _InputIterator __last) +std::vector::insert cpp_src/stl_bvector.h /^ insert(iterator __position, const bool& __x = bool())$/;" f class:std::vector access:public signature:(iterator __position, const bool& __x = bool()) +std::vector::insert cpp_src/stl_bvector.h /^ insert(iterator __position, size_type __n, const bool& __x)$/;" f class:std::vector access:public signature:(iterator __position, size_type __n, const bool& __x) +std::vector::insert cpp_src/stl_vector.h /^ insert(iterator __position, _InputIterator __first,$/;" f class:std::vector access:public signature:(iterator __position, _InputIterator __first, _InputIterator __last) +std::vector::insert cpp_src/stl_vector.h /^ insert(iterator __position, const value_type& __x);$/;" p class:std::vector access:public signature:(iterator __position, const value_type& __x) +std::vector::insert cpp_src/stl_vector.h /^ insert(iterator __position, size_type __n, const value_type& __x)$/;" f class:std::vector access:public signature:(iterator __position, size_type __n, const value_type& __x) +std::vector::insert cpp_src/vector.tcc /^ insert(iterator __position, const value_type& __x)$/;" f class:std::vector signature:(iterator __position, const value_type& __x) +std::vector::iterator cpp_src/stl_bvector.h /^ typedef _Bit_iterator iterator;$/;" t class:std::vector access:public +std::vector::iterator cpp_src/stl_vector.h /^ typedef __gnu_cxx::__normal_iterator iterator;$/;" t class:std::vector access:public +std::vector::max_size cpp_src/stl_bvector.h /^ max_size() const$/;" f class:std::vector access:public signature:() const +std::vector::max_size cpp_src/stl_vector.h /^ max_size() const$/;" f class:std::vector access:public signature:() const +std::vector::operator = cpp_src/stl_bvector.h /^ operator=(const vector& __x)$/;" f class:std::vector access:public signature:(const vector& __x) +std::vector::operator = cpp_src/stl_vector.h /^ operator=(const vector& __x);$/;" p class:std::vector access:public signature:(const vector& __x) +std::vector::operator = cpp_src/vector.tcc /^ operator=(const vector<_Tp, _Alloc>& __x)$/;" f class:std::vector signature:(const vector<_Tp, _Alloc>& __x) +std::vector::operator [] cpp_src/stl_bvector.h /^ operator[](size_type __n) const$/;" f class:std::vector access:public signature:(size_type __n) const +std::vector::operator [] cpp_src/stl_bvector.h /^ operator[](size_type __n)$/;" f class:std::vector access:public signature:(size_type __n) +std::vector::operator [] cpp_src/stl_vector.h /^ operator[](size_type __n) const$/;" f class:std::vector access:public signature:(size_type __n) const +std::vector::operator [] cpp_src/stl_vector.h /^ operator[](size_type __n)$/;" f class:std::vector access:public signature:(size_type __n) +std::vector::pointer cpp_src/stl_bvector.h /^ typedef _Bit_reference* pointer;$/;" t class:std::vector access:public +std::vector::pointer cpp_src/stl_vector.h /^ typedef typename _Tp_alloc_type::pointer pointer;$/;" t class:std::vector access:public +std::vector::pop_back cpp_src/stl_bvector.h /^ pop_back()$/;" f class:std::vector access:public signature:() +std::vector::pop_back cpp_src/stl_vector.h /^ pop_back()$/;" f class:std::vector access:public signature:() +std::vector::push_back cpp_src/stl_bvector.h /^ push_back(bool __x)$/;" f class:std::vector access:public signature:(bool __x) +std::vector::push_back cpp_src/stl_vector.h /^ push_back(const value_type& __x)$/;" f class:std::vector access:public signature:(const value_type& __x) +std::vector::rbegin cpp_src/stl_bvector.h /^ rbegin() const$/;" f class:std::vector access:public signature:() const +std::vector::rbegin cpp_src/stl_bvector.h /^ rbegin()$/;" f class:std::vector access:public signature:() +std::vector::rbegin cpp_src/stl_vector.h /^ rbegin() const$/;" f class:std::vector access:public signature:() const +std::vector::rbegin cpp_src/stl_vector.h /^ rbegin()$/;" f class:std::vector access:public signature:() +std::vector::reference cpp_src/stl_bvector.h /^ typedef _Bit_reference reference;$/;" t class:std::vector access:public +std::vector::reference cpp_src/stl_vector.h /^ typedef typename _Tp_alloc_type::reference reference;$/;" t class:std::vector access:public +std::vector::rend cpp_src/stl_bvector.h /^ rend() const$/;" f class:std::vector access:public signature:() const +std::vector::rend cpp_src/stl_bvector.h /^ rend()$/;" f class:std::vector access:public signature:() +std::vector::rend cpp_src/stl_vector.h /^ rend() const$/;" f class:std::vector access:public signature:() const +std::vector::rend cpp_src/stl_vector.h /^ rend()$/;" f class:std::vector access:public signature:() +std::vector::reserve cpp_src/stl_bvector.h /^ reserve(size_type __n)$/;" f class:std::vector access:public signature:(size_type __n) +std::vector::reserve cpp_src/stl_vector.h /^ reserve(size_type __n);$/;" p class:std::vector access:public signature:(size_type __n) +std::vector::reserve cpp_src/vector.tcc /^ reserve(size_type __n)$/;" f class:std::vector signature:(size_type __n) +std::vector::resize cpp_src/stl_bvector.h /^ resize(size_type __new_size, bool __x = bool())$/;" f class:std::vector access:public signature:(size_type __new_size, bool __x = bool()) +std::vector::resize cpp_src/stl_vector.h /^ resize(size_type __new_size, value_type __x = value_type())$/;" f class:std::vector access:public signature:(size_type __new_size, value_type __x = value_type()) +std::vector::reverse_iterator cpp_src/stl_bvector.h /^ typedef std::reverse_iterator reverse_iterator;$/;" t class:std::vector access:public +std::vector::reverse_iterator cpp_src/stl_vector.h /^ typedef std::reverse_iterator reverse_iterator;$/;" t class:std::vector access:public +std::vector::size cpp_src/stl_bvector.h /^ size() const$/;" f class:std::vector access:public signature:() const +std::vector::size cpp_src/stl_vector.h /^ size() const$/;" f class:std::vector access:public signature:() const +std::vector::size_type cpp_src/stl_bvector.h /^ typedef size_t size_type;$/;" t class:std::vector access:public +std::vector::size_type cpp_src/stl_vector.h /^ typedef size_t size_type;$/;" t class:std::vector access:public +std::vector::swap cpp_src/stl_bvector.h /^ swap(reference __x, reference __y)$/;" f class:std::vector access:public signature:(reference __x, reference __y) +std::vector::swap cpp_src/stl_bvector.h /^ swap(vector& __x)$/;" f class:std::vector access:public signature:(vector& __x) +std::vector::swap cpp_src/stl_vector.h /^ swap(vector& __x)$/;" f class:std::vector access:public signature:(vector& __x) +std::vector::value_type cpp_src/stl_bvector.h /^ typedef bool value_type;$/;" t class:std::vector access:public +std::vector::value_type cpp_src/stl_vector.h /^ typedef _Tp value_type;$/;" t class:std::vector access:public +std::vector::vector cpp_src/stl_bvector.h /^ vector(_InputIterator __first, _InputIterator __last,$/;" f class:std::vector access:public signature:(_InputIterator __first, _InputIterator __last, const allocator_type& __a = allocator_type()) +std::vector::vector cpp_src/stl_bvector.h /^ vector(const allocator_type& __a = allocator_type())$/;" f class:std::vector access:public signature:(const allocator_type& __a = allocator_type()) +std::vector::vector cpp_src/stl_bvector.h /^ vector(const vector& __x)$/;" f class:std::vector access:public signature:(const vector& __x) +std::vector::vector cpp_src/stl_bvector.h /^ vector(size_type __n, const bool& __value = bool(), $/;" f class:std::vector access:public signature:(size_type __n, const bool& __value = bool(), const allocator_type& __a = allocator_type()) +std::vector::vector cpp_src/stl_vector.h /^ vector(_InputIterator __first, _InputIterator __last,$/;" f class:std::vector access:public signature:(_InputIterator __first, _InputIterator __last, const allocator_type& __a = allocator_type()) +std::vector::vector cpp_src/stl_vector.h /^ vector(const allocator_type& __a = allocator_type())$/;" f class:std::vector access:public signature:(const allocator_type& __a = allocator_type()) +std::vector::vector cpp_src/stl_vector.h /^ vector(const vector& __x)$/;" f class:std::vector access:public signature:(const vector& __x) +std::vector::vector cpp_src/stl_vector.h /^ vector(size_type __n, const value_type& __value = value_type(),$/;" f class:std::vector access:public signature:(size_type __n, const value_type& __value = value_type(), const allocator_type& __a = allocator_type()) +std::vector::vector_type cpp_src/stl_vector.h /^ typedef vector<_Tp, _Alloc> vector_type;$/;" t class:std::vector access:private +std::vector::~vector cpp_src/stl_bvector.h /^ ~vector() { }$/;" f class:std::vector access:public signature:() +std::vector::~vector cpp_src/stl_vector.h /^ ~vector()$/;" f class:std::vector access:public signature:() +std::wcschr cpp_src/cwchar /^ wcschr(wchar_t* __p, wchar_t __c)$/;" f namespace:std signature:(wchar_t* __p, wchar_t __c) +std::wcspbrk cpp_src/cwchar /^ wcspbrk(wchar_t* __s1, const wchar_t* __s2)$/;" f namespace:std signature:(wchar_t* __s1, const wchar_t* __s2) +std::wcsrchr cpp_src/cwchar /^ wcsrchr(wchar_t* __p, wchar_t __c)$/;" f namespace:std signature:(wchar_t* __p, wchar_t __c) +std::wcsstr cpp_src/cwchar /^ wcsstr(wchar_t* __s1, const wchar_t* __s2)$/;" f namespace:std signature:(wchar_t* __s1, const wchar_t* __s2) +std::wfilebuf cpp_src/iosfwd /^ typedef basic_filebuf wfilebuf; \/\/\/< @isiosfwd$/;" t namespace:std file: +std::wfstream cpp_src/iosfwd /^ typedef basic_fstream wfstream; \/\/\/< @isiosfwd$/;" t namespace:std file: +std::wifstream cpp_src/iosfwd /^ typedef basic_ifstream wifstream; \/\/\/< @isiosfwd$/;" t namespace:std file: +std::wios cpp_src/iosfwd /^ typedef basic_ios wios; \/\/\/< @isiosfwd$/;" t namespace:std file: +std::wiostream cpp_src/iosfwd /^ typedef basic_iostream wiostream; \/\/\/< @isiosfwd$/;" t namespace:std file: +std::wistream cpp_src/iosfwd /^ typedef basic_istream wistream; \/\/\/< @isiosfwd$/;" t namespace:std file: +std::wistream::_M_extract cpp_src/istream.tcc /^ extern template wistream& wistream::_M_extract(bool&);$/;" p class:std::wistream file: signature:(bool&) +std::wistream::_M_extract cpp_src/istream.tcc /^ extern template wistream& wistream::_M_extract(double&);$/;" p class:std::wistream file: signature:(double&) +std::wistream::_M_extract cpp_src/istream.tcc /^ extern template wistream& wistream::_M_extract(float&);$/;" p class:std::wistream file: signature:(float&) +std::wistream::_M_extract cpp_src/istream.tcc /^ extern template wistream& wistream::_M_extract(long double&);$/;" p class:std::wistream file: signature:(long double&) +std::wistream::_M_extract cpp_src/istream.tcc /^ extern template wistream& wistream::_M_extract(long long&);$/;" p class:std::wistream file: signature:(long long&) +std::wistream::_M_extract cpp_src/istream.tcc /^ extern template wistream& wistream::_M_extract(long&);$/;" p class:std::wistream file: signature:(long&) +std::wistream::_M_extract cpp_src/istream.tcc /^ extern template wistream& wistream::_M_extract(unsigned int&); $/;" p class:std::wistream file: signature:(unsigned int&) +std::wistream::_M_extract cpp_src/istream.tcc /^ extern template wistream& wistream::_M_extract(unsigned long long&);$/;" p class:std::wistream file: signature:(unsigned long long&) +std::wistream::_M_extract cpp_src/istream.tcc /^ extern template wistream& wistream::_M_extract(unsigned long&);$/;" p class:std::wistream file: signature:(unsigned long&) +std::wistream::_M_extract cpp_src/istream.tcc /^ extern template wistream& wistream::_M_extract(unsigned short&);$/;" p class:std::wistream file: signature:(unsigned short&) +std::wistream::_M_extract cpp_src/istream.tcc /^ extern template wistream& wistream::_M_extract(void*&);$/;" p class:std::wistream file: signature:(void*&) +std::wistringstream cpp_src/iosfwd /^ typedef basic_istringstream wistringstream; \/\/\/< @isiosfwd$/;" t namespace:std file: +std::wmemchr cpp_src/cwchar /^ wmemchr(wchar_t* __p, wchar_t __c, size_t __n)$/;" f namespace:std signature:(wchar_t* __p, wchar_t __c, size_t __n) +std::wofstream cpp_src/iosfwd /^ typedef basic_ofstream wofstream; \/\/\/< @isiosfwd$/;" t namespace:std file: +std::wostream cpp_src/iosfwd /^ typedef basic_ostream wostream; \/\/\/< @isiosfwd$/;" t namespace:std file: +std::wostream::_M_insert cpp_src/ostream.tcc /^ extern template wostream& wostream::_M_insert(bool);$/;" p class:std::wostream file: signature:(bool) +std::wostream::_M_insert cpp_src/ostream.tcc /^ extern template wostream& wostream::_M_insert(const void*);$/;" p class:std::wostream file: signature:(const void*) +std::wostream::_M_insert cpp_src/ostream.tcc /^ extern template wostream& wostream::_M_insert(double);$/;" p class:std::wostream file: signature:(double) +std::wostream::_M_insert cpp_src/ostream.tcc /^ extern template wostream& wostream::_M_insert(long double);$/;" p class:std::wostream file: signature:(long double) +std::wostream::_M_insert cpp_src/ostream.tcc /^ extern template wostream& wostream::_M_insert(long long);$/;" p class:std::wostream file: signature:(long long) +std::wostream::_M_insert cpp_src/ostream.tcc /^ extern template wostream& wostream::_M_insert(long);$/;" p class:std::wostream file: signature:(long) +std::wostream::_M_insert cpp_src/ostream.tcc /^ extern template wostream& wostream::_M_insert(unsigned long long);$/;" p class:std::wostream file: signature:(unsigned long long) +std::wostream::_M_insert cpp_src/ostream.tcc /^ extern template wostream& wostream::_M_insert(unsigned long);$/;" p class:std::wostream file: signature:(unsigned long) +std::wostringstream cpp_src/iosfwd /^ typedef basic_ostringstream wostringstream; \/\/\/< @isiosfwd$/;" t namespace:std file: +std::ws cpp_src/istream /^ ws(basic_istream<_CharT, _Traits>& __is);$/;" p namespace:std file: signature:(basic_istream<_CharT, _Traits>& __is) +std::ws cpp_src/istream.tcc /^ ws(basic_istream<_CharT,_Traits>& __in)$/;" f namespace:std signature:(basic_istream<_CharT,_Traits>& __in) +std::ws cpp_src/istream.tcc /^ extern template istream& ws(istream&);$/;" p namespace:std file: signature:(istream&) +std::ws cpp_src/istream.tcc /^ extern template wistream& ws(wistream&);$/;" p namespace:std file: signature:(wistream&) +std::wstreambuf cpp_src/iosfwd /^ typedef basic_streambuf wstreambuf; \/\/\/< @isiosfwd$/;" t namespace:std file: +std::wstreampos cpp_src/postypes.h /^ typedef fpos wstreampos;$/;" t namespace:std +std::wstring cpp_src/stringfwd.h /^ typedef basic_string wstring;$/;" t namespace:std +std::wstringbuf cpp_src/iosfwd /^ typedef basic_stringbuf wstringbuf; \/\/\/< @isiosfwd$/;" t namespace:std file: +std::wstringstream cpp_src/iosfwd /^ typedef basic_stringstream wstringstream; \/\/\/< @isiosfwd$/;" t namespace:std file: +stossc cpp_src/streambuf /^ stossc() $/;" f class:std::basic_streambuf access:public signature:() +str cpp_src/sstream /^ str() const$/;" f class:std::basic_istringstream access:public signature:() const +str cpp_src/sstream /^ str() const$/;" f class:std::basic_ostringstream access:public signature:() const +str cpp_src/sstream /^ str() const$/;" f class:std::basic_stringbuf access:public signature:() const +str cpp_src/sstream /^ str() const$/;" f class:std::basic_stringstream access:public signature:() const +str cpp_src/sstream /^ str(const __string_type& __s)$/;" f class:std::basic_istringstream access:public signature:(const __string_type& __s) +str cpp_src/sstream /^ str(const __string_type& __s)$/;" f class:std::basic_ostringstream access:public signature:(const __string_type& __s) +str cpp_src/sstream /^ str(const __string_type& __s)$/;" f class:std::basic_stringbuf access:public signature:(const __string_type& __s) +str cpp_src/sstream /^ str(const __string_type& __s)$/;" f class:std::basic_stringstream access:public signature:(const __string_type& __s) +strcat cpp_src/cstring 59;" d file: +strchr cpp_src/cstring /^ strchr(char* __s1, int __n)$/;" f namespace:std signature:(char* __s1, int __n) +strchr cpp_src/cstring 67;" d file: +strcmp cpp_src/cstring 62;" d file: +strcoll cpp_src/cstring 63;" d file: +strcpy cpp_src/cstring 57;" d file: +strcspn cpp_src/cstring 68;" d file: +streambuf cpp_src/iosfwd /^ typedef basic_streambuf streambuf; \/\/\/< @isiosfwd$/;" t namespace:std file: +streambuf_type cpp_src/streambuf_iterator.h /^ typedef basic_streambuf<_CharT, _Traits> streambuf_type;$/;" t class:std::istreambuf_iterator access:public +streambuf_type cpp_src/streambuf_iterator.h /^ typedef basic_streambuf<_CharT, _Traits> streambuf_type;$/;" t class:std::ostreambuf_iterator access:public +streamoff cpp_src/ios_base.h /^ typedef std::streamoff streamoff;$/;" t class:std::ios_base access:public +streamoff cpp_src/postypes.h /^ typedef int64_t streamoff;$/;" t namespace:std +streampos cpp_src/ios_base.h /^ typedef std::streampos streampos;$/;" t class:std::ios_base access:public +streampos cpp_src/postypes.h /^ typedef fpos streampos;$/;" t namespace:std +streamsize cpp_src/postypes.h /^ typedef ptrdiff_t streamsize; \/\/ Signed integral type$/;" t namespace:std +strerror cpp_src/cstring 75;" d file: +strftime cpp_src/ctime 62;" d file: +stride cpp_src/gslice.h /^ valarray stride() const;$/;" p class:std::gslice access:public signature:() const +stride cpp_src/gslice.h /^ gslice::stride () const$/;" f class:std::gslice signature:() const +stride cpp_src/slice_array.h /^ size_t stride() const;$/;" p class:std::slice access:public signature:() const +stride cpp_src/slice_array.h /^ slice::stride() const$/;" f class:std::slice signature:() const +string cpp_src/stringfwd.h /^ typedef basic_string string;$/;" t namespace:std +string_type cpp_src/locale_facets.h /^ typedef basic_string<_CharT> string_type;$/;" t class:std::collate access:public +string_type cpp_src/locale_facets.h /^ typedef basic_string<_CharT> string_type;$/;" t class:std::messages access:public +string_type cpp_src/locale_facets.h /^ typedef basic_string<_CharT> string_type;$/;" t class:std::messages_byname access:public +string_type cpp_src/locale_facets.h /^ typedef basic_string<_CharT> string_type;$/;" t class:std::money_get access:public +string_type cpp_src/locale_facets.h /^ typedef basic_string<_CharT> string_type;$/;" t class:std::money_put access:public +string_type cpp_src/locale_facets.h /^ typedef basic_string<_CharT> string_type;$/;" t class:std::moneypunct access:public +string_type cpp_src/locale_facets.h /^ typedef basic_string<_CharT> string_type;$/;" t class:std::moneypunct_byname access:public +string_type cpp_src/locale_facets.h /^ typedef basic_string<_CharT> string_type;$/;" t class:std::numpunct access:public +string_type cpp_src/locale_facets.h /^ typedef basic_string<_CharT> string_type;$/;" t class:std::numpunct_byname access:public +string_type cpp_src/locale_facets.h /^ typedef basic_string<_CharT> string_type;$/;" t class:std::collate_byname access:public +stringbuf cpp_src/iosfwd /^ typedef basic_stringbuf stringbuf; \/\/\/< @isiosfwd$/;" t namespace:std file: +stringstream cpp_src/iosfwd /^ typedef basic_stringstream stringstream; \/\/\/< @isiosfwd$/;" t namespace:std file: +strlen cpp_src/cstring 76;" d file: +strncat cpp_src/cstring 60;" d file: +strncmp cpp_src/cstring 64;" d file: +strncpy cpp_src/cstring 58;" d file: +strpbrk cpp_src/cstring /^ strpbrk(char* __s1, const char* __s2)$/;" f namespace:std signature:(char* __s1, const char* __s2) +strpbrk cpp_src/cstring 69;" d file: +strrchr cpp_src/cstring /^ strrchr(char* __s1, int __n)$/;" f namespace:std signature:(char* __s1, int __n) +strrchr cpp_src/cstring 70;" d file: +strspn cpp_src/cstring 71;" d file: +strstr cpp_src/cstring /^ strstr(char* __s1, const char* __s2)$/;" f namespace:std signature:(char* __s1, const char* __s2) +strstr cpp_src/cstring 72;" d file: +strtok cpp_src/cstring 73;" d file: +strxfrm cpp_src/cstring 65;" d file: +substr cpp_src/basic_string.h /^ substr(size_type __pos = 0, size_type __n = npos) const$/;" f class:std::basic_string access:public signature:(size_type __pos = 0, size_type __n = npos) const +sum cpp_src/valarray /^ _Tp sum() const;$/;" p class:std::valarray file: access:public signature:() const +sum cpp_src/valarray /^ valarray<_Tp>::sum() const$/;" f class:std::valarray signature:() const +sum cpp_src/valarray_after.h /^ value_type sum() const;$/;" p class:std::_Expr access:public signature:() const +sum cpp_src/valarray_after.h /^ _Expr<_Clos, _Tp>::sum() const$/;" f class:std::_Expr signature:() const +sungetc cpp_src/streambuf /^ sungetc()$/;" f class:std::basic_streambuf access:public signature:() +swap cpp_src/basic_string.h /^ swap(basic_string& __s);$/;" p class:std::basic_string access:public signature:(basic_string& __s) +swap cpp_src/basic_string.h /^ swap(basic_string<_CharT, _Traits, _Alloc>& __lhs,$/;" f namespace:std signature:(basic_string<_CharT, _Traits, _Alloc>& __lhs, basic_string<_CharT, _Traits, _Alloc>& __rhs) +swap cpp_src/basic_string.tcc /^ swap(basic_string& __s)$/;" f class:std::basic_string signature:(basic_string& __s) +swap cpp_src/stl_algobase.h /^ swap(_Tp& __a, _Tp& __b)$/;" f namespace:std signature:(_Tp& __a, _Tp& __b) +swap cpp_src/stl_bvector.h /^ swap(reference __x, reference __y)$/;" f class:std::vector access:public signature:(reference __x, reference __y) +swap cpp_src/stl_bvector.h /^ swap(vector& __x)$/;" f class:std::vector access:public signature:(vector& __x) +swap cpp_src/stl_deque.h /^ swap(deque& __x)$/;" f class:std::deque access:public signature:(deque& __x) +swap cpp_src/stl_deque.h /^ swap(deque<_Tp,_Alloc>& __x, deque<_Tp,_Alloc>& __y)$/;" f namespace:std signature:(deque<_Tp,_Alloc>& __x, deque<_Tp,_Alloc>& __y) +swap cpp_src/stl_list.h /^ swap(list& __x)$/;" f class:std::list access:public signature:(list& __x) +swap cpp_src/stl_list.h /^ swap(_List_node_base& __x, _List_node_base& __y);$/;" p struct:std::_List_node_base access:public signature:(_List_node_base& __x, _List_node_base& __y) +swap cpp_src/stl_list.h /^ swap(list<_Tp, _Alloc>& __x, list<_Tp, _Alloc>& __y)$/;" f namespace:std signature:(list<_Tp, _Alloc>& __x, list<_Tp, _Alloc>& __y) +swap cpp_src/stl_map.h /^ swap(map& __x)$/;" f class:std::map access:public signature:(map& __x) +swap cpp_src/stl_map.h /^ swap(map<_Key, _Tp, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(map<_Key, _Tp, _Compare, _Alloc>& __x, map<_Key, _Tp, _Compare, _Alloc>& __y) +swap cpp_src/stl_multimap.h /^ swap(multimap& __x)$/;" f class:std::multimap access:public signature:(multimap& __x) +swap cpp_src/stl_multimap.h /^ swap(multimap<_Key, _Tp, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(multimap<_Key, _Tp, _Compare, _Alloc>& __x, multimap<_Key, _Tp, _Compare, _Alloc>& __y) +swap cpp_src/stl_multiset.h /^ swap(multiset<_Key, _Compare, _Alloc>& __x)$/;" f class:std::multiset access:public signature:(multiset<_Key, _Compare, _Alloc>& __x) +swap cpp_src/stl_multiset.h /^ swap(multiset<_Key, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(multiset<_Key, _Compare, _Alloc>& __x, multiset<_Key, _Compare, _Alloc>& __y) +swap cpp_src/stl_set.h /^ swap(set<_Key,_Compare,_Alloc>& __x)$/;" f class:std::set access:public signature:(set<_Key,_Compare,_Alloc>& __x) +swap cpp_src/stl_set.h /^ swap(set<_Key, _Compare, _Alloc>& __x, set<_Key, _Compare, _Alloc>& __y)$/;" f namespace:std signature:(set<_Key, _Compare, _Alloc>& __x, set<_Key, _Compare, _Alloc>& __y) +swap cpp_src/stl_tree.h /^ swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __t);$/;" p class:std::_Rb_tree access:public signature:(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __t) +swap cpp_src/stl_tree.h /^ swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __t)$/;" f class:std::_Rb_tree signature:(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __t) +swap cpp_src/stl_tree.h /^ swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,$/;" f namespace:std signature:(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) +swap cpp_src/stl_vector.h /^ swap(vector& __x)$/;" f class:std::vector access:public signature:(vector& __x) +swap cpp_src/stl_vector.h /^ swap(vector<_Tp, _Alloc>& __x, vector<_Tp, _Alloc>& __y)$/;" f namespace:std signature:(vector<_Tp, _Alloc>& __x, vector<_Tp, _Alloc>& __y) +swap_ranges cpp_src/stl_algo.h /^ swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1,$/;" f namespace:std signature:(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2) +swprintf cpp_src/cwchar 93;" d file: +swscanf cpp_src/cwchar 94;" d file: +symbol cpp_src/locale_facets.h /^ enum part { none, space, symbol, sign, value };$/;" e enum:std::money_base::part +sync cpp_src/fstream /^ sync();$/;" p class:std::basic_filebuf file: access:protected signature:() +sync cpp_src/fstream.tcc /^ sync()$/;" f class:std::basic_filebuf signature:() +sync cpp_src/istream /^ sync();$/;" p class:std::basic_istream file: access:public signature:() +sync cpp_src/istream.tcc /^ sync(void)$/;" f class:std::basic_istream signature:(void) +sync cpp_src/streambuf /^ sync() { return 0; }$/;" f class:std::basic_streambuf access:protected signature:() +sync_with_stdio cpp_src/ios_base.h /^ sync_with_stdio(bool __sync = true);$/;" p class:std::ios_base access:public signature:(bool __sync = true) +table cpp_src/locale_facets.h /^ table() const throw()$/;" f class:std::ctype access:protected signature:() const +table_size cpp_src/locale_facets.h /^ static const size_t table_size = 1 + static_cast(-1);$/;" m class:std::ctype access:public +tan cpp_src/cmath /^ tan(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +tan cpp_src/cmath /^ tan(float __x)$/;" f namespace:std signature:(float __x) +tan cpp_src/cmath /^ tan(long double __x)$/;" f namespace:std signature:(long double __x) +tan cpp_src/cmath 79;" d file: +tan cpp_src/complex /^ tan(const complex<_Tp>& __z) { return __complex_tan(__z); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +tan cpp_src/complex /^ tan(const complex<_Tp>& __z) { return __complex_tan(__z.__rep()); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +tan cpp_src/complex /^ template complex<_Tp> tan(const complex<_Tp>&);$/;" p namespace:std file: signature:(const complex<_Tp>&) +tanh cpp_src/cmath /^ tanh(_Tp __x)$/;" f namespace:std signature:(_Tp __x) +tanh cpp_src/cmath /^ tanh(float __x)$/;" f namespace:std signature:(float __x) +tanh cpp_src/cmath /^ tanh(long double __x)$/;" f namespace:std signature:(long double __x) +tanh cpp_src/cmath 80;" d file: +tanh cpp_src/complex /^ tanh(const complex<_Tp>& __z) { return __complex_tanh(__z); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +tanh cpp_src/complex /^ tanh(const complex<_Tp>& __z) { return __complex_tanh(__z.__rep()); }$/;" f namespace:std signature:(const complex<_Tp>& __z) +tanh cpp_src/complex /^ template complex<_Tp> tanh(const complex<_Tp>&);$/;" p namespace:std file: signature:(const complex<_Tp>&) +tellg cpp_src/istream /^ tellg();$/;" p class:std::basic_istream file: access:public signature:() +tellg cpp_src/istream.tcc /^ tellg(void)$/;" f class:std::basic_istream signature:(void) +tellp cpp_src/ostream /^ tellp();$/;" p class:std::basic_ostream file: access:public signature:() +tellp cpp_src/ostream.tcc /^ tellp()$/;" f class:std::basic_ostream signature:() +terminate cpp_src/exception /^ void terminate() __attribute__ ((__noreturn__));$/;" p namespace:std file: signature:() +terminate_handler cpp_src/exception /^ typedef void (*terminate_handler) ();$/;" t namespace:std file: +test cpp_src/bitset /^ test(size_t __position) const$/;" f class:std::bitset access:public signature:(size_t __position) const +test cpp_src/bitset /^ test(size_t) const$/;" f class:std::bitset signature:(size_t) const +thousands_sep cpp_src/locale_facets.h /^ thousands_sep() const$/;" f class:std::moneypunct access:public signature:() const +thousands_sep cpp_src/locale_facets.h /^ thousands_sep() const$/;" f class:std::numpunct access:public signature:() const +tie cpp_src/basic_ios.h /^ tie() const$/;" f class:std::basic_ios access:public signature:() const +tie cpp_src/basic_ios.h /^ tie(basic_ostream<_CharT, _Traits>* __tiestr)$/;" f class:std::basic_ios access:public signature:(basic_ostream<_CharT, _Traits>* __tiestr) +time cpp_src/ctime 57;" d file: +time cpp_src/locale_classes.h /^ static const category time = 1L << 3;$/;" m class:std::locale access:public +time_base cpp_src/locale_facets.h /^ class time_base$/;" c namespace:std +time_get cpp_src/locale_facets.h /^ time_get(size_t __refs = 0)$/;" f class:std::time_get access:public signature:(size_t __refs = 0) +time_get cpp_src/locale_facets.h /^ class time_get : public locale::facet, public time_base$/;" c namespace:std inherits:locale::facet,time_base +time_get_byname cpp_src/locale_facets.h /^ time_get_byname(const char*, size_t __refs = 0)$/;" f class:std::time_get_byname access:public signature:(const char*, size_t __refs = 0) +time_get_byname cpp_src/locale_facets.h /^ class time_get_byname : public time_get<_CharT, _InIter>$/;" c namespace:std inherits:time_get +time_put cpp_src/locale_facets.h /^ time_put(size_t __refs = 0)$/;" f class:std::time_put access:public signature:(size_t __refs = 0) +time_put cpp_src/locale_facets.h /^ class time_put : public locale::facet$/;" c namespace:std inherits:locale::facet +time_put_byname cpp_src/locale_facets.h /^ time_put_byname(const char*, size_t __refs = 0)$/;" f class:std::time_put_byname access:public signature:(const char*, size_t __refs = 0) +time_put_byname cpp_src/locale_facets.h /^ class time_put_byname : public time_put<_CharT, _OutIter>$/;" c namespace:std inherits:time_put +tinyness_before cpp_src/limits /^ static const bool tinyness_before = __glibcxx_double_tinyness_before;$/;" m struct:std::numeric_limits file: access:public +tinyness_before cpp_src/limits /^ static const bool tinyness_before = __glibcxx_float_tinyness_before;$/;" m struct:std::numeric_limits file: access:public +tinyness_before cpp_src/limits /^ static const bool tinyness_before = __glibcxx_long_double_tinyness_before;$/;" m struct:std::numeric_limits file: access:public +tinyness_before cpp_src/limits /^ static const bool tinyness_before = false;$/;" m struct:std::numeric_limits file: access:public +tinyness_before cpp_src/limits /^ static const bool tinyness_before = false;$/;" m struct:std::__numeric_limits_base file: access:public +tmpfile cpp_src/cstdio 91;" d file: +tmpnam cpp_src/cstdio 92;" d file: +to_char_type cpp_src/char_traits.h /^ to_char_type(const int_type& __c)$/;" f struct:char_traits access:public signature:(const int_type& __c) +to_int_type cpp_src/char_traits.h /^ to_int_type(const char_type& __c)$/;" f struct:char_traits access:public signature:(const char_type& __c) +to_string cpp_src/bitset /^ to_string() const$/;" f class:std::bitset access:public signature:() const +to_string cpp_src/bitset /^ to_string() const$/;" f class:std::bitset access:public signature:() const +to_ulong cpp_src/bitset /^ to_ulong() const$/;" f class:std::bitset access:public signature:() const +tolower cpp_src/cctype 65;" d file: +tolower cpp_src/locale_facets.h /^ tolower(char_type __c) const$/;" f class:std::__ctype_abstract_base access:public signature:(char_type __c) const +tolower cpp_src/locale_facets.h /^ tolower(char_type __c) const$/;" f class:std::ctype access:public signature:(char_type __c) const +tolower cpp_src/locale_facets.h /^ tolower(char_type* __lo, const char_type* __hi) const$/;" f class:std::__ctype_abstract_base access:public signature:(char_type* __lo, const char_type* __hi) const +tolower cpp_src/locale_facets.h /^ tolower(char_type* __lo, const char_type* __hi) const$/;" f class:std::ctype access:public signature:(char_type* __lo, const char_type* __hi) const +tolower cpp_src/locale_facets.h /^ tolower(_CharT __c, const locale& __loc)$/;" f namespace:std signature:(_CharT __c, const locale& __loc) +tolower cpp_src/localefwd.h /^ tolower(_CharT, const locale&);$/;" p namespace:std signature:(_CharT, const locale&) +top cpp_src/stl_queue.h /^ top() const$/;" f class:std::priority_queue access:public signature:() const +top cpp_src/stl_stack.h /^ top() const$/;" f class:std::stack access:public signature:() const +top cpp_src/stl_stack.h /^ top()$/;" f class:std::stack access:public signature:() +toupper cpp_src/cctype 66;" d file: +toupper cpp_src/locale_facets.h /^ toupper(char_type *__lo, const char_type* __hi) const$/;" f class:std::__ctype_abstract_base access:public signature:(char_type *__lo, const char_type* __hi) const +toupper cpp_src/locale_facets.h /^ toupper(char_type *__lo, const char_type* __hi) const$/;" f class:std::ctype access:public signature:(char_type *__lo, const char_type* __hi) const +toupper cpp_src/locale_facets.h /^ toupper(char_type __c) const$/;" f class:std::__ctype_abstract_base access:public signature:(char_type __c) const +toupper cpp_src/locale_facets.h /^ toupper(char_type __c) const$/;" f class:std::ctype access:public signature:(char_type __c) const +toupper cpp_src/locale_facets.h /^ toupper(_CharT __c, const locale& __loc)$/;" f namespace:std signature:(_CharT __c, const locale& __loc) +toupper cpp_src/localefwd.h /^ toupper(_CharT, const locale&);$/;" p namespace:std signature:(_CharT, const locale&) +towctrans cpp_src/cwctype 72;" d file: +towlower cpp_src/cwctype 73;" d file: +towupper cpp_src/cwctype 74;" d file: +traits_type cpp_src/basic_ios.h /^ typedef _Traits traits_type;$/;" t class:std::basic_ios access:public +traits_type cpp_src/basic_string.h /^ typedef _Traits traits_type;$/;" t class:std::basic_string access:public +traits_type cpp_src/fstream /^ typedef _Traits traits_type;$/;" t class:std::basic_fstream file: access:public +traits_type cpp_src/fstream /^ typedef _Traits traits_type;$/;" t class:std::basic_ifstream file: access:public +traits_type cpp_src/fstream /^ typedef _Traits traits_type;$/;" t class:std::basic_ofstream file: access:public +traits_type cpp_src/fstream /^ typedef _Traits traits_type;$/;" t class:std::basic_filebuf file: access:public +traits_type cpp_src/istream /^ typedef _Traits traits_type;$/;" t class:std::basic_istream::sentry file: access:public +traits_type cpp_src/istream /^ typedef _Traits traits_type;$/;" t class:std::basic_iostream file: access:public +traits_type cpp_src/istream /^ typedef _Traits traits_type;$/;" t class:std::basic_istream file: access:public +traits_type cpp_src/ostream /^ typedef _Traits traits_type;$/;" t class:std::basic_ostream file: access:public +traits_type cpp_src/sstream /^ typedef _Traits traits_type;$/;" t class:std::basic_istringstream file: access:public +traits_type cpp_src/sstream /^ typedef _Traits traits_type;$/;" t class:std::basic_ostringstream file: access:public +traits_type cpp_src/sstream /^ typedef _Traits traits_type;$/;" t class:std::basic_stringbuf file: access:public +traits_type cpp_src/sstream /^ typedef _Traits traits_type;$/;" t class:std::basic_stringstream file: access:public +traits_type cpp_src/stream_iterator.h /^ typedef _Traits traits_type;$/;" t class:std::istream_iterator access:public +traits_type cpp_src/stream_iterator.h /^ typedef _Traits traits_type;$/;" t class:std::ostream_iterator access:public +traits_type cpp_src/streambuf /^ typedef _Traits traits_type;$/;" t class:std::basic_streambuf file: access:public +traits_type cpp_src/streambuf_iterator.h /^ typedef _Traits traits_type;$/;" t class:std::istreambuf_iterator access:public +traits_type cpp_src/streambuf_iterator.h /^ typedef _Traits traits_type;$/;" t class:std::ostreambuf_iterator access:public +transfer cpp_src/stl_list.h /^ transfer(_List_node_base * const __first,$/;" p struct:std::_List_node_base access:public signature:(_List_node_base * const __first, _List_node_base * const __last) +transform cpp_src/locale_facets.h /^ transform(const _CharT* __lo, const _CharT* __hi) const$/;" f class:std::collate access:public signature:(const _CharT* __lo, const _CharT* __hi) const +transform cpp_src/stl_algo.h /^ transform(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __unary_op) +transform cpp_src/stl_algo.h /^ transform(_InputIterator1 __first1, _InputIterator1 __last1,$/;" f namespace:std signature:(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _OutputIterator __result, _BinaryOperation __binary_op) +traps cpp_src/limits /^ static const bool traps = __glibcxx_double_traps;$/;" m struct:std::numeric_limits file: access:public +traps cpp_src/limits /^ static const bool traps = __glibcxx_float_traps;$/;" m struct:std::numeric_limits file: access:public +traps cpp_src/limits /^ static const bool traps = __glibcxx_integral_traps;$/;" m struct:std::numeric_limits file: access:public +traps cpp_src/limits /^ static const bool traps = __glibcxx_long_double_traps;$/;" m struct:std::numeric_limits file: access:public +traps cpp_src/limits /^ static const bool traps = false;$/;" m struct:std::__numeric_limits_base file: access:public +truename cpp_src/locale_facets.h /^ truename() const$/;" f class:std::numpunct access:public signature:() const +trunc cpp_src/ios_base.h /^ static const openmode trunc = _S_trunc;$/;" m class:std::ios_base access:public +try cpp_src/exception_defines.h 43;" d +type_info cpp_src/typeinfo /^ explicit type_info(const char *__n): __name(__n) { }$/;" f class:std::type_info access:protected signature:(const char *__n) +type_info cpp_src/typeinfo /^ type_info(const type_info&);$/;" p class:std::type_info file: access:private signature:(const type_info&) +type_info cpp_src/typeinfo /^ class type_info $/;" c namespace:std file: +uflow cpp_src/streambuf /^ uflow() $/;" f class:std::basic_streambuf access:protected signature:() +unary_function cpp_src/stl_function.h /^ struct unary_function$/;" s namespace:std +unary_negate cpp_src/stl_function.h /^ unary_negate(const _Predicate& __x) : _M_pred(__x) {}$/;" f class:std::unary_negate access:public signature:(const _Predicate& __x) +unary_negate cpp_src/stl_function.h /^ class unary_negate$/;" c namespace:std inherits:unary_function +uncaught_exception cpp_src/exception /^ bool uncaught_exception() throw();$/;" p namespace:std file: signature:() +underflow cpp_src/fstream /^ underflow();$/;" p class:std::basic_filebuf file: access:protected signature:() +underflow cpp_src/fstream.tcc /^ underflow()$/;" f class:std::basic_filebuf signature:() +underflow cpp_src/sstream /^ underflow();$/;" p class:std::basic_stringbuf file: access:protected signature:() +underflow cpp_src/sstream.tcc /^ underflow()$/;" f class:std::basic_stringbuf signature:() +underflow cpp_src/streambuf /^ underflow()$/;" f class:std::basic_streambuf access:protected signature:() +underflow_error cpp_src/stdexcept /^ explicit underflow_error(const string& __arg);$/;" p class:std::underflow_error file: access:public signature:(const string& __arg) +underflow_error cpp_src/stdexcept /^ class underflow_error : public runtime_error $/;" c namespace:std file: inherits:runtime_error +unexpected cpp_src/exception /^ void unexpected() __attribute__ ((__noreturn__));$/;" p namespace:std file: signature:() +unexpected_handler cpp_src/exception /^ typedef void (*unexpected_handler) ();$/;" t namespace:std file: +unget cpp_src/istream /^ unget();$/;" p class:std::basic_istream file: access:public signature:() +unget cpp_src/istream.tcc /^ unget(void)$/;" f class:std::basic_istream signature:(void) +ungetc cpp_src/cstdio 93;" d file: +ungetwc cpp_src/cwchar 95;" d file: +unhook cpp_src/stl_list.h /^ unhook();$/;" p struct:std::_List_node_base access:public signature:() +uninitialized_copy cpp_src/stl_uninitialized.h /^ uninitialized_copy(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _ForwardIterator __result) +uninitialized_copy cpp_src/stl_uninitialized.h /^ uninitialized_copy(const char* __first, const char* __last, char* __result)$/;" f namespace:std signature:(const char* __first, const char* __last, char* __result) +uninitialized_copy cpp_src/stl_uninitialized.h /^ uninitialized_copy(const wchar_t* __first, const wchar_t* __last,$/;" f namespace:std signature:(const wchar_t* __first, const wchar_t* __last, wchar_t* __result) +uninitialized_fill cpp_src/stl_uninitialized.h /^ uninitialized_fill(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x) +uninitialized_fill_n cpp_src/stl_uninitialized.h /^ uninitialized_fill_n(_ForwardIterator __first, _Size __n, const _Tp& __x)$/;" f namespace:std signature:(_ForwardIterator __first, _Size __n, const _Tp& __x) +unique cpp_src/list.tcc /^ unique(_BinaryPredicate __binary_pred)$/;" f class:std::list signature:(_BinaryPredicate __binary_pred) +unique cpp_src/list.tcc /^ unique()$/;" f class:std::list signature:() +unique cpp_src/stl_algo.h /^ unique(_ForwardIterator __first, _ForwardIterator __last)$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last) +unique cpp_src/stl_algo.h /^ unique(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __binary_pred) +unique cpp_src/stl_list.h /^ unique(_BinaryPredicate);$/;" p class:std::list access:public signature:(_BinaryPredicate) +unique cpp_src/stl_list.h /^ unique();$/;" p class:std::list access:public signature:() +unique_copy cpp_src/stl_algo.h /^ unique_copy(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _OutputIterator __result) +unique_copy cpp_src/stl_algo.h /^ unique_copy(_InputIterator __first, _InputIterator __last,$/;" f namespace:std signature:(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __binary_pred) +unitbuf cpp_src/ios_base.h /^ static const fmtflags unitbuf = _S_unitbuf;$/;" m class:std::ios_base access:public +unitbuf cpp_src/ios_base.h /^ unitbuf(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +unsetf cpp_src/ios_base.h /^ unsetf(fmtflags __mask) { _M_flags &= ~__mask; }$/;" f class:std::ios_base access:public signature:(fmtflags __mask) +unshift cpp_src/codecvt.h /^ unshift(state_type& __state, extern_type* __to, extern_type* __to_end,$/;" f class:std::__codecvt_abstract_base access:public signature:(state_type& __state, extern_type* __to, extern_type* __to_end, extern_type*& __to_next) const +upper_bound cpp_src/stl_algo.h /^ upper_bound(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val) +upper_bound cpp_src/stl_algo.h /^ upper_bound(_ForwardIterator __first, _ForwardIterator __last,$/;" f namespace:std signature:(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val, _Compare __comp) +upper_bound cpp_src/stl_map.h /^ upper_bound(const key_type& __x) const$/;" f class:std::map access:public signature:(const key_type& __x) const +upper_bound cpp_src/stl_map.h /^ upper_bound(const key_type& __x)$/;" f class:std::map access:public signature:(const key_type& __x) +upper_bound cpp_src/stl_multimap.h /^ upper_bound(const key_type& __x) const$/;" f class:std::multimap access:public signature:(const key_type& __x) const +upper_bound cpp_src/stl_multimap.h /^ upper_bound(const key_type& __x)$/;" f class:std::multimap access:public signature:(const key_type& __x) +upper_bound cpp_src/stl_multiset.h /^ upper_bound(const key_type& __x) const$/;" f class:std::multiset access:public signature:(const key_type& __x) const +upper_bound cpp_src/stl_multiset.h /^ upper_bound(const key_type& __x)$/;" f class:std::multiset access:public signature:(const key_type& __x) +upper_bound cpp_src/stl_set.h /^ upper_bound(const key_type& __x) const$/;" f class:std::set access:public signature:(const key_type& __x) const +upper_bound cpp_src/stl_set.h /^ upper_bound(const key_type& __x)$/;" f class:std::set access:public signature:(const key_type& __x) +upper_bound cpp_src/stl_tree.h /^ upper_bound(const key_type& __x) const;$/;" p class:std::_Rb_tree access:public signature:(const key_type& __x) const +upper_bound cpp_src/stl_tree.h /^ upper_bound(const key_type& __x);$/;" p class:std::_Rb_tree access:public signature:(const key_type& __x) +upper_bound cpp_src/stl_tree.h /^ upper_bound(const _Key& __k) const$/;" f class:std::_Rb_tree signature:(const _Key& __k) const +upper_bound cpp_src/stl_tree.h /^ upper_bound(const _Key& __k)$/;" f class:std::_Rb_tree signature:(const _Key& __k) +uppercase cpp_src/ios_base.h /^ static const fmtflags uppercase = _S_uppercase;$/;" m class:std::ios_base access:public +uppercase cpp_src/ios_base.h /^ uppercase(ios_base& __base)$/;" f namespace:std signature:(ios_base& __base) +use_facet cpp_src/locale_classes.h /^ use_facet(const locale&);$/;" p class:std::locale access:friend signature:(const locale&) +use_facet cpp_src/locale_classes.h /^ use_facet(const locale&);$/;" p class:std::locale::_Impl access:friend signature:(const locale&) +use_facet cpp_src/locale_classes.h /^ use_facet(const locale&);$/;" p class:std::locale::id access:friend signature:(const locale&) +use_facet cpp_src/locale_facets.h /^ use_facet >(const locale& __loc);$/;" p namespace:std signature:(const locale& __loc) +use_facet cpp_src/locale_facets.h /^ use_facet >(const locale& __loc);$/;" p namespace:std signature:(const locale& __loc) +use_facet cpp_src/locale_facets.tcc /^ use_facet(const locale& __loc)$/;" f namespace:std signature:(const locale& __loc) +use_facet cpp_src/locale_facets.tcc /^ use_facet<__timepunct >(const locale&);$/;" p namespace:std file: signature:(const locale&) +use_facet cpp_src/locale_facets.tcc /^ use_facet<__timepunct >(const locale&);$/;" p namespace:std file: signature:(const locale&) +use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +use_facet cpp_src/locale_facets.tcc /^ use_facet >(locale const&);$/;" p namespace:std file: signature:(locale const&) +use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +use_facet cpp_src/locale_facets.tcc /^ use_facet >(const locale&);$/;" p namespace:std file: signature:(const locale&) +use_facet cpp_src/localefwd.h /^ use_facet(const locale& __loc);$/;" p namespace:std signature:(const locale& __loc) +va_end cpp_src/cstdarg 55;" d file: +valarray cpp_src/valarray /^ valarray(const _Expr<_Dom, _Tp>& __e);$/;" p class:std::valarray file: access:public signature:(const _Expr<_Dom, _Tp>& __e) +valarray cpp_src/valarray /^ explicit valarray(size_t);$/;" p class:std::valarray file: access:public signature:(size_t) +valarray cpp_src/valarray /^ valarray();$/;" p class:std::valarray file: access:public signature:() +valarray cpp_src/valarray /^ valarray(const _Tp&, size_t);$/;" p class:std::valarray file: access:public signature:(const _Tp&, size_t) +valarray cpp_src/valarray /^ valarray(const _Tp* __restrict__, size_t);$/;" p class:std::valarray file: access:public signature:(const _Tp* __restrict__, size_t) +valarray cpp_src/valarray /^ valarray(const gslice_array<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const gslice_array<_Tp>&) +valarray cpp_src/valarray /^ valarray(const indirect_array<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const indirect_array<_Tp>&) +valarray cpp_src/valarray /^ valarray(const mask_array<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const mask_array<_Tp>&) +valarray cpp_src/valarray /^ valarray(const slice_array<_Tp>&);$/;" p class:std::valarray file: access:public signature:(const slice_array<_Tp>&) +valarray cpp_src/valarray /^ valarray(const valarray&);$/;" p class:std::valarray file: access:public signature:(const valarray&) +valarray cpp_src/valarray /^ class valarray$/;" c namespace:std file: +valarray cpp_src/valarray /^ valarray<_Tp>::valarray() : _M_size(0), _M_data(0) {}$/;" f class:std::valarray signature:() +valarray cpp_src/valarray /^ valarray<_Tp>::valarray(const _Expr<_Dom, _Tp>& __e)$/;" f class:std::valarray signature:(const _Expr<_Dom, _Tp>& __e) +valarray cpp_src/valarray /^ valarray<_Tp>::valarray(const _Tp& __t, size_t __n)$/;" f class:std::valarray signature:(const _Tp& __t, size_t __n) +valarray cpp_src/valarray /^ valarray<_Tp>::valarray(const _Tp* __restrict__ __p, size_t __n)$/;" f class:std::valarray signature:(const _Tp* __restrict__ __p, size_t __n) +valarray cpp_src/valarray /^ valarray<_Tp>::valarray(const gslice_array<_Tp>& __ga)$/;" f class:std::valarray signature:(const gslice_array<_Tp>& __ga) +valarray cpp_src/valarray /^ valarray<_Tp>::valarray(const indirect_array<_Tp>& __ia)$/;" f class:std::valarray signature:(const indirect_array<_Tp>& __ia) +valarray cpp_src/valarray /^ valarray<_Tp>::valarray(const mask_array<_Tp>& __ma)$/;" f class:std::valarray signature:(const mask_array<_Tp>& __ma) +valarray cpp_src/valarray /^ valarray<_Tp>::valarray(const slice_array<_Tp>& __sa)$/;" f class:std::valarray signature:(const slice_array<_Tp>& __sa) +valarray cpp_src/valarray /^ valarray<_Tp>::valarray(const valarray<_Tp>& __v)$/;" f class:std::valarray signature:(const valarray<_Tp>& __v) +valarray cpp_src/valarray /^ valarray<_Tp>::valarray(size_t __n) $/;" f class:std::valarray signature:(size_t __n) +value cpp_src/locale_facets.h /^ enum part { none, space, symbol, sign, value };$/;" e enum:std::money_base::part +value cpp_src/stl_function.h /^ typename _Operation::first_argument_type value;$/;" m class:std::binder1st access:protected +value cpp_src/stl_function.h /^ typename _Operation::second_argument_type value;$/;" m class:std::binder2nd access:protected +value_comp cpp_src/stl_map.h /^ value_comp() const$/;" f class:std::map access:public signature:() const +value_comp cpp_src/stl_multimap.h /^ value_comp() const$/;" f class:std::multimap access:public signature:() const +value_comp cpp_src/stl_multiset.h /^ value_comp() const$/;" f class:std::multiset access:public signature:() const +value_comp cpp_src/stl_set.h /^ value_comp() const$/;" f class:std::set access:public signature:() const +value_compare cpp_src/stl_map.h /^ value_compare(_Compare __c)$/;" f class:std::map::value_compare access:protected signature:(_Compare __c) +value_compare cpp_src/stl_map.h /^ class value_compare$/;" c class:std::map inherits:std::binary_function access:public +value_compare cpp_src/stl_multimap.h /^ value_compare(_Compare __c)$/;" f class:std::multimap::value_compare access:protected signature:(_Compare __c) +value_compare cpp_src/stl_multimap.h /^ class value_compare$/;" c class:std::multimap inherits:std::binary_function access:public +value_compare cpp_src/stl_multiset.h /^ typedef _Compare value_compare;$/;" t class:std::multiset access:public +value_compare cpp_src/stl_set.h /^ typedef _Compare value_compare;$/;" t class:std::set access:public +value_type cpp_src/allocator.h /^ typedef _Tp value_type;$/;" t class:std::allocator access:public +value_type cpp_src/allocator.h /^ typedef void value_type;$/;" t class:std::allocator access:public +value_type cpp_src/basic_string.h /^ typedef typename _Traits::char_type value_type;$/;" t class:std::basic_string access:public +value_type cpp_src/complex /^ typedef _Tp value_type;$/;" t struct:std::complex file: access:public +value_type cpp_src/complex /^ typedef double value_type;$/;" t struct:std::complex file: access:public +value_type cpp_src/complex /^ typedef float value_type;$/;" t struct:std::complex file: access:public +value_type cpp_src/complex /^ typedef long double value_type;$/;" t struct:std::complex file: access:public +value_type cpp_src/gslice_array.h /^ typedef _Tp value_type;$/;" t class:std::gslice_array access:public +value_type cpp_src/indirect_array.h /^ typedef _Tp value_type;$/;" t class:std::indirect_array access:public +value_type cpp_src/mask_array.h /^ typedef _Tp value_type;$/;" t class:std::mask_array access:public +value_type cpp_src/slice_array.h /^ typedef _Tp value_type;$/;" t class:std::slice_array access:public +value_type cpp_src/stl_bvector.h /^ typedef bool value_type;$/;" t class:std::vector access:public +value_type cpp_src/stl_deque.h /^ typedef _Tp value_type;$/;" t class:std::deque access:public +value_type cpp_src/stl_deque.h /^ typedef _Tp value_type;$/;" t struct:std::_Deque_iterator access:public +value_type cpp_src/stl_iterator.h /^ typedef typename iterator_traits<_Iterator>::value_type value_type;$/;" t class:__normal_iterator access:public +value_type cpp_src/stl_iterator_base_types.h /^ typedef _Tp value_type;$/;" t struct:std::iterator_traits access:public +value_type cpp_src/stl_iterator_base_types.h /^ typedef _Tp value_type;$/;" t struct:std::iterator access:public +value_type cpp_src/stl_iterator_base_types.h /^ typedef typename _Iterator::value_type value_type;$/;" t struct:std::iterator_traits access:public +value_type cpp_src/stl_list.h /^ typedef _Tp value_type;$/;" t class:std::list access:public +value_type cpp_src/stl_list.h /^ typedef _Tp value_type;$/;" t struct:std::_List_const_iterator access:public +value_type cpp_src/stl_list.h /^ typedef _Tp value_type;$/;" t struct:std::_List_iterator access:public +value_type cpp_src/stl_map.h /^ typedef std::pair value_type;$/;" t class:std::map access:public +value_type cpp_src/stl_multimap.h /^ typedef std::pair value_type;$/;" t class:std::multimap access:public +value_type cpp_src/stl_multiset.h /^ typedef _Key value_type;$/;" t class:std::multiset access:public +value_type cpp_src/stl_queue.h /^ typedef typename _Sequence::value_type value_type;$/;" t class:std::priority_queue access:public +value_type cpp_src/stl_queue.h /^ typedef typename _Sequence::value_type value_type;$/;" t class:std::queue access:public +value_type cpp_src/stl_set.h /^ typedef _Key value_type;$/;" t class:std::set access:public +value_type cpp_src/stl_stack.h /^ typedef typename _Sequence::value_type value_type;$/;" t class:std::stack access:public +value_type cpp_src/stl_tempbuf.h /^ typedef _Tp value_type;$/;" t class:std::_Temporary_buffer access:public +value_type cpp_src/stl_tree.h /^ typedef _Tp value_type;$/;" t struct:std::_Rb_tree_const_iterator access:public +value_type cpp_src/stl_tree.h /^ typedef _Tp value_type;$/;" t struct:std::_Rb_tree_iterator access:public +value_type cpp_src/stl_tree.h /^ typedef _Val value_type;$/;" t class:std::_Rb_tree access:public +value_type cpp_src/stl_vector.h /^ typedef _Tp value_type;$/;" t class:std::vector access:public +value_type cpp_src/valarray /^ typedef _Tp value_type;$/;" t class:std::valarray file: access:public +value_type cpp_src/valarray_after.h /^ typedef _Tp value_type;$/;" t class:std::_Expr access:public +value_type cpp_src/valarray_after.h /^ typedef _Tp value_type;$/;" t class:std::_GBase access:public +value_type cpp_src/valarray_after.h /^ typedef _Tp value_type;$/;" t struct:std::_IClos access:public +value_type cpp_src/valarray_after.h /^ typedef typename _Base::value_type value_type;$/;" t struct:std::_GClos access:public +value_type cpp_src/valarray_after.h /^ typedef typename _Base::value_type value_type;$/;" t struct:std::_IClos access:public +value_type cpp_src/valarray_after.h /^ typedef typename _Dom::value_type value_type;$/;" t class:std::_GBase access:public +value_type cpp_src/valarray_after.h /^ typedef typename _Dom::value_type value_type;$/;" t class:std::_IBase access:public +value_type cpp_src/valarray_before.h /^ typedef _Tp value_type;$/;" t class:std::_SBase access:public +value_type cpp_src/valarray_before.h /^ typedef _Tp value_type;$/;" t struct:std::_RefFunClos access:public +value_type cpp_src/valarray_before.h /^ typedef _Tp value_type;$/;" t struct:std::_SClos access:public +value_type cpp_src/valarray_before.h /^ typedef _Tp value_type;$/;" t struct:std::_ValFunClos access:public +value_type cpp_src/valarray_before.h /^ typedef typename _Base::value_type value_type;$/;" t struct:std::_BinClos access:public +value_type cpp_src/valarray_before.h /^ typedef typename _Base::value_type value_type;$/;" t struct:std::_RefFunClos access:public +value_type cpp_src/valarray_before.h /^ typedef typename _Base::value_type value_type;$/;" t struct:std::_SClos access:public +value_type cpp_src/valarray_before.h /^ typedef typename _Base::value_type value_type;$/;" t struct:std::_UnClos access:public +value_type cpp_src/valarray_before.h /^ typedef typename _Base::value_type value_type;$/;" t struct:std::_ValFunClos access:public +value_type cpp_src/valarray_before.h /^ typedef typename _Dom::value_type value_type;$/;" t class:std::_FunBase access:public +value_type cpp_src/valarray_before.h /^ typedef typename _Dom::value_type value_type;$/;" t class:std::_SBase access:public +value_type cpp_src/valarray_before.h /^ typedef typename __fun<_Oper, _Vt>::result_type value_type;$/;" t class:std::_BinBase access:public +value_type cpp_src/valarray_before.h /^ typedef typename __fun<_Oper, _Vt>::result_type value_type;$/;" t class:std::_BinBase1 access:public +value_type cpp_src/valarray_before.h /^ typedef typename __fun<_Oper, _Vt>::result_type value_type;$/;" t class:std::_BinBase2 access:public +value_type cpp_src/valarray_before.h /^ typedef typename __fun<_Oper, _Vt>::result_type value_type;$/;" t class:std::_UnBase access:public +vector cpp_src/stl_bvector.h /^ vector(_InputIterator __first, _InputIterator __last,$/;" f class:std::vector access:public signature:(_InputIterator __first, _InputIterator __last, const allocator_type& __a = allocator_type()) +vector cpp_src/stl_bvector.h /^ vector(const allocator_type& __a = allocator_type())$/;" f class:std::vector access:public signature:(const allocator_type& __a = allocator_type()) +vector cpp_src/stl_bvector.h /^ vector(const vector& __x)$/;" f class:std::vector access:public signature:(const vector& __x) +vector cpp_src/stl_bvector.h /^ vector(size_type __n, const bool& __value = bool(), $/;" f class:std::vector access:public signature:(size_type __n, const bool& __value = bool(), const allocator_type& __a = allocator_type()) +vector cpp_src/stl_bvector.h /^ class vector : protected _Bvector_base<_Alloc>$/;" c namespace:std inherits:_Bvector_base +vector cpp_src/stl_vector.h /^ vector(_InputIterator __first, _InputIterator __last,$/;" f class:std::vector access:public signature:(_InputIterator __first, _InputIterator __last, const allocator_type& __a = allocator_type()) +vector cpp_src/stl_vector.h /^ vector(const allocator_type& __a = allocator_type())$/;" f class:std::vector access:public signature:(const allocator_type& __a = allocator_type()) +vector cpp_src/stl_vector.h /^ vector(const vector& __x)$/;" f class:std::vector access:public signature:(const vector& __x) +vector cpp_src/stl_vector.h /^ vector(size_type __n, const value_type& __value = value_type(),$/;" f class:std::vector access:public signature:(size_type __n, const value_type& __value = value_type(), const allocator_type& __a = allocator_type()) +vector cpp_src/stl_vector.h /^ class vector : protected _Vector_base<_Tp, _Alloc>$/;" c namespace:std inherits:_Vector_base +vector_type cpp_src/stl_vector.h /^ typedef vector<_Tp, _Alloc> vector_type;$/;" t class:std::vector access:private +vfprintf cpp_src/cstdio 94;" d file: +vfscanf cpp_src/cstdio /^ (vfscanf)(FILE * restrict, const char * restrict, __gnuc_va_list);$/;" p file: signature:(FILE * restrict, const char * restrict, __gnuc_va_list) +vfscanf cpp_src/cstdio 150;" d file: +vfwprintf cpp_src/cwchar 96;" d file: +vfwscanf cpp_src/cwchar 98;" d file: +vprintf cpp_src/cstdio 95;" d file: +vscanf cpp_src/cstdio /^ extern "C" int (vscanf)(const char * restrict, __gnuc_va_list);$/;" p file: signature:(const char * restrict, __gnuc_va_list) +vscanf cpp_src/cstdio 151;" d file: +vsnprintf cpp_src/cstdio /^ (vsnprintf)(char * restrict, size_t, const char * restrict, __gnuc_va_list);$/;" p file: signature:(char * restrict, size_t, const char * restrict, __gnuc_va_list) +vsnprintf cpp_src/cstdio 152;" d file: +vsprintf cpp_src/cstdio 96;" d file: +vsscanf cpp_src/cstdio /^ (vsscanf)(const char * restrict, const char * restrict, __gnuc_va_list);$/;" p file: signature:(const char * restrict, const char * restrict, __gnuc_va_list) +vsscanf cpp_src/cstdio 153;" d file: +vswprintf cpp_src/cwchar 100;" d file: +vswscanf cpp_src/cwchar 102;" d file: +vwprintf cpp_src/cwchar 104;" d file: +vwscanf cpp_src/cwchar 106;" d file: +wcrtomb cpp_src/cwchar 108;" d file: +wcscat cpp_src/cwchar 109;" d file: +wcschr cpp_src/cwchar /^ wcschr(wchar_t* __p, wchar_t __c)$/;" f namespace:std signature:(wchar_t* __p, wchar_t __c) +wcschr cpp_src/cwchar 110;" d file: +wcscmp cpp_src/cwchar 111;" d file: +wcscoll cpp_src/cwchar 112;" d file: +wcscpy cpp_src/cwchar 113;" d file: +wcscspn cpp_src/cwchar 114;" d file: +wcsftime cpp_src/cwchar 115;" d file: +wcslen cpp_src/cwchar 116;" d file: +wcsncat cpp_src/cwchar 117;" d file: +wcsncmp cpp_src/cwchar 118;" d file: +wcsncpy cpp_src/cwchar 119;" d file: +wcspbrk cpp_src/cwchar /^ wcspbrk(wchar_t* __s1, const wchar_t* __s2)$/;" f namespace:std signature:(wchar_t* __s1, const wchar_t* __s2) +wcspbrk cpp_src/cwchar 120;" d file: +wcsrchr cpp_src/cwchar /^ wcsrchr(wchar_t* __p, wchar_t __c)$/;" f namespace:std signature:(wchar_t* __p, wchar_t __c) +wcsrchr cpp_src/cwchar 121;" d file: +wcsrtombs cpp_src/cwchar 122;" d file: +wcsspn cpp_src/cwchar 123;" d file: +wcsstr cpp_src/cwchar /^ wcsstr(wchar_t* __s1, const wchar_t* __s2)$/;" f namespace:std signature:(wchar_t* __s1, const wchar_t* __s2) +wcsstr cpp_src/cwchar 124;" d file: +wcstod cpp_src/cwchar 125;" d file: +wcstof cpp_src/cwchar 127;" d file: +wcstok cpp_src/cwchar 129;" d file: +wcstol cpp_src/cwchar 130;" d file: +wcstold cpp_src/cwchar /^ (wcstold)(const wchar_t * restrict, wchar_t ** restrict);$/;" p file: signature:(const wchar_t * restrict, wchar_t ** restrict) +wcstold cpp_src/cwchar 244;" d file: +wcstoll cpp_src/cwchar /^ (wcstoll)(const wchar_t * restrict, wchar_t ** restrict, int);$/;" p file: signature:(const wchar_t * restrict, wchar_t ** restrict, int) +wcstoll cpp_src/cwchar 245;" d file: +wcstoul cpp_src/cwchar 131;" d file: +wcstoull cpp_src/cwchar /^ (wcstoull)(const wchar_t * restrict, wchar_t ** restrict, int);$/;" p file: signature:(const wchar_t * restrict, wchar_t ** restrict, int) +wcstoull cpp_src/cwchar 246;" d file: +wcsxfrm cpp_src/cwchar 132;" d file: +wctob cpp_src/cwchar 133;" d file: +wctrans cpp_src/cwctype 75;" d file: +wctype cpp_src/cwctype 76;" d file: +wfilebuf cpp_src/iosfwd /^ typedef basic_filebuf wfilebuf; \/\/\/< @isiosfwd$/;" t namespace:std file: +wfstream cpp_src/iosfwd /^ typedef basic_fstream wfstream; \/\/\/< @isiosfwd$/;" t namespace:std file: +what cpp_src/exception /^ virtual const char* what() const throw();$/;" p class:std::bad_exception file: access:public signature:() const +what cpp_src/exception /^ virtual const char* what() const throw();$/;" p class:std::exception file: access:public signature:() const +what cpp_src/ios_base.h /^ what() const throw();$/;" p class:std::ios_base::failure access:public signature:() const +what cpp_src/new /^ virtual const char* what() const throw();$/;" p class:std::bad_alloc file: access:public signature:() const +what cpp_src/stdexcept /^ what() const throw();$/;" p class:std::logic_error file: access:public signature:() const +what cpp_src/stdexcept /^ what() const throw();$/;" p class:std::runtime_error file: access:public signature:() const +what cpp_src/typeinfo /^ virtual const char* what() const throw();$/;" p class:std::bad_cast file: access:public signature:() const +what cpp_src/typeinfo /^ virtual const char* what() const throw();$/;" p class:std::bad_typeid file: access:public signature:() const +widen cpp_src/basic_ios.h /^ widen(char __c) const;$/;" p class:std::basic_ios access:public signature:(char __c) const +widen cpp_src/basic_ios.tcc /^ basic_ios<_CharT, _Traits>::widen(char __c) const$/;" f class:std::basic_ios signature:(char __c) const +widen cpp_src/locale_facets.h /^ widen(char __c) const$/;" f class:std::__ctype_abstract_base access:public signature:(char __c) const +widen cpp_src/locale_facets.h /^ widen(char __c) const$/;" f class:std::ctype access:public signature:(char __c) const +widen cpp_src/locale_facets.h /^ widen(const char* __lo, const char* __hi, char_type* __to) const$/;" f class:std::__ctype_abstract_base access:public signature:(const char* __lo, const char* __hi, char_type* __to) const +widen cpp_src/locale_facets.h /^ widen(const char* __lo, const char* __hi, char_type* __to) const$/;" f class:std::ctype access:public signature:(const char* __lo, const char* __hi, char_type* __to) const +width cpp_src/ios_base.h /^ width() const { return _M_width; }$/;" f class:std::ios_base access:public signature:() const +width cpp_src/ios_base.h /^ width(streamsize __wide)$/;" f class:std::ios_base access:public signature:(streamsize __wide) +wifstream cpp_src/iosfwd /^ typedef basic_ifstream wifstream; \/\/\/< @isiosfwd$/;" t namespace:std file: +wios cpp_src/iosfwd /^ typedef basic_ios wios; \/\/\/< @isiosfwd$/;" t namespace:std file: +wiostream cpp_src/iosfwd /^ typedef basic_iostream wiostream; \/\/\/< @isiosfwd$/;" t namespace:std file: +wistream cpp_src/iosfwd /^ typedef basic_istream wistream; \/\/\/< @isiosfwd$/;" t namespace:std file: +wistringstream cpp_src/iosfwd /^ typedef basic_istringstream wistringstream; \/\/\/< @isiosfwd$/;" t namespace:std file: +wmemchr cpp_src/cwchar /^ wmemchr(wchar_t* __p, wchar_t __c, size_t __n)$/;" f namespace:std signature:(wchar_t* __p, wchar_t __c, size_t __n) +wmemchr cpp_src/cwchar 134;" d file: +wmemcmp cpp_src/cwchar 135;" d file: +wmemcpy cpp_src/cwchar 136;" d file: +wmemmove cpp_src/cwchar 137;" d file: +wmemset cpp_src/cwchar 138;" d file: +wofstream cpp_src/iosfwd /^ typedef basic_ofstream wofstream; \/\/\/< @isiosfwd$/;" t namespace:std file: +wostream cpp_src/iosfwd /^ typedef basic_ostream wostream; \/\/\/< @isiosfwd$/;" t namespace:std file: +wostringstream cpp_src/iosfwd /^ typedef basic_ostringstream wostringstream; \/\/\/< @isiosfwd$/;" t namespace:std file: +wprintf cpp_src/cwchar 139;" d file: +write cpp_src/ostream /^ write(const char_type* __s, streamsize __n);$/;" p class:std::basic_ostream file: access:public signature:(const char_type* __s, streamsize __n) +write cpp_src/ostream.tcc /^ write(const _CharT* __s, streamsize __n)$/;" f class:std::basic_ostream signature:(const _CharT* __s, streamsize __n) +ws cpp_src/istream /^ ws(basic_istream<_CharT, _Traits>& __is);$/;" p namespace:std file: signature:(basic_istream<_CharT, _Traits>& __is) +ws cpp_src/istream.tcc /^ ws(basic_istream<_CharT,_Traits>& __in)$/;" f namespace:std signature:(basic_istream<_CharT,_Traits>& __in) +ws cpp_src/istream.tcc /^ extern template istream& ws(istream&);$/;" p namespace:std file: signature:(istream&) +ws cpp_src/istream.tcc /^ extern template wistream& ws(wistream&);$/;" p namespace:std file: signature:(wistream&) +wscanf cpp_src/cwchar 140;" d file: +wstreambuf cpp_src/iosfwd /^ typedef basic_streambuf wstreambuf; \/\/\/< @isiosfwd$/;" t namespace:std file: +wstreampos cpp_src/postypes.h /^ typedef fpos wstreampos;$/;" t namespace:std +wstring cpp_src/stringfwd.h /^ typedef basic_string wstring;$/;" t namespace:std +wstringbuf cpp_src/iosfwd /^ typedef basic_stringbuf wstringbuf; \/\/\/< @isiosfwd$/;" t namespace:std file: +wstringstream cpp_src/iosfwd /^ typedef basic_stringstream wstringstream; \/\/\/< @isiosfwd$/;" t namespace:std file: +xalloc cpp_src/ios_base.h /^ xalloc() throw();$/;" p class:std::ios_base access:public signature:() +xsgetn cpp_src/fstream /^ xsgetn(char_type* __s, streamsize __n);$/;" p class:std::basic_filebuf file: access:protected signature:(char_type* __s, streamsize __n) +xsgetn cpp_src/fstream.tcc /^ xsgetn(_CharT* __s, streamsize __n)$/;" f class:std::basic_filebuf signature:(_CharT* __s, streamsize __n) +xsgetn cpp_src/streambuf /^ xsgetn(char_type* __s, streamsize __n);$/;" p class:std::basic_streambuf file: access:protected signature:(char_type* __s, streamsize __n) +xsgetn cpp_src/streambuf.tcc /^ xsgetn(char_type* __s, streamsize __n)$/;" f class:std::basic_streambuf signature:(char_type* __s, streamsize __n) +xsputn cpp_src/fstream /^ xsputn(const char_type* __s, streamsize __n);$/;" p class:std::basic_filebuf file: access:protected signature:(const char_type* __s, streamsize __n) +xsputn cpp_src/fstream.tcc /^ xsputn(const _CharT* __s, streamsize __n)$/;" f class:std::basic_filebuf signature:(const _CharT* __s, streamsize __n) +xsputn cpp_src/streambuf /^ xsputn(const char_type* __s, streamsize __n);$/;" p class:std::basic_streambuf file: access:protected signature:(const char_type* __s, streamsize __n) +xsputn cpp_src/streambuf.tcc /^ xsputn(const char_type* __s, streamsize __n)$/;" f class:std::basic_streambuf signature:(const char_type* __s, streamsize __n) +ydm cpp_src/locale_facets.h /^ enum dateorder { no_order, dmy, mdy, ymd, ydm };$/;" e enum:std::time_base::dateorder +ymd cpp_src/locale_facets.h /^ enum dateorder { no_order, dmy, mdy, ymd, ydm };$/;" e enum:std::time_base::dateorder +~Init cpp_src/ios_base.h /^ ~Init();$/;" p class:std::ios_base::Init access:public signature:() +~_Bvector_base cpp_src/stl_bvector.h /^ ~_Bvector_base()$/;" f struct:std::_Bvector_base access:public signature:() +~_Deque_base cpp_src/stl_deque.h /^ ~_Deque_base();$/;" p class:std::_Deque_base access:public signature:() +~_Deque_base cpp_src/stl_deque.h /^ ~_Deque_base()$/;" f class:std::_Deque_base signature:() +~_Impl cpp_src/locale_classes.h /^ ~_Impl() throw();$/;" p class:std::locale::_Impl access:private signature:() +~_List_base cpp_src/stl_list.h /^ ~_List_base()$/;" f class:std::_List_base access:public signature:() +~_Rb_tree cpp_src/stl_tree.h /^ ~_Rb_tree()$/;" f class:std::_Rb_tree access:public signature:() +~_Temporary_buffer cpp_src/stl_tempbuf.h /^ ~_Temporary_buffer()$/;" f class:std::_Temporary_buffer access:public signature:() +~_Vector_base cpp_src/stl_vector.h /^ ~_Vector_base()$/;" f struct:std::_Vector_base access:public signature:() +~__codecvt_abstract_base cpp_src/codecvt.h /^ ~__codecvt_abstract_base() { }$/;" f class:std::__codecvt_abstract_base access:protected signature:() +~__ctype_abstract_base cpp_src/locale_facets.h /^ ~__ctype_abstract_base() { }$/;" f class:std::__ctype_abstract_base access:protected signature:() +~__moneypunct_cache cpp_src/locale_facets.h /^ ~__moneypunct_cache();$/;" p struct:std::__moneypunct_cache access:public signature:() +~__moneypunct_cache cpp_src/locale_facets.h /^ __moneypunct_cache<_CharT, _Intl>::~__moneypunct_cache()$/;" f class:std::__moneypunct_cache signature:() +~__numpunct_cache cpp_src/locale_facets.h /^ ~__numpunct_cache();$/;" p struct:std::__numpunct_cache access:public signature:() +~__numpunct_cache cpp_src/locale_facets.h /^ __numpunct_cache<_CharT>::~__numpunct_cache()$/;" f class:std::__numpunct_cache signature:() +~__timepunct cpp_src/locale_facets.h /^ ~__timepunct();$/;" p class:std::__timepunct access:protected signature:() +~__timepunct_cache cpp_src/locale_facets.h /^ ~__timepunct_cache();$/;" p struct:std::__timepunct_cache access:public signature:() +~__timepunct_cache cpp_src/locale_facets.h /^ __timepunct_cache<_CharT>::~__timepunct_cache()$/;" f class:std::__timepunct_cache signature:() +~allocator cpp_src/allocator.h /^ ~allocator() throw() { }$/;" f class:std::allocator access:public signature:() +~auto_ptr cpp_src/memory /^ ~auto_ptr() { delete _M_ptr; }$/;" f class:std::auto_ptr access:public signature:() +~bad_alloc cpp_src/new /^ virtual ~bad_alloc() throw();$/;" p class:std::bad_alloc file: access:public signature:() +~bad_cast cpp_src/typeinfo /^ virtual ~bad_cast() throw();$/;" p class:std::bad_cast file: access:public signature:() +~bad_exception cpp_src/exception /^ virtual ~bad_exception() throw();$/;" p class:std::bad_exception file: access:public signature:() +~bad_typeid cpp_src/typeinfo /^ virtual ~bad_typeid() throw();$/;" p class:std::bad_typeid file: access:public signature:() +~basic_filebuf cpp_src/fstream /^ ~basic_filebuf()$/;" f class:std::basic_filebuf access:public signature:() +~basic_fstream cpp_src/fstream /^ ~basic_fstream()$/;" f class:std::basic_fstream access:public signature:() +~basic_ifstream cpp_src/fstream /^ ~basic_ifstream()$/;" f class:std::basic_ifstream access:public signature:() +~basic_ios cpp_src/basic_ios.h /^ ~basic_ios() { }$/;" f class:std::basic_ios access:public signature:() +~basic_iostream cpp_src/istream /^ ~basic_iostream() { }$/;" f class:std::basic_iostream access:public signature:() +~basic_istream cpp_src/istream /^ ~basic_istream() $/;" f class:std::basic_istream access:public signature:() +~basic_istringstream cpp_src/sstream /^ ~basic_istringstream()$/;" f class:std::basic_istringstream access:public signature:() +~basic_ofstream cpp_src/fstream /^ ~basic_ofstream()$/;" f class:std::basic_ofstream access:public signature:() +~basic_ostream cpp_src/ostream /^ ~basic_ostream() { }$/;" f class:std::basic_ostream access:public signature:() +~basic_ostringstream cpp_src/sstream /^ ~basic_ostringstream()$/;" f class:std::basic_ostringstream access:public signature:() +~basic_streambuf cpp_src/streambuf /^ ~basic_streambuf() $/;" f class:std::basic_streambuf access:public signature:() +~basic_string cpp_src/basic_string.h /^ ~basic_string()$/;" f class:std::basic_string access:public signature:() +~basic_stringstream cpp_src/sstream /^ ~basic_stringstream()$/;" f class:std::basic_stringstream access:public signature:() +~codecvt cpp_src/codecvt.h /^ ~codecvt() { }$/;" f class:std::codecvt access:protected signature:() +~codecvt cpp_src/codecvt.h /^ ~codecvt();$/;" p class:std::codecvt access:protected signature:() +~codecvt_byname cpp_src/codecvt.h /^ ~codecvt_byname() { }$/;" f class:std::codecvt_byname access:protected signature:() +~collate cpp_src/locale_facets.h /^ ~collate()$/;" f class:std::collate access:protected signature:() +~collate_byname cpp_src/locale_facets.h /^ ~collate_byname() { }$/;" f class:std::collate_byname access:protected signature:() +~ctype cpp_src/locale_facets.h /^ ~ctype();$/;" p class:std::ctype access:protected signature:() +~ctype_byname cpp_src/locale_facets.h /^ ~ctype_byname() { };$/;" f class:std::ctype_byname access:protected signature:() +~deque cpp_src/stl_deque.h /^ ~deque()$/;" f class:std::deque access:public signature:() +~exception cpp_src/exception /^ virtual ~exception() throw();$/;" p class:std::exception file: access:public signature:() +~facet cpp_src/locale_classes.h /^ ~facet();$/;" p class:std::locale::facet access:protected signature:() +~failure cpp_src/ios_base.h /^ ~failure() throw();$/;" p class:std::ios_base::failure access:public signature:() +~gslice cpp_src/gslice.h /^ ~gslice();$/;" p class:std::gslice access:public signature:() +~gslice cpp_src/gslice.h /^ gslice::~gslice()$/;" f class:std::gslice signature:() +~ios_base cpp_src/ios_base.h /^ virtual ~ios_base();$/;" p class:std::ios_base access:public signature:() +~locale cpp_src/locale_classes.h /^ ~locale() throw();$/;" p class:std::locale access:public signature:() +~logic_error cpp_src/stdexcept /^ ~logic_error() throw();$/;" p class:std::logic_error file: access:public signature:() +~messages cpp_src/locale_facets.h /^ ~messages();$/;" p class:std::messages access:protected signature:() +~messages_byname cpp_src/locale_facets.h /^ ~messages_byname()$/;" f class:std::messages_byname access:protected signature:() +~money_get cpp_src/locale_facets.h /^ ~money_get() { }$/;" f class:std::money_get access:protected signature:() +~money_put cpp_src/locale_facets.h /^ ~money_put() { }$/;" f class:std::money_put access:protected signature:() +~moneypunct cpp_src/locale_facets.h /^ ~moneypunct();$/;" p class:std::moneypunct access:protected signature:() +~moneypunct cpp_src/locale_facets.h /^ moneypunct::~moneypunct();$/;" p class:std::moneypunct signature:() +~moneypunct cpp_src/locale_facets.h /^ moneypunct::~moneypunct();$/;" p class:std::moneypunct signature:() +~moneypunct cpp_src/locale_facets.h /^ moneypunct::~moneypunct();$/;" p class:std::moneypunct signature:() +~moneypunct cpp_src/locale_facets.h /^ moneypunct::~moneypunct();$/;" p class:std::moneypunct signature:() +~moneypunct_byname cpp_src/locale_facets.h /^ ~moneypunct_byname() { }$/;" f class:std::moneypunct_byname access:protected signature:() +~num_get cpp_src/locale_facets.h /^ virtual ~num_get() { }$/;" f class:std::num_get access:protected signature:() +~num_put cpp_src/locale_facets.h /^ ~num_put() { };$/;" f class:std::num_put access:protected signature:() +~numpunct cpp_src/locale_facets.h /^ ~numpunct();$/;" p class:std::numpunct access:protected signature:() +~numpunct cpp_src/locale_facets.h /^ numpunct::~numpunct();$/;" p class:std::numpunct signature:() +~numpunct cpp_src/locale_facets.h /^ numpunct::~numpunct();$/;" p class:std::numpunct signature:() +~numpunct_byname cpp_src/locale_facets.h /^ ~numpunct_byname() { }$/;" f class:std::numpunct_byname access:protected signature:() +~reference cpp_src/bitset /^ ~reference()$/;" f class:std::bitset::reference access:public signature:() +~runtime_error cpp_src/stdexcept /^ ~runtime_error() throw();$/;" p class:std::runtime_error file: access:public signature:() +~sentry cpp_src/ostream /^ ~sentry()$/;" f class:std::basic_ostream::sentry access:public signature:() +~time_get cpp_src/locale_facets.h /^ ~time_get() { }$/;" f class:std::time_get access:protected signature:() +~time_get_byname cpp_src/locale_facets.h /^ ~time_get_byname() { }$/;" f class:std::time_get_byname access:protected signature:() +~time_put cpp_src/locale_facets.h /^ ~time_put()$/;" f class:std::time_put access:protected signature:() +~time_put_byname cpp_src/locale_facets.h /^ ~time_put_byname() { }$/;" f class:std::time_put_byname access:protected signature:() +~type_info cpp_src/typeinfo /^ virtual ~type_info();$/;" p class:std::type_info file: access:public signature:() +~valarray cpp_src/valarray /^ ~valarray();$/;" p class:std::valarray file: access:public signature:() +~valarray cpp_src/valarray /^ valarray<_Tp>::~valarray()$/;" f class:std::valarray signature:() +~vector cpp_src/stl_bvector.h /^ ~vector() { }$/;" f class:std::vector access:public signature:() +~vector cpp_src/stl_vector.h /^ ~vector()$/;" f class:std::vector access:public signature:() diff --git a/cpp_src/algorithm b/cpp_src/algorithm new file mode 100644 index 0000000..7ffbf97 --- /dev/null +++ b/cpp_src/algorithm @@ -0,0 +1,70 @@ +// -*- C++ -*- + +// Copyright (C) 2001, 2002 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file include/algorithm + * This is a Standard C++ Library header. + */ + +#ifndef _GLIBCXX_ALGORITHM +#define _GLIBCXX_ALGORITHM 1 + +#pragma GCC system_header + +#include +#include +#include +#include + +#endif /* _GLIBCXX_ALGORITHM */ diff --git a/cpp_src/allocator.h b/cpp_src/allocator.h new file mode 100644 index 0000000..fcd5635 --- /dev/null +++ b/cpp_src/allocator.h @@ -0,0 +1,163 @@ +// Allocators -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * Copyright (c) 1996-1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file allocator.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _ALLOCATOR_H +#define _ALLOCATOR_H 1 + +// Define the base class to std::allocator. +#include + +#include // for __is_empty + +namespace std { + + template + class allocator; + + /// allocator specialization. + template<> + class allocator + { + public: + typedef size_t size_type; + typedef ptrdiff_t difference_type; + typedef void* pointer; + typedef const void* const_pointer; + typedef void value_type; + + template + struct rebind + { typedef allocator<_Tp1> other; }; + }; + + /** + * @brief The "standard" allocator, as per [20.4]. + * + * Further details: + * http://gcc.gnu.org/onlinedocs/libstdc++/20_util/allocator.html + */ + template + class allocator: public __glibcxx_base_allocator<_Tp> + { + public: + typedef size_t size_type; + typedef ptrdiff_t difference_type; + typedef _Tp* pointer; + typedef const _Tp* const_pointer; + typedef _Tp& reference; + typedef const _Tp& const_reference; + typedef _Tp value_type; + + template + struct rebind + { typedef allocator<_Tp1> other; }; + + allocator() throw() { } + + allocator(const allocator& __a) throw() + : __glibcxx_base_allocator<_Tp>(__a) { } + + template + allocator(const allocator<_Tp1>&) throw() { } + + ~allocator() throw() { } + + // Inherit everything else. + }; + + template + inline bool + operator==(const allocator<_T1>&, const allocator<_T2>&) + { return true; } + + template + inline bool + operator==(const allocator<_Tp>&, const allocator<_Tp>&) + { return true; } + + template + inline bool + operator!=(const allocator<_T1>&, const allocator<_T2>&) + { return false; } + + template + inline bool + operator!=(const allocator<_Tp>&, const allocator<_Tp>&) + { return false; } + + // Inhibit implicit instantiations for required instantiations, + // which are defined via explicit instantiations elsewhere. + // NB: This syntax is a GNU extension. +#if _GLIBCXX_EXTERN_TEMPLATE + extern template class allocator; + extern template class allocator; +#endif + + // Undefine. +#undef __glibcxx_base_allocator + + // To implement Option 3 of DR 431. + template::__value> + struct __alloc_swap + { static void _S_do_it(_Alloc&, _Alloc&) { } }; + + template + struct __alloc_swap<_Alloc, false> + { + static void + _S_do_it(_Alloc& __one, _Alloc& __two) + { + // Precondition: swappable allocators. + if (__one != __two) + swap(__one, __two); + } + }; + +} // namespace std + +#endif diff --git a/cpp_src/basic_ios.h b/cpp_src/basic_ios.h new file mode 100644 index 0000000..a58d970 --- /dev/null +++ b/cpp_src/basic_ios.h @@ -0,0 +1,468 @@ +// Iostreams base classes -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2001, 2002, 2003, 2004, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file basic_ios.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _BASIC_IOS_H +#define _BASIC_IOS_H 1 + +#pragma GCC system_header + +#include +#include +#include +#include + +namespace std { + + // 27.4.5 Template class basic_ios + /** + * @brief Virtual base class for all stream classes. + * + * Most of the member functions called dispatched on stream objects + * (e.g., @c std::cout.foo(bar);) are consolidated in this class. + */ + template + class basic_ios : public ios_base + { + public: + //@{ + /** + * These are standard types. They permit a standardized way of + * referring to names of (or names dependant on) the template + * parameters, which are specific to the implementation. + */ + typedef _CharT char_type; + typedef typename _Traits::int_type int_type; + typedef typename _Traits::pos_type pos_type; + typedef typename _Traits::off_type off_type; + typedef _Traits traits_type; + //@} + + //@{ + /** + * @if maint + * These are non-standard types. + * @endif + */ + typedef ctype<_CharT> __ctype_type; + typedef num_put<_CharT, ostreambuf_iterator<_CharT, _Traits> > + __num_put_type; + typedef num_get<_CharT, istreambuf_iterator<_CharT, _Traits> > + __num_get_type; + //@} + + // Data members: + protected: + basic_ostream<_CharT, _Traits>* _M_tie; + mutable char_type _M_fill; + mutable bool _M_fill_init; + basic_streambuf<_CharT, _Traits>* _M_streambuf; + + // Cached use_facet, which is based on the current locale info. + const __ctype_type* _M_ctype; + // For ostream. + const __num_put_type* _M_num_put; + // For istream. + const __num_get_type* _M_num_get; + + public: + //@{ + /** + * @brief The quick-and-easy status check. + * + * This allows you to write constructs such as + * "if (!a_stream) ..." and "while (a_stream) ..." + */ + operator void*() const + { return this->fail() ? 0 : const_cast(this); } + + bool + operator!() const + { return this->fail(); } + //@} + + /** + * @brief Returns the error state of the stream buffer. + * @return A bit pattern (well, isn't everything?) + * + * See std::ios_base::iostate for the possible bit values. Most + * users will call one of the interpreting wrappers, e.g., good(). + */ + iostate + rdstate() const + { return _M_streambuf_state; } + + /** + * @brief [Re]sets the error state. + * @param state The new state flag(s) to set. + * + * See std::ios_base::iostate for the possible bit values. Most + * users will not need to pass an argument. + */ + void + clear(iostate __state = goodbit); + + /** + * @brief Sets additional flags in the error state. + * @param state The additional state flag(s) to set. + * + * See std::ios_base::iostate for the possible bit values. + */ + void + setstate(iostate __state) + { this->clear(this->rdstate() | __state); } + + // Flip the internal state on for the proper state bits, then re + // throws the propagated exception if bit also set in + // exceptions(). + void + _M_setstate(iostate __state) + { + // 27.6.1.2.1 Common requirements. + // Turn this on without causing an ios::failure to be thrown. + _M_streambuf_state |= __state; + if (this->exceptions() & __state) + __throw_exception_again; + } + + /** + * @brief Fast error checking. + * @return True if no error flags are set. + * + * A wrapper around rdstate. + */ + bool + good() const + { return this->rdstate() == 0; } + + /** + * @brief Fast error checking. + * @return True if the eofbit is set. + * + * Note that other iostate flags may also be set. + */ + bool + eof() const + { return (this->rdstate() & eofbit) != 0; } + + /** + * @brief Fast error checking. + * @return True if either the badbit or the failbit is set. + * + * Checking the badbit in fail() is historical practice. + * Note that other iostate flags may also be set. + */ + bool + fail() const + { return (this->rdstate() & (badbit | failbit)) != 0; } + + /** + * @brief Fast error checking. + * @return True if the badbit is set. + * + * Note that other iostate flags may also be set. + */ + bool + bad() const + { return (this->rdstate() & badbit) != 0; } + + /** + * @brief Throwing exceptions on errors. + * @return The current exceptions mask. + * + * This changes nothing in the stream. See the one-argument version + * of exceptions(iostate) for the meaning of the return value. + */ + iostate + exceptions() const + { return _M_exception; } + + /** + * @brief Throwing exceptions on errors. + * @param except The new exceptions mask. + * + * By default, error flags are set silently. You can set an + * exceptions mask for each stream; if a bit in the mask becomes set + * in the error flags, then an exception of type + * std::ios_base::failure is thrown. + * + * If the error flage is already set when the exceptions mask is + * added, the exception is immediately thrown. Try running the + * following under GCC 3.1 or later: + * @code + * #include + * #include + * #include + * + * int main() + * { + * std::set_terminate (__gnu_cxx::__verbose_terminate_handler); + * + * std::ifstream f ("/etc/motd"); + * + * std::cerr << "Setting badbit\n"; + * f.setstate (std::ios_base::badbit); + * + * std::cerr << "Setting exception mask\n"; + * f.exceptions (std::ios_base::badbit); + * } + * @endcode + */ + void + exceptions(iostate __except) + { + _M_exception = __except; + this->clear(_M_streambuf_state); + } + + // Constructor/destructor: + /** + * @brief Constructor performs initialization. + * + * The parameter is passed by derived streams. + */ + explicit + basic_ios(basic_streambuf<_CharT, _Traits>* __sb) + : ios_base(), _M_tie(0), _M_fill(), _M_fill_init(false), _M_streambuf(0), + _M_ctype(0), _M_num_put(0), _M_num_get(0) + { this->init(__sb); } + + /** + * @brief Empty. + * + * The destructor does nothing. More specifically, it does not + * destroy the streambuf held by rdbuf(). + */ + virtual + ~basic_ios() { } + + // Members: + /** + * @brief Fetches the current @e tied stream. + * @return A pointer to the tied stream, or NULL if the stream is + * not tied. + * + * A stream may be @e tied (or synchronized) to a second output + * stream. When this stream performs any I/O, the tied stream is + * first flushed. For example, @c std::cin is tied to @c std::cout. + */ + basic_ostream<_CharT, _Traits>* + tie() const + { return _M_tie; } + + /** + * @brief Ties this stream to an output stream. + * @param tiestr The output stream. + * @return The previously tied output stream, or NULL if the stream + * was not tied. + * + * This sets up a new tie; see tie() for more. + */ + basic_ostream<_CharT, _Traits>* + tie(basic_ostream<_CharT, _Traits>* __tiestr) + { + basic_ostream<_CharT, _Traits>* __old = _M_tie; + _M_tie = __tiestr; + return __old; + } + + /** + * @brief Accessing the underlying buffer. + * @return The current stream buffer. + * + * This does not change the state of the stream. + */ + basic_streambuf<_CharT, _Traits>* + rdbuf() const + { return _M_streambuf; } + + /** + * @brief Changing the underlying buffer. + * @param sb The new stream buffer. + * @return The previous stream buffer. + * + * Associates a new buffer with the current stream, and clears the + * error state. + * + * Due to historical accidents which the LWG refuses to correct, the + * I/O library suffers from a design error: this function is hidden + * in derived classes by overrides of the zero-argument @c rdbuf(), + * which is non-virtual for hysterical raisins. As a result, you + * must use explicit qualifications to access this function via any + * derived class. For example: + * + * @code + * std::fstream foo; // or some other derived type + * std::streambuf* p = .....; + * + * foo.ios::rdbuf(p); // ios == basic_ios + * @endcode + */ + basic_streambuf<_CharT, _Traits>* + rdbuf(basic_streambuf<_CharT, _Traits>* __sb); + + /** + * @brief Copies fields of __rhs into this. + * @param __rhs The source values for the copies. + * @return Reference to this object. + * + * All fields of __rhs are copied into this object except that rdbuf() + * and rdstate() remain unchanged. All values in the pword and iword + * arrays are copied. Before copying, each callback is invoked with + * erase_event. After copying, each (new) callback is invoked with + * copyfmt_event. The final step is to copy exceptions(). + */ + basic_ios& + copyfmt(const basic_ios& __rhs); + + /** + * @brief Retreives the "empty" character. + * @return The current fill character. + * + * It defaults to a space (' ') in the current locale. + */ + char_type + fill() const + { + if (!_M_fill_init) + { + _M_fill = this->widen(' '); + _M_fill_init = true; + } + return _M_fill; + } + + /** + * @brief Sets a new "empty" character. + * @param ch The new character. + * @return The previous fill character. + * + * The fill character is used to fill out space when P+ characters + * have been requested (e.g., via setw), Q characters are actually + * used, and Qfill(); + _M_fill = __ch; + return __old; + } + + // Locales: + /** + * @brief Moves to a new locale. + * @param loc The new locale. + * @return The previous locale. + * + * Calls @c ios_base::imbue(loc), and if a stream buffer is associated + * with this stream, calls that buffer's @c pubimbue(loc). + * + * Additional l10n notes are at + * http://gcc.gnu.org/onlinedocs/libstdc++/22_locale/howto.html + */ + locale + imbue(const locale& __loc); + + /** + * @brief Squeezes characters. + * @param c The character to narrow. + * @param dfault The character to narrow. + * @return The narrowed character. + * + * Maps a character of @c char_type to a character of @c char, + * if possible. + * + * Returns the result of + * @code + * std::use_facet >(getloc()).narrow(c,dfault) + * @endcode + * + * Additional l10n notes are at + * http://gcc.gnu.org/onlinedocs/libstdc++/22_locale/howto.html + */ + char + narrow(char_type __c, char __dfault) const; + + /** + * @brief Widens characters. + * @param c The character to widen. + * @return The widened character. + * + * Maps a character of @c char to a character of @c char_type. + * + * Returns the result of + * @code + * std::use_facet >(getloc()).widen(c) + * @endcode + * + * Additional l10n notes are at + * http://gcc.gnu.org/onlinedocs/libstdc++/22_locale/howto.html + */ + char_type + widen(char __c) const; + + protected: + // 27.4.5.1 basic_ios constructors + /** + * @brief Empty. + * + * The default constructor does nothing and is not normally + * accessible to users. + */ + basic_ios() + : ios_base(), _M_tie(0), _M_fill(char_type()), _M_fill_init(false), + _M_streambuf(0), _M_ctype(0), _M_num_put(0), _M_num_get(0) + { } + + /** + * @brief All setup is performed here. + * + * This is called from the public constructor. It is not virtual and + * cannot be redefined. + */ + void + init(basic_streambuf<_CharT, _Traits>* __sb); + + void + _M_cache_locale(const locale& __loc); + }; + +} // namespace std + +#ifndef _GLIBCXX_EXPORT_TEMPLATE +#include +#endif + +#endif /* _BASIC_IOS_H */ diff --git a/cpp_src/basic_ios.tcc b/cpp_src/basic_ios.tcc new file mode 100644 index 0000000..c515284 --- /dev/null +++ b/cpp_src/basic_ios.tcc @@ -0,0 +1,202 @@ +// basic_ios member functions -*- C++ -*- + +// Copyright (C) 1999, 2001, 2002, 2003, 2004, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file basic_ios.tcc + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _BASIC_IOS_TCC +#define _BASIC_IOS_TCC 1 + +#pragma GCC system_header + +namespace std { + + template + void + basic_ios<_CharT, _Traits>::clear(iostate __state) + { + if (this->rdbuf()) + _M_streambuf_state = __state; + else + _M_streambuf_state = __state | badbit; + if (this->exceptions() & this->rdstate()) + __throw_ios_failure(__N("basic_ios::clear")); + } + + template + basic_streambuf<_CharT, _Traits>* + basic_ios<_CharT, _Traits>::rdbuf(basic_streambuf<_CharT, _Traits>* __sb) + { + basic_streambuf<_CharT, _Traits>* __old = _M_streambuf; + _M_streambuf = __sb; + this->clear(); + return __old; + } + + template + basic_ios<_CharT, _Traits>& + basic_ios<_CharT, _Traits>::copyfmt(const basic_ios& __rhs) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 292. effects of a.copyfmt (a) + if (this != &__rhs) + { + // Per 27.1.1, do not call imbue, yet must trash all caches + // associated with imbue() + + // Alloc any new word array first, so if it fails we have "rollback". + _Words* __words = (__rhs._M_word_size <= _S_local_word_size) ? + _M_local_word : new _Words[__rhs._M_word_size]; + + // Bump refs before doing callbacks, for safety. + _Callback_list* __cb = __rhs._M_callbacks; + if (__cb) + __cb->_M_add_reference(); + _M_call_callbacks(erase_event); + if (_M_word != _M_local_word) + { + delete [] _M_word; + _M_word = 0; + } + _M_dispose_callbacks(); + + // NB: Don't want any added during above. + _M_callbacks = __cb; + for (int __i = 0; __i < __rhs._M_word_size; ++__i) + __words[__i] = __rhs._M_word[__i]; + _M_word = __words; + _M_word_size = __rhs._M_word_size; + + this->flags(__rhs.flags()); + this->width(__rhs.width()); + this->precision(__rhs.precision()); + this->tie(__rhs.tie()); + this->fill(__rhs.fill()); + _M_ios_locale = __rhs.getloc(); + _M_cache_locale(_M_ios_locale); + + _M_call_callbacks(copyfmt_event); + + // The next is required to be the last assignment. + this->exceptions(__rhs.exceptions()); + } + return *this; + } + + template + char + basic_ios<_CharT, _Traits>::narrow(char_type __c, char __dfault) const + { return __check_facet(_M_ctype).narrow(__c, __dfault); } + + template + _CharT + basic_ios<_CharT, _Traits>::widen(char __c) const + { return __check_facet(_M_ctype).widen(__c); } + + // Locales: + template + locale + basic_ios<_CharT, _Traits>::imbue(const locale& __loc) + { + locale __old(this->getloc()); + ios_base::imbue(__loc); + _M_cache_locale(__loc); + if (this->rdbuf() != 0) + this->rdbuf()->pubimbue(__loc); + return __old; + } + + template + void + basic_ios<_CharT, _Traits>::init(basic_streambuf<_CharT, _Traits>* __sb) + { + // NB: This may be called more than once on the same object. + ios_base::_M_init(); + + // Cache locale data and specific facets used by iostreams. + _M_cache_locale(_M_ios_locale); + + // NB: The 27.4.4.1 Postconditions Table specifies requirements + // after basic_ios::init() has been called. As part of this, + // fill() must return widen(' ') any time after init() has been + // called, which needs an imbued ctype facet of char_type to + // return without throwing an exception. Unfortunately, + // ctype is not necessarily a required facet, so + // streams with char_type != [char, wchar_t] will not have it by + // default. Because of this, the correct value for _M_fill is + // constructed on the first call of fill(). That way, + // unformatted input and output with non-required basic_ios + // instantiations is possible even without imbuing the expected + // ctype facet. + _M_fill = _CharT(); + _M_fill_init = false; + + _M_tie = 0; + _M_exception = goodbit; + _M_streambuf = __sb; + _M_streambuf_state = __sb ? goodbit : badbit; + } + + template + void + basic_ios<_CharT, _Traits>::_M_cache_locale(const locale& __loc) + { + if (__builtin_expect(has_facet<__ctype_type>(__loc), true)) + _M_ctype = &use_facet<__ctype_type>(__loc); + else + _M_ctype = 0; + + if (__builtin_expect(has_facet<__num_put_type>(__loc), true)) + _M_num_put = &use_facet<__num_put_type>(__loc); + else + _M_num_put = 0; + + if (__builtin_expect(has_facet<__num_get_type>(__loc), true)) + _M_num_get = &use_facet<__num_get_type>(__loc); + else + _M_num_get = 0; + } + + // Inhibit implicit instantiations for required instantiations, + // which are defined via explicit instantiations elsewhere. + // NB: This syntax is a GNU extension. +#if _GLIBCXX_EXTERN_TEMPLATE + extern template class basic_ios; + +#ifdef _GLIBCXX_USE_WCHAR_T + extern template class basic_ios; +#endif +#endif + +} // namespace std + +#endif diff --git a/cpp_src/basic_string.h b/cpp_src/basic_string.h new file mode 100644 index 0000000..5bb6cc2 --- /dev/null +++ b/cpp_src/basic_string.h @@ -0,0 +1,2457 @@ +// Components for manipulating sequences of characters -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file basic_string.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 21 Strings library +// + +#ifndef _BASIC_STRING_H +#define _BASIC_STRING_H 1 + +#pragma GCC system_header + +#include +#include + +namespace std { + + /** + * @class basic_string basic_string.h + * @brief Managing sequences of characters and character-like objects. + * + * @ingroup Containers + * @ingroup Sequences + * + * Meets the requirements of a container, a + * reversible container, and a + * sequence. Of the + * optional sequence requirements, only + * @c push_back, @c at, and array access are supported. + * + * @doctodo + * + * + * @if maint + * Documentation? What's that? + * Nathan Myers . + * + * A string looks like this: + * + * @code + * [_Rep] + * _M_length + * [basic_string] _M_capacity + * _M_dataplus _M_refcount + * _M_p ----------------> unnamed array of char_type + * @endcode + * + * Where the _M_p points to the first character in the string, and + * you cast it to a pointer-to-_Rep and subtract 1 to get a + * pointer to the header. + * + * This approach has the enormous advantage that a string object + * requires only one allocation. All the ugliness is confined + * within a single pair of inline functions, which each compile to + * a single "add" instruction: _Rep::_M_data(), and + * string::_M_rep(); and the allocation function which gets a + * block of raw bytes and with room enough and constructs a _Rep + * object at the front. + * + * The reason you want _M_data pointing to the character array and + * not the _Rep is so that the debugger can see the string + * contents. (Probably we should add a non-inline member to get + * the _Rep for the debugger to use, so users can check the actual + * string length.) + * + * Note that the _Rep object is a POD so that you can have a + * static "empty string" _Rep object already "constructed" before + * static constructors have run. The reference-count encoding is + * chosen so that a 0 indicates one reference, so you never try to + * destroy the empty-string _Rep object. + * + * All but the last paragraph is considered pretty conventional + * for a C++ string implementation. + * @endif + */ + // 21.3 Template class basic_string + template + class basic_string + { + typedef typename _Alloc::template rebind<_CharT>::other _CharT_alloc_type; + + // Types: + public: + typedef _Traits traits_type; + typedef typename _Traits::char_type value_type; + typedef _Alloc allocator_type; + typedef typename _CharT_alloc_type::size_type size_type; + typedef typename _CharT_alloc_type::difference_type difference_type; + typedef typename _CharT_alloc_type::reference reference; + typedef typename _CharT_alloc_type::const_reference const_reference; + typedef typename _CharT_alloc_type::pointer pointer; + typedef typename _CharT_alloc_type::const_pointer const_pointer; + typedef __gnu_cxx::__normal_iterator iterator; + typedef __gnu_cxx::__normal_iterator + const_iterator; + typedef std::reverse_iterator const_reverse_iterator; + typedef std::reverse_iterator reverse_iterator; + + private: + // _Rep: string representation + // Invariants: + // 1. String really contains _M_length + 1 characters: due to 21.3.4 + // must be kept null-terminated. + // 2. _M_capacity >= _M_length + // Allocated memory is always (_M_capacity + 1) * sizeof(_CharT). + // 3. _M_refcount has three states: + // -1: leaked, one reference, no ref-copies allowed, non-const. + // 0: one reference, non-const. + // n>0: n + 1 references, operations require a lock, const. + // 4. All fields==0 is an empty string, given the extra storage + // beyond-the-end for a null terminator; thus, the shared + // empty string representation needs no constructor. + + struct _Rep_base + { + size_type _M_length; + size_type _M_capacity; + _Atomic_word _M_refcount; + }; + + struct _Rep : _Rep_base + { + // Types: + typedef typename _Alloc::template rebind::other _Raw_bytes_alloc; + + // (Public) Data members: + + // The maximum number of individual char_type elements of an + // individual string is determined by _S_max_size. This is the + // value that will be returned by max_size(). (Whereas npos + // is the maximum number of bytes the allocator can allocate.) + // If one was to divvy up the theoretical largest size string, + // with a terminating character and m _CharT elements, it'd + // look like this: + // npos = sizeof(_Rep) + (m * sizeof(_CharT)) + sizeof(_CharT) + // Solving for m: + // m = ((npos - sizeof(_Rep))/sizeof(CharT)) - 1 + // In addition, this implementation quarters this amount. + static const size_type _S_max_size; + static const _CharT _S_terminal; + + // The following storage is init'd to 0 by the linker, resulting + // (carefully) in an empty string with one reference. + static size_type _S_empty_rep_storage[]; + + static _Rep& + _S_empty_rep() + { + // NB: Mild hack to avoid strict-aliasing warnings. Note that + // _S_empty_rep_storage is never modified and the punning should + // be reasonably safe in this case. + void* __p = reinterpret_cast(&_S_empty_rep_storage); + return *reinterpret_cast<_Rep*>(__p); + } + + bool + _M_is_leaked() const + { return this->_M_refcount < 0; } + + bool + _M_is_shared() const + { return this->_M_refcount > 0; } + + void + _M_set_leaked() + { this->_M_refcount = -1; } + + void + _M_set_sharable() + { this->_M_refcount = 0; } + + void + _M_set_length_and_sharable(size_type __n) + { + this->_M_set_sharable(); // One reference. + this->_M_length = __n; + traits_type::assign(this->_M_refdata()[__n], _S_terminal); + // grrr. (per 21.3.4) + // You cannot leave those LWG people alone for a second. + } + + _CharT* + _M_refdata() throw() + { return reinterpret_cast<_CharT*>(this + 1); } + + _CharT* + _M_grab(const _Alloc& __alloc1, const _Alloc& __alloc2) + { + return (!_M_is_leaked() && __alloc1 == __alloc2) + ? _M_refcopy() : _M_clone(__alloc1); + } + + // Create & Destroy + static _Rep* + _S_create(size_type, size_type, const _Alloc&); + + void + _M_dispose(const _Alloc& __a) + { +#ifndef _GLIBCXX_FULLY_DYNAMIC_STRING + if (__builtin_expect(this != &_S_empty_rep(), false)) +#endif + if (__gnu_cxx::__exchange_and_add_dispatch(&this->_M_refcount, + -1) <= 0) + _M_destroy(__a); + } // XXX MT + + void + _M_destroy(const _Alloc&) throw(); + + _CharT* + _M_refcopy() throw() + { +#ifndef _GLIBCXX_FULLY_DYNAMIC_STRING + if (__builtin_expect(this != &_S_empty_rep(), false)) +#endif + __gnu_cxx::__atomic_add_dispatch(&this->_M_refcount, 1); + return _M_refdata(); + } // XXX MT + + _CharT* + _M_clone(const _Alloc&, size_type __res = 0); + }; + + // Use empty-base optimization: http://www.cantrip.org/emptyopt.html + struct _Alloc_hider : _Alloc + { + _Alloc_hider(_CharT* __dat, const _Alloc& __a) + : _Alloc(__a), _M_p(__dat) { } + + _CharT* _M_p; // The actual data. + }; + + public: + // Data Members (public): + // NB: This is an unsigned type, and thus represents the maximum + // size that the allocator can hold. + /// Value returned by various member functions when they fail. + static const size_type npos = static_cast(-1); + + private: + // Data Members (private): + mutable _Alloc_hider _M_dataplus; + + _CharT* + _M_data() const + { return _M_dataplus._M_p; } + + _CharT* + _M_data(_CharT* __p) + { return (_M_dataplus._M_p = __p); } + + _Rep* + _M_rep() const + { return &((reinterpret_cast<_Rep*> (_M_data()))[-1]); } + + // For the internal use we have functions similar to `begin'/`end' + // but they do not call _M_leak. + iterator + _M_ibegin() const + { return iterator(_M_data()); } + + iterator + _M_iend() const + { return iterator(_M_data() + this->size()); } + + void + _M_leak() // for use in begin() & non-const op[] + { + if (!_M_rep()->_M_is_leaked()) + _M_leak_hard(); + } + + size_type + _M_check(size_type __pos, const char* __s) const + { + if (__pos > this->size()) + __throw_out_of_range(__N(__s)); + return __pos; + } + + void + _M_check_length(size_type __n1, size_type __n2, const char* __s) const + { + if (this->max_size() - (this->size() - __n1) < __n2) + __throw_length_error(__N(__s)); + } + + // NB: _M_limit doesn't check for a bad __pos value. + size_type + _M_limit(size_type __pos, size_type __off) const + { + const bool __testoff = __off < this->size() - __pos; + return __testoff ? __off : this->size() - __pos; + } + + // True if _Rep and source do not overlap. + bool + _M_disjunct(const _CharT* __s) const + { + return (less()(__s, _M_data()) + || less()(_M_data() + this->size(), __s)); + } + + // When __n = 1 way faster than the general multichar + // traits_type::copy/move/assign. + static void + _M_copy(_CharT* __d, const _CharT* __s, size_type __n) + { + if (__n == 1) + traits_type::assign(*__d, *__s); + else + traits_type::copy(__d, __s, __n); + } + + static void + _M_move(_CharT* __d, const _CharT* __s, size_type __n) + { + if (__n == 1) + traits_type::assign(*__d, *__s); + else + traits_type::move(__d, __s, __n); + } + + static void + _M_assign(_CharT* __d, size_type __n, _CharT __c) + { + if (__n == 1) + traits_type::assign(*__d, __c); + else + traits_type::assign(__d, __n, __c); + } + + // _S_copy_chars is a separate template to permit specialization + // to optimize for the common case of pointers as iterators. + template + static void + _S_copy_chars(_CharT* __p, _Iterator __k1, _Iterator __k2) + { + for (; __k1 != __k2; ++__k1, ++__p) + traits_type::assign(*__p, *__k1); // These types are off. + } + + static void + _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2) + { _S_copy_chars(__p, __k1.base(), __k2.base()); } + + static void + _S_copy_chars(_CharT* __p, const_iterator __k1, const_iterator __k2) + { _S_copy_chars(__p, __k1.base(), __k2.base()); } + + static void + _S_copy_chars(_CharT* __p, _CharT* __k1, _CharT* __k2) + { _M_copy(__p, __k1, __k2 - __k1); } + + static void + _S_copy_chars(_CharT* __p, const _CharT* __k1, const _CharT* __k2) + { _M_copy(__p, __k1, __k2 - __k1); } + + void + _M_mutate(size_type __pos, size_type __len1, size_type __len2); + + void + _M_leak_hard(); + + static _Rep& + _S_empty_rep() + { return _Rep::_S_empty_rep(); } + + public: + // Construct/copy/destroy: + // NB: We overload ctors in some cases instead of using default + // arguments, per 17.4.4.4 para. 2 item 2. + + /** + * @brief Default constructor creates an empty string. + */ + inline + basic_string(); + + /** + * @brief Construct an empty string using allocator @a a. + */ + explicit + basic_string(const _Alloc& __a); + + // NB: per LWG issue 42, semantics different from IS: + /** + * @brief Construct string with copy of value of @a str. + * @param str Source string. + */ + basic_string(const basic_string& __str); + /** + * @brief Construct string as copy of a substring. + * @param str Source string. + * @param pos Index of first character to copy from. + * @param n Number of characters to copy (default remainder). + */ + basic_string(const basic_string& __str, size_type __pos, + size_type __n = npos); + /** + * @brief Construct string as copy of a substring. + * @param str Source string. + * @param pos Index of first character to copy from. + * @param n Number of characters to copy. + * @param a Allocator to use. + */ + basic_string(const basic_string& __str, size_type __pos, + size_type __n, const _Alloc& __a); + + /** + * @brief Construct string initialized by a character array. + * @param s Source character array. + * @param n Number of characters to copy. + * @param a Allocator to use (default is default allocator). + * + * NB: @a s must have at least @a n characters, '\0' has no special + * meaning. + */ + basic_string(const _CharT* __s, size_type __n, + const _Alloc& __a = _Alloc()); + /** + * @brief Construct string as copy of a C string. + * @param s Source C string. + * @param a Allocator to use (default is default allocator). + */ + basic_string(const _CharT* __s, const _Alloc& __a = _Alloc()); + /** + * @brief Construct string as multiple characters. + * @param n Number of characters. + * @param c Character to use. + * @param a Allocator to use (default is default allocator). + */ + basic_string(size_type __n, _CharT __c, const _Alloc& __a = _Alloc()); + + /** + * @brief Construct string as copy of a range. + * @param beg Start of range. + * @param end End of range. + * @param a Allocator to use (default is default allocator). + */ + template + basic_string(_InputIterator __beg, _InputIterator __end, + const _Alloc& __a = _Alloc()); + + /** + * @brief Destroy the string instance. + */ + ~basic_string() + { _M_rep()->_M_dispose(this->get_allocator()); } + + /** + * @brief Assign the value of @a str to this string. + * @param str Source string. + */ + basic_string& + operator=(const basic_string& __str) + { return this->assign(__str); } + + /** + * @brief Copy contents of @a s into this string. + * @param s Source null-terminated string. + */ + basic_string& + operator=(const _CharT* __s) + { return this->assign(__s); } + + /** + * @brief Set value to string of length 1. + * @param c Source character. + * + * Assigning to a character makes this string length 1 and + * (*this)[0] == @a c. + */ + basic_string& + operator=(_CharT __c) + { + this->assign(1, __c); + return *this; + } + + // Iterators: + /** + * Returns a read/write iterator that points to the first character in + * the %string. Unshares the string. + */ + iterator + begin() + { + _M_leak(); + return iterator(_M_data()); + } + + /** + * Returns a read-only (constant) iterator that points to the first + * character in the %string. + */ + const_iterator + begin() const + { return const_iterator(_M_data()); } + + /** + * Returns a read/write iterator that points one past the last + * character in the %string. Unshares the string. + */ + iterator + end() + { + _M_leak(); + return iterator(_M_data() + this->size()); + } + + /** + * Returns a read-only (constant) iterator that points one past the + * last character in the %string. + */ + const_iterator + end() const + { return const_iterator(_M_data() + this->size()); } + + /** + * Returns a read/write reverse iterator that points to the last + * character in the %string. Iteration is done in reverse element + * order. Unshares the string. + */ + reverse_iterator + rbegin() + { return reverse_iterator(this->end()); } + + /** + * Returns a read-only (constant) reverse iterator that points + * to the last character in the %string. Iteration is done in + * reverse element order. + */ + const_reverse_iterator + rbegin() const + { return const_reverse_iterator(this->end()); } + + /** + * Returns a read/write reverse iterator that points to one before the + * first character in the %string. Iteration is done in reverse + * element order. Unshares the string. + */ + reverse_iterator + rend() + { return reverse_iterator(this->begin()); } + + /** + * Returns a read-only (constant) reverse iterator that points + * to one before the first character in the %string. Iteration + * is done in reverse element order. + */ + const_reverse_iterator + rend() const + { return const_reverse_iterator(this->begin()); } + + public: + // Capacity: + /// Returns the number of characters in the string, not including any + /// null-termination. + size_type + size() const + { return _M_rep()->_M_length; } + + /// Returns the number of characters in the string, not including any + /// null-termination. + size_type + length() const + { return _M_rep()->_M_length; } + + /// Returns the size() of the largest possible %string. + size_type + max_size() const + { return _Rep::_S_max_size; } + + /** + * @brief Resizes the %string to the specified number of characters. + * @param n Number of characters the %string should contain. + * @param c Character to fill any new elements. + * + * This function will %resize the %string to the specified + * number of characters. If the number is smaller than the + * %string's current size the %string is truncated, otherwise + * the %string is extended and new elements are set to @a c. + */ + void + resize(size_type __n, _CharT __c); + + /** + * @brief Resizes the %string to the specified number of characters. + * @param n Number of characters the %string should contain. + * + * This function will resize the %string to the specified length. If + * the new size is smaller than the %string's current size the %string + * is truncated, otherwise the %string is extended and new characters + * are default-constructed. For basic types such as char, this means + * setting them to 0. + */ + void + resize(size_type __n) + { this->resize(__n, _CharT()); } + + /** + * Returns the total number of characters that the %string can hold + * before needing to allocate more memory. + */ + size_type + capacity() const + { return _M_rep()->_M_capacity; } + + /** + * @brief Attempt to preallocate enough memory for specified number of + * characters. + * @param res_arg Number of characters required. + * @throw std::length_error If @a res_arg exceeds @c max_size(). + * + * This function attempts to reserve enough memory for the + * %string to hold the specified number of characters. If the + * number requested is more than max_size(), length_error is + * thrown. + * + * The advantage of this function is that if optimal code is a + * necessity and the user can determine the string length that will be + * required, the user can reserve the memory in %advance, and thus + * prevent a possible reallocation of memory and copying of %string + * data. + */ + void + reserve(size_type __res_arg = 0); + + /** + * Erases the string, making it empty. + */ + void + clear() + { _M_mutate(0, this->size(), 0); } + + /** + * Returns true if the %string is empty. Equivalent to *this == "". + */ + bool + empty() const + { return this->size() == 0; } + + // Element access: + /** + * @brief Subscript access to the data contained in the %string. + * @param pos The index of the character to access. + * @return Read-only (constant) reference to the character. + * + * This operator allows for easy, array-style, data access. + * Note that data access with this operator is unchecked and + * out_of_range lookups are not defined. (For checked lookups + * see at().) + */ + const_reference + operator[] (size_type __pos) const + { + _GLIBCXX_DEBUG_ASSERT(__pos <= size()); + return _M_data()[__pos]; + } + + /** + * @brief Subscript access to the data contained in the %string. + * @param pos The index of the character to access. + * @return Read/write reference to the character. + * + * This operator allows for easy, array-style, data access. + * Note that data access with this operator is unchecked and + * out_of_range lookups are not defined. (For checked lookups + * see at().) Unshares the string. + */ + reference + operator[](size_type __pos) + { + // allow pos == size() as v3 extension: + _GLIBCXX_DEBUG_ASSERT(__pos <= size()); + // but be strict in pedantic mode: + _GLIBCXX_DEBUG_PEDASSERT(__pos < size()); + _M_leak(); + return _M_data()[__pos]; + } + + /** + * @brief Provides access to the data contained in the %string. + * @param n The index of the character to access. + * @return Read-only (const) reference to the character. + * @throw std::out_of_range If @a n is an invalid index. + * + * This function provides for safer data access. The parameter is + * first checked that it is in the range of the string. The function + * throws out_of_range if the check fails. + */ + const_reference + at(size_type __n) const + { + if (__n >= this->size()) + __throw_out_of_range(__N("basic_string::at")); + return _M_data()[__n]; + } + + /** + * @brief Provides access to the data contained in the %string. + * @param n The index of the character to access. + * @return Read/write reference to the character. + * @throw std::out_of_range If @a n is an invalid index. + * + * This function provides for safer data access. The parameter is + * first checked that it is in the range of the string. The function + * throws out_of_range if the check fails. Success results in + * unsharing the string. + */ + reference + at(size_type __n) + { + if (__n >= size()) + __throw_out_of_range(__N("basic_string::at")); + _M_leak(); + return _M_data()[__n]; + } + + // Modifiers: + /** + * @brief Append a string to this string. + * @param str The string to append. + * @return Reference to this string. + */ + basic_string& + operator+=(const basic_string& __str) + { return this->append(__str); } + + /** + * @brief Append a C string. + * @param s The C string to append. + * @return Reference to this string. + */ + basic_string& + operator+=(const _CharT* __s) + { return this->append(__s); } + + /** + * @brief Append a character. + * @param c The character to append. + * @return Reference to this string. + */ + basic_string& + operator+=(_CharT __c) + { + this->push_back(__c); + return *this; + } + + /** + * @brief Append a string to this string. + * @param str The string to append. + * @return Reference to this string. + */ + basic_string& + append(const basic_string& __str); + + /** + * @brief Append a substring. + * @param str The string to append. + * @param pos Index of the first character of str to append. + * @param n The number of characters to append. + * @return Reference to this string. + * @throw std::out_of_range if @a pos is not a valid index. + * + * This function appends @a n characters from @a str starting at @a pos + * to this string. If @a n is is larger than the number of available + * characters in @a str, the remainder of @a str is appended. + */ + basic_string& + append(const basic_string& __str, size_type __pos, size_type __n); + + /** + * @brief Append a C substring. + * @param s The C string to append. + * @param n The number of characters to append. + * @return Reference to this string. + */ + basic_string& + append(const _CharT* __s, size_type __n); + + /** + * @brief Append a C string. + * @param s The C string to append. + * @return Reference to this string. + */ + basic_string& + append(const _CharT* __s) + { + __glibcxx_requires_string(__s); + return this->append(__s, traits_type::length(__s)); + } + + /** + * @brief Append multiple characters. + * @param n The number of characters to append. + * @param c The character to use. + * @return Reference to this string. + * + * Appends n copies of c to this string. + */ + basic_string& + append(size_type __n, _CharT __c); + + /** + * @brief Append a range of characters. + * @param first Iterator referencing the first character to append. + * @param last Iterator marking the end of the range. + * @return Reference to this string. + * + * Appends characters in the range [first,last) to this string. + */ + template + basic_string& + append(_InputIterator __first, _InputIterator __last) + { return this->replace(_M_iend(), _M_iend(), __first, __last); } + + /** + * @brief Append a single character. + * @param c Character to append. + */ + void + push_back(_CharT __c) + { + const size_type __len = 1 + this->size(); + if (__len > this->capacity() || _M_rep()->_M_is_shared()) + this->reserve(__len); + traits_type::assign(_M_data()[this->size()], __c); + _M_rep()->_M_set_length_and_sharable(__len); + } + + /** + * @brief Set value to contents of another string. + * @param str Source string to use. + * @return Reference to this string. + */ + basic_string& + assign(const basic_string& __str); + + /** + * @brief Set value to a substring of a string. + * @param str The string to use. + * @param pos Index of the first character of str. + * @param n Number of characters to use. + * @return Reference to this string. + * @throw std::out_of_range if @a pos is not a valid index. + * + * This function sets this string to the substring of @a str consisting + * of @a n characters at @a pos. If @a n is is larger than the number + * of available characters in @a str, the remainder of @a str is used. + */ + basic_string& + assign(const basic_string& __str, size_type __pos, size_type __n) + { return this->assign(__str._M_data() + + __str._M_check(__pos, "basic_string::assign"), + __str._M_limit(__pos, __n)); } + + /** + * @brief Set value to a C substring. + * @param s The C string to use. + * @param n Number of characters to use. + * @return Reference to this string. + * + * This function sets the value of this string to the first @a n + * characters of @a s. If @a n is is larger than the number of + * available characters in @a s, the remainder of @a s is used. + */ + basic_string& + assign(const _CharT* __s, size_type __n); + + /** + * @brief Set value to contents of a C string. + * @param s The C string to use. + * @return Reference to this string. + * + * This function sets the value of this string to the value of @a s. + * The data is copied, so there is no dependence on @a s once the + * function returns. + */ + basic_string& + assign(const _CharT* __s) + { + __glibcxx_requires_string(__s); + return this->assign(__s, traits_type::length(__s)); + } + + /** + * @brief Set value to multiple characters. + * @param n Length of the resulting string. + * @param c The character to use. + * @return Reference to this string. + * + * This function sets the value of this string to @a n copies of + * character @a c. + */ + basic_string& + assign(size_type __n, _CharT __c) + { return _M_replace_aux(size_type(0), this->size(), __n, __c); } + + /** + * @brief Set value to a range of characters. + * @param first Iterator referencing the first character to append. + * @param last Iterator marking the end of the range. + * @return Reference to this string. + * + * Sets value of string to characters in the range [first,last). + */ + template + basic_string& + assign(_InputIterator __first, _InputIterator __last) + { return this->replace(_M_ibegin(), _M_iend(), __first, __last); } + + /** + * @brief Insert multiple characters. + * @param p Iterator referencing location in string to insert at. + * @param n Number of characters to insert + * @param c The character to insert. + * @throw std::length_error If new length exceeds @c max_size(). + * + * Inserts @a n copies of character @a c starting at the position + * referenced by iterator @a p. If adding characters causes the length + * to exceed max_size(), length_error is thrown. The value of the + * string doesn't change if an error is thrown. + */ + void + insert(iterator __p, size_type __n, _CharT __c) + { this->replace(__p, __p, __n, __c); } + + /** + * @brief Insert a range of characters. + * @param p Iterator referencing location in string to insert at. + * @param beg Start of range. + * @param end End of range. + * @throw std::length_error If new length exceeds @c max_size(). + * + * Inserts characters in range [beg,end). If adding characters causes + * the length to exceed max_size(), length_error is thrown. The value + * of the string doesn't change if an error is thrown. + */ + template + void + insert(iterator __p, _InputIterator __beg, _InputIterator __end) + { this->replace(__p, __p, __beg, __end); } + + /** + * @brief Insert value of a string. + * @param pos1 Iterator referencing location in string to insert at. + * @param str The string to insert. + * @return Reference to this string. + * @throw std::length_error If new length exceeds @c max_size(). + * + * Inserts value of @a str starting at @a pos1. If adding characters + * causes the length to exceed max_size(), length_error is thrown. The + * value of the string doesn't change if an error is thrown. + */ + basic_string& + insert(size_type __pos1, const basic_string& __str) + { return this->insert(__pos1, __str, size_type(0), __str.size()); } + + /** + * @brief Insert a substring. + * @param pos1 Iterator referencing location in string to insert at. + * @param str The string to insert. + * @param pos2 Start of characters in str to insert. + * @param n Number of characters to insert. + * @return Reference to this string. + * @throw std::length_error If new length exceeds @c max_size(). + * @throw std::out_of_range If @a pos1 > size() or + * @a pos2 > @a str.size(). + * + * Starting at @a pos1, insert @a n character of @a str beginning with + * @a pos2. If adding characters causes the length to exceed + * max_size(), length_error is thrown. If @a pos1 is beyond the end of + * this string or @a pos2 is beyond the end of @a str, out_of_range is + * thrown. The value of the string doesn't change if an error is + * thrown. + */ + basic_string& + insert(size_type __pos1, const basic_string& __str, + size_type __pos2, size_type __n) + { return this->insert(__pos1, __str._M_data() + + __str._M_check(__pos2, "basic_string::insert"), + __str._M_limit(__pos2, __n)); } + + /** + * @brief Insert a C substring. + * @param pos Iterator referencing location in string to insert at. + * @param s The C string to insert. + * @param n The number of characters to insert. + * @return Reference to this string. + * @throw std::length_error If new length exceeds @c max_size(). + * @throw std::out_of_range If @a pos is beyond the end of this + * string. + * + * Inserts the first @a n characters of @a s starting at @a pos. If + * adding characters causes the length to exceed max_size(), + * length_error is thrown. If @a pos is beyond end(), out_of_range is + * thrown. The value of the string doesn't change if an error is + * thrown. + */ + basic_string& + insert(size_type __pos, const _CharT* __s, size_type __n); + + /** + * @brief Insert a C string. + * @param pos Iterator referencing location in string to insert at. + * @param s The C string to insert. + * @return Reference to this string. + * @throw std::length_error If new length exceeds @c max_size(). + * @throw std::out_of_range If @a pos is beyond the end of this + * string. + * + * Inserts the first @a n characters of @a s starting at @a pos. If + * adding characters causes the length to exceed max_size(), + * length_error is thrown. If @a pos is beyond end(), out_of_range is + * thrown. The value of the string doesn't change if an error is + * thrown. + */ + basic_string& + insert(size_type __pos, const _CharT* __s) + { + __glibcxx_requires_string(__s); + return this->insert(__pos, __s, traits_type::length(__s)); + } + + /** + * @brief Insert multiple characters. + * @param pos Index in string to insert at. + * @param n Number of characters to insert + * @param c The character to insert. + * @return Reference to this string. + * @throw std::length_error If new length exceeds @c max_size(). + * @throw std::out_of_range If @a pos is beyond the end of this + * string. + * + * Inserts @a n copies of character @a c starting at index @a pos. If + * adding characters causes the length to exceed max_size(), + * length_error is thrown. If @a pos > length(), out_of_range is + * thrown. The value of the string doesn't change if an error is + * thrown. + */ + basic_string& + insert(size_type __pos, size_type __n, _CharT __c) + { return _M_replace_aux(_M_check(__pos, "basic_string::insert"), + size_type(0), __n, __c); } + + /** + * @brief Insert one character. + * @param p Iterator referencing position in string to insert at. + * @param c The character to insert. + * @return Iterator referencing newly inserted char. + * @throw std::length_error If new length exceeds @c max_size(). + * + * Inserts character @a c at position referenced by @a p. If adding + * character causes the length to exceed max_size(), length_error is + * thrown. If @a p is beyond end of string, out_of_range is thrown. + * The value of the string doesn't change if an error is thrown. + */ + iterator + insert(iterator __p, _CharT __c) + { + _GLIBCXX_DEBUG_PEDASSERT(__p >= _M_ibegin() && __p <= _M_iend()); + const size_type __pos = __p - _M_ibegin(); + _M_replace_aux(__pos, size_type(0), size_type(1), __c); + _M_rep()->_M_set_leaked(); + return iterator(_M_data() + __pos); + } + + /** + * @brief Remove characters. + * @param pos Index of first character to remove (default 0). + * @param n Number of characters to remove (default remainder). + * @return Reference to this string. + * @throw std::out_of_range If @a pos is beyond the end of this + * string. + * + * Removes @a n characters from this string starting at @a pos. The + * length of the string is reduced by @a n. If there are < @a n + * characters to remove, the remainder of the string is truncated. If + * @a p is beyond end of string, out_of_range is thrown. The value of + * the string doesn't change if an error is thrown. + */ + basic_string& + erase(size_type __pos = 0, size_type __n = npos) + { + _M_mutate(_M_check(__pos, "basic_string::erase"), + _M_limit(__pos, __n), size_type(0)); + return *this; + } + + /** + * @brief Remove one character. + * @param position Iterator referencing the character to remove. + * @return iterator referencing same location after removal. + * + * Removes the character at @a position from this string. The value + * of the string doesn't change if an error is thrown. + */ + iterator + erase(iterator __position) + { + _GLIBCXX_DEBUG_PEDASSERT(__position >= _M_ibegin() + && __position < _M_iend()); + const size_type __pos = __position - _M_ibegin(); + _M_mutate(__pos, size_type(1), size_type(0)); + _M_rep()->_M_set_leaked(); + return iterator(_M_data() + __pos); + } + + /** + * @brief Remove a range of characters. + * @param first Iterator referencing the first character to remove. + * @param last Iterator referencing the end of the range. + * @return Iterator referencing location of first after removal. + * + * Removes the characters in the range [first,last) from this string. + * The value of the string doesn't change if an error is thrown. + */ + iterator + erase(iterator __first, iterator __last) + { + _GLIBCXX_DEBUG_PEDASSERT(__first >= _M_ibegin() && __first <= __last + && __last <= _M_iend()); + const size_type __pos = __first - _M_ibegin(); + _M_mutate(__pos, __last - __first, size_type(0)); + _M_rep()->_M_set_leaked(); + return iterator(_M_data() + __pos); + } + + /** + * @brief Replace characters with value from another string. + * @param pos Index of first character to replace. + * @param n Number of characters to be replaced. + * @param str String to insert. + * @return Reference to this string. + * @throw std::out_of_range If @a pos is beyond the end of this + * string. + * @throw std::length_error If new length exceeds @c max_size(). + * + * Removes the characters in the range [pos,pos+n) from this string. + * In place, the value of @a str is inserted. If @a pos is beyond end + * of string, out_of_range is thrown. If the length of the result + * exceeds max_size(), length_error is thrown. The value of the string + * doesn't change if an error is thrown. + */ + basic_string& + replace(size_type __pos, size_type __n, const basic_string& __str) + { return this->replace(__pos, __n, __str._M_data(), __str.size()); } + + /** + * @brief Replace characters with value from another string. + * @param pos1 Index of first character to replace. + * @param n1 Number of characters to be replaced. + * @param str String to insert. + * @param pos2 Index of first character of str to use. + * @param n2 Number of characters from str to use. + * @return Reference to this string. + * @throw std::out_of_range If @a pos1 > size() or @a pos2 > + * str.size(). + * @throw std::length_error If new length exceeds @c max_size(). + * + * Removes the characters in the range [pos1,pos1 + n) from this + * string. In place, the value of @a str is inserted. If @a pos is + * beyond end of string, out_of_range is thrown. If the length of the + * result exceeds max_size(), length_error is thrown. The value of the + * string doesn't change if an error is thrown. + */ + basic_string& + replace(size_type __pos1, size_type __n1, const basic_string& __str, + size_type __pos2, size_type __n2) + { return this->replace(__pos1, __n1, __str._M_data() + + __str._M_check(__pos2, "basic_string::replace"), + __str._M_limit(__pos2, __n2)); } + + /** + * @brief Replace characters with value of a C substring. + * @param pos Index of first character to replace. + * @param n1 Number of characters to be replaced. + * @param s C string to insert. + * @param n2 Number of characters from @a s to use. + * @return Reference to this string. + * @throw std::out_of_range If @a pos1 > size(). + * @throw std::length_error If new length exceeds @c max_size(). + * + * Removes the characters in the range [pos,pos + n1) from this string. + * In place, the first @a n2 characters of @a s are inserted, or all + * of @a s if @a n2 is too large. If @a pos is beyond end of string, + * out_of_range is thrown. If the length of result exceeds max_size(), + * length_error is thrown. The value of the string doesn't change if + * an error is thrown. + */ + basic_string& + replace(size_type __pos, size_type __n1, const _CharT* __s, + size_type __n2); + + /** + * @brief Replace characters with value of a C string. + * @param pos Index of first character to replace. + * @param n1 Number of characters to be replaced. + * @param s C string to insert. + * @return Reference to this string. + * @throw std::out_of_range If @a pos > size(). + * @throw std::length_error If new length exceeds @c max_size(). + * + * Removes the characters in the range [pos,pos + n1) from this string. + * In place, the first @a n characters of @a s are inserted. If @a + * pos is beyond end of string, out_of_range is thrown. If the length + * of result exceeds max_size(), length_error is thrown. The value of + * the string doesn't change if an error is thrown. + */ + basic_string& + replace(size_type __pos, size_type __n1, const _CharT* __s) + { + __glibcxx_requires_string(__s); + return this->replace(__pos, __n1, __s, traits_type::length(__s)); + } + + /** + * @brief Replace characters with multiple characters. + * @param pos Index of first character to replace. + * @param n1 Number of characters to be replaced. + * @param n2 Number of characters to insert. + * @param c Character to insert. + * @return Reference to this string. + * @throw std::out_of_range If @a pos > size(). + * @throw std::length_error If new length exceeds @c max_size(). + * + * Removes the characters in the range [pos,pos + n1) from this string. + * In place, @a n2 copies of @a c are inserted. If @a pos is beyond + * end of string, out_of_range is thrown. If the length of result + * exceeds max_size(), length_error is thrown. The value of the string + * doesn't change if an error is thrown. + */ + basic_string& + replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c) + { return _M_replace_aux(_M_check(__pos, "basic_string::replace"), + _M_limit(__pos, __n1), __n2, __c); } + + /** + * @brief Replace range of characters with string. + * @param i1 Iterator referencing start of range to replace. + * @param i2 Iterator referencing end of range to replace. + * @param str String value to insert. + * @return Reference to this string. + * @throw std::length_error If new length exceeds @c max_size(). + * + * Removes the characters in the range [i1,i2). In place, the value of + * @a str is inserted. If the length of result exceeds max_size(), + * length_error is thrown. The value of the string doesn't change if + * an error is thrown. + */ + basic_string& + replace(iterator __i1, iterator __i2, const basic_string& __str) + { return this->replace(__i1, __i2, __str._M_data(), __str.size()); } + + /** + * @brief Replace range of characters with C substring. + * @param i1 Iterator referencing start of range to replace. + * @param i2 Iterator referencing end of range to replace. + * @param s C string value to insert. + * @param n Number of characters from s to insert. + * @return Reference to this string. + * @throw std::length_error If new length exceeds @c max_size(). + * + * Removes the characters in the range [i1,i2). In place, the first @a + * n characters of @a s are inserted. If the length of result exceeds + * max_size(), length_error is thrown. The value of the string doesn't + * change if an error is thrown. + */ + basic_string& + replace(iterator __i1, iterator __i2, const _CharT* __s, size_type __n) + { + _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2 + && __i2 <= _M_iend()); + return this->replace(__i1 - _M_ibegin(), __i2 - __i1, __s, __n); + } + + /** + * @brief Replace range of characters with C string. + * @param i1 Iterator referencing start of range to replace. + * @param i2 Iterator referencing end of range to replace. + * @param s C string value to insert. + * @return Reference to this string. + * @throw std::length_error If new length exceeds @c max_size(). + * + * Removes the characters in the range [i1,i2). In place, the + * characters of @a s are inserted. If the length of result exceeds + * max_size(), length_error is thrown. The value of the string doesn't + * change if an error is thrown. + */ + basic_string& + replace(iterator __i1, iterator __i2, const _CharT* __s) + { + __glibcxx_requires_string(__s); + return this->replace(__i1, __i2, __s, traits_type::length(__s)); + } + + /** + * @brief Replace range of characters with multiple characters + * @param i1 Iterator referencing start of range to replace. + * @param i2 Iterator referencing end of range to replace. + * @param n Number of characters to insert. + * @param c Character to insert. + * @return Reference to this string. + * @throw std::length_error If new length exceeds @c max_size(). + * + * Removes the characters in the range [i1,i2). In place, @a n copies + * of @a c are inserted. If the length of result exceeds max_size(), + * length_error is thrown. The value of the string doesn't change if + * an error is thrown. + */ + basic_string& + replace(iterator __i1, iterator __i2, size_type __n, _CharT __c) + { + _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2 + && __i2 <= _M_iend()); + return _M_replace_aux(__i1 - _M_ibegin(), __i2 - __i1, __n, __c); + } + + /** + * @brief Replace range of characters with range. + * @param i1 Iterator referencing start of range to replace. + * @param i2 Iterator referencing end of range to replace. + * @param k1 Iterator referencing start of range to insert. + * @param k2 Iterator referencing end of range to insert. + * @return Reference to this string. + * @throw std::length_error If new length exceeds @c max_size(). + * + * Removes the characters in the range [i1,i2). In place, characters + * in the range [k1,k2) are inserted. If the length of result exceeds + * max_size(), length_error is thrown. The value of the string doesn't + * change if an error is thrown. + */ + template + basic_string& + replace(iterator __i1, iterator __i2, + _InputIterator __k1, _InputIterator __k2) + { + _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2 + && __i2 <= _M_iend()); + __glibcxx_requires_valid_range(__k1, __k2); + typedef typename std::__is_integer<_InputIterator>::__type _Integral; + return _M_replace_dispatch(__i1, __i2, __k1, __k2, _Integral()); + } + + // Specializations for the common case of pointer and iterator: + // useful to avoid the overhead of temporary buffering in _M_replace. + basic_string& + replace(iterator __i1, iterator __i2, _CharT* __k1, _CharT* __k2) + { + _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2 + && __i2 <= _M_iend()); + __glibcxx_requires_valid_range(__k1, __k2); + return this->replace(__i1 - _M_ibegin(), __i2 - __i1, + __k1, __k2 - __k1); + } + + basic_string& + replace(iterator __i1, iterator __i2, + const _CharT* __k1, const _CharT* __k2) + { + _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2 + && __i2 <= _M_iend()); + __glibcxx_requires_valid_range(__k1, __k2); + return this->replace(__i1 - _M_ibegin(), __i2 - __i1, + __k1, __k2 - __k1); + } + + basic_string& + replace(iterator __i1, iterator __i2, iterator __k1, iterator __k2) + { + _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2 + && __i2 <= _M_iend()); + __glibcxx_requires_valid_range(__k1, __k2); + return this->replace(__i1 - _M_ibegin(), __i2 - __i1, + __k1.base(), __k2 - __k1); + } + + basic_string& + replace(iterator __i1, iterator __i2, + const_iterator __k1, const_iterator __k2) + { + _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2 + && __i2 <= _M_iend()); + __glibcxx_requires_valid_range(__k1, __k2); + return this->replace(__i1 - _M_ibegin(), __i2 - __i1, + __k1.base(), __k2 - __k1); + } + + private: + template + basic_string& + _M_replace_dispatch(iterator __i1, iterator __i2, _Integer __n, + _Integer __val, __true_type) + { return _M_replace_aux(__i1 - _M_ibegin(), __i2 - __i1, __n, __val); } + + template + basic_string& + _M_replace_dispatch(iterator __i1, iterator __i2, _InputIterator __k1, + _InputIterator __k2, __false_type); + + basic_string& + _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2, + _CharT __c); + + basic_string& + _M_replace_safe(size_type __pos1, size_type __n1, const _CharT* __s, + size_type __n2); + + // _S_construct_aux is used to implement the 21.3.1 para 15 which + // requires special behaviour if _InIter is an integral type + template + static _CharT* + _S_construct_aux(_InIterator __beg, _InIterator __end, + const _Alloc& __a, __false_type) + { + typedef typename iterator_traits<_InIterator>::iterator_category _Tag; + return _S_construct(__beg, __end, __a, _Tag()); + } + + template + static _CharT* + _S_construct_aux(_InIterator __beg, _InIterator __end, + const _Alloc& __a, __true_type) + { return _S_construct(static_cast(__beg), + static_cast(__end), __a); } + + template + static _CharT* + _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a) + { + typedef typename std::__is_integer<_InIterator>::__type _Integral; + return _S_construct_aux(__beg, __end, __a, _Integral()); + } + + // For Input Iterators, used in istreambuf_iterators, etc. + template + static _CharT* + _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a, + input_iterator_tag); + + // For forward_iterators up to random_access_iterators, used for + // string::iterator, _CharT*, etc. + template + static _CharT* + _S_construct(_FwdIterator __beg, _FwdIterator __end, const _Alloc& __a, + forward_iterator_tag); + + static _CharT* + _S_construct(size_type __req, _CharT __c, const _Alloc& __a); + + public: + + /** + * @brief Copy substring into C string. + * @param s C string to copy value into. + * @param n Number of characters to copy. + * @param pos Index of first character to copy. + * @return Number of characters actually copied + * @throw std::out_of_range If pos > size(). + * + * Copies up to @a n characters starting at @a pos into the C string @a + * s. If @a pos is greater than size(), out_of_range is thrown. + */ + size_type + copy(_CharT* __s, size_type __n, size_type __pos = 0) const; + + /** + * @brief Swap contents with another string. + * @param s String to swap with. + * + * Exchanges the contents of this string with that of @a s in constant + * time. + */ + void + swap(basic_string& __s); + + // String operations: + /** + * @brief Return const pointer to null-terminated contents. + * + * This is a handle to internal data. Do not modify or dire things may + * happen. + */ + const _CharT* + c_str() const + { return _M_data(); } + + /** + * @brief Return const pointer to contents. + * + * This is a handle to internal data. Do not modify or dire things may + * happen. + */ + const _CharT* + data() const + { return _M_data(); } + + /** + * @brief Return copy of allocator used to construct this string. + */ + allocator_type + get_allocator() const + { return _M_dataplus; } + + /** + * @brief Find position of a C substring. + * @param s C string to locate. + * @param pos Index of character to search from. + * @param n Number of characters from @a s to search for. + * @return Index of start of first occurrence. + * + * Starting from @a pos, searches forward for the first @a n characters + * in @a s within this string. If found, returns the index where it + * begins. If not found, returns npos. + */ + size_type + find(const _CharT* __s, size_type __pos, size_type __n) const; + + /** + * @brief Find position of a string. + * @param str String to locate. + * @param pos Index of character to search from (default 0). + * @return Index of start of first occurrence. + * + * Starting from @a pos, searches forward for value of @a str within + * this string. If found, returns the index where it begins. If not + * found, returns npos. + */ + size_type + find(const basic_string& __str, size_type __pos = 0) const + { return this->find(__str.data(), __pos, __str.size()); } + + /** + * @brief Find position of a C string. + * @param s C string to locate. + * @param pos Index of character to search from (default 0). + * @return Index of start of first occurrence. + * + * Starting from @a pos, searches forward for the value of @a s within + * this string. If found, returns the index where it begins. If not + * found, returns npos. + */ + size_type + find(const _CharT* __s, size_type __pos = 0) const + { + __glibcxx_requires_string(__s); + return this->find(__s, __pos, traits_type::length(__s)); + } + + /** + * @brief Find position of a character. + * @param c Character to locate. + * @param pos Index of character to search from (default 0). + * @return Index of first occurrence. + * + * Starting from @a pos, searches forward for @a c within this string. + * If found, returns the index where it was found. If not found, + * returns npos. + */ + size_type + find(_CharT __c, size_type __pos = 0) const; + + /** + * @brief Find last position of a string. + * @param str String to locate. + * @param pos Index of character to search back from (default end). + * @return Index of start of last occurrence. + * + * Starting from @a pos, searches backward for value of @a str within + * this string. If found, returns the index where it begins. If not + * found, returns npos. + */ + size_type + rfind(const basic_string& __str, size_type __pos = npos) const + { return this->rfind(__str.data(), __pos, __str.size()); } + + /** + * @brief Find last position of a C substring. + * @param s C string to locate. + * @param pos Index of character to search back from. + * @param n Number of characters from s to search for. + * @return Index of start of last occurrence. + * + * Starting from @a pos, searches backward for the first @a n + * characters in @a s within this string. If found, returns the index + * where it begins. If not found, returns npos. + */ + size_type + rfind(const _CharT* __s, size_type __pos, size_type __n) const; + + /** + * @brief Find last position of a C string. + * @param s C string to locate. + * @param pos Index of character to start search at (default end). + * @return Index of start of last occurrence. + * + * Starting from @a pos, searches backward for the value of @a s within + * this string. If found, returns the index where it begins. If not + * found, returns npos. + */ + size_type + rfind(const _CharT* __s, size_type __pos = npos) const + { + __glibcxx_requires_string(__s); + return this->rfind(__s, __pos, traits_type::length(__s)); + } + + /** + * @brief Find last position of a character. + * @param c Character to locate. + * @param pos Index of character to search back from (default end). + * @return Index of last occurrence. + * + * Starting from @a pos, searches backward for @a c within this string. + * If found, returns the index where it was found. If not found, + * returns npos. + */ + size_type + rfind(_CharT __c, size_type __pos = npos) const; + + /** + * @brief Find position of a character of string. + * @param str String containing characters to locate. + * @param pos Index of character to search from (default 0). + * @return Index of first occurrence. + * + * Starting from @a pos, searches forward for one of the characters of + * @a str within this string. If found, returns the index where it was + * found. If not found, returns npos. + */ + size_type + find_first_of(const basic_string& __str, size_type __pos = 0) const + { return this->find_first_of(__str.data(), __pos, __str.size()); } + + /** + * @brief Find position of a character of C substring. + * @param s String containing characters to locate. + * @param pos Index of character to search from. + * @param n Number of characters from s to search for. + * @return Index of first occurrence. + * + * Starting from @a pos, searches forward for one of the first @a n + * characters of @a s within this string. If found, returns the index + * where it was found. If not found, returns npos. + */ + size_type + find_first_of(const _CharT* __s, size_type __pos, size_type __n) const; + + /** + * @brief Find position of a character of C string. + * @param s String containing characters to locate. + * @param pos Index of character to search from (default 0). + * @return Index of first occurrence. + * + * Starting from @a pos, searches forward for one of the characters of + * @a s within this string. If found, returns the index where it was + * found. If not found, returns npos. + */ + size_type + find_first_of(const _CharT* __s, size_type __pos = 0) const + { + __glibcxx_requires_string(__s); + return this->find_first_of(__s, __pos, traits_type::length(__s)); + } + + /** + * @brief Find position of a character. + * @param c Character to locate. + * @param pos Index of character to search from (default 0). + * @return Index of first occurrence. + * + * Starting from @a pos, searches forward for the character @a c within + * this string. If found, returns the index where it was found. If + * not found, returns npos. + * + * Note: equivalent to find(c, pos). + */ + size_type + find_first_of(_CharT __c, size_type __pos = 0) const + { return this->find(__c, __pos); } + + /** + * @brief Find last position of a character of string. + * @param str String containing characters to locate. + * @param pos Index of character to search back from (default end). + * @return Index of last occurrence. + * + * Starting from @a pos, searches backward for one of the characters of + * @a str within this string. If found, returns the index where it was + * found. If not found, returns npos. + */ + size_type + find_last_of(const basic_string& __str, size_type __pos = npos) const + { return this->find_last_of(__str.data(), __pos, __str.size()); } + + /** + * @brief Find last position of a character of C substring. + * @param s C string containing characters to locate. + * @param pos Index of character to search back from. + * @param n Number of characters from s to search for. + * @return Index of last occurrence. + * + * Starting from @a pos, searches backward for one of the first @a n + * characters of @a s within this string. If found, returns the index + * where it was found. If not found, returns npos. + */ + size_type + find_last_of(const _CharT* __s, size_type __pos, size_type __n) const; + + /** + * @brief Find last position of a character of C string. + * @param s C string containing characters to locate. + * @param pos Index of character to search back from (default end). + * @return Index of last occurrence. + * + * Starting from @a pos, searches backward for one of the characters of + * @a s within this string. If found, returns the index where it was + * found. If not found, returns npos. + */ + size_type + find_last_of(const _CharT* __s, size_type __pos = npos) const + { + __glibcxx_requires_string(__s); + return this->find_last_of(__s, __pos, traits_type::length(__s)); + } + + /** + * @brief Find last position of a character. + * @param c Character to locate. + * @param pos Index of character to search back from (default end). + * @return Index of last occurrence. + * + * Starting from @a pos, searches backward for @a c within this string. + * If found, returns the index where it was found. If not found, + * returns npos. + * + * Note: equivalent to rfind(c, pos). + */ + size_type + find_last_of(_CharT __c, size_type __pos = npos) const + { return this->rfind(__c, __pos); } + + /** + * @brief Find position of a character not in string. + * @param str String containing characters to avoid. + * @param pos Index of character to search from (default 0). + * @return Index of first occurrence. + * + * Starting from @a pos, searches forward for a character not contained + * in @a str within this string. If found, returns the index where it + * was found. If not found, returns npos. + */ + size_type + find_first_not_of(const basic_string& __str, size_type __pos = 0) const + { return this->find_first_not_of(__str.data(), __pos, __str.size()); } + + /** + * @brief Find position of a character not in C substring. + * @param s C string containing characters to avoid. + * @param pos Index of character to search from. + * @param n Number of characters from s to consider. + * @return Index of first occurrence. + * + * Starting from @a pos, searches forward for a character not contained + * in the first @a n characters of @a s within this string. If found, + * returns the index where it was found. If not found, returns npos. + */ + size_type + find_first_not_of(const _CharT* __s, size_type __pos, + size_type __n) const; + + /** + * @brief Find position of a character not in C string. + * @param s C string containing characters to avoid. + * @param pos Index of character to search from (default 0). + * @return Index of first occurrence. + * + * Starting from @a pos, searches forward for a character not contained + * in @a s within this string. If found, returns the index where it + * was found. If not found, returns npos. + */ + size_type + find_first_not_of(const _CharT* __s, size_type __pos = 0) const + { + __glibcxx_requires_string(__s); + return this->find_first_not_of(__s, __pos, traits_type::length(__s)); + } + + /** + * @brief Find position of a different character. + * @param c Character to avoid. + * @param pos Index of character to search from (default 0). + * @return Index of first occurrence. + * + * Starting from @a pos, searches forward for a character other than @a c + * within this string. If found, returns the index where it was found. + * If not found, returns npos. + */ + size_type + find_first_not_of(_CharT __c, size_type __pos = 0) const; + + /** + * @brief Find last position of a character not in string. + * @param str String containing characters to avoid. + * @param pos Index of character to search back from (default end). + * @return Index of last occurrence. + * + * Starting from @a pos, searches backward for a character not + * contained in @a str within this string. If found, returns the index + * where it was found. If not found, returns npos. + */ + size_type + find_last_not_of(const basic_string& __str, size_type __pos = npos) const + { return this->find_last_not_of(__str.data(), __pos, __str.size()); } + + /** + * @brief Find last position of a character not in C substring. + * @param s C string containing characters to avoid. + * @param pos Index of character to search back from. + * @param n Number of characters from s to consider. + * @return Index of last occurrence. + * + * Starting from @a pos, searches backward for a character not + * contained in the first @a n characters of @a s within this string. + * If found, returns the index where it was found. If not found, + * returns npos. + */ + size_type + find_last_not_of(const _CharT* __s, size_type __pos, + size_type __n) const; + /** + * @brief Find last position of a character not in C string. + * @param s C string containing characters to avoid. + * @param pos Index of character to search back from (default end). + * @return Index of last occurrence. + * + * Starting from @a pos, searches backward for a character not + * contained in @a s within this string. If found, returns the index + * where it was found. If not found, returns npos. + */ + size_type + find_last_not_of(const _CharT* __s, size_type __pos = npos) const + { + __glibcxx_requires_string(__s); + return this->find_last_not_of(__s, __pos, traits_type::length(__s)); + } + + /** + * @brief Find last position of a different character. + * @param c Character to avoid. + * @param pos Index of character to search back from (default end). + * @return Index of last occurrence. + * + * Starting from @a pos, searches backward for a character other than + * @a c within this string. If found, returns the index where it was + * found. If not found, returns npos. + */ + size_type + find_last_not_of(_CharT __c, size_type __pos = npos) const; + + /** + * @brief Get a substring. + * @param pos Index of first character (default 0). + * @param n Number of characters in substring (default remainder). + * @return The new string. + * @throw std::out_of_range If pos > size(). + * + * Construct and return a new string using the @a n characters starting + * at @a pos. If the string is too short, use the remainder of the + * characters. If @a pos is beyond the end of the string, out_of_range + * is thrown. + */ + basic_string + substr(size_type __pos = 0, size_type __n = npos) const + { return basic_string(*this, + _M_check(__pos, "basic_string::substr"), __n); } + + /** + * @brief Compare to a string. + * @param str String to compare against. + * @return Integer < 0, 0, or > 0. + * + * Returns an integer < 0 if this string is ordered before @a str, 0 if + * their values are equivalent, or > 0 if this string is ordered after + * @a str. Determines the effective length rlen of the strings to + * compare as the smallest of size() and str.size(). The function + * then compares the two strings by calling traits::compare(data(), + * str.data(),rlen). If the result of the comparison is nonzero returns + * it, otherwise the shorter one is ordered first. + */ + int + compare(const basic_string& __str) const + { + const size_type __size = this->size(); + const size_type __osize = __str.size(); + const size_type __len = std::min(__size, __osize); + + int __r = traits_type::compare(_M_data(), __str.data(), __len); + if (!__r) + __r = __size - __osize; + return __r; + } + + /** + * @brief Compare substring to a string. + * @param pos Index of first character of substring. + * @param n Number of characters in substring. + * @param str String to compare against. + * @return Integer < 0, 0, or > 0. + * + * Form the substring of this string from the @a n characters starting + * at @a pos. Returns an integer < 0 if the substring is ordered + * before @a str, 0 if their values are equivalent, or > 0 if the + * substring is ordered after @a str. Determines the effective length + * rlen of the strings to compare as the smallest of the length of the + * substring and @a str.size(). The function then compares the two + * strings by calling traits::compare(substring.data(),str.data(),rlen). + * If the result of the comparison is nonzero returns it, otherwise the + * shorter one is ordered first. + */ + int + compare(size_type __pos, size_type __n, const basic_string& __str) const; + + /** + * @brief Compare substring to a substring. + * @param pos1 Index of first character of substring. + * @param n1 Number of characters in substring. + * @param str String to compare against. + * @param pos2 Index of first character of substring of str. + * @param n2 Number of characters in substring of str. + * @return Integer < 0, 0, or > 0. + * + * Form the substring of this string from the @a n1 characters starting + * at @a pos1. Form the substring of @a str from the @a n2 characters + * starting at @a pos2. Returns an integer < 0 if this substring is + * ordered before the substring of @a str, 0 if their values are + * equivalent, or > 0 if this substring is ordered after the substring + * of @a str. Determines the effective length rlen of the strings + * to compare as the smallest of the lengths of the substrings. The + * function then compares the two strings by calling + * traits::compare(substring.data(),str.substr(pos2,n2).data(),rlen). + * If the result of the comparison is nonzero returns it, otherwise the + * shorter one is ordered first. + */ + int + compare(size_type __pos1, size_type __n1, const basic_string& __str, + size_type __pos2, size_type __n2) const; + + /** + * @brief Compare to a C string. + * @param s C string to compare against. + * @return Integer < 0, 0, or > 0. + * + * Returns an integer < 0 if this string is ordered before @a s, 0 if + * their values are equivalent, or > 0 if this string is ordered after + * @a s. Determines the effective length rlen of the strings to + * compare as the smallest of size() and the length of a string + * constructed from @a s. The function then compares the two strings + * by calling traits::compare(data(),s,rlen). If the result of the + * comparison is nonzero returns it, otherwise the shorter one is + * ordered first. + */ + int + compare(const _CharT* __s) const; + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 5 String::compare specification questionable + /** + * @brief Compare substring to a C string. + * @param pos Index of first character of substring. + * @param n1 Number of characters in substring. + * @param s C string to compare against. + * @return Integer < 0, 0, or > 0. + * + * Form the substring of this string from the @a n1 characters starting + * at @a pos. Returns an integer < 0 if the substring is ordered + * before @a s, 0 if their values are equivalent, or > 0 if the + * substring is ordered after @a s. Determines the effective length + * rlen of the strings to compare as the smallest of the length of the + * substring and the length of a string constructed from @a s. The + * function then compares the two string by calling + * traits::compare(substring.data(),s,rlen). If the result of the + * comparison is nonzero returns it, otherwise the shorter one is + * ordered first. + */ + int + compare(size_type __pos, size_type __n1, const _CharT* __s) const; + + /** + * @brief Compare substring against a character array. + * @param pos1 Index of first character of substring. + * @param n1 Number of characters in substring. + * @param s character array to compare against. + * @param n2 Number of characters of s. + * @return Integer < 0, 0, or > 0. + * + * Form the substring of this string from the @a n1 characters starting + * at @a pos1. Form a string from the first @a n2 characters of @a s. + * Returns an integer < 0 if this substring is ordered before the string + * from @a s, 0 if their values are equivalent, or > 0 if this substring + * is ordered after the string from @a s. Determines the effective + * length rlen of the strings to compare as the smallest of the length + * of the substring and @a n2. The function then compares the two + * strings by calling traits::compare(substring.data(),s,rlen). If the + * result of the comparison is nonzero returns it, otherwise the shorter + * one is ordered first. + * + * NB: s must have at least n2 characters, '\0' has no special + * meaning. + */ + int + compare(size_type __pos, size_type __n1, const _CharT* __s, + size_type __n2) const; + }; + + template + inline basic_string<_CharT, _Traits, _Alloc>:: + basic_string() +#ifndef _GLIBCXX_FULLY_DYNAMIC_STRING + : _M_dataplus(_S_empty_rep()._M_refdata(), _Alloc()) { } +#else + : _M_dataplus(_S_construct(size_type(), _CharT(), _Alloc()), _Alloc()) { } +#endif + + // operator+ + /** + * @brief Concatenate two strings. + * @param lhs First string. + * @param rhs Last string. + * @return New string with value of @a lhs followed by @a rhs. + */ + template + basic_string<_CharT, _Traits, _Alloc> + operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs, + const basic_string<_CharT, _Traits, _Alloc>& __rhs) + { + basic_string<_CharT, _Traits, _Alloc> __str(__lhs); + __str.append(__rhs); + return __str; + } + + /** + * @brief Concatenate C string and string. + * @param lhs First string. + * @param rhs Last string. + * @return New string with value of @a lhs followed by @a rhs. + */ + template + basic_string<_CharT,_Traits,_Alloc> + operator+(const _CharT* __lhs, + const basic_string<_CharT,_Traits,_Alloc>& __rhs); + + /** + * @brief Concatenate character and string. + * @param lhs First string. + * @param rhs Last string. + * @return New string with @a lhs followed by @a rhs. + */ + template + basic_string<_CharT,_Traits,_Alloc> + operator+(_CharT __lhs, const basic_string<_CharT,_Traits,_Alloc>& __rhs); + + /** + * @brief Concatenate string and C string. + * @param lhs First string. + * @param rhs Last string. + * @return New string with @a lhs followed by @a rhs. + */ + template + inline basic_string<_CharT, _Traits, _Alloc> + operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs, + const _CharT* __rhs) + { + basic_string<_CharT, _Traits, _Alloc> __str(__lhs); + __str.append(__rhs); + return __str; + } + + /** + * @brief Concatenate string and character. + * @param lhs First string. + * @param rhs Last string. + * @return New string with @a lhs followed by @a rhs. + */ + template + inline basic_string<_CharT, _Traits, _Alloc> + operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs, _CharT __rhs) + { + typedef basic_string<_CharT, _Traits, _Alloc> __string_type; + typedef typename __string_type::size_type __size_type; + __string_type __str(__lhs); + __str.append(__size_type(1), __rhs); + return __str; + } + + // operator == + /** + * @brief Test equivalence of two strings. + * @param lhs First string. + * @param rhs Second string. + * @return True if @a lhs.compare(@a rhs) == 0. False otherwise. + */ + template + inline bool + operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs, + const basic_string<_CharT, _Traits, _Alloc>& __rhs) + { return __lhs.compare(__rhs) == 0; } + + /** + * @brief Test equivalence of C string and string. + * @param lhs C string. + * @param rhs String. + * @return True if @a rhs.compare(@a lhs) == 0. False otherwise. + */ + template + inline bool + operator==(const _CharT* __lhs, + const basic_string<_CharT, _Traits, _Alloc>& __rhs) + { return __rhs.compare(__lhs) == 0; } + + /** + * @brief Test equivalence of string and C string. + * @param lhs String. + * @param rhs C string. + * @return True if @a lhs.compare(@a rhs) == 0. False otherwise. + */ + template + inline bool + operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs, + const _CharT* __rhs) + { return __lhs.compare(__rhs) == 0; } + + // operator != + /** + * @brief Test difference of two strings. + * @param lhs First string. + * @param rhs Second string. + * @return True if @a lhs.compare(@a rhs) != 0. False otherwise. + */ + template + inline bool + operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, + const basic_string<_CharT, _Traits, _Alloc>& __rhs) + { return __rhs.compare(__lhs) != 0; } + + /** + * @brief Test difference of C string and string. + * @param lhs C string. + * @param rhs String. + * @return True if @a rhs.compare(@a lhs) != 0. False otherwise. + */ + template + inline bool + operator!=(const _CharT* __lhs, + const basic_string<_CharT, _Traits, _Alloc>& __rhs) + { return __rhs.compare(__lhs) != 0; } + + /** + * @brief Test difference of string and C string. + * @param lhs String. + * @param rhs C string. + * @return True if @a lhs.compare(@a rhs) != 0. False otherwise. + */ + template + inline bool + operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, + const _CharT* __rhs) + { return __lhs.compare(__rhs) != 0; } + + // operator < + /** + * @brief Test if string precedes string. + * @param lhs First string. + * @param rhs Second string. + * @return True if @a lhs precedes @a rhs. False otherwise. + */ + template + inline bool + operator<(const basic_string<_CharT, _Traits, _Alloc>& __lhs, + const basic_string<_CharT, _Traits, _Alloc>& __rhs) + { return __lhs.compare(__rhs) < 0; } + + /** + * @brief Test if string precedes C string. + * @param lhs String. + * @param rhs C string. + * @return True if @a lhs precedes @a rhs. False otherwise. + */ + template + inline bool + operator<(const basic_string<_CharT, _Traits, _Alloc>& __lhs, + const _CharT* __rhs) + { return __lhs.compare(__rhs) < 0; } + + /** + * @brief Test if C string precedes string. + * @param lhs C string. + * @param rhs String. + * @return True if @a lhs precedes @a rhs. False otherwise. + */ + template + inline bool + operator<(const _CharT* __lhs, + const basic_string<_CharT, _Traits, _Alloc>& __rhs) + { return __rhs.compare(__lhs) > 0; } + + // operator > + /** + * @brief Test if string follows string. + * @param lhs First string. + * @param rhs Second string. + * @return True if @a lhs follows @a rhs. False otherwise. + */ + template + inline bool + operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs, + const basic_string<_CharT, _Traits, _Alloc>& __rhs) + { return __lhs.compare(__rhs) > 0; } + + /** + * @brief Test if string follows C string. + * @param lhs String. + * @param rhs C string. + * @return True if @a lhs follows @a rhs. False otherwise. + */ + template + inline bool + operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs, + const _CharT* __rhs) + { return __lhs.compare(__rhs) > 0; } + + /** + * @brief Test if C string follows string. + * @param lhs C string. + * @param rhs String. + * @return True if @a lhs follows @a rhs. False otherwise. + */ + template + inline bool + operator>(const _CharT* __lhs, + const basic_string<_CharT, _Traits, _Alloc>& __rhs) + { return __rhs.compare(__lhs) < 0; } + + // operator <= + /** + * @brief Test if string doesn't follow string. + * @param lhs First string. + * @param rhs Second string. + * @return True if @a lhs doesn't follow @a rhs. False otherwise. + */ + template + inline bool + operator<=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, + const basic_string<_CharT, _Traits, _Alloc>& __rhs) + { return __lhs.compare(__rhs) <= 0; } + + /** + * @brief Test if string doesn't follow C string. + * @param lhs String. + * @param rhs C string. + * @return True if @a lhs doesn't follow @a rhs. False otherwise. + */ + template + inline bool + operator<=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, + const _CharT* __rhs) + { return __lhs.compare(__rhs) <= 0; } + + /** + * @brief Test if C string doesn't follow string. + * @param lhs C string. + * @param rhs String. + * @return True if @a lhs doesn't follow @a rhs. False otherwise. + */ + template + inline bool + operator<=(const _CharT* __lhs, + const basic_string<_CharT, _Traits, _Alloc>& __rhs) + { return __rhs.compare(__lhs) >= 0; } + + // operator >= + /** + * @brief Test if string doesn't precede string. + * @param lhs First string. + * @param rhs Second string. + * @return True if @a lhs doesn't precede @a rhs. False otherwise. + */ + template + inline bool + operator>=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, + const basic_string<_CharT, _Traits, _Alloc>& __rhs) + { return __lhs.compare(__rhs) >= 0; } + + /** + * @brief Test if string doesn't precede C string. + * @param lhs String. + * @param rhs C string. + * @return True if @a lhs doesn't precede @a rhs. False otherwise. + */ + template + inline bool + operator>=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, + const _CharT* __rhs) + { return __lhs.compare(__rhs) >= 0; } + + /** + * @brief Test if C string doesn't precede string. + * @param lhs C string. + * @param rhs String. + * @return True if @a lhs doesn't precede @a rhs. False otherwise. + */ + template + inline bool + operator>=(const _CharT* __lhs, + const basic_string<_CharT, _Traits, _Alloc>& __rhs) + { return __rhs.compare(__lhs) <= 0; } + + /** + * @brief Swap contents of two strings. + * @param lhs First string. + * @param rhs Second string. + * + * Exchanges the contents of @a lhs and @a rhs in constant time. + */ + template + inline void + swap(basic_string<_CharT, _Traits, _Alloc>& __lhs, + basic_string<_CharT, _Traits, _Alloc>& __rhs) + { __lhs.swap(__rhs); } + + /** + * @brief Read stream into a string. + * @param is Input stream. + * @param str Buffer to store into. + * @return Reference to the input stream. + * + * Stores characters from @a is into @a str until whitespace is found, the + * end of the stream is encountered, or str.max_size() is reached. If + * is.width() is non-zero, that is the limit on the number of characters + * stored into @a str. Any previous contents of @a str are erased. + */ + template + basic_istream<_CharT, _Traits>& + operator>>(basic_istream<_CharT, _Traits>& __is, + basic_string<_CharT, _Traits, _Alloc>& __str); + + template<> + basic_istream& + operator>>(basic_istream& __is, basic_string& __str); + + /** + * @brief Write string to a stream. + * @param os Output stream. + * @param str String to write out. + * @return Reference to the output stream. + * + * Output characters of @a str into os following the same rules as for + * writing a C string. + */ + template + inline basic_ostream<_CharT, _Traits>& + operator<<(basic_ostream<_CharT, _Traits>& __os, + const basic_string<_CharT, _Traits, _Alloc>& __str) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 586. string inserter not a formatted function + return __ostream_insert(__os, __str.data(), __str.size()); + } + + /** + * @brief Read a line from stream into a string. + * @param is Input stream. + * @param str Buffer to store into. + * @param delim Character marking end of line. + * @return Reference to the input stream. + * + * Stores characters from @a is into @a str until @a delim is found, the + * end of the stream is encountered, or str.max_size() is reached. If + * is.width() is non-zero, that is the limit on the number of characters + * stored into @a str. Any previous contents of @a str are erased. If @a + * delim was encountered, it is extracted but not stored into @a str. + */ + template + basic_istream<_CharT, _Traits>& + getline(basic_istream<_CharT, _Traits>& __is, + basic_string<_CharT, _Traits, _Alloc>& __str, _CharT __delim); + + /** + * @brief Read a line from stream into a string. + * @param is Input stream. + * @param str Buffer to store into. + * @return Reference to the input stream. + * + * Stores characters from is into @a str until '\n' is found, the end of + * the stream is encountered, or str.max_size() is reached. If is.width() + * is non-zero, that is the limit on the number of characters stored into + * @a str. Any previous contents of @a str are erased. If end of line was + * encountered, it is extracted but not stored into @a str. + */ + template + inline basic_istream<_CharT, _Traits>& + getline(basic_istream<_CharT, _Traits>& __is, + basic_string<_CharT, _Traits, _Alloc>& __str) + { return getline(__is, __str, __is.widen('\n')); } + + template<> + basic_istream& + getline(basic_istream& __in, basic_string& __str, + char __delim); + +#ifdef _GLIBCXX_USE_WCHAR_T + template<> + basic_istream& + getline(basic_istream& __in, basic_string& __str, + wchar_t __delim); +#endif + +} // namespace std + +#endif /* _BASIC_STRING_H */ diff --git a/cpp_src/basic_string.tcc b/cpp_src/basic_string.tcc new file mode 100644 index 0000000..8fef423 --- /dev/null +++ b/cpp_src/basic_string.tcc @@ -0,0 +1,1012 @@ +// Components for manipulating sequences of characters -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file basic_string.tcc + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 21 Strings library +// + +// Written by Jason Merrill based upon the specification by Takanori Adachi +// in ANSI X3J16/94-0013R2. Rewritten by Nathan Myers to ISO-14882. + +#ifndef _BASIC_STRING_TCC +#define _BASIC_STRING_TCC 1 + +#pragma GCC system_header + +namespace std { + + template + inline bool + __is_null_pointer(_Type* __ptr) + { return __ptr == 0; } + + template + inline bool + __is_null_pointer(_Type) + { return false; } + + template + const typename basic_string<_CharT, _Traits, _Alloc>::size_type + basic_string<_CharT, _Traits, _Alloc>:: + _Rep::_S_max_size = (((npos - sizeof(_Rep_base))/sizeof(_CharT)) - 1) / 4; + + template + const _CharT + basic_string<_CharT, _Traits, _Alloc>:: + _Rep::_S_terminal = _CharT(); + + template + const typename basic_string<_CharT, _Traits, _Alloc>::size_type + basic_string<_CharT, _Traits, _Alloc>::npos; + + // Linker sets _S_empty_rep_storage to all 0s (one reference, empty string) + // at static init time (before static ctors are run). + template + typename basic_string<_CharT, _Traits, _Alloc>::size_type + basic_string<_CharT, _Traits, _Alloc>::_Rep::_S_empty_rep_storage[ + (sizeof(_Rep_base) + sizeof(_CharT) + sizeof(size_type) - 1) / + sizeof(size_type)]; + + // NB: This is the special case for Input Iterators, used in + // istreambuf_iterators, etc. + // Input Iterators have a cost structure very different from + // pointers, calling for a different coding style. + template + template + _CharT* + basic_string<_CharT, _Traits, _Alloc>:: + _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a, + input_iterator_tag) + { +#ifndef _GLIBCXX_FULLY_DYNAMIC_STRING + if (__beg == __end && __a == _Alloc()) + return _S_empty_rep()._M_refdata(); +#endif + // Avoid reallocation for common case. + _CharT __buf[128]; + size_type __len = 0; + while (__beg != __end && __len < sizeof(__buf) / sizeof(_CharT)) + { + __buf[__len++] = *__beg; + ++__beg; + } + _Rep* __r = _Rep::_S_create(__len, size_type(0), __a); + _M_copy(__r->_M_refdata(), __buf, __len); + try + { + while (__beg != __end) + { + if (__len == __r->_M_capacity) + { + // Allocate more space. + _Rep* __another = _Rep::_S_create(__len + 1, __len, __a); + _M_copy(__another->_M_refdata(), __r->_M_refdata(), __len); + __r->_M_destroy(__a); + __r = __another; + } + __r->_M_refdata()[__len++] = *__beg; + ++__beg; + } + } + catch(...) + { + __r->_M_destroy(__a); + __throw_exception_again; + } + __r->_M_set_length_and_sharable(__len); + return __r->_M_refdata(); + } + + template + template + _CharT* + basic_string<_CharT, _Traits, _Alloc>:: + _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a, + forward_iterator_tag) + { +#ifndef _GLIBCXX_FULLY_DYNAMIC_STRING + if (__beg == __end && __a == _Alloc()) + return _S_empty_rep()._M_refdata(); +#endif + // NB: Not required, but considered best practice. + if (__builtin_expect(__is_null_pointer(__beg) && __beg != __end, 0)) + __throw_logic_error(__N("basic_string::_S_construct NULL not valid")); + + const size_type __dnew = static_cast(std::distance(__beg, + __end)); + // Check for out_of_range and length_error exceptions. + _Rep* __r = _Rep::_S_create(__dnew, size_type(0), __a); + try + { _S_copy_chars(__r->_M_refdata(), __beg, __end); } + catch(...) + { + __r->_M_destroy(__a); + __throw_exception_again; + } + __r->_M_set_length_and_sharable(__dnew); + return __r->_M_refdata(); + } + + template + _CharT* + basic_string<_CharT, _Traits, _Alloc>:: + _S_construct(size_type __n, _CharT __c, const _Alloc& __a) + { +#ifndef _GLIBCXX_FULLY_DYNAMIC_STRING + if (__n == 0 && __a == _Alloc()) + return _S_empty_rep()._M_refdata(); +#endif + // Check for out_of_range and length_error exceptions. + _Rep* __r = _Rep::_S_create(__n, size_type(0), __a); + if (__n) + _M_assign(__r->_M_refdata(), __n, __c); + + __r->_M_set_length_and_sharable(__n); + return __r->_M_refdata(); + } + + template + basic_string<_CharT, _Traits, _Alloc>:: + basic_string(const basic_string& __str) + : _M_dataplus(__str._M_rep()->_M_grab(_Alloc(__str.get_allocator()), + __str.get_allocator()), + __str.get_allocator()) + { } + + template + basic_string<_CharT, _Traits, _Alloc>:: + basic_string(const _Alloc& __a) + : _M_dataplus(_S_construct(size_type(), _CharT(), __a), __a) + { } + + template + basic_string<_CharT, _Traits, _Alloc>:: + basic_string(const basic_string& __str, size_type __pos, size_type __n) + : _M_dataplus(_S_construct(__str._M_data() + + __str._M_check(__pos, + "basic_string::basic_string"), + __str._M_data() + __str._M_limit(__pos, __n) + + __pos, _Alloc()), _Alloc()) + { } + + template + basic_string<_CharT, _Traits, _Alloc>:: + basic_string(const basic_string& __str, size_type __pos, + size_type __n, const _Alloc& __a) + : _M_dataplus(_S_construct(__str._M_data() + + __str._M_check(__pos, + "basic_string::basic_string"), + __str._M_data() + __str._M_limit(__pos, __n) + + __pos, __a), __a) + { } + + // TBD: DPG annotate + template + basic_string<_CharT, _Traits, _Alloc>:: + basic_string(const _CharT* __s, size_type __n, const _Alloc& __a) + : _M_dataplus(_S_construct(__s, __s + __n, __a), __a) + { } + + // TBD: DPG annotate + template + basic_string<_CharT, _Traits, _Alloc>:: + basic_string(const _CharT* __s, const _Alloc& __a) + : _M_dataplus(_S_construct(__s, __s ? __s + traits_type::length(__s) : + __s + npos, __a), __a) + { } + + template + basic_string<_CharT, _Traits, _Alloc>:: + basic_string(size_type __n, _CharT __c, const _Alloc& __a) + : _M_dataplus(_S_construct(__n, __c, __a), __a) + { } + + // TBD: DPG annotate + template + template + basic_string<_CharT, _Traits, _Alloc>:: + basic_string(_InputIterator __beg, _InputIterator __end, const _Alloc& __a) + : _M_dataplus(_S_construct(__beg, __end, __a), __a) + { } + + template + basic_string<_CharT, _Traits, _Alloc>& + basic_string<_CharT, _Traits, _Alloc>:: + assign(const basic_string& __str) + { + if (_M_rep() != __str._M_rep()) + { + // XXX MT + const allocator_type __a = this->get_allocator(); + _CharT* __tmp = __str._M_rep()->_M_grab(__a, __str.get_allocator()); + _M_rep()->_M_dispose(__a); + _M_data(__tmp); + } + return *this; + } + + template + basic_string<_CharT, _Traits, _Alloc>& + basic_string<_CharT, _Traits, _Alloc>:: + assign(const _CharT* __s, size_type __n) + { + __glibcxx_requires_string_len(__s, __n); + _M_check_length(this->size(), __n, "basic_string::assign"); + if (_M_disjunct(__s) || _M_rep()->_M_is_shared()) + return _M_replace_safe(size_type(0), this->size(), __s, __n); + else + { + // Work in-place. + const size_type __pos = __s - _M_data(); + if (__pos >= __n) + _M_copy(_M_data(), __s, __n); + else if (__pos) + _M_move(_M_data(), __s, __n); + _M_rep()->_M_set_length_and_sharable(__n); + return *this; + } + } + + template + basic_string<_CharT, _Traits, _Alloc>& + basic_string<_CharT, _Traits, _Alloc>:: + append(size_type __n, _CharT __c) + { + if (__n) + { + _M_check_length(size_type(0), __n, "basic_string::append"); + const size_type __len = __n + this->size(); + if (__len > this->capacity() || _M_rep()->_M_is_shared()) + this->reserve(__len); + _M_assign(_M_data() + this->size(), __n, __c); + _M_rep()->_M_set_length_and_sharable(__len); + } + return *this; + } + + template + basic_string<_CharT, _Traits, _Alloc>& + basic_string<_CharT, _Traits, _Alloc>:: + append(const _CharT* __s, size_type __n) + { + __glibcxx_requires_string_len(__s, __n); + if (__n) + { + _M_check_length(size_type(0), __n, "basic_string::append"); + const size_type __len = __n + this->size(); + if (__len > this->capacity() || _M_rep()->_M_is_shared()) + { + if (_M_disjunct(__s)) + this->reserve(__len); + else + { + const size_type __off = __s - _M_data(); + this->reserve(__len); + __s = _M_data() + __off; + } + } + _M_copy(_M_data() + this->size(), __s, __n); + _M_rep()->_M_set_length_and_sharable(__len); + } + return *this; + } + + template + basic_string<_CharT, _Traits, _Alloc>& + basic_string<_CharT, _Traits, _Alloc>:: + append(const basic_string& __str) + { + const size_type __size = __str.size(); + if (__size) + { + const size_type __len = __size + this->size(); + if (__len > this->capacity() || _M_rep()->_M_is_shared()) + this->reserve(__len); + _M_copy(_M_data() + this->size(), __str._M_data(), __size); + _M_rep()->_M_set_length_and_sharable(__len); + } + return *this; + } + + template + basic_string<_CharT, _Traits, _Alloc>& + basic_string<_CharT, _Traits, _Alloc>:: + append(const basic_string& __str, size_type __pos, size_type __n) + { + __str._M_check(__pos, "basic_string::append"); + __n = __str._M_limit(__pos, __n); + if (__n) + { + const size_type __len = __n + this->size(); + if (__len > this->capacity() || _M_rep()->_M_is_shared()) + this->reserve(__len); + _M_copy(_M_data() + this->size(), __str._M_data() + __pos, __n); + _M_rep()->_M_set_length_and_sharable(__len); + } + return *this; + } + + template + basic_string<_CharT, _Traits, _Alloc>& + basic_string<_CharT, _Traits, _Alloc>:: + insert(size_type __pos, const _CharT* __s, size_type __n) + { + __glibcxx_requires_string_len(__s, __n); + _M_check(__pos, "basic_string::insert"); + _M_check_length(size_type(0), __n, "basic_string::insert"); + if (_M_disjunct(__s) || _M_rep()->_M_is_shared()) + return _M_replace_safe(__pos, size_type(0), __s, __n); + else + { + // Work in-place. + const size_type __off = __s - _M_data(); + _M_mutate(__pos, 0, __n); + __s = _M_data() + __off; + _CharT* __p = _M_data() + __pos; + if (__s + __n <= __p) + _M_copy(__p, __s, __n); + else if (__s >= __p) + _M_copy(__p, __s + __n, __n); + else + { + const size_type __nleft = __p - __s; + _M_copy(__p, __s, __nleft); + _M_copy(__p + __nleft, __p + __n, __n - __nleft); + } + return *this; + } + } + + template + basic_string<_CharT, _Traits, _Alloc>& + basic_string<_CharT, _Traits, _Alloc>:: + replace(size_type __pos, size_type __n1, const _CharT* __s, + size_type __n2) + { + __glibcxx_requires_string_len(__s, __n2); + _M_check(__pos, "basic_string::replace"); + __n1 = _M_limit(__pos, __n1); + _M_check_length(__n1, __n2, "basic_string::replace"); + bool __left; + if (_M_disjunct(__s) || _M_rep()->_M_is_shared()) + return _M_replace_safe(__pos, __n1, __s, __n2); + else if ((__left = __s + __n2 <= _M_data() + __pos) + || _M_data() + __pos + __n1 <= __s) + { + // Work in-place: non-overlapping case. + size_type __off = __s - _M_data(); + __left ? __off : (__off += __n2 - __n1); + _M_mutate(__pos, __n1, __n2); + _M_copy(_M_data() + __pos, _M_data() + __off, __n2); + return *this; + } + else + { + // Todo: overlapping case. + const basic_string __tmp(__s, __n2); + return _M_replace_safe(__pos, __n1, __tmp._M_data(), __n2); + } + } + + template + void + basic_string<_CharT, _Traits, _Alloc>::_Rep:: + _M_destroy(const _Alloc& __a) throw () + { + const size_type __size = sizeof(_Rep_base) + + (this->_M_capacity + 1) * sizeof(_CharT); + _Raw_bytes_alloc(__a).deallocate(reinterpret_cast(this), __size); + } + + template + void + basic_string<_CharT, _Traits, _Alloc>:: + _M_leak_hard() + { +#ifndef _GLIBCXX_FULLY_DYNAMIC_STRING + if (_M_rep() == &_S_empty_rep()) + return; +#endif + if (_M_rep()->_M_is_shared()) + _M_mutate(0, 0, 0); + _M_rep()->_M_set_leaked(); + } + + template + void + basic_string<_CharT, _Traits, _Alloc>:: + _M_mutate(size_type __pos, size_type __len1, size_type __len2) + { + const size_type __old_size = this->size(); + const size_type __new_size = __old_size + __len2 - __len1; + const size_type __how_much = __old_size - __pos - __len1; + + if (__new_size > this->capacity() || _M_rep()->_M_is_shared()) + { + // Must reallocate. + const allocator_type __a = get_allocator(); + _Rep* __r = _Rep::_S_create(__new_size, this->capacity(), __a); + + if (__pos) + _M_copy(__r->_M_refdata(), _M_data(), __pos); + if (__how_much) + _M_copy(__r->_M_refdata() + __pos + __len2, + _M_data() + __pos + __len1, __how_much); + + _M_rep()->_M_dispose(__a); + _M_data(__r->_M_refdata()); + } + else if (__how_much && __len1 != __len2) + { + // Work in-place. + _M_move(_M_data() + __pos + __len2, + _M_data() + __pos + __len1, __how_much); + } + _M_rep()->_M_set_length_and_sharable(__new_size); + } + + template + void + basic_string<_CharT, _Traits, _Alloc>:: + reserve(size_type __res) + { + if (__res != this->capacity() || _M_rep()->_M_is_shared()) + { + // Make sure we don't shrink below the current size + if (__res < this->size()) + __res = this->size(); + const allocator_type __a = get_allocator(); + _CharT* __tmp = _M_rep()->_M_clone(__a, __res - this->size()); + _M_rep()->_M_dispose(__a); + _M_data(__tmp); + } + } + + template + void + basic_string<_CharT, _Traits, _Alloc>:: + swap(basic_string& __s) + { + if (_M_rep()->_M_is_leaked()) + _M_rep()->_M_set_sharable(); + if (__s._M_rep()->_M_is_leaked()) + __s._M_rep()->_M_set_sharable(); + if (this->get_allocator() == __s.get_allocator()) + { + _CharT* __tmp = _M_data(); + _M_data(__s._M_data()); + __s._M_data(__tmp); + } + // The code below can usually be optimized away. + else + { + const basic_string __tmp1(_M_ibegin(), _M_iend(), + __s.get_allocator()); + const basic_string __tmp2(__s._M_ibegin(), __s._M_iend(), + this->get_allocator()); + *this = __tmp2; + __s = __tmp1; + } + } + + template + typename basic_string<_CharT, _Traits, _Alloc>::_Rep* + basic_string<_CharT, _Traits, _Alloc>::_Rep:: + _S_create(size_type __capacity, size_type __old_capacity, + const _Alloc& __alloc) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 83. String::npos vs. string::max_size() + if (__capacity > _S_max_size) + __throw_length_error(__N("basic_string::_S_create")); + + // The standard places no restriction on allocating more memory + // than is strictly needed within this layer at the moment or as + // requested by an explicit application call to reserve(). + + // Many malloc implementations perform quite poorly when an + // application attempts to allocate memory in a stepwise fashion + // growing each allocation size by only 1 char. Additionally, + // it makes little sense to allocate less linear memory than the + // natural blocking size of the malloc implementation. + // Unfortunately, we would need a somewhat low-level calculation + // with tuned parameters to get this perfect for any particular + // malloc implementation. Fortunately, generalizations about + // common features seen among implementations seems to suffice. + + // __pagesize need not match the actual VM page size for good + // results in practice, thus we pick a common value on the low + // side. __malloc_header_size is an estimate of the amount of + // overhead per memory allocation (in practice seen N * sizeof + // (void*) where N is 0, 2 or 4). According to folklore, + // picking this value on the high side is better than + // low-balling it (especially when this algorithm is used with + // malloc implementations that allocate memory blocks rounded up + // to a size which is a power of 2). + const size_type __pagesize = 4096; + const size_type __malloc_header_size = 4 * sizeof(void*); + + // The below implements an exponential growth policy, necessary to + // meet amortized linear time requirements of the library: see + // http://gcc.gnu.org/ml/libstdc++/2001-07/msg00085.html. + // It's active for allocations requiring an amount of memory above + // system pagesize. This is consistent with the requirements of the + // standard: http://gcc.gnu.org/ml/libstdc++/2001-07/msg00130.html + if (__capacity > __old_capacity && __capacity < 2 * __old_capacity) + __capacity = 2 * __old_capacity; + + // NB: Need an array of char_type[__capacity], plus a terminating + // null char_type() element, plus enough for the _Rep data structure. + // Whew. Seemingly so needy, yet so elemental. + size_type __size = (__capacity + 1) * sizeof(_CharT) + sizeof(_Rep); + + const size_type __adj_size = __size + __malloc_header_size; + if (__adj_size > __pagesize && __capacity > __old_capacity) + { + const size_type __extra = __pagesize - __adj_size % __pagesize; + __capacity += __extra / sizeof(_CharT); + // Never allocate a string bigger than _S_max_size. + if (__capacity > _S_max_size) + __capacity = _S_max_size; + __size = (__capacity + 1) * sizeof(_CharT) + sizeof(_Rep); + } + + // NB: Might throw, but no worries about a leak, mate: _Rep() + // does not throw. + void* __place = _Raw_bytes_alloc(__alloc).allocate(__size); + _Rep *__p = new (__place) _Rep; + __p->_M_capacity = __capacity; + // ABI compatibility - 3.4.x set in _S_create both + // _M_refcount and _M_length. All callers of _S_create + // in basic_string.tcc then set just _M_length. + // In 4.0.x and later both _M_refcount and _M_length + // are initialized in the callers, unfortunately we can + // have 3.4.x compiled code with _S_create callers inlined + // calling 4.0.x+ _S_create. + __p->_M_set_sharable(); + return __p; + } + + template + _CharT* + basic_string<_CharT, _Traits, _Alloc>::_Rep:: + _M_clone(const _Alloc& __alloc, size_type __res) + { + // Requested capacity of the clone. + const size_type __requested_cap = this->_M_length + __res; + _Rep* __r = _Rep::_S_create(__requested_cap, this->_M_capacity, + __alloc); + if (this->_M_length) + _M_copy(__r->_M_refdata(), _M_refdata(), this->_M_length); + + __r->_M_set_length_and_sharable(this->_M_length); + return __r->_M_refdata(); + } + + template + void + basic_string<_CharT, _Traits, _Alloc>:: + resize(size_type __n, _CharT __c) + { + const size_type __size = this->size(); + _M_check_length(__size, __n, "basic_string::resize"); + if (__size < __n) + this->append(__n - __size, __c); + else if (__n < __size) + this->erase(__n); + // else nothing (in particular, avoid calling _M_mutate() unnecessarily.) + } + + template + template + basic_string<_CharT, _Traits, _Alloc>& + basic_string<_CharT, _Traits, _Alloc>:: + _M_replace_dispatch(iterator __i1, iterator __i2, _InputIterator __k1, + _InputIterator __k2, __false_type) + { + const basic_string __s(__k1, __k2); + const size_type __n1 = __i2 - __i1; + _M_check_length(__n1, __s.size(), "basic_string::_M_replace_dispatch"); + return _M_replace_safe(__i1 - _M_ibegin(), __n1, __s._M_data(), + __s.size()); + } + + template + basic_string<_CharT, _Traits, _Alloc>& + basic_string<_CharT, _Traits, _Alloc>:: + _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2, + _CharT __c) + { + _M_check_length(__n1, __n2, "basic_string::_M_replace_aux"); + _M_mutate(__pos1, __n1, __n2); + if (__n2) + _M_assign(_M_data() + __pos1, __n2, __c); + return *this; + } + + template + basic_string<_CharT, _Traits, _Alloc>& + basic_string<_CharT, _Traits, _Alloc>:: + _M_replace_safe(size_type __pos1, size_type __n1, const _CharT* __s, + size_type __n2) + { + _M_mutate(__pos1, __n1, __n2); + if (__n2) + _M_copy(_M_data() + __pos1, __s, __n2); + return *this; + } + + template + basic_string<_CharT, _Traits, _Alloc> + operator+(const _CharT* __lhs, + const basic_string<_CharT, _Traits, _Alloc>& __rhs) + { + __glibcxx_requires_string(__lhs); + typedef basic_string<_CharT, _Traits, _Alloc> __string_type; + typedef typename __string_type::size_type __size_type; + const __size_type __len = _Traits::length(__lhs); + __string_type __str; + __str.reserve(__len + __rhs.size()); + __str.append(__lhs, __len); + __str.append(__rhs); + return __str; + } + + template + basic_string<_CharT, _Traits, _Alloc> + operator+(_CharT __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) + { + typedef basic_string<_CharT, _Traits, _Alloc> __string_type; + typedef typename __string_type::size_type __size_type; + __string_type __str; + const __size_type __len = __rhs.size(); + __str.reserve(__len + 1); + __str.append(__size_type(1), __lhs); + __str.append(__rhs); + return __str; + } + + template + typename basic_string<_CharT, _Traits, _Alloc>::size_type + basic_string<_CharT, _Traits, _Alloc>:: + copy(_CharT* __s, size_type __n, size_type __pos) const + { + _M_check(__pos, "basic_string::copy"); + __n = _M_limit(__pos, __n); + __glibcxx_requires_string_len(__s, __n); + if (__n) + _M_copy(__s, _M_data() + __pos, __n); + // 21.3.5.7 par 3: do not append null. (good.) + return __n; + } + + template + typename basic_string<_CharT, _Traits, _Alloc>::size_type + basic_string<_CharT, _Traits, _Alloc>:: + find(const _CharT* __s, size_type __pos, size_type __n) const + { + __glibcxx_requires_string_len(__s, __n); + const size_type __size = this->size(); + const _CharT* __data = _M_data(); + + if (__n == 0) + return __pos <= __size ? __pos : npos; + + if (__n <= __size) + { + for (; __pos <= __size - __n; ++__pos) + if (traits_type::eq(__data[__pos], __s[0]) + && traits_type::compare(__data + __pos + 1, + __s + 1, __n - 1) == 0) + return __pos; + } + return npos; + } + + template + typename basic_string<_CharT, _Traits, _Alloc>::size_type + basic_string<_CharT, _Traits, _Alloc>:: + find(_CharT __c, size_type __pos) const + { + size_type __ret = npos; + const size_type __size = this->size(); + if (__pos < __size) + { + const _CharT* __data = _M_data(); + const size_type __n = __size - __pos; + const _CharT* __p = traits_type::find(__data + __pos, __n, __c); + if (__p) + __ret = __p - __data; + } + return __ret; + } + + template + typename basic_string<_CharT, _Traits, _Alloc>::size_type + basic_string<_CharT, _Traits, _Alloc>:: + rfind(const _CharT* __s, size_type __pos, size_type __n) const + { + __glibcxx_requires_string_len(__s, __n); + const size_type __size = this->size(); + if (__n <= __size) + { + __pos = std::min(size_type(__size - __n), __pos); + const _CharT* __data = _M_data(); + do + { + if (traits_type::compare(__data + __pos, __s, __n) == 0) + return __pos; + } + while (__pos-- > 0); + } + return npos; + } + + template + typename basic_string<_CharT, _Traits, _Alloc>::size_type + basic_string<_CharT, _Traits, _Alloc>:: + rfind(_CharT __c, size_type __pos) const + { + size_type __size = this->size(); + if (__size) + { + if (--__size > __pos) + __size = __pos; + for (++__size; __size-- > 0; ) + if (traits_type::eq(_M_data()[__size], __c)) + return __size; + } + return npos; + } + + template + typename basic_string<_CharT, _Traits, _Alloc>::size_type + basic_string<_CharT, _Traits, _Alloc>:: + find_first_of(const _CharT* __s, size_type __pos, size_type __n) const + { + __glibcxx_requires_string_len(__s, __n); + for (; __n && __pos < this->size(); ++__pos) + { + const _CharT* __p = traits_type::find(__s, __n, _M_data()[__pos]); + if (__p) + return __pos; + } + return npos; + } + + template + typename basic_string<_CharT, _Traits, _Alloc>::size_type + basic_string<_CharT, _Traits, _Alloc>:: + find_last_of(const _CharT* __s, size_type __pos, size_type __n) const + { + __glibcxx_requires_string_len(__s, __n); + size_type __size = this->size(); + if (__size && __n) + { + if (--__size > __pos) + __size = __pos; + do + { + if (traits_type::find(__s, __n, _M_data()[__size])) + return __size; + } + while (__size-- != 0); + } + return npos; + } + + template + typename basic_string<_CharT, _Traits, _Alloc>::size_type + basic_string<_CharT, _Traits, _Alloc>:: + find_first_not_of(const _CharT* __s, size_type __pos, size_type __n) const + { + __glibcxx_requires_string_len(__s, __n); + for (; __pos < this->size(); ++__pos) + if (!traits_type::find(__s, __n, _M_data()[__pos])) + return __pos; + return npos; + } + + template + typename basic_string<_CharT, _Traits, _Alloc>::size_type + basic_string<_CharT, _Traits, _Alloc>:: + find_first_not_of(_CharT __c, size_type __pos) const + { + for (; __pos < this->size(); ++__pos) + if (!traits_type::eq(_M_data()[__pos], __c)) + return __pos; + return npos; + } + + template + typename basic_string<_CharT, _Traits, _Alloc>::size_type + basic_string<_CharT, _Traits, _Alloc>:: + find_last_not_of(const _CharT* __s, size_type __pos, size_type __n) const + { + __glibcxx_requires_string_len(__s, __n); + size_type __size = this->size(); + if (__size) + { + if (--__size > __pos) + __size = __pos; + do + { + if (!traits_type::find(__s, __n, _M_data()[__size])) + return __size; + } + while (__size--); + } + return npos; + } + + template + typename basic_string<_CharT, _Traits, _Alloc>::size_type + basic_string<_CharT, _Traits, _Alloc>:: + find_last_not_of(_CharT __c, size_type __pos) const + { + size_type __size = this->size(); + if (__size) + { + if (--__size > __pos) + __size = __pos; + do + { + if (!traits_type::eq(_M_data()[__size], __c)) + return __size; + } + while (__size--); + } + return npos; + } + + template + int + basic_string<_CharT, _Traits, _Alloc>:: + compare(size_type __pos, size_type __n, const basic_string& __str) const + { + _M_check(__pos, "basic_string::compare"); + __n = _M_limit(__pos, __n); + const size_type __osize = __str.size(); + const size_type __len = std::min(__n, __osize); + int __r = traits_type::compare(_M_data() + __pos, __str.data(), __len); + if (!__r) + __r = __n - __osize; + return __r; + } + + template + int + basic_string<_CharT, _Traits, _Alloc>:: + compare(size_type __pos1, size_type __n1, const basic_string& __str, + size_type __pos2, size_type __n2) const + { + _M_check(__pos1, "basic_string::compare"); + __str._M_check(__pos2, "basic_string::compare"); + __n1 = _M_limit(__pos1, __n1); + __n2 = __str._M_limit(__pos2, __n2); + const size_type __len = std::min(__n1, __n2); + int __r = traits_type::compare(_M_data() + __pos1, + __str.data() + __pos2, __len); + if (!__r) + __r = __n1 - __n2; + return __r; + } + + template + int + basic_string<_CharT, _Traits, _Alloc>:: + compare(const _CharT* __s) const + { + __glibcxx_requires_string(__s); + const size_type __size = this->size(); + const size_type __osize = traits_type::length(__s); + const size_type __len = std::min(__size, __osize); + int __r = traits_type::compare(_M_data(), __s, __len); + if (!__r) + __r = __size - __osize; + return __r; + } + + template + int + basic_string <_CharT, _Traits, _Alloc>:: + compare(size_type __pos, size_type __n1, const _CharT* __s) const + { + __glibcxx_requires_string(__s); + _M_check(__pos, "basic_string::compare"); + __n1 = _M_limit(__pos, __n1); + const size_type __osize = traits_type::length(__s); + const size_type __len = std::min(__n1, __osize); + int __r = traits_type::compare(_M_data() + __pos, __s, __len); + if (!__r) + __r = __n1 - __osize; + return __r; + } + + template + int + basic_string <_CharT, _Traits, _Alloc>:: + compare(size_type __pos, size_type __n1, const _CharT* __s, + size_type __n2) const + { + __glibcxx_requires_string_len(__s, __n2); + _M_check(__pos, "basic_string::compare"); + __n1 = _M_limit(__pos, __n1); + const size_type __len = std::min(__n1, __n2); + int __r = traits_type::compare(_M_data() + __pos, __s, __len); + if (!__r) + __r = __n1 - __n2; + return __r; + } + + // Inhibit implicit instantiations for required instantiations, + // which are defined via explicit instantiations elsewhere. + // NB: This syntax is a GNU extension. +#if _GLIBCXX_EXTERN_TEMPLATE + extern template class basic_string; + extern template + basic_istream& + operator>>(basic_istream&, string&); + extern template + basic_ostream& + operator<<(basic_ostream&, const string&); + extern template + basic_istream& + getline(basic_istream&, string&, char); + extern template + basic_istream& + getline(basic_istream&, string&); + +#ifdef _GLIBCXX_USE_WCHAR_T + extern template class basic_string; + extern template + basic_istream& + operator>>(basic_istream&, wstring&); + extern template + basic_ostream& + operator<<(basic_ostream&, const wstring&); + extern template + basic_istream& + getline(basic_istream&, wstring&, wchar_t); + extern template + basic_istream& + getline(basic_istream&, wstring&); +#endif +#endif + +} // namespace std + +#endif diff --git a/cpp_src/bitset b/cpp_src/bitset new file mode 100644 index 0000000..bee1270 --- /dev/null +++ b/cpp_src/bitset @@ -0,0 +1,1344 @@ +// -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * Copyright (c) 1998 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file include/bitset + * This is a Standard C++ Library header. + */ + +#ifndef _GLIBCXX_BITSET +#define _GLIBCXX_BITSET 1 + +#pragma GCC system_header + +#include // For size_t +#include // For memset +#include // For numeric_limits +#include +#include // For invalid_argument, out_of_range, + // overflow_error +#include // For ostream (operator<<) +#include // For istream (operator>>) + +#define _GLIBCXX_BITSET_BITS_PER_WORD numeric_limits::digits +#define _GLIBCXX_BITSET_WORDS(__n) \ + ((__n) < 1 ? 0 : ((__n) + _GLIBCXX_BITSET_BITS_PER_WORD - 1) \ + / _GLIBCXX_BITSET_BITS_PER_WORD) + +namespace std { + + /** + * @if maint + * Base class, general case. It is a class inveriant that _Nw will be + * nonnegative. + * + * See documentation for bitset. + * @endif + */ + template + struct _Base_bitset + { + typedef unsigned long _WordT; + + /// 0 is the least significant word. + _WordT _M_w[_Nw]; + + _Base_bitset() + { _M_do_reset(); } + + _Base_bitset(unsigned long __val) + { + _M_do_reset(); + _M_w[0] = __val; + } + + static size_t + _S_whichword(size_t __pos ) + { return __pos / _GLIBCXX_BITSET_BITS_PER_WORD; } + + static size_t + _S_whichbyte(size_t __pos ) + { return (__pos % _GLIBCXX_BITSET_BITS_PER_WORD) / __CHAR_BIT__; } + + static size_t + _S_whichbit(size_t __pos ) + { return __pos % _GLIBCXX_BITSET_BITS_PER_WORD; } + + static _WordT + _S_maskbit(size_t __pos ) + { return (static_cast<_WordT>(1)) << _S_whichbit(__pos); } + + _WordT& + _M_getword(size_t __pos) + { return _M_w[_S_whichword(__pos)]; } + + _WordT + _M_getword(size_t __pos) const + { return _M_w[_S_whichword(__pos)]; } + + _WordT& + _M_hiword() + { return _M_w[_Nw - 1]; } + + _WordT + _M_hiword() const + { return _M_w[_Nw - 1]; } + + void + _M_do_and(const _Base_bitset<_Nw>& __x) + { + for (size_t __i = 0; __i < _Nw; __i++) + _M_w[__i] &= __x._M_w[__i]; + } + + void + _M_do_or(const _Base_bitset<_Nw>& __x) + { + for (size_t __i = 0; __i < _Nw; __i++) + _M_w[__i] |= __x._M_w[__i]; + } + + void + _M_do_xor(const _Base_bitset<_Nw>& __x) + { + for (size_t __i = 0; __i < _Nw; __i++) + _M_w[__i] ^= __x._M_w[__i]; + } + + void + _M_do_left_shift(size_t __shift); + + void + _M_do_right_shift(size_t __shift); + + void + _M_do_flip() + { + for (size_t __i = 0; __i < _Nw; __i++) + _M_w[__i] = ~_M_w[__i]; + } + + void + _M_do_set() + { + for (size_t __i = 0; __i < _Nw; __i++) + _M_w[__i] = ~static_cast<_WordT>(0); + } + + void + _M_do_reset() + { std::memset(_M_w, 0, _Nw * sizeof(_WordT)); } + + bool + _M_is_equal(const _Base_bitset<_Nw>& __x) const + { + for (size_t __i = 0; __i < _Nw; ++__i) + { + if (_M_w[__i] != __x._M_w[__i]) + return false; + } + return true; + } + + bool + _M_is_any() const + { + for (size_t __i = 0; __i < _Nw; __i++) + { + if (_M_w[__i] != static_cast<_WordT>(0)) + return true; + } + return false; + } + + size_t + _M_do_count() const + { + size_t __result = 0; + for (size_t __i = 0; __i < _Nw; __i++) + __result += __builtin_popcountl(_M_w[__i]); + return __result; + } + + unsigned long + _M_do_to_ulong() const; + + // find first "on" bit + size_t + _M_do_find_first(size_t __not_found) const; + + // find the next "on" bit that follows "prev" + size_t + _M_do_find_next(size_t __prev, size_t __not_found) const; + }; + + // Definitions of non-inline functions from _Base_bitset. + template + void + _Base_bitset<_Nw>::_M_do_left_shift(size_t __shift) + { + if (__builtin_expect(__shift != 0, 1)) + { + const size_t __wshift = __shift / _GLIBCXX_BITSET_BITS_PER_WORD; + const size_t __offset = __shift % _GLIBCXX_BITSET_BITS_PER_WORD; + + if (__offset == 0) + for (size_t __n = _Nw - 1; __n >= __wshift; --__n) + _M_w[__n] = _M_w[__n - __wshift]; + else + { + const size_t __sub_offset = (_GLIBCXX_BITSET_BITS_PER_WORD + - __offset); + for (size_t __n = _Nw - 1; __n > __wshift; --__n) + _M_w[__n] = ((_M_w[__n - __wshift] << __offset) + | (_M_w[__n - __wshift - 1] >> __sub_offset)); + _M_w[__wshift] = _M_w[0] << __offset; + } + + std::fill(_M_w + 0, _M_w + __wshift, static_cast<_WordT>(0)); + } + } + + template + void + _Base_bitset<_Nw>::_M_do_right_shift(size_t __shift) + { + if (__builtin_expect(__shift != 0, 1)) + { + const size_t __wshift = __shift / _GLIBCXX_BITSET_BITS_PER_WORD; + const size_t __offset = __shift % _GLIBCXX_BITSET_BITS_PER_WORD; + const size_t __limit = _Nw - __wshift - 1; + + if (__offset == 0) + for (size_t __n = 0; __n <= __limit; ++__n) + _M_w[__n] = _M_w[__n + __wshift]; + else + { + const size_t __sub_offset = (_GLIBCXX_BITSET_BITS_PER_WORD + - __offset); + for (size_t __n = 0; __n < __limit; ++__n) + _M_w[__n] = ((_M_w[__n + __wshift] >> __offset) + | (_M_w[__n + __wshift + 1] << __sub_offset)); + _M_w[__limit] = _M_w[_Nw-1] >> __offset; + } + + std::fill(_M_w + __limit + 1, _M_w + _Nw, static_cast<_WordT>(0)); + } + } + + template + unsigned long + _Base_bitset<_Nw>::_M_do_to_ulong() const + { + for (size_t __i = 1; __i < _Nw; ++__i) + if (_M_w[__i]) + __throw_overflow_error(__N("_Base_bitset::_M_do_to_ulong")); + return _M_w[0]; + } + + template + size_t + _Base_bitset<_Nw>::_M_do_find_first(size_t __not_found) const + { + for (size_t __i = 0; __i < _Nw; __i++) + { + _WordT __thisword = _M_w[__i]; + if (__thisword != static_cast<_WordT>(0)) + return (__i * _GLIBCXX_BITSET_BITS_PER_WORD + + __builtin_ctzl(__thisword)); + } + // not found, so return an indication of failure. + return __not_found; + } + + template + size_t + _Base_bitset<_Nw>::_M_do_find_next(size_t __prev, size_t __not_found) const + { + // make bound inclusive + ++__prev; + + // check out of bounds + if (__prev >= _Nw * _GLIBCXX_BITSET_BITS_PER_WORD) + return __not_found; + + // search first word + size_t __i = _S_whichword(__prev); + _WordT __thisword = _M_w[__i]; + + // mask off bits below bound + __thisword &= (~static_cast<_WordT>(0)) << _S_whichbit(__prev); + + if (__thisword != static_cast<_WordT>(0)) + return (__i * _GLIBCXX_BITSET_BITS_PER_WORD + + __builtin_ctzl(__thisword)); + + // check subsequent words + __i++; + for (; __i < _Nw; __i++) + { + __thisword = _M_w[__i]; + if (__thisword != static_cast<_WordT>(0)) + return (__i * _GLIBCXX_BITSET_BITS_PER_WORD + + __builtin_ctzl(__thisword)); + } + // not found, so return an indication of failure. + return __not_found; + } // end _M_do_find_next + + /** + * @if maint + * Base class, specialization for a single word. + * + * See documentation for bitset. + * @endif + */ + template<> + struct _Base_bitset<1> + { + typedef unsigned long _WordT; + _WordT _M_w; + + _Base_bitset(void) + : _M_w(0) + { } + + _Base_bitset(unsigned long __val) + : _M_w(__val) + { } + + static size_t + _S_whichword(size_t __pos ) + { return __pos / _GLIBCXX_BITSET_BITS_PER_WORD; } + + static size_t + _S_whichbyte(size_t __pos ) + { return (__pos % _GLIBCXX_BITSET_BITS_PER_WORD) / __CHAR_BIT__; } + + static size_t + _S_whichbit(size_t __pos ) + { return __pos % _GLIBCXX_BITSET_BITS_PER_WORD; } + + static _WordT + _S_maskbit(size_t __pos ) + { return (static_cast<_WordT>(1)) << _S_whichbit(__pos); } + + _WordT& + _M_getword(size_t) + { return _M_w; } + + _WordT + _M_getword(size_t) const + { return _M_w; } + + _WordT& + _M_hiword() + { return _M_w; } + + _WordT + _M_hiword() const + { return _M_w; } + + void + _M_do_and(const _Base_bitset<1>& __x) + { _M_w &= __x._M_w; } + + void + _M_do_or(const _Base_bitset<1>& __x) + { _M_w |= __x._M_w; } + + void + _M_do_xor(const _Base_bitset<1>& __x) + { _M_w ^= __x._M_w; } + + void + _M_do_left_shift(size_t __shift) + { _M_w <<= __shift; } + + void + _M_do_right_shift(size_t __shift) + { _M_w >>= __shift; } + + void + _M_do_flip() + { _M_w = ~_M_w; } + + void + _M_do_set() + { _M_w = ~static_cast<_WordT>(0); } + + void + _M_do_reset() + { _M_w = 0; } + + bool + _M_is_equal(const _Base_bitset<1>& __x) const + { return _M_w == __x._M_w; } + + bool + _M_is_any() const + { return _M_w != 0; } + + size_t + _M_do_count() const + { return __builtin_popcountl(_M_w); } + + unsigned long + _M_do_to_ulong() const + { return _M_w; } + + size_t + _M_do_find_first(size_t __not_found) const + { + if (_M_w != 0) + return __builtin_ctzl(_M_w); + else + return __not_found; + } + + // find the next "on" bit that follows "prev" + size_t + _M_do_find_next(size_t __prev, size_t __not_found) const + { + ++__prev; + if (__prev >= ((size_t) _GLIBCXX_BITSET_BITS_PER_WORD)) + return __not_found; + + _WordT __x = _M_w >> __prev; + if (__x != 0) + return __builtin_ctzl(__x) + __prev; + else + return __not_found; + } + }; + + /** + * @if maint + * Base class, specialization for no storage (zero-length %bitset). + * + * See documentation for bitset. + * @endif + */ + template<> + struct _Base_bitset<0> + { + typedef unsigned long _WordT; + + _Base_bitset() + { } + + _Base_bitset(unsigned long) + { } + + static size_t + _S_whichword(size_t __pos ) + { return __pos / _GLIBCXX_BITSET_BITS_PER_WORD; } + + static size_t + _S_whichbyte(size_t __pos ) + { return (__pos % _GLIBCXX_BITSET_BITS_PER_WORD) / __CHAR_BIT__; } + + static size_t + _S_whichbit(size_t __pos ) + { return __pos % _GLIBCXX_BITSET_BITS_PER_WORD; } + + static _WordT + _S_maskbit(size_t __pos ) + { return (static_cast<_WordT>(1)) << _S_whichbit(__pos); } + + // This would normally give access to the data. The bounds-checking + // in the bitset class will prevent the user from getting this far, + // but (1) it must still return an lvalue to compile, and (2) the + // user might call _Unchecked_set directly, in which case this /needs/ + // to fail. Let's not penalize zero-length users unless they actually + // make an unchecked call; all the memory ugliness is therefore + // localized to this single should-never-get-this-far function. + _WordT& + _M_getword(size_t) const + { + __throw_out_of_range(__N("_Base_bitset::_M_getword")); + return *new _WordT; + } + + _WordT + _M_hiword() const + { return 0; } + + void + _M_do_and(const _Base_bitset<0>&) + { } + + void + _M_do_or(const _Base_bitset<0>&) + { } + + void + _M_do_xor(const _Base_bitset<0>&) + { } + + void + _M_do_left_shift(size_t) + { } + + void + _M_do_right_shift(size_t) + { } + + void + _M_do_flip() + { } + + void + _M_do_set() + { } + + void + _M_do_reset() + { } + + // Are all empty bitsets equal to each other? Are they equal to + // themselves? How to compare a thing which has no state? What is + // the sound of one zero-length bitset clapping? + bool + _M_is_equal(const _Base_bitset<0>&) const + { return true; } + + bool + _M_is_any() const + { return false; } + + size_t + _M_do_count() const + { return 0; } + + unsigned long + _M_do_to_ulong() const + { return 0; } + + // Normally "not found" is the size, but that could also be + // misinterpreted as an index in this corner case. Oh well. + size_t + _M_do_find_first(size_t) const + { return 0; } + + size_t + _M_do_find_next(size_t, size_t) const + { return 0; } + }; + + + // Helper class to zero out the unused high-order bits in the highest word. + template + struct _Sanitize + { + static void _S_do_sanitize(unsigned long& __val) + { __val &= ~((~static_cast(0)) << _Extrabits); } + }; + + template<> + struct _Sanitize<0> + { static void _S_do_sanitize(unsigned long) {} }; + + /** + * @brief The %bitset class represents a @e fixed-size sequence of bits. + * + * @ingroup Containers + * + * (Note that %bitset does @e not meet the formal requirements of a + * container. Mainly, it lacks iterators.) + * + * The template argument, @a Nb, may be any non-negative number, + * specifying the number of bits (e.g., "0", "12", "1024*1024"). + * + * In the general unoptimized case, storage is allocated in word-sized + * blocks. Let B be the number of bits in a word, then (Nb+(B-1))/B + * words will be used for storage. B - Nb%B bits are unused. (They are + * the high-order bits in the highest word.) It is a class invariant + * that those unused bits are always zero. + * + * If you think of %bitset as "a simple array of bits," be aware that + * your mental picture is reversed: a %bitset behaves the same way as + * bits in integers do, with the bit at index 0 in the "least significant + * / right-hand" position, and the bit at index Nb-1 in the "most + * significant / left-hand" position. Thus, unlike other containers, a + * %bitset's index "counts from right to left," to put it very loosely. + * + * This behavior is preserved when translating to and from strings. For + * example, the first line of the following program probably prints + * "b('a') is 0001100001" on a modern ASCII system. + * + * @code + * #include + * #include + * #include + * + * using namespace std; + * + * int main() + * { + * long a = 'a'; + * bitset<10> b(a); + * + * cout << "b('a') is " << b << endl; + * + * ostringstream s; + * s << b; + * string str = s.str(); + * cout << "index 3 in the string is " << str[3] << " but\n" + * << "index 3 in the bitset is " << b[3] << endl; + * } + * @endcode + * + * Also see http://gcc.gnu.org/onlinedocs/libstdc++/ext/sgiexts.html#ch23 + * for a description of extensions. + * + * @if maint + * Most of the actual code isn't contained in %bitset<> itself, but in the + * base class _Base_bitset. The base class works with whole words, not with + * individual bits. This allows us to specialize _Base_bitset for the + * important special case where the %bitset is only a single word. + * + * Extra confusion can result due to the fact that the storage for + * _Base_bitset @e is a regular array, and is indexed as such. This is + * carefully encapsulated. + * @endif + */ + template + class bitset + : private _Base_bitset<_GLIBCXX_BITSET_WORDS(_Nb)> + { + private: + typedef _Base_bitset<_GLIBCXX_BITSET_WORDS(_Nb)> _Base; + typedef unsigned long _WordT; + + void + _M_do_sanitize() + { + _Sanitize<_Nb % _GLIBCXX_BITSET_BITS_PER_WORD>:: + _S_do_sanitize(this->_M_hiword()); + } + + public: + /** + * This encapsulates the concept of a single bit. An instance of this + * class is a proxy for an actual bit; this way the individual bit + * operations are done as faster word-size bitwise instructions. + * + * Most users will never need to use this class directly; conversions + * to and from bool are automatic and should be transparent. Overloaded + * operators help to preserve the illusion. + * + * (On a typical system, this "bit %reference" is 64 times the size of + * an actual bit. Ha.) + */ + class reference + { + friend class bitset; + + _WordT *_M_wp; + size_t _M_bpos; + + // left undefined + reference(); + + public: + reference(bitset& __b, size_t __pos) + { + _M_wp = &__b._M_getword(__pos); + _M_bpos = _Base::_S_whichbit(__pos); + } + + ~reference() + { } + + // For b[i] = __x; + reference& + operator=(bool __x) + { + if (__x) + *_M_wp |= _Base::_S_maskbit(_M_bpos); + else + *_M_wp &= ~_Base::_S_maskbit(_M_bpos); + return *this; + } + + // For b[i] = b[__j]; + reference& + operator=(const reference& __j) + { + if ((*(__j._M_wp) & _Base::_S_maskbit(__j._M_bpos))) + *_M_wp |= _Base::_S_maskbit(_M_bpos); + else + *_M_wp &= ~_Base::_S_maskbit(_M_bpos); + return *this; + } + + // Flips the bit + bool + operator~() const + { return (*(_M_wp) & _Base::_S_maskbit(_M_bpos)) == 0; } + + // For __x = b[i]; + operator bool() const + { return (*(_M_wp) & _Base::_S_maskbit(_M_bpos)) != 0; } + + // For b[i].flip(); + reference& + flip() + { + *_M_wp ^= _Base::_S_maskbit(_M_bpos); + return *this; + } + }; + friend class reference; + + // 23.3.5.1 constructors: + /// All bits set to zero. + bitset() + { } + + /// Initial bits bitwise-copied from a single word (others set to zero). + bitset(unsigned long __val) + : _Base(__val) + { _M_do_sanitize(); } + + /** + * @brief Use a subset of a string. + * @param s A string of '0' and '1' characters. + * @param position Index of the first character in @a s to use; + * defaults to zero. + * @throw std::out_of_range If @a pos is bigger the size of @a s. + * @throw std::invalid_argument If a character appears in the string + * which is neither '0' nor '1'. + */ + template + explicit + bitset(const std::basic_string<_CharT, _Traits, _Alloc>& __s, + size_t __position = 0) + : _Base() + { + if (__position > __s.size()) + __throw_out_of_range(__N("bitset::bitset initial position " + "not valid")); + _M_copy_from_string(__s, __position, + std::basic_string<_CharT, _Traits, _Alloc>::npos); + } + + /** + * @brief Use a subset of a string. + * @param s A string of '0' and '1' characters. + * @param position Index of the first character in @a s to use. + * @param n The number of characters to copy. + * @throw std::out_of_range If @a pos is bigger the size of @a s. + * @throw std::invalid_argument If a character appears in the string + * which is neither '0' nor '1'. + */ + template + bitset(const std::basic_string<_CharT, _Traits, _Alloc>& __s, + size_t __position, size_t __n) + : _Base() + { + if (__position > __s.size()) + __throw_out_of_range(__N("bitset::bitset initial position " + "not valid")); + _M_copy_from_string(__s, __position, __n); + } + + // 23.3.5.2 bitset operations: + //@{ + /** + * @brief Operations on bitsets. + * @param rhs A same-sized bitset. + * + * These should be self-explanatory. + */ + bitset<_Nb>& + operator&=(const bitset<_Nb>& __rhs) + { + this->_M_do_and(__rhs); + return *this; + } + + bitset<_Nb>& + operator|=(const bitset<_Nb>& __rhs) + { + this->_M_do_or(__rhs); + return *this; + } + + bitset<_Nb>& + operator^=(const bitset<_Nb>& __rhs) + { + this->_M_do_xor(__rhs); + return *this; + } + //@} + + //@{ + /** + * @brief Operations on bitsets. + * @param position The number of places to shift. + * + * These should be self-explanatory. + */ + bitset<_Nb>& + operator<<=(size_t __position) + { + if (__builtin_expect(__position < _Nb, 1)) + { + this->_M_do_left_shift(__position); + this->_M_do_sanitize(); + } + else + this->_M_do_reset(); + return *this; + } + + bitset<_Nb>& + operator>>=(size_t __position) + { + if (__builtin_expect(__position < _Nb, 1)) + { + this->_M_do_right_shift(__position); + this->_M_do_sanitize(); + } + else + this->_M_do_reset(); + return *this; + } + //@} + + //@{ + /** + * These versions of single-bit set, reset, flip, and test are + * extensions from the SGI version. They do no range checking. + * @ingroup SGIextensions + */ + bitset<_Nb>& + _Unchecked_set(size_t __pos) + { + this->_M_getword(__pos) |= _Base::_S_maskbit(__pos); + return *this; + } + + bitset<_Nb>& + _Unchecked_set(size_t __pos, int __val) + { + if (__val) + this->_M_getword(__pos) |= _Base::_S_maskbit(__pos); + else + this->_M_getword(__pos) &= ~_Base::_S_maskbit(__pos); + return *this; + } + + bitset<_Nb>& + _Unchecked_reset(size_t __pos) + { + this->_M_getword(__pos) &= ~_Base::_S_maskbit(__pos); + return *this; + } + + bitset<_Nb>& + _Unchecked_flip(size_t __pos) + { + this->_M_getword(__pos) ^= _Base::_S_maskbit(__pos); + return *this; + } + + bool + _Unchecked_test(size_t __pos) const + { return ((this->_M_getword(__pos) & _Base::_S_maskbit(__pos)) + != static_cast<_WordT>(0)); } + //@} + + // Set, reset, and flip. + /** + * @brief Sets every bit to true. + */ + bitset<_Nb>& + set() + { + this->_M_do_set(); + this->_M_do_sanitize(); + return *this; + } + + /** + * @brief Sets a given bit to a particular value. + * @param position The index of the bit. + * @param val Either true or false, defaults to true. + * @throw std::out_of_range If @a pos is bigger the size of the %set. + */ + bitset<_Nb>& + set(size_t __position, bool __val = true) + { + if (__position >= _Nb) + __throw_out_of_range(__N("bitset::set")); + return _Unchecked_set(__position, __val); + } + + /** + * @brief Sets every bit to false. + */ + bitset<_Nb>& + reset() + { + this->_M_do_reset(); + return *this; + } + + /** + * @brief Sets a given bit to false. + * @param position The index of the bit. + * @throw std::out_of_range If @a pos is bigger the size of the %set. + * + * Same as writing @c set(pos,false). + */ + bitset<_Nb>& + reset(size_t __position) + { + if (__position >= _Nb) + __throw_out_of_range(__N("bitset::reset")); + return _Unchecked_reset(__position); + } + + /** + * @brief Toggles every bit to its opposite value. + */ + bitset<_Nb>& + flip() + { + this->_M_do_flip(); + this->_M_do_sanitize(); + return *this; + } + + /** + * @brief Toggles a given bit to its opposite value. + * @param position The index of the bit. + * @throw std::out_of_range If @a pos is bigger the size of the %set. + */ + bitset<_Nb>& + flip(size_t __position) + { + if (__position >= _Nb) + __throw_out_of_range(__N("bitset::flip")); + return _Unchecked_flip(__position); + } + + /// See the no-argument flip(). + bitset<_Nb> + operator~() const + { return bitset<_Nb>(*this).flip(); } + + //@{ + /** + * @brief Array-indexing support. + * @param position Index into the %bitset. + * @return A bool for a 'const %bitset'. For non-const bitsets, an + * instance of the reference proxy class. + * @note These operators do no range checking and throw no exceptions, + * as required by DR 11 to the standard. + * + * @if maint + * _GLIBCXX_RESOLVE_LIB_DEFECTS Note that this implementation already + * resolves DR 11 (items 1 and 2), but does not do the range-checking + * required by that DR's resolution. -pme + * The DR has since been changed: range-checking is a precondition + * (users' responsibility), and these functions must not throw. -pme + * @endif + */ + reference + operator[](size_t __position) + { return reference(*this,__position); } + + bool + operator[](size_t __position) const + { return _Unchecked_test(__position); } + //@} + + /** + * @brief Retuns a numerical interpretation of the %bitset. + * @return The integral equivalent of the bits. + * @throw std::overflow_error If there are too many bits to be + * represented in an @c unsigned @c long. + */ + unsigned long + to_ulong() const + { return this->_M_do_to_ulong(); } + + /** + * @brief Retuns a character interpretation of the %bitset. + * @return The string equivalent of the bits. + * + * Note the ordering of the bits: decreasing character positions + * correspond to increasing bit positions (see the main class notes for + * an example). + */ + template + std::basic_string<_CharT, _Traits, _Alloc> + to_string() const + { + std::basic_string<_CharT, _Traits, _Alloc> __result; + _M_copy_to_string(__result); + return __result; + } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 434. bitset::to_string() hard to use. + template + std::basic_string<_CharT, _Traits, std::allocator<_CharT> > + to_string() const + { return to_string<_CharT, _Traits, std::allocator<_CharT> >(); } + + template + std::basic_string<_CharT, std::char_traits<_CharT>, + std::allocator<_CharT> > + to_string() const + { + return to_string<_CharT, std::char_traits<_CharT>, + std::allocator<_CharT> >(); + } + + std::basic_string, std::allocator > + to_string() const + { + return to_string, + std::allocator >(); + } + + // Helper functions for string operations. + template + void + _M_copy_from_string(const std::basic_string<_CharT, + _Traits, _Alloc>& __s, + size_t, size_t); + + template + void + _M_copy_to_string(std::basic_string<_CharT, _Traits, _Alloc>&) const; + + /// Returns the number of bits which are set. + size_t + count() const + { return this->_M_do_count(); } + + /// Returns the total number of bits. + size_t + size() const + { return _Nb; } + + //@{ + /// These comparisons for equality/inequality are, well, @e bitwise. + bool + operator==(const bitset<_Nb>& __rhs) const + { return this->_M_is_equal(__rhs); } + + bool + operator!=(const bitset<_Nb>& __rhs) const + { return !this->_M_is_equal(__rhs); } + //@} + + /** + * @brief Tests the value of a bit. + * @param position The index of a bit. + * @return The value at @a pos. + * @throw std::out_of_range If @a pos is bigger the size of the %set. + */ + bool + test(size_t __position) const + { + if (__position >= _Nb) + __throw_out_of_range(__N("bitset::test")); + return _Unchecked_test(__position); + } + + /** + * @brief Tests whether any of the bits are on. + * @return True if at least one bit is set. + */ + bool + any() const + { return this->_M_is_any(); } + + /** + * @brief Tests whether any of the bits are on. + * @return True if none of the bits are set. + */ + bool + none() const + { return !this->_M_is_any(); } + + //@{ + /// Self-explanatory. + bitset<_Nb> + operator<<(size_t __position) const + { return bitset<_Nb>(*this) <<= __position; } + + bitset<_Nb> + operator>>(size_t __position) const + { return bitset<_Nb>(*this) >>= __position; } + //@} + + /** + * @brief Finds the index of the first "on" bit. + * @return The index of the first bit set, or size() if not found. + * @ingroup SGIextensions + * @sa _Find_next + */ + size_t + _Find_first() const + { return this->_M_do_find_first(_Nb); } + + /** + * @brief Finds the index of the next "on" bit after prev. + * @return The index of the next bit set, or size() if not found. + * @param prev Where to start searching. + * @ingroup SGIextensions + * @sa _Find_first + */ + size_t + _Find_next(size_t __prev ) const + { return this->_M_do_find_next(__prev, _Nb); } + }; + + // Definitions of non-inline member functions. + template + template + void + bitset<_Nb>:: + _M_copy_from_string(const std::basic_string<_CharT, _Traits, + _Alloc>& __s, size_t __pos, size_t __n) + { + reset(); + const size_t __nbits = std::min(_Nb, std::min(__n, __s.size() - __pos)); + for (size_t __i = __nbits; __i > 0; --__i) + { + switch(__s[__pos + __nbits - __i]) + { + case '0': + break; + case '1': + _Unchecked_set(__i - 1); + break; + default: + __throw_invalid_argument(__N("bitset::_M_copy_from_string")); + } + } + } + + template + template + void + bitset<_Nb>:: + _M_copy_to_string(std::basic_string<_CharT, _Traits, _Alloc>& __s) const + { + __s.assign(_Nb, '0'); + for (size_t __i = _Nb; __i > 0; --__i) + if (_Unchecked_test(__i - 1)) + __s[_Nb - __i] = '1'; + } + + // 23.3.5.3 bitset operations: + //@{ + /** + * @brief Global bitwise operations on bitsets. + * @param x A bitset. + * @param y A bitset of the same size as @a x. + * @return A new bitset. + * + * These should be self-explanatory. + */ + template + inline bitset<_Nb> + operator&(const bitset<_Nb>& __x, const bitset<_Nb>& __y) + { + bitset<_Nb> __result(__x); + __result &= __y; + return __result; + } + + template + inline bitset<_Nb> + operator|(const bitset<_Nb>& __x, const bitset<_Nb>& __y) + { + bitset<_Nb> __result(__x); + __result |= __y; + return __result; + } + + template + inline bitset<_Nb> + operator^(const bitset<_Nb>& __x, const bitset<_Nb>& __y) + { + bitset<_Nb> __result(__x); + __result ^= __y; + return __result; + } + //@} + + //@{ + /** + * @brief Global I/O operators for bitsets. + * + * Direct I/O between streams and bitsets is supported. Output is + * straightforward. Input will skip whitespace, only accept '0' and '1' + * characters, and will only extract as many digits as the %bitset will + * hold. + */ + template + std::basic_istream<_CharT, _Traits>& + operator>>(std::basic_istream<_CharT, _Traits>& __is, bitset<_Nb>& __x) + { + typedef typename _Traits::char_type char_type; + std::basic_string<_CharT, _Traits> __tmp; + __tmp.reserve(_Nb); + + std::ios_base::iostate __state = std::ios_base::goodbit; + typename std::basic_istream<_CharT, _Traits>::sentry __sentry(__is); + if (__sentry) + { + try + { + basic_streambuf<_CharT, _Traits>* __buf = __is.rdbuf(); + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 303. Bitset input operator underspecified + const char_type __zero = __is.widen('0'); + const char_type __one = __is.widen('1'); + for (size_t __i = _Nb; __i > 0; --__i) + { + static typename _Traits::int_type __eof = _Traits::eof(); + + typename _Traits::int_type __c1 = __buf->sbumpc(); + if (_Traits::eq_int_type(__c1, __eof)) + { + __state |= std::ios_base::eofbit; + break; + } + else + { + const char_type __c2 = _Traits::to_char_type(__c1); + if (__c2 == __zero) + __tmp.push_back('0'); + else if (__c2 == __one) + __tmp.push_back('1'); + else if (_Traits::eq_int_type(__buf->sputbackc(__c2), + __eof)) + { + __state |= std::ios_base::failbit; + break; + } + } + } + } + catch(...) + { __is._M_setstate(std::ios_base::badbit); } + } + + if (__tmp.empty() && _Nb) + __state |= std::ios_base::failbit; + else + __x._M_copy_from_string(__tmp, static_cast(0), _Nb); + if (__state) + __is.setstate(__state); + return __is; + } + + template + std::basic_ostream<_CharT, _Traits>& + operator<<(std::basic_ostream<_CharT, _Traits>& __os, + const bitset<_Nb>& __x) + { + std::basic_string<_CharT, _Traits> __tmp; + __x._M_copy_to_string(__tmp); + return __os << __tmp; + } + + // Specializations for zero-sized bitsets, to avoid "unsigned comparison + // with zero" warnings. + template<> + inline bitset<0>& + bitset<0>:: + set(size_t, bool) + { + __throw_out_of_range(__N("bitset::set")); + return *this; + } + + template<> + inline bitset<0>& + bitset<0>:: + reset(size_t) + { + __throw_out_of_range(__N("bitset::reset")); + return *this; + } + + template<> + inline bitset<0>& + bitset<0>:: + flip(size_t) + { + __throw_out_of_range(__N("bitset::flip")); + return *this; + } + + template<> + inline bool + bitset<0>:: + test(size_t) const + { + __throw_out_of_range(__N("bitset::test")); + return false; + } + //@} + +} // namespace std + +#undef _GLIBCXX_BITSET_WORDS +#undef _GLIBCXX_BITSET_BITS_PER_WORD + +#ifdef _GLIBCXX_DEBUG +# include +#endif + +#endif /* _GLIBCXX_BITSET */ diff --git a/cpp_src/boost_concept_check.h b/cpp_src/boost_concept_check.h new file mode 100644 index 0000000..ad1ade8 --- /dev/null +++ b/cpp_src/boost_concept_check.h @@ -0,0 +1,933 @@ +// -*- C++ -*- + +// Copyright (C) 2004, 2005 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +// (C) Copyright Jeremy Siek 2000. Permission to copy, use, modify, +// sell and distribute this software is granted provided this +// copyright notice appears in all copies. This software is provided +// "as is" without express or implied warranty, and with no claim as +// to its suitability for any purpose. +// + +/** @file boost_concept_check.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// GCC Note: based on version 1.12.0 of the Boost library. + +#ifndef _BOOST_CONCEPT_CHECK_H +#define _BOOST_CONCEPT_CHECK_H 1 + +#pragma GCC system_header + +#include // for ptrdiff_t, used next +#include // for traits and tags +#include // for pair<> + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + +#define _IsUnused __attribute__ ((__unused__)) + +// When the C-C code is in use, we would like this function to do as little +// as possible at runtime, use as few resources as possible, and hopefully +// be elided out of existence... hmmm. +template +inline void __function_requires() +{ + void (_Concept::*__x)() _IsUnused = &_Concept::__constraints; +} + +// No definition: if this is referenced, there's a problem with +// the instantiating type not being one of the required integer types. +// Unfortunately, this results in a link-time error, not a compile-time error. +void __error_type_must_be_an_integer_type(); +void __error_type_must_be_an_unsigned_integer_type(); +void __error_type_must_be_a_signed_integer_type(); + +// ??? Should the "concept_checking*" structs begin with more than _ ? +#define _GLIBCXX_CLASS_REQUIRES(_type_var, _ns, _concept) \ + typedef void (_ns::_concept <_type_var>::* _func##_type_var##_concept)(); \ + template <_func##_type_var##_concept _Tp1> \ + struct _concept_checking##_type_var##_concept { }; \ + typedef _concept_checking##_type_var##_concept< \ + &_ns::_concept <_type_var>::__constraints> \ + _concept_checking_typedef##_type_var##_concept + +#define _GLIBCXX_CLASS_REQUIRES2(_type_var1, _type_var2, _ns, _concept) \ + typedef void (_ns::_concept <_type_var1,_type_var2>::* _func##_type_var1##_type_var2##_concept)(); \ + template <_func##_type_var1##_type_var2##_concept _Tp1> \ + struct _concept_checking##_type_var1##_type_var2##_concept { }; \ + typedef _concept_checking##_type_var1##_type_var2##_concept< \ + &_ns::_concept <_type_var1,_type_var2>::__constraints> \ + _concept_checking_typedef##_type_var1##_type_var2##_concept + +#define _GLIBCXX_CLASS_REQUIRES3(_type_var1, _type_var2, _type_var3, _ns, _concept) \ + typedef void (_ns::_concept <_type_var1,_type_var2,_type_var3>::* _func##_type_var1##_type_var2##_type_var3##_concept)(); \ + template <_func##_type_var1##_type_var2##_type_var3##_concept _Tp1> \ + struct _concept_checking##_type_var1##_type_var2##_type_var3##_concept { }; \ + typedef _concept_checking##_type_var1##_type_var2##_type_var3##_concept< \ + &_ns::_concept <_type_var1,_type_var2,_type_var3>::__constraints> \ + _concept_checking_typedef##_type_var1##_type_var2##_type_var3##_concept + +#define _GLIBCXX_CLASS_REQUIRES4(_type_var1, _type_var2, _type_var3, _type_var4, _ns, _concept) \ + typedef void (_ns::_concept <_type_var1,_type_var2,_type_var3,_type_var4>::* _func##_type_var1##_type_var2##_type_var3##_type_var4##_concept)(); \ + template <_func##_type_var1##_type_var2##_type_var3##_type_var4##_concept _Tp1> \ + struct _concept_checking##_type_var1##_type_var2##_type_var3##_type_var4##_concept { }; \ + typedef _concept_checking##_type_var1##_type_var2##_type_var3##_type_var4##_concept< \ + &_ns::_concept <_type_var1,_type_var2,_type_var3,_type_var4>::__constraints> \ + _concept_checking_typedef##_type_var1##_type_var2##_type_var3##_type_var4##_concept + + +template +struct _Aux_require_same { }; + +template +struct _Aux_require_same<_Tp,_Tp> { typedef _Tp _Type; }; + + template + struct _SameTypeConcept + { + void __constraints() { + typedef typename _Aux_require_same<_Tp1, _Tp2>::_Type _Required; + } + }; + + template + struct _IntegerConcept { + void __constraints() { + __error_type_must_be_an_integer_type(); + } + }; + template <> struct _IntegerConcept { void __constraints() {} }; + template <> struct _IntegerConcept { void __constraints(){} }; + template <> struct _IntegerConcept { void __constraints() {} }; + template <> struct _IntegerConcept { void __constraints() {} }; + template <> struct _IntegerConcept { void __constraints() {} }; + template <> struct _IntegerConcept { void __constraints() {} }; + template <> struct _IntegerConcept { void __constraints() {} }; + template <> struct _IntegerConcept + { void __constraints() {} }; + + template + struct _SignedIntegerConcept { + void __constraints() { + __error_type_must_be_a_signed_integer_type(); + } + }; + template <> struct _SignedIntegerConcept { void __constraints() {} }; + template <> struct _SignedIntegerConcept { void __constraints() {} }; + template <> struct _SignedIntegerConcept { void __constraints() {} }; + template <> struct _SignedIntegerConcept { void __constraints(){}}; + + template + struct _UnsignedIntegerConcept { + void __constraints() { + __error_type_must_be_an_unsigned_integer_type(); + } + }; + template <> struct _UnsignedIntegerConcept + { void __constraints() {} }; + template <> struct _UnsignedIntegerConcept + { void __constraints() {} }; + template <> struct _UnsignedIntegerConcept + { void __constraints() {} }; + template <> struct _UnsignedIntegerConcept + { void __constraints() {} }; + + //=========================================================================== + // Basic Concepts + + template + struct _DefaultConstructibleConcept + { + void __constraints() { + _Tp __a _IsUnused; // require default constructor + } + }; + + template + struct _AssignableConcept + { + void __constraints() { + __a = __a; // require assignment operator + __const_constraints(__a); + } + void __const_constraints(const _Tp& __b) { + __a = __b; // const required for argument to assignment + } + _Tp __a; + // possibly should be "Tp* a;" and then dereference "a" in constraint + // functions? present way would require a default ctor, i think... + }; + + template + struct _CopyConstructibleConcept + { + void __constraints() { + _Tp __a(__b); // require copy constructor + _Tp* __ptr _IsUnused = &__a; // require address of operator + __const_constraints(__a); + } + void __const_constraints(const _Tp& __a) { + _Tp __c _IsUnused(__a); // require const copy constructor + const _Tp* __ptr _IsUnused = &__a; // require const address of operator + } + _Tp __b; + }; + + // The SGI STL version of Assignable requires copy constructor and operator= + template + struct _SGIAssignableConcept + { + void __constraints() { + _Tp __b _IsUnused(__a); + __a = __a; // require assignment operator + __const_constraints(__a); + } + void __const_constraints(const _Tp& __b) { + _Tp __c _IsUnused(__b); + __a = __b; // const required for argument to assignment + } + _Tp __a; + }; + + template + struct _ConvertibleConcept + { + void __constraints() { + _To __y _IsUnused = __x; + } + _From __x; + }; + + // The C++ standard requirements for many concepts talk about return + // types that must be "convertible to bool". The problem with this + // requirement is that it leaves the door open for evil proxies that + // define things like operator|| with strange return types. Two + // possible solutions are: + // 1) require the return type to be exactly bool + // 2) stay with convertible to bool, and also + // specify stuff about all the logical operators. + // For now we just test for convertible to bool. + template + void __aux_require_boolean_expr(const _Tp& __t) { + bool __x _IsUnused = __t; + } + +// FIXME + template + struct _EqualityComparableConcept + { + void __constraints() { + __aux_require_boolean_expr(__a == __b); + } + _Tp __a, __b; + }; + + template + struct _LessThanComparableConcept + { + void __constraints() { + __aux_require_boolean_expr(__a < __b); + } + _Tp __a, __b; + }; + + // This is equivalent to SGI STL's LessThanComparable. + template + struct _ComparableConcept + { + void __constraints() { + __aux_require_boolean_expr(__a < __b); + __aux_require_boolean_expr(__a > __b); + __aux_require_boolean_expr(__a <= __b); + __aux_require_boolean_expr(__a >= __b); + } + _Tp __a, __b; + }; + +#define _GLIBCXX_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT(_OP,_NAME) \ + template \ + struct _NAME { \ + void __constraints() { (void)__constraints_(); } \ + bool __constraints_() { \ + return __a _OP __b; \ + } \ + _First __a; \ + _Second __b; \ + } + +#define _GLIBCXX_DEFINE_BINARY_OPERATOR_CONSTRAINT(_OP,_NAME) \ + template \ + struct _NAME { \ + void __constraints() { (void)__constraints_(); } \ + _Ret __constraints_() { \ + return __a _OP __b; \ + } \ + _First __a; \ + _Second __b; \ + } + + _GLIBCXX_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT(==, _EqualOpConcept); + _GLIBCXX_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT(!=, _NotEqualOpConcept); + _GLIBCXX_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT(<, _LessThanOpConcept); + _GLIBCXX_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT(<=, _LessEqualOpConcept); + _GLIBCXX_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT(>, _GreaterThanOpConcept); + _GLIBCXX_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT(>=, _GreaterEqualOpConcept); + + _GLIBCXX_DEFINE_BINARY_OPERATOR_CONSTRAINT(+, _PlusOpConcept); + _GLIBCXX_DEFINE_BINARY_OPERATOR_CONSTRAINT(*, _TimesOpConcept); + _GLIBCXX_DEFINE_BINARY_OPERATOR_CONSTRAINT(/, _DivideOpConcept); + _GLIBCXX_DEFINE_BINARY_OPERATOR_CONSTRAINT(-, _SubtractOpConcept); + _GLIBCXX_DEFINE_BINARY_OPERATOR_CONSTRAINT(%, _ModOpConcept); + +#undef _GLIBCXX_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT +#undef _GLIBCXX_DEFINE_BINARY_OPERATOR_CONSTRAINT + + //=========================================================================== + // Function Object Concepts + + template + struct _GeneratorConcept + { + void __constraints() { + const _Return& __r _IsUnused = __f();// require operator() member function + } + _Func __f; + }; + + + template + struct _GeneratorConcept<_Func,void> + { + void __constraints() { + __f(); // require operator() member function + } + _Func __f; + }; + + template + struct _UnaryFunctionConcept + { + void __constraints() { + __r = __f(__arg); // require operator() + } + _Func __f; + _Arg __arg; + _Return __r; + }; + + template + struct _UnaryFunctionConcept<_Func, void, _Arg> { + void __constraints() { + __f(__arg); // require operator() + } + _Func __f; + _Arg __arg; + }; + + template + struct _BinaryFunctionConcept + { + void __constraints() { + __r = __f(__first, __second); // require operator() + } + _Func __f; + _First __first; + _Second __second; + _Return __r; + }; + + template + struct _BinaryFunctionConcept<_Func, void, _First, _Second> + { + void __constraints() { + __f(__first, __second); // require operator() + } + _Func __f; + _First __first; + _Second __second; + }; + + template + struct _UnaryPredicateConcept + { + void __constraints() { + __aux_require_boolean_expr(__f(__arg)); // require op() returning bool + } + _Func __f; + _Arg __arg; + }; + + template + struct _BinaryPredicateConcept + { + void __constraints() { + __aux_require_boolean_expr(__f(__a, __b)); // require op() returning bool + } + _Func __f; + _First __a; + _Second __b; + }; + + // use this when functor is used inside a container class like std::set + template + struct _Const_BinaryPredicateConcept { + void __constraints() { + __const_constraints(__f); + } + void __const_constraints(const _Func& __fun) { + __function_requires<_BinaryPredicateConcept<_Func, _First, _Second> >(); + // operator() must be a const member function + __aux_require_boolean_expr(__fun(__a, __b)); + } + _Func __f; + _First __a; + _Second __b; + }; + + //=========================================================================== + // Iterator Concepts + + template + struct _TrivialIteratorConcept + { + void __constraints() { +// __function_requires< _DefaultConstructibleConcept<_Tp> >(); + __function_requires< _AssignableConcept<_Tp> >(); + __function_requires< _EqualityComparableConcept<_Tp> >(); +// typedef typename std::iterator_traits<_Tp>::value_type _V; + (void)*__i; // require dereference operator + } + _Tp __i; + }; + + template + struct _Mutable_TrivialIteratorConcept + { + void __constraints() { + __function_requires< _TrivialIteratorConcept<_Tp> >(); + *__i = *__j; // require dereference and assignment + } + _Tp __i, __j; + }; + + template + struct _InputIteratorConcept + { + void __constraints() { + __function_requires< _TrivialIteratorConcept<_Tp> >(); + // require iterator_traits typedef's + typedef typename std::iterator_traits<_Tp>::difference_type _Diff; +// __function_requires< _SignedIntegerConcept<_Diff> >(); + typedef typename std::iterator_traits<_Tp>::reference _Ref; + typedef typename std::iterator_traits<_Tp>::pointer _Pt; + typedef typename std::iterator_traits<_Tp>::iterator_category _Cat; + __function_requires< _ConvertibleConcept< + typename std::iterator_traits<_Tp>::iterator_category, + std::input_iterator_tag> >(); + ++__i; // require preincrement operator + __i++; // require postincrement operator + } + _Tp __i; + }; + + template + struct _OutputIteratorConcept + { + void __constraints() { + __function_requires< _AssignableConcept<_Tp> >(); + ++__i; // require preincrement operator + __i++; // require postincrement operator + *__i++ = __t; // require postincrement and assignment + } + _Tp __i; + _ValueT __t; + }; + + template + struct _ForwardIteratorConcept + { + void __constraints() { + __function_requires< _InputIteratorConcept<_Tp> >(); + __function_requires< _DefaultConstructibleConcept<_Tp> >(); + __function_requires< _ConvertibleConcept< + typename std::iterator_traits<_Tp>::iterator_category, + std::forward_iterator_tag> >(); + typedef typename std::iterator_traits<_Tp>::reference _Ref; + _Ref __r _IsUnused = *__i; + } + _Tp __i; + }; + + template + struct _Mutable_ForwardIteratorConcept + { + void __constraints() { + __function_requires< _ForwardIteratorConcept<_Tp> >(); + *__i++ = *__i; // require postincrement and assignment + } + _Tp __i; + }; + + template + struct _BidirectionalIteratorConcept + { + void __constraints() { + __function_requires< _ForwardIteratorConcept<_Tp> >(); + __function_requires< _ConvertibleConcept< + typename std::iterator_traits<_Tp>::iterator_category, + std::bidirectional_iterator_tag> >(); + --__i; // require predecrement operator + __i--; // require postdecrement operator + } + _Tp __i; + }; + + template + struct _Mutable_BidirectionalIteratorConcept + { + void __constraints() { + __function_requires< _BidirectionalIteratorConcept<_Tp> >(); + __function_requires< _Mutable_ForwardIteratorConcept<_Tp> >(); + *__i-- = *__i; // require postdecrement and assignment + } + _Tp __i; + }; + + + template + struct _RandomAccessIteratorConcept + { + void __constraints() { + __function_requires< _BidirectionalIteratorConcept<_Tp> >(); + __function_requires< _ComparableConcept<_Tp> >(); + __function_requires< _ConvertibleConcept< + typename std::iterator_traits<_Tp>::iterator_category, + std::random_access_iterator_tag> >(); + // ??? We don't use _Ref, are we just checking for "referenceability"? + typedef typename std::iterator_traits<_Tp>::reference _Ref; + + __i += __n; // require assignment addition operator + __i = __i + __n; __i = __n + __i; // require addition with difference type + __i -= __n; // require assignment subtraction op + __i = __i - __n; // require subtraction with + // difference type + __n = __i - __j; // require difference operator + (void)__i[__n]; // require element access operator + } + _Tp __a, __b; + _Tp __i, __j; + typename std::iterator_traits<_Tp>::difference_type __n; + }; + + template + struct _Mutable_RandomAccessIteratorConcept + { + void __constraints() { + __function_requires< _RandomAccessIteratorConcept<_Tp> >(); + __function_requires< _Mutable_BidirectionalIteratorConcept<_Tp> >(); + __i[__n] = *__i; // require element access and assignment + } + _Tp __i; + typename std::iterator_traits<_Tp>::difference_type __n; + }; + + //=========================================================================== + // Container Concepts + + template + struct _ContainerConcept + { + typedef typename _Container::value_type _Value_type; + typedef typename _Container::difference_type _Difference_type; + typedef typename _Container::size_type _Size_type; + typedef typename _Container::const_reference _Const_reference; + typedef typename _Container::const_pointer _Const_pointer; + typedef typename _Container::const_iterator _Const_iterator; + + void __constraints() { + __function_requires< _InputIteratorConcept<_Const_iterator> >(); + __function_requires< _AssignableConcept<_Container> >(); + const _Container __c; + __i = __c.begin(); + __i = __c.end(); + __n = __c.size(); + __n = __c.max_size(); + __b = __c.empty(); + } + bool __b; + _Const_iterator __i; + _Size_type __n; + }; + + template + struct _Mutable_ContainerConcept + { + typedef typename _Container::value_type _Value_type; + typedef typename _Container::reference _Reference; + typedef typename _Container::iterator _Iterator; + typedef typename _Container::pointer _Pointer; + + void __constraints() { + __function_requires< _ContainerConcept<_Container> >(); + __function_requires< _AssignableConcept<_Value_type> >(); + __function_requires< _InputIteratorConcept<_Iterator> >(); + + __i = __c.begin(); + __i = __c.end(); + __c.swap(__c2); + } + _Iterator __i; + _Container __c, __c2; + }; + + template + struct _ForwardContainerConcept + { + void __constraints() { + __function_requires< _ContainerConcept<_ForwardContainer> >(); + typedef typename _ForwardContainer::const_iterator _Const_iterator; + __function_requires< _ForwardIteratorConcept<_Const_iterator> >(); + } + }; + + template + struct _Mutable_ForwardContainerConcept + { + void __constraints() { + __function_requires< _ForwardContainerConcept<_ForwardContainer> >(); + __function_requires< _Mutable_ContainerConcept<_ForwardContainer> >(); + typedef typename _ForwardContainer::iterator _Iterator; + __function_requires< _Mutable_ForwardIteratorConcept<_Iterator> >(); + } + }; + + template + struct _ReversibleContainerConcept + { + typedef typename _ReversibleContainer::const_iterator _Const_iterator; + typedef typename _ReversibleContainer::const_reverse_iterator + _Const_reverse_iterator; + + void __constraints() { + __function_requires< _ForwardContainerConcept<_ReversibleContainer> >(); + __function_requires< _BidirectionalIteratorConcept<_Const_iterator> >(); + __function_requires< + _BidirectionalIteratorConcept<_Const_reverse_iterator> >(); + + const _ReversibleContainer __c; + _Const_reverse_iterator __i = __c.rbegin(); + __i = __c.rend(); + } + }; + + template + struct _Mutable_ReversibleContainerConcept + { + typedef typename _ReversibleContainer::iterator _Iterator; + typedef typename _ReversibleContainer::reverse_iterator _Reverse_iterator; + + void __constraints() { + __function_requires<_ReversibleContainerConcept<_ReversibleContainer> >(); + __function_requires< + _Mutable_ForwardContainerConcept<_ReversibleContainer> >(); + __function_requires<_Mutable_BidirectionalIteratorConcept<_Iterator> >(); + __function_requires< + _Mutable_BidirectionalIteratorConcept<_Reverse_iterator> >(); + + _Reverse_iterator __i = __c.rbegin(); + __i = __c.rend(); + } + _ReversibleContainer __c; + }; + + template + struct _RandomAccessContainerConcept + { + typedef typename _RandomAccessContainer::size_type _Size_type; + typedef typename _RandomAccessContainer::const_reference _Const_reference; + typedef typename _RandomAccessContainer::const_iterator _Const_iterator; + typedef typename _RandomAccessContainer::const_reverse_iterator + _Const_reverse_iterator; + + void __constraints() { + __function_requires< + _ReversibleContainerConcept<_RandomAccessContainer> >(); + __function_requires< _RandomAccessIteratorConcept<_Const_iterator> >(); + __function_requires< + _RandomAccessIteratorConcept<_Const_reverse_iterator> >(); + + const _RandomAccessContainer __c; + _Const_reference __r _IsUnused = __c[__n]; + } + _Size_type __n; + }; + + template + struct _Mutable_RandomAccessContainerConcept + { + typedef typename _RandomAccessContainer::size_type _Size_type; + typedef typename _RandomAccessContainer::reference _Reference; + typedef typename _RandomAccessContainer::iterator _Iterator; + typedef typename _RandomAccessContainer::reverse_iterator _Reverse_iterator; + + void __constraints() { + __function_requires< + _RandomAccessContainerConcept<_RandomAccessContainer> >(); + __function_requires< + _Mutable_ReversibleContainerConcept<_RandomAccessContainer> >(); + __function_requires< _Mutable_RandomAccessIteratorConcept<_Iterator> >(); + __function_requires< + _Mutable_RandomAccessIteratorConcept<_Reverse_iterator> >(); + + _Reference __r _IsUnused = __c[__i]; + } + _Size_type __i; + _RandomAccessContainer __c; + }; + + // A Sequence is inherently mutable + template + struct _SequenceConcept + { + typedef typename _Sequence::reference _Reference; + typedef typename _Sequence::const_reference _Const_reference; + + void __constraints() { + // Matt Austern's book puts DefaultConstructible here, the C++ + // standard places it in Container + // function_requires< DefaultConstructible >(); + __function_requires< _Mutable_ForwardContainerConcept<_Sequence> >(); + __function_requires< _DefaultConstructibleConcept<_Sequence> >(); + + _Sequence + __c _IsUnused(__n, __t), + __c2 _IsUnused(__first, __last); + + __c.insert(__p, __t); + __c.insert(__p, __n, __t); + __c.insert(__p, __first, __last); + + __c.erase(__p); + __c.erase(__p, __q); + + _Reference __r _IsUnused = __c.front(); + + __const_constraints(__c); + } + void __const_constraints(const _Sequence& __c) { + _Const_reference __r _IsUnused = __c.front(); + } + typename _Sequence::value_type __t; + typename _Sequence::size_type __n; + typename _Sequence::value_type *__first, *__last; + typename _Sequence::iterator __p, __q; + }; + + template + struct _FrontInsertionSequenceConcept + { + void __constraints() { + __function_requires< _SequenceConcept<_FrontInsertionSequence> >(); + + __c.push_front(__t); + __c.pop_front(); + } + _FrontInsertionSequence __c; + typename _FrontInsertionSequence::value_type __t; + }; + + template + struct _BackInsertionSequenceConcept + { + typedef typename _BackInsertionSequence::reference _Reference; + typedef typename _BackInsertionSequence::const_reference _Const_reference; + + void __constraints() { + __function_requires< _SequenceConcept<_BackInsertionSequence> >(); + + __c.push_back(__t); + __c.pop_back(); + _Reference __r _IsUnused = __c.back(); + } + void __const_constraints(const _BackInsertionSequence& __c) { + _Const_reference __r _IsUnused = __c.back(); + }; + _BackInsertionSequence __c; + typename _BackInsertionSequence::value_type __t; + }; + + template + struct _AssociativeContainerConcept + { + void __constraints() { + __function_requires< _ForwardContainerConcept<_AssociativeContainer> >(); + __function_requires< + _DefaultConstructibleConcept<_AssociativeContainer> >(); + + __i = __c.find(__k); + __r = __c.equal_range(__k); + __c.erase(__k); + __c.erase(__i); + __c.erase(__r.first, __r.second); + __const_constraints(__c); + } + void __const_constraints(const _AssociativeContainer& __c) { + __ci = __c.find(__k); + __n = __c.count(__k); + __cr = __c.equal_range(__k); + } + typedef typename _AssociativeContainer::iterator _Iterator; + typedef typename _AssociativeContainer::const_iterator _Const_iterator; + + _AssociativeContainer __c; + _Iterator __i; + std::pair<_Iterator,_Iterator> __r; + _Const_iterator __ci; + std::pair<_Const_iterator,_Const_iterator> __cr; + typename _AssociativeContainer::key_type __k; + typename _AssociativeContainer::size_type __n; + }; + + template + struct _UniqueAssociativeContainerConcept + { + void __constraints() { + __function_requires< + _AssociativeContainerConcept<_UniqueAssociativeContainer> >(); + + _UniqueAssociativeContainer __c(__first, __last); + + __pos_flag = __c.insert(__t); + __c.insert(__first, __last); + } + std::pair __pos_flag; + typename _UniqueAssociativeContainer::value_type __t; + typename _UniqueAssociativeContainer::value_type *__first, *__last; + }; + + template + struct _MultipleAssociativeContainerConcept + { + void __constraints() { + __function_requires< + _AssociativeContainerConcept<_MultipleAssociativeContainer> >(); + + _MultipleAssociativeContainer __c(__first, __last); + + __pos = __c.insert(__t); + __c.insert(__first, __last); + + } + typename _MultipleAssociativeContainer::iterator __pos; + typename _MultipleAssociativeContainer::value_type __t; + typename _MultipleAssociativeContainer::value_type *__first, *__last; + }; + + template + struct _SimpleAssociativeContainerConcept + { + void __constraints() { + __function_requires< + _AssociativeContainerConcept<_SimpleAssociativeContainer> >(); + typedef typename _SimpleAssociativeContainer::key_type _Key_type; + typedef typename _SimpleAssociativeContainer::value_type _Value_type; + typedef typename _Aux_require_same<_Key_type, _Value_type>::_Type + _Required; + } + }; + + template + struct _PairAssociativeContainerConcept + { + void __constraints() { + __function_requires< + _AssociativeContainerConcept<_SimpleAssociativeContainer> >(); + typedef typename _SimpleAssociativeContainer::key_type _Key_type; + typedef typename _SimpleAssociativeContainer::value_type _Value_type; + typedef typename _SimpleAssociativeContainer::mapped_type _Mapped_type; + typedef std::pair _Required_value_type; + typedef typename _Aux_require_same<_Value_type, + _Required_value_type>::_Type _Required; + } + }; + + template + struct _SortedAssociativeContainerConcept + { + void __constraints() { + __function_requires< + _AssociativeContainerConcept<_SortedAssociativeContainer> >(); + __function_requires< + _ReversibleContainerConcept<_SortedAssociativeContainer> >(); + + _SortedAssociativeContainer + __c _IsUnused(__kc), + __c2 _IsUnused(__first, __last), + __c3 _IsUnused(__first, __last, __kc); + + __p = __c.upper_bound(__k); + __p = __c.lower_bound(__k); + __r = __c.equal_range(__k); + + __c.insert(__p, __t); + } + void __const_constraints(const _SortedAssociativeContainer& __c) { + __kc = __c.key_comp(); + __vc = __c.value_comp(); + + __cp = __c.upper_bound(__k); + __cp = __c.lower_bound(__k); + __cr = __c.equal_range(__k); + } + typename _SortedAssociativeContainer::key_compare __kc; + typename _SortedAssociativeContainer::value_compare __vc; + typename _SortedAssociativeContainer::value_type __t; + typename _SortedAssociativeContainer::key_type __k; + typedef typename _SortedAssociativeContainer::iterator _Iterator; + typedef typename _SortedAssociativeContainer::const_iterator + _Const_iterator; + + _Iterator __p; + _Const_iterator __cp; + std::pair<_Iterator,_Iterator> __r; + std::pair<_Const_iterator,_Const_iterator> __cr; + typename _SortedAssociativeContainer::value_type *__first, *__last; + }; + + // HashedAssociativeContainer + +} // namespace std + +#undef _IsUnused + +#endif // _GLIBCXX_BOOST_CONCEPT_CHECK + + diff --git a/cpp_src/cassert b/cpp_src/cassert new file mode 100644 index 0000000..0e5c77a --- /dev/null +++ b/cpp_src/cassert @@ -0,0 +1,49 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file cassert + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c assert.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: 19.2 Assertions +// + +// No include guards on this header... + +#pragma GCC system_header + +#include diff --git a/cpp_src/cctype b/cpp_src/cctype new file mode 100644 index 0000000..11c98bb --- /dev/null +++ b/cpp_src/cctype @@ -0,0 +1,86 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file include/cctype + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c ctype.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: +// + +#ifndef _GLIBCXX_CCTYPE +#define _GLIBCXX_CCTYPE 1 + +#pragma GCC system_header + +#include +#include + +// Get rid of those macros defined in in lieu of real functions. +#undef isalnum +#undef isalpha +#undef iscntrl +#undef isdigit +#undef isgraph +#undef islower +#undef isprint +#undef ispunct +#undef isspace +#undef isupper +#undef isxdigit +#undef tolower +#undef toupper + +namespace std { + + using ::isalnum; + using ::isalpha; + using ::iscntrl; + using ::isdigit; + using ::isgraph; + using ::islower; + using ::isprint; + using ::ispunct; + using ::isspace; + using ::isupper; + using ::isxdigit; + using ::tolower; + using ::toupper; + +} // namespace std + +#endif diff --git a/cpp_src/cerrno b/cpp_src/cerrno new file mode 100644 index 0000000..e597b8f --- /dev/null +++ b/cpp_src/cerrno @@ -0,0 +1,57 @@ +// The -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file cerrno + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c errno.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: 19.3 Error numbers +// + +#ifndef _GLIBCXX_CERRNO +#define _GLIBCXX_CERRNO 1 + +#pragma GCC system_header + +#include + +// Adhere to section 17.4.1.2 clause 5 of ISO 14882:1998 +#ifndef errno +#define errno errno +#endif + +#endif diff --git a/cpp_src/cfloat b/cpp_src/cfloat new file mode 100644 index 0000000..2b51449 --- /dev/null +++ b/cpp_src/cfloat @@ -0,0 +1,52 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file include/cfloat + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c float.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: 18.2.2 Implementation properties: C library +// + +#ifndef _GLIBCXX_CFLOAT +#define _GLIBCXX_CFLOAT 1 + +#pragma GCC system_header + +#include + +#endif diff --git a/cpp_src/char_traits.h b/cpp_src/char_traits.h new file mode 100644 index 0000000..3632578 --- /dev/null +++ b/cpp_src/char_traits.h @@ -0,0 +1,367 @@ +// Character Traits for use by standard string and iostream -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file char_traits.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 21 Strings library +// + +#ifndef _CHAR_TRAITS_H +#define _CHAR_TRAITS_H 1 + +#pragma GCC system_header + +#include // For memmove, memset, memchr +#include // For copy, lexicographical_compare, fill_n +#include // For streampos + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + + /** + * @brief Mapping from character type to associated types. + * + * @note This is an implementation class for the generic version + * of char_traits. It defines int_type, off_type, pos_type, and + * state_type. By default these are unsigned long, streamoff, + * streampos, and mbstate_t. Users who need a different set of + * types, but who don't need to change the definitions of any function + * defined in char_traits, can specialize __gnu_cxx::_Char_types + * while leaving __gnu_cxx::char_traits alone. */ + template + struct _Char_types + { + typedef unsigned long int_type; + typedef std::streampos pos_type; + typedef std::streamoff off_type; + typedef std::mbstate_t state_type; + }; + + + /** + * @brief Base class used to implement std::char_traits. + * + * @note For any given actual character type, this definition is + * probably wrong. (Most of the member functions are likely to be + * right, but the int_type and state_type typedefs, and the eof() + * member function, are likely to be wrong.) The reason this class + * exists is so users can specialize it. Classes in namespace std + * may not be specialized for fundamentl types, but classes in + * namespace __gnu_cxx may be. + * + * See http://gcc.gnu.org/onlinedocs/libstdc++/21_strings/howto.html#5 + * for advice on how to make use of this class for "unusual" character + * types. Also, check out include/ext/pod_char_traits.h. + */ + template + struct char_traits + { + typedef _CharT char_type; + typedef typename _Char_types<_CharT>::int_type int_type; + typedef typename _Char_types<_CharT>::pos_type pos_type; + typedef typename _Char_types<_CharT>::off_type off_type; + typedef typename _Char_types<_CharT>::state_type state_type; + + static void + assign(char_type& __c1, const char_type& __c2) + { __c1 = __c2; } + + static bool + eq(const char_type& __c1, const char_type& __c2) + { return __c1 == __c2; } + + static bool + lt(const char_type& __c1, const char_type& __c2) + { return __c1 < __c2; } + + static int + compare(const char_type* __s1, const char_type* __s2, std::size_t __n); + + static std::size_t + length(const char_type* __s); + + static const char_type* + find(const char_type* __s, std::size_t __n, const char_type& __a); + + static char_type* + move(char_type* __s1, const char_type* __s2, std::size_t __n); + + static char_type* + copy(char_type* __s1, const char_type* __s2, std::size_t __n); + + static char_type* + assign(char_type* __s, std::size_t __n, char_type __a); + + static char_type + to_char_type(const int_type& __c) + { return static_cast(__c); } + + static int_type + to_int_type(const char_type& __c) + { return static_cast(__c); } + + static bool + eq_int_type(const int_type& __c1, const int_type& __c2) + { return __c1 == __c2; } + + static int_type + eof() + { return static_cast(EOF); } + + static int_type + not_eof(const int_type& __c) + { return !eq_int_type(__c, eof()) ? __c : to_int_type(char_type()); } + }; + + template + int + char_traits<_CharT>:: + compare(const char_type* __s1, const char_type* __s2, std::size_t __n) + { + for (std::size_t __i = 0; __i < __n; ++__i) + if (lt(__s1[__i], __s2[__i])) + return -1; + else if (lt(__s2[__i], __s1[__i])) + return 1; + return 0; + } + + template + std::size_t + char_traits<_CharT>:: + length(const char_type* __p) + { + std::size_t __i = 0; + while (!eq(__p[__i], char_type())) + ++__i; + return __i; + } + + template + const typename char_traits<_CharT>::char_type* + char_traits<_CharT>:: + find(const char_type* __s, std::size_t __n, const char_type& __a) + { + for (std::size_t __i = 0; __i < __n; ++__i) + if (eq(__s[__i], __a)) + return __s + __i; + return 0; + } + + template + typename char_traits<_CharT>::char_type* + char_traits<_CharT>:: + move(char_type* __s1, const char_type* __s2, std::size_t __n) + { + return static_cast<_CharT*>(std::memmove(__s1, __s2, + __n * sizeof(char_type))); + } + + template + typename char_traits<_CharT>::char_type* + char_traits<_CharT>:: + copy(char_type* __s1, const char_type* __s2, std::size_t __n) + { + std::copy(__s2, __s2 + __n, __s1); + return __s1; + } + + template + typename char_traits<_CharT>::char_type* + char_traits<_CharT>:: + assign(char_type* __s, std::size_t __n, char_type __a) + { + std::fill_n(__s, __n, __a); + return __s; + } + +} // namespace std + +namespace std { + + // 21.1 + /** + * @brief Basis for explicit traits specializations. + * + * @note For any given actual character type, this definition is + * probably wrong. Since this is just a thin wrapper around + * __gnu_cxx::char_traits, it is possible to achieve a more + * appropriate definition by specializing __gnu_cxx::char_traits. + * + * See http://gcc.gnu.org/onlinedocs/libstdc++/21_strings/howto.html#5 + * for advice on how to make use of this class for "unusual" character + * types. Also, check out include/ext/pod_char_traits.h. + */ + template + struct char_traits : public __gnu_cxx::char_traits<_CharT> + { }; + + + /// @brief 21.1.3.1 char_traits specializations + template<> + struct char_traits + { + typedef char char_type; + typedef int int_type; + typedef streampos pos_type; + typedef streamoff off_type; + typedef mbstate_t state_type; + + static void + assign(char_type& __c1, const char_type& __c2) + { __c1 = __c2; } + + static bool + eq(const char_type& __c1, const char_type& __c2) + { return __c1 == __c2; } + + static bool + lt(const char_type& __c1, const char_type& __c2) + { return __c1 < __c2; } + + static int + compare(const char_type* __s1, const char_type* __s2, size_t __n) + { return memcmp(__s1, __s2, __n); } + + static size_t + length(const char_type* __s) + { return strlen(__s); } + + static const char_type* + find(const char_type* __s, size_t __n, const char_type& __a) + { return static_cast(memchr(__s, __a, __n)); } + + static char_type* + move(char_type* __s1, const char_type* __s2, size_t __n) + { return static_cast(memmove(__s1, __s2, __n)); } + + static char_type* + copy(char_type* __s1, const char_type* __s2, size_t __n) + { return static_cast(memcpy(__s1, __s2, __n)); } + + static char_type* + assign(char_type* __s, size_t __n, char_type __a) + { return static_cast(memset(__s, __a, __n)); } + + static char_type + to_char_type(const int_type& __c) + { return static_cast(__c); } + + // To keep both the byte 0xff and the eof symbol 0xffffffff + // from ending up as 0xffffffff. + static int_type + to_int_type(const char_type& __c) + { return static_cast(static_cast(__c)); } + + static bool + eq_int_type(const int_type& __c1, const int_type& __c2) + { return __c1 == __c2; } + + static int_type + eof() { return static_cast(EOF); } + + static int_type + not_eof(const int_type& __c) + { return (__c == eof()) ? 0 : __c; } + }; + + +#ifdef _GLIBCXX_USE_WCHAR_T + /// @brief 21.1.3.2 char_traits specializations + template<> + struct char_traits + { + typedef wchar_t char_type; + typedef wint_t int_type; + typedef streamoff off_type; + typedef wstreampos pos_type; + typedef mbstate_t state_type; + + static void + assign(char_type& __c1, const char_type& __c2) + { __c1 = __c2; } + + static bool + eq(const char_type& __c1, const char_type& __c2) + { return __c1 == __c2; } + + static bool + lt(const char_type& __c1, const char_type& __c2) + { return __c1 < __c2; } + + static int + compare(const char_type* __s1, const char_type* __s2, size_t __n) + { return wmemcmp(__s1, __s2, __n); } + + static size_t + length(const char_type* __s) + { return wcslen(__s); } + + static const char_type* + find(const char_type* __s, size_t __n, const char_type& __a) + { return wmemchr(__s, __a, __n); } + + static char_type* + move(char_type* __s1, const char_type* __s2, size_t __n) + { return wmemmove(__s1, __s2, __n); } + + static char_type* + copy(char_type* __s1, const char_type* __s2, size_t __n) + { return wmemcpy(__s1, __s2, __n); } + + static char_type* + assign(char_type* __s, size_t __n, char_type __a) + { return wmemset(__s, __a, __n); } + + static char_type + to_char_type(const int_type& __c) { return char_type(__c); } + + static int_type + to_int_type(const char_type& __c) { return int_type(__c); } + + static bool + eq_int_type(const int_type& __c1, const int_type& __c2) + { return __c1 == __c2; } + + static int_type + eof() { return static_cast(WEOF); } + + static int_type + not_eof(const int_type& __c) + { return eq_int_type(__c, eof()) ? 0 : __c; } + }; +#endif //_GLIBCXX_USE_WCHAR_T + +} // namespace std + +#endif diff --git a/cpp_src/climits b/cpp_src/climits new file mode 100644 index 0000000..e85869f --- /dev/null +++ b/cpp_src/climits @@ -0,0 +1,52 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file include/climits + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c limits.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: 18.2.2 Implementation properties: C library +// + +#ifndef _GLIBCXX_CLIMITS +#define _GLIBCXX_CLIMITS 1 + +#pragma GCC system_header + +#include + +#endif diff --git a/cpp_src/clocale b/cpp_src/clocale new file mode 100644 index 0000000..fb657fe --- /dev/null +++ b/cpp_src/clocale @@ -0,0 +1,65 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file clocale + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c locale.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: 18.2.2 Implementation properties: C library +// + +#ifndef _GLIBCXX_CLOCALE +#define _GLIBCXX_CLOCALE 1 + +#pragma GCC system_header + +#include +#include + +// Get rid of those macros defined in in lieu of real functions. +#undef setlocale +#undef localeconv + +namespace std { + + using ::lconv; + using ::setlocale; + using ::localeconv; + +} // namespace std + +#endif diff --git a/cpp_src/cmath b/cpp_src/cmath new file mode 100644 index 0000000..7c4a403 --- /dev/null +++ b/cpp_src/cmath @@ -0,0 +1,600 @@ +// -*- C++ -*- C forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file include/cmath + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c math.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: 26.5 C library +// + +#ifndef _GLIBCXX_CMATH +#define _GLIBCXX_CMATH 1 + +#pragma GCC system_header + +#include +#include +#include + +#include + +// Get rid of those macros defined in in lieu of real functions. +#undef abs +#undef div +#undef acos +#undef asin +#undef atan +#undef atan2 +#undef ceil +#undef cos +#undef cosh +#undef exp +#undef fabs +#undef floor +#undef fmod +#undef frexp +#undef ldexp +#undef log +#undef log10 +#undef modf +#undef pow +#undef sin +#undef sinh +#undef sqrt +#undef tan +#undef tanh + +namespace std { + + // Forward declaration of a helper function. This really should be + // an `exported' forward declaration. + template _Tp __cmath_power(_Tp, unsigned int); + + inline double + abs(double __x) + { return __builtin_fabs(__x); } + + inline float + abs(float __x) + { return __builtin_fabsf(__x); } + + inline long double + abs(long double __x) + { return __builtin_fabsl(__x); } + + using ::acos; + + inline float + acos(float __x) + { return __builtin_acosf(__x); } + + inline long double + acos(long double __x) + { return __builtin_acosl(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + acos(_Tp __x) + { return __builtin_acos(__x); } + + using ::asin; + + inline float + asin(float __x) + { return __builtin_asinf(__x); } + + inline long double + asin(long double __x) + { return __builtin_asinl(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + asin(_Tp __x) + { return __builtin_asin(__x); } + + using ::atan; + + inline float + atan(float __x) + { return __builtin_atanf(__x); } + + inline long double + atan(long double __x) + { return __builtin_atanl(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + atan(_Tp __x) + { return __builtin_atan(__x); } + + using ::atan2; + + inline float + atan2(float __y, float __x) + { return __builtin_atan2f(__y, __x); } + + inline long double + atan2(long double __y, long double __x) + { return __builtin_atan2l(__y, __x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value + && __is_integer<_Up>::__value, + double>::__type + atan2(_Tp __y, _Up __x) + { return __builtin_atan2(__y, __x); } + + using ::ceil; + + inline float + ceil(float __x) + { return __builtin_ceilf(__x); } + + inline long double + ceil(long double __x) + { return __builtin_ceill(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + ceil(_Tp __x) + { return __builtin_ceil(__x); } + + using ::cos; + + inline float + cos(float __x) + { return __builtin_cosf(__x); } + + inline long double + cos(long double __x) + { return __builtin_cosl(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + cos(_Tp __x) + { return __builtin_cos(__x); } + + using ::cosh; + + inline float + cosh(float __x) + { return __builtin_coshf(__x); } + + inline long double + cosh(long double __x) + { return __builtin_coshl(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + cosh(_Tp __x) + { return __builtin_cosh(__x); } + + using ::exp; + + inline float + exp(float __x) + { return __builtin_expf(__x); } + + inline long double + exp(long double __x) + { return __builtin_expl(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + exp(_Tp __x) + { return __builtin_exp(__x); } + + using ::fabs; + + inline float + fabs(float __x) + { return __builtin_fabsf(__x); } + + inline long double + fabs(long double __x) + { return __builtin_fabsl(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + fabs(_Tp __x) + { return __builtin_fabs(__x); } + + using ::floor; + + inline float + floor(float __x) + { return __builtin_floorf(__x); } + + inline long double + floor(long double __x) + { return __builtin_floorl(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + floor(_Tp __x) + { return __builtin_floor(__x); } + + using ::fmod; + + inline float + fmod(float __x, float __y) + { return __builtin_fmodf(__x, __y); } + + inline long double + fmod(long double __x, long double __y) + { return __builtin_fmodl(__x, __y); } + + using ::frexp; + + inline float + frexp(float __x, int* __exp) + { return __builtin_frexpf(__x, __exp); } + + inline long double + frexp(long double __x, int* __exp) + { return __builtin_frexpl(__x, __exp); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + frexp(_Tp __x, int* __exp) + { return __builtin_frexp(__x, __exp); } + + using ::ldexp; + + inline float + ldexp(float __x, int __exp) + { return __builtin_ldexpf(__x, __exp); } + + inline long double + ldexp(long double __x, int __exp) + { return __builtin_ldexpl(__x, __exp); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + ldexp(_Tp __x, int __exp) + { return __builtin_ldexp(__x, __exp); } + + using ::log; + + inline float + log(float __x) + { return __builtin_logf(__x); } + + inline long double + log(long double __x) + { return __builtin_logl(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + log(_Tp __x) + { return __builtin_log(__x); } + + using ::log10; + + inline float + log10(float __x) + { return __builtin_log10f(__x); } + + inline long double + log10(long double __x) + { return __builtin_log10l(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + log10(_Tp __x) + { return __builtin_log10(__x); } + + using ::modf; + + inline float + modf(float __x, float* __iptr) + { return __builtin_modff(__x, __iptr); } + + inline long double + modf(long double __x, long double* __iptr) + { return __builtin_modfl(__x, __iptr); } + + template + inline _Tp + __pow_helper(_Tp __x, int __n) + { + return __n < 0 + ? _Tp(1)/__cmath_power(__x, -__n) + : __cmath_power(__x, __n); + } + + using ::pow; + + inline float + pow(float __x, float __y) + { return __builtin_powf(__x, __y); } + + inline long double + pow(long double __x, long double __y) + { return __builtin_powl(__x, __y); } + + inline double + pow(double __x, int __i) + { return __builtin_powi(__x, __i); } + + inline float + pow(float __x, int __n) + { return __builtin_powif(__x, __n); } + + inline long double + pow(long double __x, int __n) + { return __builtin_powil(__x, __n); } + + using ::sin; + + inline float + sin(float __x) + { return __builtin_sinf(__x); } + + inline long double + sin(long double __x) + { return __builtin_sinl(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + sin(_Tp __x) + { return __builtin_sin(__x); } + + using ::sinh; + + inline float + sinh(float __x) + { return __builtin_sinhf(__x); } + + inline long double + sinh(long double __x) + { return __builtin_sinhl(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + sinh(_Tp __x) + { return __builtin_sinh(__x); } + + using ::sqrt; + + inline float + sqrt(float __x) + { return __builtin_sqrtf(__x); } + + inline long double + sqrt(long double __x) + { return __builtin_sqrtl(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + sqrt(_Tp __x) + { return __builtin_sqrt(__x); } + + using ::tan; + + inline float + tan(float __x) + { return __builtin_tanf(__x); } + + inline long double + tan(long double __x) + { return __builtin_tanl(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + tan(_Tp __x) + { return __builtin_tan(__x); } + + using ::tanh; + + inline float + tanh(float __x) + { return __builtin_tanhf(__x); } + + inline long double + tanh(long double __x) + { return __builtin_tanhl(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + tanh(_Tp __x) + { return __builtin_tanh(__x); } + +} // namespace std + +#if _GLIBCXX_USE_C99_MATH +#if !_GLIBCXX_USE_C99_FP_MACROS_DYNAMIC +// These are possible macros imported from C99-land. For strict +// conformance, remove possible C99-injected names from the global +// namespace, and sequester them in the __gnu_cxx extension namespace. + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + + template + inline int + __capture_fpclassify(_Tp __f) { return fpclassify(__f); } + + template + inline int + __capture_isfinite(_Tp __f) { return isfinite(__f); } + + template + inline int + __capture_isinf(_Tp __f) { return isinf(__f); } + + template + inline int + __capture_isnan(_Tp __f) { return isnan(__f); } + + template + inline int + __capture_isnormal(_Tp __f) { return isnormal(__f); } + + template + inline int + __capture_signbit(_Tp __f) { return signbit(__f); } + + template + inline int + __capture_isgreater(_Tp __f1, _Tp __f2) + { return isgreater(__f1, __f2); } + + template + inline int + __capture_isgreaterequal(_Tp __f1, _Tp __f2) + { return isgreaterequal(__f1, __f2); } + + template + inline int + __capture_isless(_Tp __f1, _Tp __f2) { return isless(__f1, __f2); } + + template + inline int + __capture_islessequal(_Tp __f1, _Tp __f2) + { return islessequal(__f1, __f2); } + + template + inline int + __capture_islessgreater(_Tp __f1, _Tp __f2) + { return islessgreater(__f1, __f2); } + + template + inline int + __capture_isunordered(_Tp __f1, _Tp __f2) + { return isunordered(__f1, __f2); } + +} // namespace std + +// Only undefine the C99 FP macros, if actually captured for namespace movement +#undef fpclassify +#undef isfinite +#undef isinf +#undef isnan +#undef isnormal +#undef signbit +#undef isgreater +#undef isgreaterequal +#undef isless +#undef islessequal +#undef islessgreater +#undef isunordered + +namespace std { + + template + inline int + fpclassify(_Tp __f) { return ::__gnu_cxx::__capture_fpclassify(__f); } + + template + inline int + isfinite(_Tp __f) { return ::__gnu_cxx::__capture_isfinite(__f); } + + template + inline int + isinf(_Tp __f) { return ::__gnu_cxx::__capture_isinf(__f); } + + template + inline int + isnan(_Tp __f) { return ::__gnu_cxx::__capture_isnan(__f); } + + template + inline int + isnormal(_Tp __f) { return ::__gnu_cxx::__capture_isnormal(__f); } + + template + inline int + signbit(_Tp __f) { return ::__gnu_cxx::__capture_signbit(__f); } + + template + inline int + isgreater(_Tp __f1, _Tp __f2) + { return ::__gnu_cxx::__capture_isgreater(__f1, __f2); } + + template + inline int + isgreaterequal(_Tp __f1, _Tp __f2) + { return ::__gnu_cxx::__capture_isgreaterequal(__f1, __f2); } + + template + inline int + isless(_Tp __f1, _Tp __f2) + { return ::__gnu_cxx::__capture_isless(__f1, __f2); } + + template + inline int + islessequal(_Tp __f1, _Tp __f2) + { return ::__gnu_cxx::__capture_islessequal(__f1, __f2); } + + template + inline int + islessgreater(_Tp __f1, _Tp __f2) + { return ::__gnu_cxx::__capture_islessgreater(__f1, __f2); } + + template + inline int + isunordered(_Tp __f1, _Tp __f2) + { return ::__gnu_cxx::__capture_isunordered(__f1, __f2); } + +} // namespace std + +#endif /* _GLIBCXX_USE_C99_FP_MACROS_DYNAMIC */ +#endif + +#ifndef _GLIBCXX_EXPORT_TEMPLATE +# include +#endif + +#endif diff --git a/cpp_src/cmath.tcc b/cpp_src/cmath.tcc new file mode 100644 index 0000000..56fdafc --- /dev/null +++ b/cpp_src/cmath.tcc @@ -0,0 +1,59 @@ +// -*- C++ -*- C math library. + +// Copyright (C) 2000, 2003, 2004, 2006 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +// This file was written by Gabriel Dos Reis + +/** @file cmath.tcc + * This is a Standard C++ Library file. + */ + +#ifndef _GLIBCXX_CMATH_TCC +#define _GLIBCXX_CMATH_TCC 1 + +namespace std { + + template + inline _Tp + __cmath_power(_Tp __x, unsigned int __n) + { + _Tp __y = __n % 2 ? __x : 1; + + while (__n >>= 1) + { + __x = __x * __x; + if (__n % 2) + __y = __y * __x; + } + + return __y; + } + +} // namespace std + +#endif diff --git a/cpp_src/codecvt.h b/cpp_src/codecvt.h new file mode 100644 index 0000000..56119d1 --- /dev/null +++ b/cpp_src/codecvt.h @@ -0,0 +1,474 @@ +// Locale support (codecvt) -*- C++ -*- + +// Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file bits/codecvt.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 22.2.1.5 Template class codecvt +// + +// Written by Benjamin Kosnik + +#ifndef _CODECVT_H +#define _CODECVT_H 1 + +#pragma GCC system_header + +namespace std { + + /// @brief Empty base class for codecvt facet [22.2.1.5]. + class codecvt_base + { + public: + enum result + { + ok, + partial, + error, + noconv + }; + }; + + /** + * @brief Common base for codecvt functions. + * + * This template class provides implementations of the public functions + * that forward to the protected virtual functions. + * + * This template also provides abstract stubs for the protected virtual + * functions. + */ + template + class __codecvt_abstract_base + : public locale::facet, public codecvt_base + { + public: + // Types: + typedef codecvt_base::result result; + typedef _InternT intern_type; + typedef _ExternT extern_type; + typedef _StateT state_type; + + // 22.2.1.5.1 codecvt members + /** + * @brief Convert from internal to external character set. + * + * Converts input string of intern_type to output string of + * extern_type. This is analogous to wcsrtombs. It does this by + * calling codecvt::do_out. + * + * The source and destination character sets are determined by the + * facet's locale, internal and external types. + * + * The characters in [from,from_end) are converted and written to + * [to,to_end). from_next and to_next are set to point to the + * character following the last successfully converted character, + * respectively. If the result needed no conversion, from_next and + * to_next are not affected. + * + * The @a state argument should be intialized if the input is at the + * beginning and carried from a previous call if continuing + * conversion. There are no guarantees about how @a state is used. + * + * The result returned is a member of codecvt_base::result. If + * all the input is converted, returns codecvt_base::ok. If no + * conversion is necessary, returns codecvt_base::noconv. If + * the input ends early or there is insufficient space in the + * output, returns codecvt_base::partial. Otherwise the + * conversion failed and codecvt_base::error is returned. + * + * @param state Persistent conversion state data. + * @param from Start of input. + * @param from_end End of input. + * @param from_next Returns start of unconverted data. + * @param to Start of output buffer. + * @param to_end End of output buffer. + * @param to_next Returns start of unused output area. + * @return codecvt_base::result. + */ + result + out(state_type& __state, const intern_type* __from, + const intern_type* __from_end, const intern_type*& __from_next, + extern_type* __to, extern_type* __to_end, + extern_type*& __to_next) const + { + return this->do_out(__state, __from, __from_end, __from_next, + __to, __to_end, __to_next); + } + + /** + * @brief Reset conversion state. + * + * Writes characters to output that would restore @a state to initial + * conditions. The idea is that if a partial conversion occurs, then + * the converting the characters written by this function would leave + * the state in initial conditions, rather than partial conversion + * state. It does this by calling codecvt::do_unshift(). + * + * For example, if 4 external characters always converted to 1 internal + * character, and input to in() had 6 external characters with state + * saved, this function would write two characters to the output and + * set the state to initialized conditions. + * + * The source and destination character sets are determined by the + * facet's locale, internal and external types. + * + * The result returned is a member of codecvt_base::result. If the + * state could be reset and data written, returns codecvt_base::ok. If + * no conversion is necessary, returns codecvt_base::noconv. If the + * output has insufficient space, returns codecvt_base::partial. + * Otherwise the reset failed and codecvt_base::error is returned. + * + * @param state Persistent conversion state data. + * @param to Start of output buffer. + * @param to_end End of output buffer. + * @param to_next Returns start of unused output area. + * @return codecvt_base::result. + */ + result + unshift(state_type& __state, extern_type* __to, extern_type* __to_end, + extern_type*& __to_next) const + { return this->do_unshift(__state, __to,__to_end,__to_next); } + + /** + * @brief Convert from external to internal character set. + * + * Converts input string of extern_type to output string of + * intern_type. This is analogous to mbsrtowcs. It does this by + * calling codecvt::do_in. + * + * The source and destination character sets are determined by the + * facet's locale, internal and external types. + * + * The characters in [from,from_end) are converted and written to + * [to,to_end). from_next and to_next are set to point to the + * character following the last successfully converted character, + * respectively. If the result needed no conversion, from_next and + * to_next are not affected. + * + * The @a state argument should be intialized if the input is at the + * beginning and carried from a previous call if continuing + * conversion. There are no guarantees about how @a state is used. + * + * The result returned is a member of codecvt_base::result. If + * all the input is converted, returns codecvt_base::ok. If no + * conversion is necessary, returns codecvt_base::noconv. If + * the input ends early or there is insufficient space in the + * output, returns codecvt_base::partial. Otherwise the + * conversion failed and codecvt_base::error is returned. + * + * @param state Persistent conversion state data. + * @param from Start of input. + * @param from_end End of input. + * @param from_next Returns start of unconverted data. + * @param to Start of output buffer. + * @param to_end End of output buffer. + * @param to_next Returns start of unused output area. + * @return codecvt_base::result. + */ + result + in(state_type& __state, const extern_type* __from, + const extern_type* __from_end, const extern_type*& __from_next, + intern_type* __to, intern_type* __to_end, + intern_type*& __to_next) const + { + return this->do_in(__state, __from, __from_end, __from_next, + __to, __to_end, __to_next); + } + + int + encoding() const throw() + { return this->do_encoding(); } + + bool + always_noconv() const throw() + { return this->do_always_noconv(); } + + int + length(state_type& __state, const extern_type* __from, + const extern_type* __end, size_t __max) const + { return this->do_length(__state, __from, __end, __max); } + + int + max_length() const throw() + { return this->do_max_length(); } + + protected: + explicit + __codecvt_abstract_base(size_t __refs = 0) : locale::facet(__refs) { } + + virtual + ~__codecvt_abstract_base() { } + + /** + * @brief Convert from internal to external character set. + * + * Converts input string of intern_type to output string of + * extern_type. This function is a hook for derived classes to change + * the value returned. @see out for more information. + */ + virtual result + do_out(state_type& __state, const intern_type* __from, + const intern_type* __from_end, const intern_type*& __from_next, + extern_type* __to, extern_type* __to_end, + extern_type*& __to_next) const = 0; + + virtual result + do_unshift(state_type& __state, extern_type* __to, + extern_type* __to_end, extern_type*& __to_next) const = 0; + + virtual result + do_in(state_type& __state, const extern_type* __from, + const extern_type* __from_end, const extern_type*& __from_next, + intern_type* __to, intern_type* __to_end, + intern_type*& __to_next) const = 0; + + virtual int + do_encoding() const throw() = 0; + + virtual bool + do_always_noconv() const throw() = 0; + + virtual int + do_length(state_type&, const extern_type* __from, + const extern_type* __end, size_t __max) const = 0; + + virtual int + do_max_length() const throw() = 0; + }; + + /// @brief class codecvt [22.2.1.5]. + /// NB: Generic, mostly useless implementation. + template + class codecvt + : public __codecvt_abstract_base<_InternT, _ExternT, _StateT> + { + public: + // Types: + typedef codecvt_base::result result; + typedef _InternT intern_type; + typedef _ExternT extern_type; + typedef _StateT state_type; + + protected: + __c_locale _M_c_locale_codecvt; + + public: + static locale::id id; + + explicit + codecvt(size_t __refs = 0) + : __codecvt_abstract_base<_InternT, _ExternT, _StateT> (__refs) { } + + explicit + codecvt(__c_locale __cloc, size_t __refs = 0); + + protected: + virtual + ~codecvt() { } + + virtual result + do_out(state_type& __state, const intern_type* __from, + const intern_type* __from_end, const intern_type*& __from_next, + extern_type* __to, extern_type* __to_end, + extern_type*& __to_next) const; + + virtual result + do_unshift(state_type& __state, extern_type* __to, + extern_type* __to_end, extern_type*& __to_next) const; + + virtual result + do_in(state_type& __state, const extern_type* __from, + const extern_type* __from_end, const extern_type*& __from_next, + intern_type* __to, intern_type* __to_end, + intern_type*& __to_next) const; + + virtual int + do_encoding() const throw(); + + virtual bool + do_always_noconv() const throw(); + + virtual int + do_length(state_type&, const extern_type* __from, + const extern_type* __end, size_t __max) const; + + virtual int + do_max_length() const throw(); + }; + + template + locale::id codecvt<_InternT, _ExternT, _StateT>::id; + + /// @brief class codecvt specialization. + template<> + class codecvt + : public __codecvt_abstract_base + { + public: + // Types: + typedef char intern_type; + typedef char extern_type; + typedef mbstate_t state_type; + + protected: + __c_locale _M_c_locale_codecvt; + + public: + static locale::id id; + + explicit + codecvt(size_t __refs = 0); + + explicit + codecvt(__c_locale __cloc, size_t __refs = 0); + + protected: + virtual + ~codecvt(); + + virtual result + do_out(state_type& __state, const intern_type* __from, + const intern_type* __from_end, const intern_type*& __from_next, + extern_type* __to, extern_type* __to_end, + extern_type*& __to_next) const; + + virtual result + do_unshift(state_type& __state, extern_type* __to, + extern_type* __to_end, extern_type*& __to_next) const; + + virtual result + do_in(state_type& __state, const extern_type* __from, + const extern_type* __from_end, const extern_type*& __from_next, + intern_type* __to, intern_type* __to_end, + intern_type*& __to_next) const; + + virtual int + do_encoding() const throw(); + + virtual bool + do_always_noconv() const throw(); + + virtual int + do_length(state_type&, const extern_type* __from, + const extern_type* __end, size_t __max) const; + + virtual int + do_max_length() const throw(); + }; + +#ifdef _GLIBCXX_USE_WCHAR_T + /// @brief class codecvt specialization. + template<> + class codecvt + : public __codecvt_abstract_base + { + public: + // Types: + typedef wchar_t intern_type; + typedef char extern_type; + typedef mbstate_t state_type; + + protected: + __c_locale _M_c_locale_codecvt; + + public: + static locale::id id; + + explicit + codecvt(size_t __refs = 0); + + explicit + codecvt(__c_locale __cloc, size_t __refs = 0); + + protected: + virtual + ~codecvt(); + + virtual result + do_out(state_type& __state, const intern_type* __from, + const intern_type* __from_end, const intern_type*& __from_next, + extern_type* __to, extern_type* __to_end, + extern_type*& __to_next) const; + + virtual result + do_unshift(state_type& __state, + extern_type* __to, extern_type* __to_end, + extern_type*& __to_next) const; + + virtual result + do_in(state_type& __state, + const extern_type* __from, const extern_type* __from_end, + const extern_type*& __from_next, + intern_type* __to, intern_type* __to_end, + intern_type*& __to_next) const; + + virtual + int do_encoding() const throw(); + + virtual + bool do_always_noconv() const throw(); + + virtual + int do_length(state_type&, const extern_type* __from, + const extern_type* __end, size_t __max) const; + + virtual int + do_max_length() const throw(); + }; +#endif //_GLIBCXX_USE_WCHAR_T + + /// @brief class codecvt_byname [22.2.1.6]. + template + class codecvt_byname : public codecvt<_InternT, _ExternT, _StateT> + { + public: + explicit + codecvt_byname(const char* __s, size_t __refs = 0) + : codecvt<_InternT, _ExternT, _StateT>(__refs) + { + if (std::strcmp(__s, "C") != 0 && std::strcmp(__s, "POSIX") != 0) + { + this->_S_destroy_c_locale(this->_M_c_locale_codecvt); + this->_S_create_c_locale(this->_M_c_locale_codecvt, __s); + } + } + + protected: + virtual + ~codecvt_byname() { } + }; + +} // namespace std + +#endif // _CODECVT_H diff --git a/cpp_src/complex b/cpp_src/complex new file mode 100644 index 0000000..d2aca5a --- /dev/null +++ b/cpp_src/complex @@ -0,0 +1,1489 @@ +// The template and inlines for the -*- C++ -*- complex number classes. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file complex + * This is a Standard C++ Library header. + */ + +// +// ISO C++ 14882: 26.2 Complex Numbers +// Note: this is not a conforming implementation. +// Initially implemented by Ulrich Drepper +// Improved by Gabriel Dos Reis +// + +#ifndef _GLIBCXX_COMPLEX +#define _GLIBCXX_COMPLEX 1 + +#pragma GCC system_header + +#include +#include +#include +#include + +namespace std { + + // Forward declarations. + template class complex; + template<> class complex; + template<> class complex; + template<> class complex; + + /// Return magnitude of @a z. + template _Tp abs(const complex<_Tp>&); + /// Return phase angle of @a z. + template _Tp arg(const complex<_Tp>&); + /// Return @a z magnitude squared. + template _Tp norm(const complex<_Tp>&); + + /// Return complex conjugate of @a z. + template complex<_Tp> conj(const complex<_Tp>&); + /// Return complex with magnitude @a rho and angle @a theta. + template complex<_Tp> polar(const _Tp&, const _Tp& = 0); + + // Transcendentals: + /// Return complex cosine of @a z. + template complex<_Tp> cos(const complex<_Tp>&); + /// Return complex hyperbolic cosine of @a z. + template complex<_Tp> cosh(const complex<_Tp>&); + /// Return complex base e exponential of @a z. + template complex<_Tp> exp(const complex<_Tp>&); + /// Return complex natural logarithm of @a z. + template complex<_Tp> log(const complex<_Tp>&); + /// Return complex base 10 logarithm of @a z. + template complex<_Tp> log10(const complex<_Tp>&); + /// Return complex cosine of @a z. + template complex<_Tp> pow(const complex<_Tp>&, int); + /// Return @a x to the @a y'th power. + template complex<_Tp> pow(const complex<_Tp>&, const _Tp&); + /// Return @a x to the @a y'th power. + template complex<_Tp> pow(const complex<_Tp>&, + const complex<_Tp>&); + /// Return @a x to the @a y'th power. + template complex<_Tp> pow(const _Tp&, const complex<_Tp>&); + /// Return complex sine of @a z. + template complex<_Tp> sin(const complex<_Tp>&); + /// Return complex hyperbolic sine of @a z. + template complex<_Tp> sinh(const complex<_Tp>&); + /// Return complex square root of @a z. + template complex<_Tp> sqrt(const complex<_Tp>&); + /// Return complex tangent of @a z. + template complex<_Tp> tan(const complex<_Tp>&); + /// Return complex hyperbolic tangent of @a z. + template complex<_Tp> tanh(const complex<_Tp>&); + //@} + + + // 26.2.2 Primary template class complex + /** + * Template to represent complex numbers. + * + * Specializations for float, double, and long double are part of the + * library. Results with any other type are not guaranteed. + * + * @param Tp Type of real and imaginary values. + */ + template + struct complex + { + /// Value typedef. + typedef _Tp value_type; + + /// Default constructor. First parameter is x, second parameter is y. + /// Unspecified parameters default to 0. + complex(const _Tp& = _Tp(), const _Tp & = _Tp()); + + // Lets the compiler synthesize the copy constructor + // complex (const complex<_Tp>&); + /// Copy constructor. + template + complex(const complex<_Up>&); + + /// Return real part of complex number. + _Tp& real(); + /// Return real part of complex number. + const _Tp& real() const; + /// Return imaginary part of complex number. + _Tp& imag(); + /// Return imaginary part of complex number. + const _Tp& imag() const; + + /// Assign this complex number to scalar @a t. + complex<_Tp>& operator=(const _Tp&); + /// Add @a t to this complex number. + complex<_Tp>& operator+=(const _Tp&); + /// Subtract @a t from this complex number. + complex<_Tp>& operator-=(const _Tp&); + /// Multiply this complex number by @a t. + complex<_Tp>& operator*=(const _Tp&); + /// Divide this complex number by @a t. + complex<_Tp>& operator/=(const _Tp&); + + // Lets the compiler synthesize the + // copy and assignment operator + // complex<_Tp>& operator= (const complex<_Tp>&); + /// Assign this complex number to complex @a z. + template + complex<_Tp>& operator=(const complex<_Up>&); + /// Add @a z to this complex number. + template + complex<_Tp>& operator+=(const complex<_Up>&); + /// Subtract @a z from this complex number. + template + complex<_Tp>& operator-=(const complex<_Up>&); + /// Multiply this complex number by @a z. + template + complex<_Tp>& operator*=(const complex<_Up>&); + /// Divide this complex number by @a z. + template + complex<_Tp>& operator/=(const complex<_Up>&); + + const complex& __rep() const; + + private: + _Tp _M_real; + _Tp _M_imag; + }; + + template + inline _Tp& + complex<_Tp>::real() { return _M_real; } + + template + inline const _Tp& + complex<_Tp>::real() const { return _M_real; } + + template + inline _Tp& + complex<_Tp>::imag() { return _M_imag; } + + template + inline const _Tp& + complex<_Tp>::imag() const { return _M_imag; } + + template + inline + complex<_Tp>::complex(const _Tp& __r, const _Tp& __i) + : _M_real(__r), _M_imag(__i) { } + + template + template + inline + complex<_Tp>::complex(const complex<_Up>& __z) + : _M_real(__z.real()), _M_imag(__z.imag()) { } + + template + complex<_Tp>& + complex<_Tp>::operator=(const _Tp& __t) + { + _M_real = __t; + _M_imag = _Tp(); + return *this; + } + + // 26.2.5/1 + template + inline complex<_Tp>& + complex<_Tp>::operator+=(const _Tp& __t) + { + _M_real += __t; + return *this; + } + + // 26.2.5/3 + template + inline complex<_Tp>& + complex<_Tp>::operator-=(const _Tp& __t) + { + _M_real -= __t; + return *this; + } + + // 26.2.5/5 + template + complex<_Tp>& + complex<_Tp>::operator*=(const _Tp& __t) + { + _M_real *= __t; + _M_imag *= __t; + return *this; + } + + // 26.2.5/7 + template + complex<_Tp>& + complex<_Tp>::operator/=(const _Tp& __t) + { + _M_real /= __t; + _M_imag /= __t; + return *this; + } + + template + template + complex<_Tp>& + complex<_Tp>::operator=(const complex<_Up>& __z) + { + _M_real = __z.real(); + _M_imag = __z.imag(); + return *this; + } + + // 26.2.5/9 + template + template + complex<_Tp>& + complex<_Tp>::operator+=(const complex<_Up>& __z) + { + _M_real += __z.real(); + _M_imag += __z.imag(); + return *this; + } + + // 26.2.5/11 + template + template + complex<_Tp>& + complex<_Tp>::operator-=(const complex<_Up>& __z) + { + _M_real -= __z.real(); + _M_imag -= __z.imag(); + return *this; + } + + // 26.2.5/13 + // XXX: This is a grammar school implementation. + template + template + complex<_Tp>& + complex<_Tp>::operator*=(const complex<_Up>& __z) + { + const _Tp __r = _M_real * __z.real() - _M_imag * __z.imag(); + _M_imag = _M_real * __z.imag() + _M_imag * __z.real(); + _M_real = __r; + return *this; + } + + // 26.2.5/15 + // XXX: This is a grammar school implementation. + template + template + complex<_Tp>& + complex<_Tp>::operator/=(const complex<_Up>& __z) + { + const _Tp __r = _M_real * __z.real() + _M_imag * __z.imag(); + const _Tp __n = std::norm(__z); + _M_imag = (_M_imag * __z.real() - _M_real * __z.imag()) / __n; + _M_real = __r / __n; + return *this; + } + + template + inline const complex<_Tp>& + complex<_Tp>::__rep() const { return *this; } + + // Operators: + //@{ + /// Return new complex value @a x plus @a y. + template + inline complex<_Tp> + operator+(const complex<_Tp>& __x, const complex<_Tp>& __y) + { + complex<_Tp> __r = __x; + __r += __y; + return __r; + } + + template + inline complex<_Tp> + operator+(const complex<_Tp>& __x, const _Tp& __y) + { + complex<_Tp> __r = __x; + __r.real() += __y; + return __r; + } + + template + inline complex<_Tp> + operator+(const _Tp& __x, const complex<_Tp>& __y) + { + complex<_Tp> __r = __y; + __r.real() += __x; + return __r; + } + //@} + + //@{ + /// Return new complex value @a x minus @a y. + template + inline complex<_Tp> + operator-(const complex<_Tp>& __x, const complex<_Tp>& __y) + { + complex<_Tp> __r = __x; + __r -= __y; + return __r; + } + + template + inline complex<_Tp> + operator-(const complex<_Tp>& __x, const _Tp& __y) + { + complex<_Tp> __r = __x; + __r.real() -= __y; + return __r; + } + + template + inline complex<_Tp> + operator-(const _Tp& __x, const complex<_Tp>& __y) + { + complex<_Tp> __r(__x, -__y.imag()); + __r.real() -= __y.real(); + return __r; + } + //@} + + //@{ + /// Return new complex value @a x times @a y. + template + inline complex<_Tp> + operator*(const complex<_Tp>& __x, const complex<_Tp>& __y) + { + complex<_Tp> __r = __x; + __r *= __y; + return __r; + } + + template + inline complex<_Tp> + operator*(const complex<_Tp>& __x, const _Tp& __y) + { + complex<_Tp> __r = __x; + __r *= __y; + return __r; + } + + template + inline complex<_Tp> + operator*(const _Tp& __x, const complex<_Tp>& __y) + { + complex<_Tp> __r = __y; + __r *= __x; + return __r; + } + //@} + + //@{ + /// Return new complex value @a x divided by @a y. + template + inline complex<_Tp> + operator/(const complex<_Tp>& __x, const complex<_Tp>& __y) + { + complex<_Tp> __r = __x; + __r /= __y; + return __r; + } + + template + inline complex<_Tp> + operator/(const complex<_Tp>& __x, const _Tp& __y) + { + complex<_Tp> __r = __x; + __r /= __y; + return __r; + } + + template + inline complex<_Tp> + operator/(const _Tp& __x, const complex<_Tp>& __y) + { + complex<_Tp> __r = __x; + __r /= __y; + return __r; + } + //@} + + /// Return @a x. + template + inline complex<_Tp> + operator+(const complex<_Tp>& __x) + { return __x; } + + /// Return complex negation of @a x. + template + inline complex<_Tp> + operator-(const complex<_Tp>& __x) + { return complex<_Tp>(-__x.real(), -__x.imag()); } + + //@{ + /// Return true if @a x is equal to @a y. + template + inline bool + operator==(const complex<_Tp>& __x, const complex<_Tp>& __y) + { return __x.real() == __y.real() && __x.imag() == __y.imag(); } + + template + inline bool + operator==(const complex<_Tp>& __x, const _Tp& __y) + { return __x.real() == __y && __x.imag() == _Tp(); } + + template + inline bool + operator==(const _Tp& __x, const complex<_Tp>& __y) + { return __x == __y.real() && _Tp() == __y.imag(); } + //@} + + //@{ + /// Return false if @a x is equal to @a y. + template + inline bool + operator!=(const complex<_Tp>& __x, const complex<_Tp>& __y) + { return __x.real() != __y.real() || __x.imag() != __y.imag(); } + + template + inline bool + operator!=(const complex<_Tp>& __x, const _Tp& __y) + { return __x.real() != __y || __x.imag() != _Tp(); } + + template + inline bool + operator!=(const _Tp& __x, const complex<_Tp>& __y) + { return __x != __y.real() || _Tp() != __y.imag(); } + //@} + + /// Extraction operator for complex values. + template + basic_istream<_CharT, _Traits>& + operator>>(basic_istream<_CharT, _Traits>& __is, complex<_Tp>& __x) + { + _Tp __re_x, __im_x; + _CharT __ch; + __is >> __ch; + if (__ch == '(') + { + __is >> __re_x >> __ch; + if (__ch == ',') + { + __is >> __im_x >> __ch; + if (__ch == ')') + __x = complex<_Tp>(__re_x, __im_x); + else + __is.setstate(ios_base::failbit); + } + else if (__ch == ')') + __x = __re_x; + else + __is.setstate(ios_base::failbit); + } + else + { + __is.putback(__ch); + __is >> __re_x; + __x = __re_x; + } + return __is; + } + + /// Insertion operator for complex values. + template + basic_ostream<_CharT, _Traits>& + operator<<(basic_ostream<_CharT, _Traits>& __os, const complex<_Tp>& __x) + { + basic_ostringstream<_CharT, _Traits> __s; + __s.flags(__os.flags()); + __s.imbue(__os.getloc()); + __s.precision(__os.precision()); + __s << '(' << __x.real() << ',' << __x.imag() << ')'; + return __os << __s.str(); + } + + // Values + template + inline _Tp& + real(complex<_Tp>& __z) + { return __z.real(); } + + template + inline const _Tp& + real(const complex<_Tp>& __z) + { return __z.real(); } + + template + inline _Tp& + imag(complex<_Tp>& __z) + { return __z.imag(); } + + template + inline const _Tp& + imag(const complex<_Tp>& __z) + { return __z.imag(); } + + // 26.2.7/3 abs(__z): Returns the magnitude of __z. + template + inline _Tp + __complex_abs(const complex<_Tp>& __z) + { + _Tp __x = __z.real(); + _Tp __y = __z.imag(); + const _Tp __s = std::max(abs(__x), abs(__y)); + if (__s == _Tp()) // well ... + return __s; + __x /= __s; + __y /= __s; + return __s * sqrt(__x * __x + __y * __y); + } + +#if _GLIBCXX_USE_C99_COMPLEX + inline float + __complex_abs(__complex__ float __z) { return __builtin_cabsf(__z); } + + inline double + __complex_abs(__complex__ double __z) { return __builtin_cabs(__z); } + + inline long double + __complex_abs(const __complex__ long double& __z) + { return __builtin_cabsl(__z); } + + template + inline _Tp + abs(const complex<_Tp>& __z) { return __complex_abs(__z.__rep()); } +#else + template + inline _Tp + abs(const complex<_Tp>& __z) { return __complex_abs(__z); } +#endif + + + // 26.2.7/4: arg(__z): Returns the phase angle of __z. + template + inline _Tp + __complex_arg(const complex<_Tp>& __z) + { return atan2(__z.imag(), __z.real()); } + +#if _GLIBCXX_USE_C99_COMPLEX + inline float + __complex_arg(__complex__ float __z) { return __builtin_cargf(__z); } + + inline double + __complex_arg(__complex__ double __z) { return __builtin_carg(__z); } + + inline long double + __complex_arg(const __complex__ long double& __z) + { return __builtin_cargl(__z); } + + template + inline _Tp + arg(const complex<_Tp>& __z) { return __complex_arg(__z.__rep()); } +#else + template + inline _Tp + arg(const complex<_Tp>& __z) { return __complex_arg(__z); } +#endif + + // 26.2.7/5: norm(__z) returns the squared magintude of __z. + // As defined, norm() is -not- a norm is the common mathematical + // sens used in numerics. The helper class _Norm_helper<> tries to + // distinguish between builtin floating point and the rest, so as + // to deliver an answer as close as possible to the real value. + template + struct _Norm_helper + { + template + static inline _Tp _S_do_it(const complex<_Tp>& __z) + { + const _Tp __x = __z.real(); + const _Tp __y = __z.imag(); + return __x * __x + __y * __y; + } + }; + + template<> + struct _Norm_helper + { + template + static inline _Tp _S_do_it(const complex<_Tp>& __z) + { + _Tp __res = std::abs(__z); + return __res * __res; + } + }; + + template + inline _Tp + norm(const complex<_Tp>& __z) + { + return _Norm_helper<__is_floating<_Tp>::__value + && !_GLIBCXX_FAST_MATH>::_S_do_it(__z); + } + + template + inline complex<_Tp> + polar(const _Tp& __rho, const _Tp& __theta) + { return complex<_Tp>(__rho * cos(__theta), __rho * sin(__theta)); } + + template + inline complex<_Tp> + conj(const complex<_Tp>& __z) + { return complex<_Tp>(__z.real(), -__z.imag()); } + + // Transcendentals + + // 26.2.8/1 cos(__z): Returns the cosine of __z. + template + inline complex<_Tp> + __complex_cos(const complex<_Tp>& __z) + { + const _Tp __x = __z.real(); + const _Tp __y = __z.imag(); + return complex<_Tp>(cos(__x) * cosh(__y), -sin(__x) * sinh(__y)); + } + +#if _GLIBCXX_USE_C99_COMPLEX + inline __complex__ float + __complex_cos(__complex__ float __z) { return __builtin_ccosf(__z); } + + inline __complex__ double + __complex_cos(__complex__ double __z) { return __builtin_ccos(__z); } + + inline __complex__ long double + __complex_cos(const __complex__ long double& __z) + { return __builtin_ccosl(__z); } + + template + inline complex<_Tp> + cos(const complex<_Tp>& __z) { return __complex_cos(__z.__rep()); } +#else + template + inline complex<_Tp> + cos(const complex<_Tp>& __z) { return __complex_cos(__z); } +#endif + + // 26.2.8/2 cosh(__z): Returns the hyperbolic cosine of __z. + template + inline complex<_Tp> + __complex_cosh(const complex<_Tp>& __z) + { + const _Tp __x = __z.real(); + const _Tp __y = __z.imag(); + return complex<_Tp>(cosh(__x) * cos(__y), sinh(__x) * sin(__y)); + } + +#if _GLIBCXX_USE_C99_COMPLEX + inline __complex__ float + __complex_cosh(__complex__ float __z) { return __builtin_ccoshf(__z); } + + inline __complex__ double + __complex_cosh(__complex__ double __z) { return __builtin_ccosh(__z); } + + inline __complex__ long double + __complex_cosh(const __complex__ long double& __z) + { return __builtin_ccoshl(__z); } + + template + inline complex<_Tp> + cosh(const complex<_Tp>& __z) { return __complex_cosh(__z.__rep()); } +#else + template + inline complex<_Tp> + cosh(const complex<_Tp>& __z) { return __complex_cosh(__z); } +#endif + + // 26.2.8/3 exp(__z): Returns the complex base e exponential of x + template + inline complex<_Tp> + __complex_exp(const complex<_Tp>& __z) + { return std::polar(exp(__z.real()), __z.imag()); } + +#if _GLIBCXX_USE_C99_COMPLEX + inline __complex__ float + __complex_exp(__complex__ float __z) { return __builtin_cexpf(__z); } + + inline __complex__ double + __complex_exp(__complex__ double __z) { return __builtin_cexp(__z); } + + inline __complex__ long double + __complex_exp(const __complex__ long double& __z) + { return __builtin_cexpl(__z); } + + template + inline complex<_Tp> + exp(const complex<_Tp>& __z) { return __complex_exp(__z.__rep()); } +#else + template + inline complex<_Tp> + exp(const complex<_Tp>& __z) { return __complex_exp(__z); } +#endif + + // 26.2.8/5 log(__z): Reurns the natural complex logaritm of __z. + // The branch cut is along the negative axis. + template + inline complex<_Tp> + __complex_log(const complex<_Tp>& __z) + { return complex<_Tp>(log(std::abs(__z)), std::arg(__z)); } + +#if _GLIBCXX_USE_C99_COMPLEX + inline __complex__ float + __complex_log(__complex__ float __z) { return __builtin_clogf(__z); } + + inline __complex__ double + __complex_log(__complex__ double __z) { return __builtin_clog(__z); } + + inline __complex__ long double + __complex_log(const __complex__ long double& __z) + { return __builtin_clogl(__z); } + + template + inline complex<_Tp> + log(const complex<_Tp>& __z) { return __complex_log(__z.__rep()); } +#else + template + inline complex<_Tp> + log(const complex<_Tp>& __z) { return __complex_log(__z); } +#endif + + template + inline complex<_Tp> + log10(const complex<_Tp>& __z) + { return std::log(__z) / log(_Tp(10.0)); } + + // 26.2.8/10 sin(__z): Returns the sine of __z. + template + inline complex<_Tp> + __complex_sin(const complex<_Tp>& __z) + { + const _Tp __x = __z.real(); + const _Tp __y = __z.imag(); + return complex<_Tp>(sin(__x) * cosh(__y), cos(__x) * sinh(__y)); + } + +#if _GLIBCXX_USE_C99_COMPLEX + inline __complex__ float + __complex_sin(__complex__ float __z) { return __builtin_csinf(__z); } + + inline __complex__ double + __complex_sin(__complex__ double __z) { return __builtin_csin(__z); } + + inline __complex__ long double + __complex_sin(const __complex__ long double& __z) + { return __builtin_csinl(__z); } + + template + inline complex<_Tp> + sin(const complex<_Tp>& __z) { return __complex_sin(__z.__rep()); } +#else + template + inline complex<_Tp> + sin(const complex<_Tp>& __z) { return __complex_sin(__z); } +#endif + + // 26.2.8/11 sinh(__z): Returns the hyperbolic sine of __z. + template + inline complex<_Tp> + __complex_sinh(const complex<_Tp>& __z) + { + const _Tp __x = __z.real(); + const _Tp __y = __z.imag(); + return complex<_Tp>(sinh(__x) * cos(__y), cosh(__x) * sin(__y)); + } + +#if _GLIBCXX_USE_C99_COMPLEX + inline __complex__ float + __complex_sinh(__complex__ float __z) { return __builtin_csinhf(__z); } + + inline __complex__ double + __complex_sinh(__complex__ double __z) { return __builtin_csinh(__z); } + + inline __complex__ long double + __complex_sinh(const __complex__ long double& __z) + { return __builtin_csinhl(__z); } + + template + inline complex<_Tp> + sinh(const complex<_Tp>& __z) { return __complex_sinh(__z.__rep()); } +#else + template + inline complex<_Tp> + sinh(const complex<_Tp>& __z) { return __complex_sinh(__z); } +#endif + + // 26.2.8/13 sqrt(__z): Returns the complex square root of __z. + // The branch cut is on the negative axis. + template + complex<_Tp> + __complex_sqrt(const complex<_Tp>& __z) + { + _Tp __x = __z.real(); + _Tp __y = __z.imag(); + + if (__x == _Tp()) + { + _Tp __t = sqrt(abs(__y) / 2); + return complex<_Tp>(__t, __y < _Tp() ? -__t : __t); + } + else + { + _Tp __t = sqrt(2 * (std::abs(__z) + abs(__x))); + _Tp __u = __t / 2; + return __x > _Tp() + ? complex<_Tp>(__u, __y / __t) + : complex<_Tp>(abs(__y) / __t, __y < _Tp() ? -__u : __u); + } + } + +#if _GLIBCXX_USE_C99_COMPLEX + inline __complex__ float + __complex_sqrt(__complex__ float __z) { return __builtin_csqrtf(__z); } + + inline __complex__ double + __complex_sqrt(__complex__ double __z) { return __builtin_csqrt(__z); } + + inline __complex__ long double + __complex_sqrt(const __complex__ long double& __z) + { return __builtin_csqrtl(__z); } + + template + inline complex<_Tp> + sqrt(const complex<_Tp>& __z) { return __complex_sqrt(__z.__rep()); } +#else + template + inline complex<_Tp> + sqrt(const complex<_Tp>& __z) { return __complex_sqrt(__z); } +#endif + + // 26.2.8/14 tan(__z): Return the complex tangent of __z. + + template + inline complex<_Tp> + __complex_tan(const complex<_Tp>& __z) + { return std::sin(__z) / std::cos(__z); } + +#if _GLIBCXX_USE_C99_COMPLEX + inline __complex__ float + __complex_tan(__complex__ float __z) { return __builtin_ctanf(__z); } + + inline __complex__ double + __complex_tan(__complex__ double __z) { return __builtin_ctan(__z); } + + inline __complex__ long double + __complex_tan(const __complex__ long double& __z) + { return __builtin_ctanl(__z); } + + template + inline complex<_Tp> + tan(const complex<_Tp>& __z) { return __complex_tan(__z.__rep()); } +#else + template + inline complex<_Tp> + tan(const complex<_Tp>& __z) { return __complex_tan(__z); } +#endif + + + // 26.2.8/15 tanh(__z): Returns the hyperbolic tangent of __z. + + template + inline complex<_Tp> + __complex_tanh(const complex<_Tp>& __z) + { return std::sinh(__z) / std::cosh(__z); } + +#if _GLIBCXX_USE_C99_COMPLEX + inline __complex__ float + __complex_tanh(__complex__ float __z) { return __builtin_ctanhf(__z); } + + inline __complex__ double + __complex_tanh(__complex__ double __z) { return __builtin_ctanh(__z); } + + inline __complex__ long double + __complex_tanh(const __complex__ long double& __z) + { return __builtin_ctanhl(__z); } + + template + inline complex<_Tp> + tanh(const complex<_Tp>& __z) { return __complex_tanh(__z.__rep()); } +#else + template + inline complex<_Tp> + tanh(const complex<_Tp>& __z) { return __complex_tanh(__z); } +#endif + + + // 26.2.8/9 pow(__x, __y): Returns the complex power base of __x + // raised to the __y-th power. The branch + // cut is on the negative axis. + template + inline complex<_Tp> + pow(const complex<_Tp>& __z, int __n) + { return std::__pow_helper(__z, __n); } + + template + complex<_Tp> + pow(const complex<_Tp>& __x, const _Tp& __y) + { +#ifndef _GLIBCXX_USE_C99_COMPLEX + if (__x == _Tp()) + return _Tp(); +#endif + if (__x.imag() == _Tp() && __x.real() > _Tp()) + return pow(__x.real(), __y); + + complex<_Tp> __t = std::log(__x); + return std::polar(exp(__y * __t.real()), __y * __t.imag()); + } + + template + inline complex<_Tp> + __complex_pow(const complex<_Tp>& __x, const complex<_Tp>& __y) + { return __x == _Tp() ? _Tp() : std::exp(__y * std::log(__x)); } + +#if _GLIBCXX_USE_C99_COMPLEX + inline __complex__ float + __complex_pow(__complex__ float __x, __complex__ float __y) + { return __builtin_cpowf(__x, __y); } + + inline __complex__ double + __complex_pow(__complex__ double __x, __complex__ double __y) + { return __builtin_cpow(__x, __y); } + + inline __complex__ long double + __complex_pow(const __complex__ long double& __x, + const __complex__ long double& __y) + { return __builtin_cpowl(__x, __y); } + + template + inline complex<_Tp> + pow(const complex<_Tp>& __x, const complex<_Tp>& __y) + { return __complex_pow(__x.__rep(), __y.__rep()); } +#else + template + inline complex<_Tp> + pow(const complex<_Tp>& __x, const complex<_Tp>& __y) + { return __complex_pow(__x, __y); } +#endif + + template + inline complex<_Tp> + pow(const _Tp& __x, const complex<_Tp>& __y) + { + return __x > _Tp() ? std::polar(pow(__x, __y.real()), + __y.imag() * log(__x)) + : std::pow(complex<_Tp>(__x, _Tp()), __y); + } + + // 26.2.3 complex specializations + // complex specialization + template<> + struct complex + { + typedef float value_type; + typedef __complex__ float _ComplexT; + + complex(_ComplexT __z) : _M_value(__z) { } + + complex(float = 0.0f, float = 0.0f); + + explicit complex(const complex&); + explicit complex(const complex&); + + float& real(); + const float& real() const; + float& imag(); + const float& imag() const; + + complex& operator=(float); + complex& operator+=(float); + complex& operator-=(float); + complex& operator*=(float); + complex& operator/=(float); + + // Let's the compiler synthetize the copy and assignment + // operator. It always does a pretty good job. + // complex& operator= (const complex&); + template + complex&operator=(const complex<_Tp>&); + template + complex& operator+=(const complex<_Tp>&); + template + complex& operator-=(const complex<_Tp>&); + template + complex& operator*=(const complex<_Tp>&); + template + complex&operator/=(const complex<_Tp>&); + + const _ComplexT& __rep() const { return _M_value; } + + private: + _ComplexT _M_value; + }; + + inline float& + complex::real() + { return __real__ _M_value; } + + inline const float& + complex::real() const + { return __real__ _M_value; } + + inline float& + complex::imag() + { return __imag__ _M_value; } + + inline const float& + complex::imag() const + { return __imag__ _M_value; } + + inline + complex::complex(float r, float i) + { + __real__ _M_value = r; + __imag__ _M_value = i; + } + + inline complex& + complex::operator=(float __f) + { + __real__ _M_value = __f; + __imag__ _M_value = 0.0f; + return *this; + } + + inline complex& + complex::operator+=(float __f) + { + __real__ _M_value += __f; + return *this; + } + + inline complex& + complex::operator-=(float __f) + { + __real__ _M_value -= __f; + return *this; + } + + inline complex& + complex::operator*=(float __f) + { + _M_value *= __f; + return *this; + } + + inline complex& + complex::operator/=(float __f) + { + _M_value /= __f; + return *this; + } + + template + inline complex& + complex::operator=(const complex<_Tp>& __z) + { + __real__ _M_value = __z.real(); + __imag__ _M_value = __z.imag(); + return *this; + } + + template + inline complex& + complex::operator+=(const complex<_Tp>& __z) + { + __real__ _M_value += __z.real(); + __imag__ _M_value += __z.imag(); + return *this; + } + + template + inline complex& + complex::operator-=(const complex<_Tp>& __z) + { + __real__ _M_value -= __z.real(); + __imag__ _M_value -= __z.imag(); + return *this; + } + + template + inline complex& + complex::operator*=(const complex<_Tp>& __z) + { + _ComplexT __t; + __real__ __t = __z.real(); + __imag__ __t = __z.imag(); + _M_value *= __t; + return *this; + } + + template + inline complex& + complex::operator/=(const complex<_Tp>& __z) + { + _ComplexT __t; + __real__ __t = __z.real(); + __imag__ __t = __z.imag(); + _M_value /= __t; + return *this; + } + + // 26.2.3 complex specializations + // complex specialization + template<> + struct complex + { + typedef double value_type; + typedef __complex__ double _ComplexT; + + complex(_ComplexT __z) : _M_value(__z) { } + + complex(double = 0.0, double = 0.0); + + complex(const complex&); + explicit complex(const complex&); + + double& real(); + const double& real() const; + double& imag(); + const double& imag() const; + + complex& operator=(double); + complex& operator+=(double); + complex& operator-=(double); + complex& operator*=(double); + complex& operator/=(double); + + // The compiler will synthetize this, efficiently. + // complex& operator= (const complex&); + template + complex& operator=(const complex<_Tp>&); + template + complex& operator+=(const complex<_Tp>&); + template + complex& operator-=(const complex<_Tp>&); + template + complex& operator*=(const complex<_Tp>&); + template + complex& operator/=(const complex<_Tp>&); + + const _ComplexT& __rep() const { return _M_value; } + + private: + _ComplexT _M_value; + }; + + inline double& + complex::real() + { return __real__ _M_value; } + + inline const double& + complex::real() const + { return __real__ _M_value; } + + inline double& + complex::imag() + { return __imag__ _M_value; } + + inline const double& + complex::imag() const + { return __imag__ _M_value; } + + inline + complex::complex(double __r, double __i) + { + __real__ _M_value = __r; + __imag__ _M_value = __i; + } + + inline complex& + complex::operator=(double __d) + { + __real__ _M_value = __d; + __imag__ _M_value = 0.0; + return *this; + } + + inline complex& + complex::operator+=(double __d) + { + __real__ _M_value += __d; + return *this; + } + + inline complex& + complex::operator-=(double __d) + { + __real__ _M_value -= __d; + return *this; + } + + inline complex& + complex::operator*=(double __d) + { + _M_value *= __d; + return *this; + } + + inline complex& + complex::operator/=(double __d) + { + _M_value /= __d; + return *this; + } + + template + inline complex& + complex::operator=(const complex<_Tp>& __z) + { + __real__ _M_value = __z.real(); + __imag__ _M_value = __z.imag(); + return *this; + } + + template + inline complex& + complex::operator+=(const complex<_Tp>& __z) + { + __real__ _M_value += __z.real(); + __imag__ _M_value += __z.imag(); + return *this; + } + + template + inline complex& + complex::operator-=(const complex<_Tp>& __z) + { + __real__ _M_value -= __z.real(); + __imag__ _M_value -= __z.imag(); + return *this; + } + + template + inline complex& + complex::operator*=(const complex<_Tp>& __z) + { + _ComplexT __t; + __real__ __t = __z.real(); + __imag__ __t = __z.imag(); + _M_value *= __t; + return *this; + } + + template + inline complex& + complex::operator/=(const complex<_Tp>& __z) + { + _ComplexT __t; + __real__ __t = __z.real(); + __imag__ __t = __z.imag(); + _M_value /= __t; + return *this; + } + + // 26.2.3 complex specializations + // complex specialization + template<> + struct complex + { + typedef long double value_type; + typedef __complex__ long double _ComplexT; + + complex(_ComplexT __z) : _M_value(__z) { } + + complex(long double = 0.0L, long double = 0.0L); + + complex(const complex&); + complex(const complex&); + + long double& real(); + const long double& real() const; + long double& imag(); + const long double& imag() const; + + complex& operator= (long double); + complex& operator+= (long double); + complex& operator-= (long double); + complex& operator*= (long double); + complex& operator/= (long double); + + // The compiler knows how to do this efficiently + // complex& operator= (const complex&); + template + complex& operator=(const complex<_Tp>&); + template + complex& operator+=(const complex<_Tp>&); + template + complex& operator-=(const complex<_Tp>&); + template + complex& operator*=(const complex<_Tp>&); + template + complex& operator/=(const complex<_Tp>&); + + const _ComplexT& __rep() const { return _M_value; } + + private: + _ComplexT _M_value; + }; + + inline + complex::complex(long double __r, long double __i) + { + __real__ _M_value = __r; + __imag__ _M_value = __i; + } + + inline long double& + complex::real() + { return __real__ _M_value; } + + inline const long double& + complex::real() const + { return __real__ _M_value; } + + inline long double& + complex::imag() + { return __imag__ _M_value; } + + inline const long double& + complex::imag() const + { return __imag__ _M_value; } + + inline complex& + complex::operator=(long double __r) + { + __real__ _M_value = __r; + __imag__ _M_value = 0.0L; + return *this; + } + + inline complex& + complex::operator+=(long double __r) + { + __real__ _M_value += __r; + return *this; + } + + inline complex& + complex::operator-=(long double __r) + { + __real__ _M_value -= __r; + return *this; + } + + inline complex& + complex::operator*=(long double __r) + { + _M_value *= __r; + return *this; + } + + inline complex& + complex::operator/=(long double __r) + { + _M_value /= __r; + return *this; + } + + template + inline complex& + complex::operator=(const complex<_Tp>& __z) + { + __real__ _M_value = __z.real(); + __imag__ _M_value = __z.imag(); + return *this; + } + + template + inline complex& + complex::operator+=(const complex<_Tp>& __z) + { + __real__ _M_value += __z.real(); + __imag__ _M_value += __z.imag(); + return *this; + } + + template + inline complex& + complex::operator-=(const complex<_Tp>& __z) + { + __real__ _M_value -= __z.real(); + __imag__ _M_value -= __z.imag(); + return *this; + } + + template + inline complex& + complex::operator*=(const complex<_Tp>& __z) + { + _ComplexT __t; + __real__ __t = __z.real(); + __imag__ __t = __z.imag(); + _M_value *= __t; + return *this; + } + + template + inline complex& + complex::operator/=(const complex<_Tp>& __z) + { + _ComplexT __t; + __real__ __t = __z.real(); + __imag__ __t = __z.imag(); + _M_value /= __t; + return *this; + } + + // These bits have to be at the end of this file, so that the + // specializations have all been defined. + // ??? No, they have to be there because of compiler limitation at + // inlining. It suffices that class specializations be defined. + inline + complex::complex(const complex& __z) + : _M_value(__z.__rep()) { } + + inline + complex::complex(const complex& __z) + : _M_value(__z.__rep()) { } + + inline + complex::complex(const complex& __z) + : _M_value(__z.__rep()) { } + + inline + complex::complex(const complex& __z) + : _M_value(__z.__rep()) { } + + inline + complex::complex(const complex& __z) + : _M_value(__z.__rep()) { } + + inline + complex::complex(const complex& __z) + : _M_value(__z.__rep()) { } + +} // namespace std + +#endif /* _GLIBCXX_COMPLEX */ diff --git a/cpp_src/concept_check.h b/cpp_src/concept_check.h new file mode 100644 index 0000000..98cb42d --- /dev/null +++ b/cpp_src/concept_check.h @@ -0,0 +1,85 @@ +// Concept-checking control -*- C++ -*- + +// Copyright (C) 2001 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file concept_check.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _CONCEPT_CHECK_H +#define _CONCEPT_CHECK_H 1 + +#pragma GCC system_header + +#include + +// All places in libstdc++-v3 where these are used, or /might/ be used, or +// don't need to be used, or perhaps /should/ be used, are commented with +// "concept requirements" (and maybe some more text). So grep like crazy +// if you're looking for additional places to use these. + +// Concept-checking code is off by default unless users turn it on via +// configure options or editing c++config.h. + +#ifndef _GLIBCXX_CONCEPT_CHECKS + +#define __glibcxx_function_requires(...) +#define __glibcxx_class_requires(_a,_b) +#define __glibcxx_class_requires2(_a,_b,_c) +#define __glibcxx_class_requires3(_a,_b,_c,_d) +#define __glibcxx_class_requires4(_a,_b,_c,_d,_e) + +#else // the checks are on + +#include + +// Note that the obvious and elegant approach of +// +//#define glibcxx_function_requires(C) boost::function_requires< boost::C >() +// +// won't work due to concept templates with more than one parameter, e.g., +// BinaryPredicateConcept. The preprocessor tries to split things up on +// the commas in the template argument list. We can't use an inner pair of +// parenthesis to hide the commas, because "boost::(Temp)" isn't +// a valid instantiation pattern. Thus, we steal a feature from C99. + +#define __glibcxx_function_requires(...) \ + __gnu_cxx::__function_requires< __gnu_cxx::__VA_ARGS__ >(); +#define __glibcxx_class_requires(_a,_C) \ + _GLIBCXX_CLASS_REQUIRES(_a, __gnu_cxx, _C); +#define __glibcxx_class_requires2(_a,_b,_C) \ + _GLIBCXX_CLASS_REQUIRES2(_a, _b, __gnu_cxx, _C); +#define __glibcxx_class_requires3(_a,_b,_c,_C) \ + _GLIBCXX_CLASS_REQUIRES3(_a, _b, _c, __gnu_cxx, _C); +#define __glibcxx_class_requires4(_a,_b,_c,_d,_C) \ + _GLIBCXX_CLASS_REQUIRES4(_a, _b, _c, _d, __gnu_cxx, _C); + +#endif // enable/disable + +#endif // _GLIBCXX_CONCEPT_CHECK diff --git a/cpp_src/cpp_type_traits.h b/cpp_src/cpp_type_traits.h new file mode 100644 index 0000000..5fe1563 --- /dev/null +++ b/cpp_src/cpp_type_traits.h @@ -0,0 +1,403 @@ +// The -*- C++ -*- type traits classes for internal use in libstdc++ + +// Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file cpp_type_traits.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// Written by Gabriel Dos Reis + +#ifndef _CPP_TYPE_TRAITS_H +#define _CPP_TYPE_TRAITS_H 1 + +#pragma GCC system_header + +#include + +// +// This file provides some compile-time information about various types. +// These representations were designed, on purpose, to be constant-expressions +// and not types as found in . In particular, they +// can be used in control structures and the optimizer hopefully will do +// the obvious thing. +// +// Why integral expressions, and not functions nor types? +// Firstly, these compile-time entities are used as template-arguments +// so function return values won't work: We need compile-time entities. +// We're left with types and constant integral expressions. +// Secondly, from the point of view of ease of use, type-based compile-time +// information is -not- *that* convenient. On has to write lots of +// overloaded functions and to hope that the compiler will select the right +// one. As a net effect, the overall structure isn't very clear at first +// glance. +// Thirdly, partial ordering and overload resolution (of function templates) +// is highly costly in terms of compiler-resource. It is a Good Thing to +// keep these resource consumption as least as possible. +// +// See valarray_array.h for a case use. +// +// -- Gaby (dosreis@cmla.ens-cachan.fr) 2000-03-06. +// +// Update 2005: types are also provided and has been +// removed. +// + +// Forward declaration hack, should really include this from somewhere. +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + + template + class __normal_iterator; + +} // namespace std + +namespace std { + +namespace __detail +{ + // NB: g++ can not compile these if declared within the class + // __is_pod itself. + typedef char __one; + typedef char __two[2]; + + template + __one __test_type(int _Tp::*); + template + __two& __test_type(...); +} // namespace __detail + + + struct __true_type { }; + struct __false_type { }; + + template + struct __truth_type + { typedef __false_type __type; }; + + template<> + struct __truth_type + { typedef __true_type __type; }; + + // N.B. The conversions to bool are needed due to the issue + // explained in c++/19404. + template + struct __traitor + { + enum { __value = bool(_Sp::__value) || bool(_Tp::__value) }; + typedef typename __truth_type<__value>::__type __type; + }; + + // Compare for equality of types. + template + struct __are_same + { + enum { __value = 0 }; + typedef __false_type __type; + }; + + template + struct __are_same<_Tp, _Tp> + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + // Holds if the template-argument is a void type. + template + struct __is_void + { + enum { __value = 0 }; + typedef __false_type __type; + }; + + template<> + struct __is_void + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + // + // Integer types + // + template + struct __is_integer + { + enum { __value = 0 }; + typedef __false_type __type; + }; + + // Thirteen specializations (yes there are eleven standard integer + // types; 'long long' and 'unsigned long long' are supported as + // extensions) + template<> + struct __is_integer + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + template<> + struct __is_integer + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + template<> + struct __is_integer + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + template<> + struct __is_integer + { + enum { __value = 1 }; + typedef __true_type __type; + }; + +# ifdef _GLIBCXX_USE_WCHAR_T + template<> + struct __is_integer + { + enum { __value = 1 }; + typedef __true_type __type; + }; +# endif + + template<> + struct __is_integer + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + template<> + struct __is_integer + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + template<> + struct __is_integer + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + template<> + struct __is_integer + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + template<> + struct __is_integer + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + template<> + struct __is_integer + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + template<> + struct __is_integer + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + template<> + struct __is_integer + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + // + // Floating point types + // + template + struct __is_floating + { + enum { __value = 0 }; + typedef __false_type __type; + }; + + // three specializations (float, double and 'long double') + template<> + struct __is_floating + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + template<> + struct __is_floating + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + template<> + struct __is_floating + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + // + // Pointer types + // + template + struct __is_pointer + { + enum { __value = 0 }; + typedef __false_type __type; + }; + + template + struct __is_pointer<_Tp*> + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + // + // Normal iterator type + // + template + struct __is_normal_iterator + { + enum { __value = 0 }; + typedef __false_type __type; + }; + + template + struct __is_normal_iterator< __gnu_cxx::__normal_iterator<_Iterator, + _Container> > + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + // + // An arithmetic type is an integer type or a floating point type + // + template + struct __is_arithmetic + : public __traitor<__is_integer<_Tp>, __is_floating<_Tp> > + { }; + + // + // A fundamental type is `void' or and arithmetic type + // + template + struct __is_fundamental + : public __traitor<__is_void<_Tp>, __is_arithmetic<_Tp> > + { }; + + // + // A scalar type is an arithmetic type or a pointer type + // + template + struct __is_scalar + : public __traitor<__is_arithmetic<_Tp>, __is_pointer<_Tp> > + { }; + + // For the immediate use, the following is a good approximation. + template + struct __is_pod + { + enum + { + __value = (sizeof(__detail::__test_type<_Tp>(0)) + != sizeof(__detail::__one)) + }; + }; + + // + // A stripped-down version of std::tr1::is_empty + // + template + struct __is_empty + { + private: + template + struct __first { }; + template + struct __second + : public _Up { }; + + public: + enum + { + __value = sizeof(__first<_Tp>) == sizeof(__second<_Tp>) + }; + }; + + // + // For use in std::copy and std::find overloads for streambuf iterators. + // + template + struct __is_char + { + enum { __value = 0 }; + typedef __false_type __type; + }; + + template<> + struct __is_char + { + enum { __value = 1 }; + typedef __true_type __type; + }; + +#ifdef _GLIBCXX_USE_WCHAR_T + template<> + struct __is_char + { + enum { __value = 1 }; + typedef __true_type __type; + }; +#endif + +} // namespace std + +#endif //_CPP_TYPE_TRAITS_H diff --git a/cpp_src/csetjmp b/cpp_src/csetjmp new file mode 100644 index 0000000..ed0a80c --- /dev/null +++ b/cpp_src/csetjmp @@ -0,0 +1,68 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file csetjmp + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c setjmp.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: 20.4.6 C library +// + +#ifndef _GLIBCXX_CSETJMP +#define _GLIBCXX_CSETJMP 1 + +#pragma GCC system_header + +#include +#include + +// Get rid of those macros defined in in lieu of real functions. +#undef longjmp + +// Adhere to section 17.4.1.2 clause 5 of ISO 14882:1998 +#ifndef setjmp +#define setjmp(env) setjmp (env) +#endif + +namespace std { + + using ::jmp_buf; + using ::longjmp; + +} // namespace std + +#endif diff --git a/cpp_src/csignal b/cpp_src/csignal new file mode 100644 index 0000000..d873dee --- /dev/null +++ b/cpp_src/csignal @@ -0,0 +1,64 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file csignal + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c signal.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: 20.4.6 C library +// + +#ifndef _GLIBCXX_CSIGNAL +#define _GLIBCXX_CSIGNAL 1 + +#pragma GCC system_header + +#include +#include + +// Get rid of those macros defined in in lieu of real functions. +#undef raise + +namespace std { + + using ::sig_atomic_t; + using ::signal; + using ::raise; + +} // namespace std + +#endif diff --git a/cpp_src/cstdarg b/cpp_src/cstdarg new file mode 100644 index 0000000..a4f6760 --- /dev/null +++ b/cpp_src/cstdarg @@ -0,0 +1,64 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file include/cstdarg + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c stdarg.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: 20.4.6 C library +// + +#ifndef _GLIBCXX_CSTDARG +#define _GLIBCXX_CSTDARG 1 + +#pragma GCC system_header + +#include +#include + +// Adhere to section 17.4.1.2 clause 5 of ISO 14882:1998 +#ifndef va_end +#define va_end(ap) va_end (ap) +#endif + +namespace std { + + using ::va_list; + +} // namespace std + +#endif diff --git a/cpp_src/cstddef b/cpp_src/cstddef new file mode 100644 index 0000000..246a0f0 --- /dev/null +++ b/cpp_src/cstddef @@ -0,0 +1,60 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file cstddef + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c stddef.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: 18.1 Types +// + +#ifndef _GLIBCXX_CSTDDEF +#define _GLIBCXX_CSTDDEF 1 + +#pragma GCC system_header + +#include +#include + +namespace std { + + using ::ptrdiff_t; + using ::size_t; + +} // namespace std + +#endif diff --git a/cpp_src/cstdio b/cpp_src/cstdio new file mode 100644 index 0000000..6f78679 --- /dev/null +++ b/cpp_src/cstdio @@ -0,0 +1,191 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file include/cstdio + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c stdio.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: 27.8.2 C Library files +// + +#ifndef _GLIBCXX_CSTDIO +#define _GLIBCXX_CSTDIO 1 + +#pragma GCC system_header + +#include +#include + +#include + +// Get rid of those macros defined in in lieu of real functions. +#undef clearerr +#undef fclose +#undef feof +#undef ferror +#undef fflush +#undef fgetc +#undef fgetpos +#undef fgets +#undef fopen +#undef fprintf +#undef fputc +#undef fputs +#undef fread +#undef freopen +#undef fscanf +#undef fseek +#undef fsetpos +#undef ftell +#undef fwrite +#undef getc +#undef getchar +#undef gets +#undef perror +#undef printf +#undef putc +#undef putchar +#undef puts +#undef remove +#undef rename +#undef rewind +#undef scanf +#undef setbuf +#undef setvbuf +#undef sprintf +#undef sscanf +#undef tmpfile +#undef tmpnam +#undef ungetc +#undef vfprintf +#undef vprintf +#undef vsprintf + +namespace std { + + using ::FILE; + using ::fpos_t; + + using ::clearerr; + using ::fclose; + using ::feof; + using ::ferror; + using ::fflush; + using ::fgetc; + using ::fgetpos; + using ::fgets; + using ::fopen; + using ::fprintf; + using ::fputc; + using ::fputs; + using ::fread; + using ::freopen; + using ::fscanf; + using ::fseek; + using ::fsetpos; + using ::ftell; + using ::fwrite; + using ::getc; + using ::getchar; + using ::gets; + using ::perror; + using ::printf; + using ::putc; + using ::putchar; + using ::puts; + using ::remove; + using ::rename; + using ::rewind; + using ::scanf; + using ::setbuf; + using ::setvbuf; + using ::sprintf; + using ::sscanf; + using ::tmpfile; + using ::tmpnam; + using ::ungetc; + using ::vfprintf; + using ::vprintf; + using ::vsprintf; + +} // namespace std + +#if _GLIBCXX_USE_C99 || defined(__UCLIBC__) + +#undef snprintf +#undef vfscanf +#undef vscanf +#undef vsnprintf +#undef vsscanf + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + +#if _GLIBCXX_USE_C99_CHECK || _GLIBCXX_USE_C99_DYNAMIC + extern "C" int + (snprintf)(char * restrict, size_t, const char * restrict, ...); + extern "C" int + (vfscanf)(FILE * restrict, const char * restrict, __gnuc_va_list); + extern "C" int (vscanf)(const char * restrict, __gnuc_va_list); + extern "C" int + (vsnprintf)(char * restrict, size_t, const char * restrict, __gnuc_va_list); + extern "C" int + (vsscanf)(const char * restrict, const char * restrict, __gnuc_va_list); +#endif + +#if !_GLIBCXX_USE_C99_DYNAMIC + using ::snprintf; + using ::vfscanf; + using ::vscanf; + using ::vsnprintf; + using ::vsscanf; +#endif + +} // namespace std + +namespace std { + + using ::__gnu_cxx::snprintf; + using ::__gnu_cxx::vfscanf; + using ::__gnu_cxx::vscanf; + using ::__gnu_cxx::vsnprintf; + using ::__gnu_cxx::vsscanf; + +} // namespace std + +#endif + +#endif diff --git a/cpp_src/cstdlib b/cpp_src/cstdlib new file mode 100644 index 0000000..5dba03f --- /dev/null +++ b/cpp_src/cstdlib @@ -0,0 +1,227 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file include/cstdlib + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c stdlib.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: 20.4.6 C library +// + +#ifndef _GLIBCXX_CSTDLIB +#define _GLIBCXX_CSTDLIB 1 + +#pragma GCC system_header + +#include +#include + +#if !_GLIBCXX_HOSTED +// The C standard does not require a freestanding implementation to +// provide . However, the C++ standard does still require +// -- but only the functionality mentioned in +// [lib.support.start.term]. + +#define EXIT_SUCCESS 0 +#define EXIT_FAILURE 1 + +namespace std { + + extern "C" void abort(void); + extern "C" int atexit(void (*)()); + extern "C" void exit(int); + +} // namespace std + +#else + +#include + +// Get rid of those macros defined in in lieu of real functions. +#undef abort +#undef abs +#undef atexit +#undef atof +#undef atoi +#undef atol +#undef bsearch +#undef calloc +#undef div +#undef exit +#undef free +#undef getenv +#undef labs +#undef ldiv +#undef malloc +#undef mblen +#undef mbstowcs +#undef mbtowc +#undef qsort +#undef rand +#undef realloc +#undef srand +#undef strtod +#undef strtol +#undef strtoul +#undef system +#undef wcstombs +#undef wctomb + +namespace std { + + using ::div_t; + using ::ldiv_t; + + using ::abort; + using ::abs; + using ::atexit; + using ::atof; + using ::atoi; + using ::atol; + using ::bsearch; + using ::calloc; + using ::div; + using ::exit; + using ::free; + using ::getenv; + using ::labs; + using ::ldiv; + using ::malloc; +#ifdef _GLIBCXX_HAVE_MBSTATE_T + using ::mblen; + using ::mbstowcs; + using ::mbtowc; +#endif // _GLIBCXX_HAVE_MBSTATE_T + using ::qsort; + using ::rand; + using ::realloc; + using ::srand; + using ::strtod; + using ::strtol; + using ::strtoul; + using ::system; +#ifdef _GLIBCXX_USE_WCHAR_T + using ::wcstombs; + using ::wctomb; +#endif // _GLIBCXX_USE_WCHAR_T + + inline long + abs(long __i) { return labs(__i); } + + inline ldiv_t + div(long __i, long __j) { return ldiv(__i, __j); } + +} // namespace std + +#if _GLIBCXX_USE_C99 + +#undef _Exit +#undef llabs +#undef lldiv +#undef atoll +#undef strtoll +#undef strtoull +#undef strtof +#undef strtold + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + +#if !_GLIBCXX_USE_C99_LONG_LONG_DYNAMIC + using ::lldiv_t; +#endif +#if _GLIBCXX_USE_C99_CHECK || _GLIBCXX_USE_C99_DYNAMIC + extern "C" void (_Exit)(int); +#endif +#if !_GLIBCXX_USE_C99_DYNAMIC + using ::_Exit; +#endif + + inline long long + abs(long long __x) { return __x >= 0 ? __x : -__x; } + +#if !_GLIBCXX_USE_C99_LONG_LONG_DYNAMIC + using ::llabs; + + inline lldiv_t + div(long long __n, long long __d) + { lldiv_t __q; __q.quot = __n / __d; __q.rem = __n % __d; return __q; } + + using ::lldiv; +#endif + +#if _GLIBCXX_USE_C99_LONG_LONG_CHECK || _GLIBCXX_USE_C99_LONG_LONG_DYNAMIC + extern "C" long long int (atoll)(const char *); + extern "C" long long int + (strtoll)(const char * restrict, char ** restrict, int); + extern "C" unsigned long long int + (strtoull)(const char * restrict, char ** restrict, int); +#endif +#if !_GLIBCXX_USE_C99_LONG_LONG_DYNAMIC + using ::atoll; + using ::strtoll; + using ::strtoull; +#endif + using ::strtof; + using ::strtold; + +} // namespace std + +namespace std { + +#if !_GLIBCXX_USE_C99_LONG_LONG_DYNAMIC + using ::__gnu_cxx::lldiv_t; +#endif + using ::__gnu_cxx::_Exit; + using ::__gnu_cxx::abs; +#if !_GLIBCXX_USE_C99_LONG_LONG_DYNAMIC + using ::__gnu_cxx::llabs; + using ::__gnu_cxx::div; + using ::__gnu_cxx::lldiv; +#endif + using ::__gnu_cxx::atoll; + using ::__gnu_cxx::strtof; + using ::__gnu_cxx::strtoll; + using ::__gnu_cxx::strtoull; + using ::__gnu_cxx::strtold; + +} // namespace std + +#endif // _GLIBCXX_USE_C99 + +#endif // !_GLIBCXX_HOSTED + +#endif diff --git a/cpp_src/cstring b/cpp_src/cstring new file mode 100644 index 0000000..a6e39e7 --- /dev/null +++ b/cpp_src/cstring @@ -0,0 +1,130 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file cstring + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c string.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: 20.4.6 C library +// + +#ifndef _GLIBCXX_CSTRING +#define _GLIBCXX_CSTRING 1 + +#pragma GCC system_header + +#include +#include +#include + +// Get rid of those macros defined in in lieu of real functions. +#undef memcpy +#undef memmove +#undef strcpy +#undef strncpy +#undef strcat +#undef strncat +#undef memcmp +#undef strcmp +#undef strcoll +#undef strncmp +#undef strxfrm +#undef memchr +#undef strchr +#undef strcspn +#undef strpbrk +#undef strrchr +#undef strspn +#undef strstr +#undef strtok +#undef memset +#undef strerror +#undef strlen + +namespace std { + + using ::memcpy; + using ::memmove; + using ::strcpy; + using ::strncpy; + using ::strcat; + using ::strncat; + using ::memcmp; + using ::strcmp; + using ::strcoll; + using ::strncmp; + using ::strxfrm; + using ::strcspn; + using ::strspn; + using ::strtok; + using ::memset; + using ::strerror; + using ::strlen; + + using ::memchr; + + inline void* + memchr(void* __p, int __c, size_t __n) + { return memchr(const_cast(__p), __c, __n); } + + using ::strchr; + + inline char* + strchr(char* __s1, int __n) + { return __builtin_strchr(const_cast(__s1), __n); } + + using ::strpbrk; + + inline char* + strpbrk(char* __s1, const char* __s2) + { return __builtin_strpbrk(const_cast(__s1), __s2); } + + using ::strrchr; + + inline char* + strrchr(char* __s1, int __n) + { return __builtin_strrchr(const_cast(__s1), __n); } + + using ::strstr; + + inline char* + strstr(char* __s1, const char* __s2) + { return __builtin_strstr(const_cast(__s1), __s2); } + +} // namespace std + +#endif diff --git a/cpp_src/ctime b/cpp_src/ctime new file mode 100644 index 0000000..3d6509d --- /dev/null +++ b/cpp_src/ctime @@ -0,0 +1,82 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file include/ctime + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c time.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: 20.5 Date and time +// + +#ifndef _GLIBCXX_CTIME +#define _GLIBCXX_CTIME 1 + +#pragma GCC system_header + +#include +#include + +// Get rid of those macros defined in in lieu of real functions. +#undef clock +#undef difftime +#undef mktime +#undef time +#undef asctime +#undef ctime +#undef gmtime +#undef localtime +#undef strftime + +namespace std { + + using ::clock_t; + using ::time_t; + using ::tm; + + using ::clock; + using ::difftime; + using ::mktime; + using ::time; + using ::asctime; + using ::ctime; + using ::gmtime; + using ::localtime; + using ::strftime; + +} // namespace std + +#endif diff --git a/cpp_src/cwchar b/cpp_src/cwchar new file mode 100644 index 0000000..dc9324f --- /dev/null +++ b/cpp_src/cwchar @@ -0,0 +1,282 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file include/cwchar + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c wchar.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: 21.4 +// + +#ifndef _GLIBCXX_CWCHAR +#define _GLIBCXX_CWCHAR 1 + +#pragma GCC system_header + +#include +#include +#include + +#if _GLIBCXX_HAVE_WCHAR_H +#include +#endif + +// Need to do a bit of trickery here with mbstate_t as char_traits +// assumes it is in wchar.h, regardless of wchar_t specializations. +#ifndef _GLIBCXX_HAVE_MBSTATE_T +extern "C" +{ + typedef struct + { + int __fill[6]; + } mbstate_t; +} +#endif + +namespace std { + + using ::mbstate_t; + +} // namespace std + +// Get rid of those macros defined in in lieu of real functions. +#undef btowc +#undef fgetwc +#undef fgetws +#undef fputwc +#undef fputws +#undef fwide +#undef fwprintf +#undef fwscanf +#undef getwc +#undef getwchar +#undef mbrlen +#undef mbrtowc +#undef mbsinit +#undef mbsrtowcs +#undef putwc +#undef putwchar +#undef swprintf +#undef swscanf +#undef ungetwc +#undef vfwprintf +#if _GLIBCXX_HAVE_VFWSCANF +# undef vfwscanf +#endif +#undef vswprintf +#if _GLIBCXX_HAVE_VSWSCANF +# undef vswscanf +#endif +#undef vwprintf +#if _GLIBCXX_HAVE_VWSCANF +# undef vwscanf +#endif +#undef wcrtomb +#undef wcscat +#undef wcschr +#undef wcscmp +#undef wcscoll +#undef wcscpy +#undef wcscspn +#undef wcsftime +#undef wcslen +#undef wcsncat +#undef wcsncmp +#undef wcsncpy +#undef wcspbrk +#undef wcsrchr +#undef wcsrtombs +#undef wcsspn +#undef wcsstr +#undef wcstod +#if _GLIBCXX_HAVE_WCSTOF +# undef wcstof +#endif +#undef wcstok +#undef wcstol +#undef wcstoul +#undef wcsxfrm +#undef wctob +#undef wmemchr +#undef wmemcmp +#undef wmemcpy +#undef wmemmove +#undef wmemset +#undef wprintf +#undef wscanf + +#if _GLIBCXX_USE_WCHAR_T + +namespace std { + + using ::wint_t; + + using ::btowc; + using ::fgetwc; + using ::fgetws; + using ::fputwc; + using ::fputws; + using ::fwide; + using ::fwprintf; + using ::fwscanf; + using ::getwc; + using ::getwchar; + using ::mbrlen; + using ::mbrtowc; + using ::mbsinit; + using ::mbsrtowcs; + using ::putwc; + using ::putwchar; + using ::swprintf; + using ::swscanf; + using ::ungetwc; + using ::vfwprintf; +#if _GLIBCXX_HAVE_VFWSCANF + using ::vfwscanf; +#endif + using ::vswprintf; +#if _GLIBCXX_HAVE_VSWSCANF + using ::vswscanf; +#endif + using ::vwprintf; +#if _GLIBCXX_HAVE_VWSCANF + using ::vwscanf; +#endif + using ::wcrtomb; + using ::wcscat; + using ::wcscmp; + using ::wcscoll; + using ::wcscpy; + using ::wcscspn; +#if _GLIBCXX_HAVE_WCSFTIME + using ::wcsftime; +#endif + using ::wcslen; + using ::wcsncat; + using ::wcsncmp; + using ::wcsncpy; + using ::wcsrtombs; + using ::wcsspn; + using ::wcstod; +#if _GLIBCXX_HAVE_WCSTOF + using ::wcstof; +#endif + using ::wcstok; + using ::wcstol; + using ::wcstoul; + using ::wcsxfrm; + using ::wctob; + using ::wmemcmp; + using ::wmemcpy; + using ::wmemmove; + using ::wmemset; + using ::wprintf; + using ::wscanf; + + using ::wcschr; + + inline wchar_t* + wcschr(wchar_t* __p, wchar_t __c) + { return wcschr(const_cast(__p), __c); } + + using ::wcspbrk; + + inline wchar_t* + wcspbrk(wchar_t* __s1, const wchar_t* __s2) + { return wcspbrk(const_cast(__s1), __s2); } + + using ::wcsrchr; + + inline wchar_t* + wcsrchr(wchar_t* __p, wchar_t __c) + { return wcsrchr(const_cast(__p), __c); } + + using ::wcsstr; + + inline wchar_t* + wcsstr(wchar_t* __s1, const wchar_t* __s2) + { return wcsstr(const_cast(__s1), __s2); } + + using ::wmemchr; + + inline wchar_t* + wmemchr(wchar_t* __p, wchar_t __c, size_t __n) + { return wmemchr(const_cast(__p), __c, __n); } + +} // namespace std + +#if _GLIBCXX_USE_C99 + +#undef wcstold +#undef wcstoll +#undef wcstoull + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + +#if _GLIBCXX_USE_C99_CHECK || _GLIBCXX_USE_C99_DYNAMIC + extern "C" long double + (wcstold)(const wchar_t * restrict, wchar_t ** restrict); +#endif +#if !_GLIBCXX_USE_C99_DYNAMIC + using ::wcstold; +#endif +#if _GLIBCXX_USE_C99_LONG_LONG_CHECK || _GLIBCXX_USE_C99_LONG_LONG_DYNAMIC + extern "C" long long int + (wcstoll)(const wchar_t * restrict, wchar_t ** restrict, int); + extern "C" unsigned long long int + (wcstoull)(const wchar_t * restrict, wchar_t ** restrict, int); +#endif +#if !_GLIBCXX_USE_C99_LONG_LONG_DYNAMIC + using ::wcstoll; + using ::wcstoull; +#endif + +} // namespace std + +namespace std { + + using ::__gnu_cxx::wcstold; + using ::__gnu_cxx::wcstoll; + using ::__gnu_cxx::wcstoull; + +} // namespace std + +#endif + +#endif //_GLIBCXX_USE_WCHAR_T + +#endif diff --git a/cpp_src/cwctype b/cpp_src/cwctype new file mode 100644 index 0000000..cf8301c --- /dev/null +++ b/cpp_src/cwctype @@ -0,0 +1,112 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file include/cwctype + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c wctype.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: +// + +#ifndef _GLIBCXX_CWCTYPE +#define _GLIBCXX_CWCTYPE 1 + +#pragma GCC system_header + +#include + +#if _GLIBCXX_HAVE_WCTYPE_H +#include +#endif + +// Get rid of those macros defined in in lieu of real functions. +#undef iswalnum +#undef iswalpha +#if _GLIBCXX_HAVE_ISWBLANK +# undef iswblank +#endif +#undef iswcntrl +#undef iswctype +#undef iswdigit +#undef iswgraph +#undef iswlower +#undef iswprint +#undef iswpunct +#undef iswspace +#undef iswupper +#undef iswxdigit +#undef towctrans +#undef towlower +#undef towupper +#undef wctrans +#undef wctype + +#if _GLIBCXX_USE_WCHAR_T + +namespace std { + + using ::wint_t; // cwchar + + using ::wctype_t; + using ::wctrans_t; + + using ::iswalnum; + using ::iswalpha; +#if _GLIBCXX_HAVE_ISWBLANK + using ::iswblank; +#endif + using ::iswcntrl; + using ::iswctype; + using ::iswdigit; + using ::iswgraph; + using ::iswlower; + using ::iswprint; + using ::iswpunct; + using ::iswspace; + using ::iswupper; + using ::iswxdigit; + using ::towctrans; + using ::towlower; + using ::towupper; + using ::wctrans; + using ::wctype; + +} // namespace std + +#endif //_GLIBCXX_USE_WCHAR_T + +#endif diff --git a/cpp_src/deque b/cpp_src/deque new file mode 100644 index 0000000..57c6e43 --- /dev/null +++ b/cpp_src/deque @@ -0,0 +1,80 @@ +// -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file include/deque + * This is a Standard C++ Library header. + */ + +#ifndef _GLIBCXX_DEQUE +#define _GLIBCXX_DEQUE 1 + +#pragma GCC system_header + +#include +#include +#include +#include +#include +#include + +#ifndef _GLIBCXX_EXPORT_TEMPLATE +# include +#endif + +#ifdef _GLIBCXX_DEBUG +# include +#endif + +#endif /* _GLIBCXX_DEQUE */ diff --git a/cpp_src/deque.tcc b/cpp_src/deque.tcc new file mode 100644 index 0000000..dcdcf3d --- /dev/null +++ b/cpp_src/deque.tcc @@ -0,0 +1,778 @@ +// Deque implementation (out of line) -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file deque.tcc + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _DEQUE_TCC +#define _DEQUE_TCC 1 + +namespace std { + + template + deque<_Tp, _Alloc>& + deque<_Tp, _Alloc>:: + operator=(const deque& __x) + { + const size_type __len = size(); + if (&__x != this) + { + if (__len >= __x.size()) + _M_erase_at_end(std::copy(__x.begin(), __x.end(), + this->_M_impl._M_start)); + else + { + const_iterator __mid = __x.begin() + difference_type(__len); + std::copy(__x.begin(), __mid, this->_M_impl._M_start); + insert(this->_M_impl._M_finish, __mid, __x.end()); + } + } + return *this; + } + + template + typename deque<_Tp, _Alloc>::iterator + deque<_Tp, _Alloc>:: + insert(iterator __position, const value_type& __x) + { + if (__position._M_cur == this->_M_impl._M_start._M_cur) + { + push_front(__x); + return this->_M_impl._M_start; + } + else if (__position._M_cur == this->_M_impl._M_finish._M_cur) + { + push_back(__x); + iterator __tmp = this->_M_impl._M_finish; + --__tmp; + return __tmp; + } + else + return _M_insert_aux(__position, __x); + } + + template + typename deque<_Tp, _Alloc>::iterator + deque<_Tp, _Alloc>:: + erase(iterator __position) + { + iterator __next = __position; + ++__next; + const difference_type __index = __position - begin(); + if (static_cast(__index) < (size() >> 1)) + { + if (__position != begin()) + std::copy_backward(begin(), __position, __next); + pop_front(); + } + else + { + if (__next != end()) + std::copy(__next, end(), __position); + pop_back(); + } + return begin() + __index; + } + + template + typename deque<_Tp, _Alloc>::iterator + deque<_Tp, _Alloc>:: + erase(iterator __first, iterator __last) + { + if (__first == begin() && __last == end()) + { + clear(); + return end(); + } + else + { + const difference_type __n = __last - __first; + const difference_type __elems_before = __first - begin(); + if (static_cast(__elems_before) <= (size() - __n) / 2) + { + if (__first != begin()) + std::copy_backward(begin(), __first, __last); + _M_erase_at_begin(begin() + __n); + } + else + { + if (__last != end()) + std::copy(__last, end(), __first); + _M_erase_at_end(end() - __n); + } + return begin() + __elems_before; + } + } + + template + template + void + deque<_Tp, _Alloc>:: + _M_assign_aux(_InputIterator __first, _InputIterator __last, + std::input_iterator_tag) + { + iterator __cur = begin(); + for (; __first != __last && __cur != end(); ++__cur, ++__first) + *__cur = *__first; + if (__first == __last) + _M_erase_at_end(__cur); + else + insert(end(), __first, __last); + } + + template + void + deque<_Tp, _Alloc>:: + _M_fill_insert(iterator __pos, size_type __n, const value_type& __x) + { + if (__pos._M_cur == this->_M_impl._M_start._M_cur) + { + iterator __new_start = _M_reserve_elements_at_front(__n); + try + { + std::__uninitialized_fill_a(__new_start, this->_M_impl._M_start, + __x, _M_get_Tp_allocator()); + this->_M_impl._M_start = __new_start; + } + catch(...) + { + _M_destroy_nodes(__new_start._M_node, + this->_M_impl._M_start._M_node); + __throw_exception_again; + } + } + else if (__pos._M_cur == this->_M_impl._M_finish._M_cur) + { + iterator __new_finish = _M_reserve_elements_at_back(__n); + try + { + std::__uninitialized_fill_a(this->_M_impl._M_finish, + __new_finish, __x, + _M_get_Tp_allocator()); + this->_M_impl._M_finish = __new_finish; + } + catch(...) + { + _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1, + __new_finish._M_node + 1); + __throw_exception_again; + } + } + else + _M_insert_aux(__pos, __n, __x); + } + + template + void + deque<_Tp, _Alloc>:: + _M_fill_initialize(const value_type& __value) + { + _Map_pointer __cur; + try + { + for (__cur = this->_M_impl._M_start._M_node; + __cur < this->_M_impl._M_finish._M_node; + ++__cur) + std::__uninitialized_fill_a(*__cur, *__cur + _S_buffer_size(), + __value, _M_get_Tp_allocator()); + std::__uninitialized_fill_a(this->_M_impl._M_finish._M_first, + this->_M_impl._M_finish._M_cur, + __value, _M_get_Tp_allocator()); + } + catch(...) + { + std::_Destroy(this->_M_impl._M_start, iterator(*__cur, __cur), + _M_get_Tp_allocator()); + __throw_exception_again; + } + } + + template + template + void + deque<_Tp, _Alloc>:: + _M_range_initialize(_InputIterator __first, _InputIterator __last, + std::input_iterator_tag) + { + this->_M_initialize_map(0); + try + { + for (; __first != __last; ++__first) + push_back(*__first); + } + catch(...) + { + clear(); + __throw_exception_again; + } + } + + template + template + void + deque<_Tp, _Alloc>:: + _M_range_initialize(_ForwardIterator __first, _ForwardIterator __last, + std::forward_iterator_tag) + { + const size_type __n = std::distance(__first, __last); + this->_M_initialize_map(__n); + + _Map_pointer __cur_node; + try + { + for (__cur_node = this->_M_impl._M_start._M_node; + __cur_node < this->_M_impl._M_finish._M_node; + ++__cur_node) + { + _ForwardIterator __mid = __first; + std::advance(__mid, _S_buffer_size()); + std::__uninitialized_copy_a(__first, __mid, *__cur_node, + _M_get_Tp_allocator()); + __first = __mid; + } + std::__uninitialized_copy_a(__first, __last, + this->_M_impl._M_finish._M_first, + _M_get_Tp_allocator()); + } + catch(...) + { + std::_Destroy(this->_M_impl._M_start, + iterator(*__cur_node, __cur_node), + _M_get_Tp_allocator()); + __throw_exception_again; + } + } + + // Called only if _M_impl._M_finish._M_cur == _M_impl._M_finish._M_last - 1. + template + void + deque<_Tp, _Alloc>:: + _M_push_back_aux(const value_type& __t) + { + value_type __t_copy = __t; + _M_reserve_map_at_back(); + *(this->_M_impl._M_finish._M_node + 1) = this->_M_allocate_node(); + try + { + this->_M_impl.construct(this->_M_impl._M_finish._M_cur, __t_copy); + this->_M_impl._M_finish._M_set_node(this->_M_impl._M_finish._M_node + + 1); + this->_M_impl._M_finish._M_cur = this->_M_impl._M_finish._M_first; + } + catch(...) + { + _M_deallocate_node(*(this->_M_impl._M_finish._M_node + 1)); + __throw_exception_again; + } + } + + // Called only if _M_impl._M_start._M_cur == _M_impl._M_start._M_first. + template + void + deque<_Tp, _Alloc>:: + _M_push_front_aux(const value_type& __t) + { + value_type __t_copy = __t; + _M_reserve_map_at_front(); + *(this->_M_impl._M_start._M_node - 1) = this->_M_allocate_node(); + try + { + this->_M_impl._M_start._M_set_node(this->_M_impl._M_start._M_node + - 1); + this->_M_impl._M_start._M_cur = this->_M_impl._M_start._M_last - 1; + this->_M_impl.construct(this->_M_impl._M_start._M_cur, __t_copy); + } + catch(...) + { + ++this->_M_impl._M_start; + _M_deallocate_node(*(this->_M_impl._M_start._M_node - 1)); + __throw_exception_again; + } + } + + // Called only if _M_impl._M_finish._M_cur == _M_impl._M_finish._M_first. + template + void deque<_Tp, _Alloc>:: + _M_pop_back_aux() + { + _M_deallocate_node(this->_M_impl._M_finish._M_first); + this->_M_impl._M_finish._M_set_node(this->_M_impl._M_finish._M_node - 1); + this->_M_impl._M_finish._M_cur = this->_M_impl._M_finish._M_last - 1; + this->_M_impl.destroy(this->_M_impl._M_finish._M_cur); + } + + // Called only if _M_impl._M_start._M_cur == _M_impl._M_start._M_last - 1. + // Note that if the deque has at least one element (a precondition for this + // member function), and if + // _M_impl._M_start._M_cur == _M_impl._M_start._M_last, + // then the deque must have at least two nodes. + template + void deque<_Tp, _Alloc>:: + _M_pop_front_aux() + { + this->_M_impl.destroy(this->_M_impl._M_start._M_cur); + _M_deallocate_node(this->_M_impl._M_start._M_first); + this->_M_impl._M_start._M_set_node(this->_M_impl._M_start._M_node + 1); + this->_M_impl._M_start._M_cur = this->_M_impl._M_start._M_first; + } + + template + template + void + deque<_Tp, _Alloc>:: + _M_range_insert_aux(iterator __pos, + _InputIterator __first, _InputIterator __last, + std::input_iterator_tag) + { std::copy(__first, __last, std::inserter(*this, __pos)); } + + template + template + void + deque<_Tp, _Alloc>:: + _M_range_insert_aux(iterator __pos, + _ForwardIterator __first, _ForwardIterator __last, + std::forward_iterator_tag) + { + const size_type __n = std::distance(__first, __last); + if (__pos._M_cur == this->_M_impl._M_start._M_cur) + { + iterator __new_start = _M_reserve_elements_at_front(__n); + try + { + std::__uninitialized_copy_a(__first, __last, __new_start, + _M_get_Tp_allocator()); + this->_M_impl._M_start = __new_start; + } + catch(...) + { + _M_destroy_nodes(__new_start._M_node, + this->_M_impl._M_start._M_node); + __throw_exception_again; + } + } + else if (__pos._M_cur == this->_M_impl._M_finish._M_cur) + { + iterator __new_finish = _M_reserve_elements_at_back(__n); + try + { + std::__uninitialized_copy_a(__first, __last, + this->_M_impl._M_finish, + _M_get_Tp_allocator()); + this->_M_impl._M_finish = __new_finish; + } + catch(...) + { + _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1, + __new_finish._M_node + 1); + __throw_exception_again; + } + } + else + _M_insert_aux(__pos, __first, __last, __n); + } + + template + typename deque<_Tp, _Alloc>::iterator + deque<_Tp, _Alloc>:: + _M_insert_aux(iterator __pos, const value_type& __x) + { + difference_type __index = __pos - this->_M_impl._M_start; + value_type __x_copy = __x; // XXX copy + if (static_cast(__index) < size() / 2) + { + push_front(front()); + iterator __front1 = this->_M_impl._M_start; + ++__front1; + iterator __front2 = __front1; + ++__front2; + __pos = this->_M_impl._M_start + __index; + iterator __pos1 = __pos; + ++__pos1; + std::copy(__front2, __pos1, __front1); + } + else + { + push_back(back()); + iterator __back1 = this->_M_impl._M_finish; + --__back1; + iterator __back2 = __back1; + --__back2; + __pos = this->_M_impl._M_start + __index; + std::copy_backward(__pos, __back2, __back1); + } + *__pos = __x_copy; + return __pos; + } + + template + void + deque<_Tp, _Alloc>:: + _M_insert_aux(iterator __pos, size_type __n, const value_type& __x) + { + const difference_type __elems_before = __pos - this->_M_impl._M_start; + const size_type __length = this->size(); + value_type __x_copy = __x; + if (__elems_before < difference_type(__length / 2)) + { + iterator __new_start = _M_reserve_elements_at_front(__n); + iterator __old_start = this->_M_impl._M_start; + __pos = this->_M_impl._M_start + __elems_before; + try + { + if (__elems_before >= difference_type(__n)) + { + iterator __start_n = (this->_M_impl._M_start + + difference_type(__n)); + std::__uninitialized_copy_a(this->_M_impl._M_start, + __start_n, __new_start, + _M_get_Tp_allocator()); + this->_M_impl._M_start = __new_start; + std::copy(__start_n, __pos, __old_start); + std::fill(__pos - difference_type(__n), __pos, __x_copy); + } + else + { + std::__uninitialized_copy_fill(this->_M_impl._M_start, + __pos, __new_start, + this->_M_impl._M_start, + __x_copy, + _M_get_Tp_allocator()); + this->_M_impl._M_start = __new_start; + std::fill(__old_start, __pos, __x_copy); + } + } + catch(...) + { + _M_destroy_nodes(__new_start._M_node, + this->_M_impl._M_start._M_node); + __throw_exception_again; + } + } + else + { + iterator __new_finish = _M_reserve_elements_at_back(__n); + iterator __old_finish = this->_M_impl._M_finish; + const difference_type __elems_after = + difference_type(__length) - __elems_before; + __pos = this->_M_impl._M_finish - __elems_after; + try + { + if (__elems_after > difference_type(__n)) + { + iterator __finish_n = (this->_M_impl._M_finish + - difference_type(__n)); + std::__uninitialized_copy_a(__finish_n, + this->_M_impl._M_finish, + this->_M_impl._M_finish, + _M_get_Tp_allocator()); + this->_M_impl._M_finish = __new_finish; + std::copy_backward(__pos, __finish_n, __old_finish); + std::fill(__pos, __pos + difference_type(__n), __x_copy); + } + else + { + std::__uninitialized_fill_copy(this->_M_impl._M_finish, + __pos + difference_type(__n), + __x_copy, __pos, + this->_M_impl._M_finish, + _M_get_Tp_allocator()); + this->_M_impl._M_finish = __new_finish; + std::fill(__pos, __old_finish, __x_copy); + } + } + catch(...) + { + _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1, + __new_finish._M_node + 1); + __throw_exception_again; + } + } + } + + template + template + void + deque<_Tp, _Alloc>:: + _M_insert_aux(iterator __pos, + _ForwardIterator __first, _ForwardIterator __last, + size_type __n) + { + const difference_type __elemsbefore = __pos - this->_M_impl._M_start; + const size_type __length = size(); + if (static_cast(__elemsbefore) < __length / 2) + { + iterator __new_start = _M_reserve_elements_at_front(__n); + iterator __old_start = this->_M_impl._M_start; + __pos = this->_M_impl._M_start + __elemsbefore; + try + { + if (__elemsbefore >= difference_type(__n)) + { + iterator __start_n = (this->_M_impl._M_start + + difference_type(__n)); + std::__uninitialized_copy_a(this->_M_impl._M_start, + __start_n, __new_start, + _M_get_Tp_allocator()); + this->_M_impl._M_start = __new_start; + std::copy(__start_n, __pos, __old_start); + std::copy(__first, __last, __pos - difference_type(__n)); + } + else + { + _ForwardIterator __mid = __first; + std::advance(__mid, difference_type(__n) - __elemsbefore); + std::__uninitialized_copy_copy(this->_M_impl._M_start, + __pos, __first, __mid, + __new_start, + _M_get_Tp_allocator()); + this->_M_impl._M_start = __new_start; + std::copy(__mid, __last, __old_start); + } + } + catch(...) + { + _M_destroy_nodes(__new_start._M_node, + this->_M_impl._M_start._M_node); + __throw_exception_again; + } + } + else + { + iterator __new_finish = _M_reserve_elements_at_back(__n); + iterator __old_finish = this->_M_impl._M_finish; + const difference_type __elemsafter = + difference_type(__length) - __elemsbefore; + __pos = this->_M_impl._M_finish - __elemsafter; + try + { + if (__elemsafter > difference_type(__n)) + { + iterator __finish_n = (this->_M_impl._M_finish + - difference_type(__n)); + std::__uninitialized_copy_a(__finish_n, + this->_M_impl._M_finish, + this->_M_impl._M_finish, + _M_get_Tp_allocator()); + this->_M_impl._M_finish = __new_finish; + std::copy_backward(__pos, __finish_n, __old_finish); + std::copy(__first, __last, __pos); + } + else + { + _ForwardIterator __mid = __first; + std::advance(__mid, __elemsafter); + std::__uninitialized_copy_copy(__mid, __last, __pos, + this->_M_impl._M_finish, + this->_M_impl._M_finish, + _M_get_Tp_allocator()); + this->_M_impl._M_finish = __new_finish; + std::copy(__first, __mid, __pos); + } + } + catch(...) + { + _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1, + __new_finish._M_node + 1); + __throw_exception_again; + } + } + } + + template + void + deque<_Tp, _Alloc>:: + _M_destroy_data_aux(iterator __first, iterator __last) + { + for (_Map_pointer __node = __first._M_node + 1; + __node < __last._M_node; ++__node) + std::_Destroy(*__node, *__node + _S_buffer_size(), + _M_get_Tp_allocator()); + + if (__first._M_node != __last._M_node) + { + std::_Destroy(__first._M_cur, __first._M_last, + _M_get_Tp_allocator()); + std::_Destroy(__last._M_first, __last._M_cur, + _M_get_Tp_allocator()); + } + else + std::_Destroy(__first._M_cur, __last._M_cur, + _M_get_Tp_allocator()); + } + + template + void + deque<_Tp, _Alloc>:: + _M_new_elements_at_front(size_type __new_elems) + { + if (this->max_size() - this->size() < __new_elems) + __throw_length_error(__N("deque::_M_new_elements_at_front")); + + const size_type __new_nodes = ((__new_elems + _S_buffer_size() - 1) + / _S_buffer_size()); + _M_reserve_map_at_front(__new_nodes); + size_type __i; + try + { + for (__i = 1; __i <= __new_nodes; ++__i) + *(this->_M_impl._M_start._M_node - __i) = this->_M_allocate_node(); + } + catch(...) + { + for (size_type __j = 1; __j < __i; ++__j) + _M_deallocate_node(*(this->_M_impl._M_start._M_node - __j)); + __throw_exception_again; + } + } + + template + void + deque<_Tp, _Alloc>:: + _M_new_elements_at_back(size_type __new_elems) + { + if (this->max_size() - this->size() < __new_elems) + __throw_length_error(__N("deque::_M_new_elements_at_back")); + + const size_type __new_nodes = ((__new_elems + _S_buffer_size() - 1) + / _S_buffer_size()); + _M_reserve_map_at_back(__new_nodes); + size_type __i; + try + { + for (__i = 1; __i <= __new_nodes; ++__i) + *(this->_M_impl._M_finish._M_node + __i) = this->_M_allocate_node(); + } + catch(...) + { + for (size_type __j = 1; __j < __i; ++__j) + _M_deallocate_node(*(this->_M_impl._M_finish._M_node + __j)); + __throw_exception_again; + } + } + + template + void + deque<_Tp, _Alloc>:: + _M_reallocate_map(size_type __nodes_to_add, bool __add_at_front) + { + const size_type __old_num_nodes + = this->_M_impl._M_finish._M_node - this->_M_impl._M_start._M_node + 1; + const size_type __new_num_nodes = __old_num_nodes + __nodes_to_add; + + _Map_pointer __new_nstart; + if (this->_M_impl._M_map_size > 2 * __new_num_nodes) + { + __new_nstart = this->_M_impl._M_map + (this->_M_impl._M_map_size + - __new_num_nodes) / 2 + + (__add_at_front ? __nodes_to_add : 0); + if (__new_nstart < this->_M_impl._M_start._M_node) + std::copy(this->_M_impl._M_start._M_node, + this->_M_impl._M_finish._M_node + 1, + __new_nstart); + else + std::copy_backward(this->_M_impl._M_start._M_node, + this->_M_impl._M_finish._M_node + 1, + __new_nstart + __old_num_nodes); + } + else + { + size_type __new_map_size = this->_M_impl._M_map_size + + std::max(this->_M_impl._M_map_size, + __nodes_to_add) + 2; + + _Map_pointer __new_map = this->_M_allocate_map(__new_map_size); + __new_nstart = __new_map + (__new_map_size - __new_num_nodes) / 2 + + (__add_at_front ? __nodes_to_add : 0); + std::copy(this->_M_impl._M_start._M_node, + this->_M_impl._M_finish._M_node + 1, + __new_nstart); + _M_deallocate_map(this->_M_impl._M_map, this->_M_impl._M_map_size); + + this->_M_impl._M_map = __new_map; + this->_M_impl._M_map_size = __new_map_size; + } + + this->_M_impl._M_start._M_set_node(__new_nstart); + this->_M_impl._M_finish._M_set_node(__new_nstart + __old_num_nodes - 1); + } + + // Overload for deque::iterators, exploiting the "segmented-iterator + // optimization". NB: leave const_iterators alone! + template + void + fill(const _Deque_iterator<_Tp, _Tp&, _Tp*>& __first, + const _Deque_iterator<_Tp, _Tp&, _Tp*>& __last, const _Tp& __value) + { + typedef typename _Deque_iterator<_Tp, _Tp&, _Tp*>::_Self _Self; + + for (typename _Self::_Map_pointer __node = __first._M_node + 1; + __node < __last._M_node; ++__node) + std::fill(*__node, *__node + _Self::_S_buffer_size(), __value); + + if (__first._M_node != __last._M_node) + { + std::fill(__first._M_cur, __first._M_last, __value); + std::fill(__last._M_first, __last._M_cur, __value); + } + else + std::fill(__first._M_cur, __last._M_cur, __value); + } + +} // namespace std + +#endif diff --git a/cpp_src/exception b/cpp_src/exception new file mode 100644 index 0000000..30191d0 --- /dev/null +++ b/cpp_src/exception @@ -0,0 +1,135 @@ +// Exception Handling support header for -*- C++ -*- + +// Copyright (C) 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, +// 2004, 2005, 2006, 2007 +// Free Software Foundation +// +// This file is part of GCC. +// +// GCC is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation; either version 2, or (at your option) +// any later version. +// +// GCC is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. +// +// You should have received a copy of the GNU General Public License +// along with GCC; see the file COPYING. If not, write to +// the Free Software Foundation, 51 Franklin Street, Fifth Floor, +// Boston, MA 02110-1301, USA. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file exception + * This is a Standard C++ Library header. + */ + +#ifndef __EXCEPTION__ +#define __EXCEPTION__ + +#pragma GCC visibility push(default) + +#include + +extern "C++" { + +namespace std +{ + /** + * @brief Base class for all library exceptions. + * + * This is the base class for all exceptions thrown by the standard + * library, and by certain language expressions. You are free to derive + * your own %exception classes, or use a different hierarchy, or to + * throw non-class data (e.g., fundamental types). + */ + class exception + { + public: + exception() throw() { } + virtual ~exception() throw(); + + /** Returns a C-style character string describing the general cause + * of the current error. */ + virtual const char* what() const throw(); + }; + + /** If an %exception is thrown which is not listed in a function's + * %exception specification, one of these may be thrown. */ + class bad_exception : public exception + { + public: + bad_exception() throw() { } + + // This declaration is not useless: + // http://gcc.gnu.org/onlinedocs/gcc-3.0.2/gcc_6.html#SEC118 + virtual ~bad_exception() throw(); + + // See comment in eh_exception.cc. + virtual const char* what() const throw(); + }; + + /// If you write a replacement %terminate handler, it must be of this type. + typedef void (*terminate_handler) (); + + /// If you write a replacement %unexpected handler, it must be of this type. + typedef void (*unexpected_handler) (); + + /// Takes a new handler function as an argument, returns the old function. + terminate_handler set_terminate(terminate_handler) throw(); + + /** The runtime will call this function if %exception handling must be + * abandoned for any reason. It can also be called by the user. */ + void terminate() __attribute__ ((__noreturn__)); + + /// Takes a new handler function as an argument, returns the old function. + unexpected_handler set_unexpected(unexpected_handler) throw(); + + /** The runtime will call this function if an %exception is thrown which + * violates the function's %exception specification. */ + void unexpected() __attribute__ ((__noreturn__)); + + /** [18.6.4]/1: "Returns true after completing evaluation of a + * throw-expression until either completing initialization of the + * exception-declaration in the matching handler or entering @c unexpected() + * due to the throw; or after entering @c terminate() for any reason + * other than an explicit call to @c terminate(). [Note: This includes + * stack unwinding [15.2]. end note]" + * + * 2: "When @c uncaught_exception() is true, throwing an %exception can + * result in a call of @c terminate() (15.5.1)." + */ + bool uncaught_exception() throw(); +} // namespace std + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + + /** A replacement for the standard terminate_handler which prints more + information about the terminating exception (if any) on stderr. Call + @code + std::set_terminate (__gnu_cxx::__verbose_terminate_handler) + @endcode + to use. For more info, see + http://gcc.gnu.org/onlinedocs/libstdc++/19_diagnostics/howto.html#4 + + In 3.4 and later, this is on by default. + */ + void __verbose_terminate_handler (); + +} // namespace std + +} // extern "C++" + +#pragma GCC visibility pop + +#endif diff --git a/cpp_src/exception_defines.h b/cpp_src/exception_defines.h new file mode 100644 index 0000000..446ed94 --- /dev/null +++ b/cpp_src/exception_defines.h @@ -0,0 +1,51 @@ +// -fno-exceptions Support -*- C++ -*- + +// Copyright (C) 2001, 2003 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +// +// ISO C++ 14882: 19.1 Exception classes +// + +/** @file exception_defines.h + * This is a Standard C++ Library header. + */ + +#ifndef _EXCEPTION_DEFINES_H +#define _EXCEPTION_DEFINES_H 1 + +#ifndef __EXCEPTIONS +// Iff -fno-exceptions, transform error handling code to work without it. +# define try if (true) +# define catch(X) if (false) +# define __throw_exception_again +#else +// Else proceed normally. +# define __throw_exception_again throw +#endif + +#endif diff --git a/cpp_src/fstream b/cpp_src/fstream new file mode 100644 index 0000000..40de910 --- /dev/null +++ b/cpp_src/fstream @@ -0,0 +1,808 @@ +// File based streams -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file fstream + * This is a Standard C++ Library header. + */ + +// +// ISO C++ 14882: 27.8 File-based streams +// + +#ifndef _GLIBCXX_FSTREAM +#define _GLIBCXX_FSTREAM 1 + +#pragma GCC system_header + +#include +#include +#include // For codecvt +#include // For SEEK_SET, SEEK_CUR, SEEK_END, BUFSIZ +#include +#include + +namespace std { + + // [27.8.1.1] template class basic_filebuf + /** + * @brief The actual work of input and output (for files). + * + * This class associates both its input and output sequence with an + * external disk file, and maintains a joint file position for both + * sequences. Many of its sematics are described in terms of similar + * behavior in the Standard C Library's @c FILE streams. + */ + // Requirements on traits_type, specific to this class: + // traits_type::pos_type must be fpos + // traits_type::off_type must be streamoff + // traits_type::state_type must be Assignable and DefaultConstructable, + // and traits_type::state_type() must be the initial state for codecvt. + template + class basic_filebuf : public basic_streambuf<_CharT, _Traits> + { + public: + // Types: + typedef _CharT char_type; + typedef _Traits traits_type; + typedef typename traits_type::int_type int_type; + typedef typename traits_type::pos_type pos_type; + typedef typename traits_type::off_type off_type; + + typedef basic_streambuf __streambuf_type; + typedef basic_filebuf __filebuf_type; + typedef __basic_file __file_type; + typedef typename traits_type::state_type __state_type; + typedef codecvt __codecvt_type; + + friend class ios_base; // For sync_with_stdio. + + protected: + // Data Members: + // MT lock inherited from libio or other low-level io library. + __c_lock _M_lock; + + // External buffer. + __file_type _M_file; + + /** + * @if maint + * Place to stash in || out || in | out settings for current filebuf. + * @endif + */ + ios_base::openmode _M_mode; + + // Beginning state type for codecvt. + __state_type _M_state_beg; + + // During output, the state that corresponds to pptr(), + // during input, the state that corresponds to egptr() and + // _M_ext_next. + __state_type _M_state_cur; + + // Not used for output. During input, the state that corresponds + // to eback() and _M_ext_buf. + __state_type _M_state_last; + + /** + * @if maint + * Pointer to the beginning of internal buffer. + * @endif + */ + char_type* _M_buf; + + /** + * @if maint + * Actual size of internal buffer. This number is equal to the size + * of the put area + 1 position, reserved for the overflow char of + * a full area. + * @endif + */ + size_t _M_buf_size; + + // Set iff _M_buf is allocated memory from _M_allocate_internal_buffer. + bool _M_buf_allocated; + + /** + * @if maint + * _M_reading == false && _M_writing == false for 'uncommitted' mode; + * _M_reading == true for 'read' mode; + * _M_writing == true for 'write' mode; + * + * NB: _M_reading == true && _M_writing == true is unused. + * @endif + */ + bool _M_reading; + bool _M_writing; + + //@{ + /** + * @if maint + * Necessary bits for putback buffer management. + * + * @note pbacks of over one character are not currently supported. + * @endif + */ + char_type _M_pback; + char_type* _M_pback_cur_save; + char_type* _M_pback_end_save; + bool _M_pback_init; + //@} + + // Cached codecvt facet. + const __codecvt_type* _M_codecvt; + + /** + * @if maint + * Buffer for external characters. Used for input when + * codecvt::always_noconv() == false. When valid, this corresponds + * to eback(). + * @endif + */ + char* _M_ext_buf; + + /** + * @if maint + * Size of buffer held by _M_ext_buf. + * @endif + */ + streamsize _M_ext_buf_size; + + /** + * @if maint + * Pointers into the buffer held by _M_ext_buf that delimit a + * subsequence of bytes that have been read but not yet converted. + * When valid, _M_ext_next corresponds to egptr(). + * @endif + */ + const char* _M_ext_next; + char* _M_ext_end; + + /** + * @if maint + * Initializes pback buffers, and moves normal buffers to safety. + * Assumptions: + * _M_in_cur has already been moved back + * @endif + */ + void + _M_create_pback() + { + if (!_M_pback_init) + { + _M_pback_cur_save = this->gptr(); + _M_pback_end_save = this->egptr(); + this->setg(&_M_pback, &_M_pback, &_M_pback + 1); + _M_pback_init = true; + } + } + + /** + * @if maint + * Deactivates pback buffer contents, and restores normal buffer. + * Assumptions: + * The pback buffer has only moved forward. + * @endif + */ + void + _M_destroy_pback() throw() + { + if (_M_pback_init) + { + // Length _M_in_cur moved in the pback buffer. + _M_pback_cur_save += this->gptr() != this->eback(); + this->setg(_M_buf, _M_pback_cur_save, _M_pback_end_save); + _M_pback_init = false; + } + } + + public: + // Constructors/destructor: + /** + * @brief Does not open any files. + * + * The default constructor initializes the parent class using its + * own default ctor. + */ + basic_filebuf(); + + /** + * @brief The destructor closes the file first. + */ + virtual + ~basic_filebuf() + { this->close(); } + + // Members: + /** + * @brief Returns true if the external file is open. + */ + bool + is_open() const throw() + { return _M_file.is_open(); } + + /** + * @brief Opens an external file. + * @param s The name of the file. + * @param mode The open mode flags. + * @return @c this on success, NULL on failure + * + * If a file is already open, this function immediately fails. + * Otherwise it tries to open the file named @a s using the flags + * given in @a mode. + * + * Table 92, adapted here, gives the relation between openmode + * combinations and the equivalent fopen() flags. + * (NB: lines in|out|app and binary|in|out|app per DR 596) + * +---------------------------------------------------------+ + * | ios_base Flag combination stdio equivalent | + * |binary in out trunc app | + * +---------------------------------------------------------+ + * | + "w" | + * | + + "a" | + * | + + "w" | + * | + "r" | + * | + + "r+" | + * | + + + "w+" | + * | + + + "a+" | + * +---------------------------------------------------------+ + * | + + "wb" | + * | + + + "ab" | + * | + + + "wb" | + * | + + "rb" | + * | + + + "r+b" | + * | + + + + "w+b" | + * | + + + + "a+b" | + * +---------------------------------------------------------+ + */ + __filebuf_type* + open(const char* __s, ios_base::openmode __mode); + + /** + * @brief Closes the currently associated file. + * @return @c this on success, NULL on failure + * + * If no file is currently open, this function immediately fails. + * + * If a "put buffer area" exists, @c overflow(eof) is called to flush + * all the characters. The file is then closed. + * + * If any operations fail, this function also fails. + */ + __filebuf_type* + close() throw(); + + protected: + void + _M_allocate_internal_buffer(); + + void + _M_destroy_internal_buffer() throw(); + + // [27.8.1.4] overridden virtual functions + virtual streamsize + showmanyc(); + + // Stroustrup, 1998, p. 628 + // underflow() and uflow() functions are called to get the next + // charater from the real input source when the buffer is empty. + // Buffered input uses underflow() + + virtual int_type + underflow(); + + virtual int_type + pbackfail(int_type __c = _Traits::eof()); + + // Stroustrup, 1998, p 648 + // The overflow() function is called to transfer characters to the + // real output destination when the buffer is full. A call to + // overflow(c) outputs the contents of the buffer plus the + // character c. + // 27.5.2.4.5 + // Consume some sequence of the characters in the pending sequence. + virtual int_type + overflow(int_type __c = _Traits::eof()); + + // Convert internal byte sequence to external, char-based + // sequence via codecvt. + bool + _M_convert_to_external(char_type*, streamsize); + + /** + * @brief Manipulates the buffer. + * @param s Pointer to a buffer area. + * @param n Size of @a s. + * @return @c this + * + * If no file has been opened, and both @a s and @a n are zero, then + * the stream becomes unbuffered. Otherwise, @c s is used as a + * buffer; see + * http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#2 + * for more. + */ + virtual __streambuf_type* + setbuf(char_type* __s, streamsize __n); + + virtual pos_type + seekoff(off_type __off, ios_base::seekdir __way, + ios_base::openmode __mode = ios_base::in | ios_base::out); + + virtual pos_type + seekpos(pos_type __pos, + ios_base::openmode __mode = ios_base::in | ios_base::out); + + // Common code for seekoff and seekpos + pos_type + _M_seek(off_type __off, ios_base::seekdir __way, __state_type __state); + + virtual int + sync(); + + virtual void + imbue(const locale& __loc); + + virtual streamsize + xsgetn(char_type* __s, streamsize __n); + + virtual streamsize + xsputn(const char_type* __s, streamsize __n); + + // Flushes output buffer, then writes unshift sequence. + bool + _M_terminate_output(); + + /** + * @if maint + * This function sets the pointers of the internal buffer, both get + * and put areas. Typically: + * + * __off == egptr() - eback() upon underflow/uflow ('read' mode); + * __off == 0 upon overflow ('write' mode); + * __off == -1 upon open, setbuf, seekoff/pos ('uncommitted' mode). + * + * NB: epptr() - pbase() == _M_buf_size - 1, since _M_buf_size + * reflects the actual allocated memory and the last cell is reserved + * for the overflow char of a full put area. + * @endif + */ + void + _M_set_buffer(streamsize __off) + { + const bool __testin = _M_mode & ios_base::in; + const bool __testout = _M_mode & ios_base::out; + + if (__testin && __off > 0) + this->setg(_M_buf, _M_buf, _M_buf + __off); + else + this->setg(_M_buf, _M_buf, _M_buf); + + if (__testout && __off == 0 && _M_buf_size > 1 ) + this->setp(_M_buf, _M_buf + _M_buf_size - 1); + else + this->setp(NULL, NULL); + } + }; + + // [27.8.1.5] Template class basic_ifstream + /** + * @brief Controlling input for files. + * + * This class supports reading from named files, using the inherited + * functions from std::basic_istream. To control the associated + * sequence, an instance of std::basic_filebuf is used, which this page + * refers to as @c sb. + */ + template + class basic_ifstream : public basic_istream<_CharT, _Traits> + { + public: + // Types: + typedef _CharT char_type; + typedef _Traits traits_type; + typedef typename traits_type::int_type int_type; + typedef typename traits_type::pos_type pos_type; + typedef typename traits_type::off_type off_type; + + // Non-standard types: + typedef basic_filebuf __filebuf_type; + typedef basic_istream __istream_type; + + private: + __filebuf_type _M_filebuf; + + public: + // Constructors/Destructors: + /** + * @brief Default constructor. + * + * Initializes @c sb using its default constructor, and passes + * @c &sb to the base class initializer. Does not open any files + * (you haven't given it a filename to open). + */ + basic_ifstream() : __istream_type(), _M_filebuf() + { this->init(&_M_filebuf); } + + /** + * @brief Create an input file stream. + * @param s Null terminated string specifying the filename. + * @param mode Open file in specified mode (see std::ios_base). + * + * @c ios_base::in is automatically included in @a mode. + * + * Tip: When using std::string to hold the filename, you must use + * .c_str() before passing it to this constructor. + */ + explicit + basic_ifstream(const char* __s, ios_base::openmode __mode = ios_base::in) + : __istream_type(), _M_filebuf() + { + this->init(&_M_filebuf); + this->open(__s, __mode); + } + + /** + * @brief The destructor does nothing. + * + * The file is closed by the filebuf object, not the formatting + * stream. + */ + ~basic_ifstream() + { } + + // Members: + /** + * @brief Accessing the underlying buffer. + * @return The current basic_filebuf buffer. + * + * This hides both signatures of std::basic_ios::rdbuf(). + */ + __filebuf_type* + rdbuf() const + { return const_cast<__filebuf_type*>(&_M_filebuf); } + + /** + * @brief Wrapper to test for an open file. + * @return @c rdbuf()->is_open() + */ + bool + is_open() + { return _M_filebuf.is_open(); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 365. Lack of const-qualification in clause 27 + bool + is_open() const + { return _M_filebuf.is_open(); } + + /** + * @brief Opens an external file. + * @param s The name of the file. + * @param mode The open mode flags. + * + * Calls @c std::basic_filebuf::open(s,mode|in). If that function + * fails, @c failbit is set in the stream's error state. + * + * Tip: When using std::string to hold the filename, you must use + * .c_str() before passing it to this constructor. + */ + void + open(const char* __s, ios_base::openmode __mode = ios_base::in) + { + if (!_M_filebuf.open(__s, __mode | ios_base::in)) + this->setstate(ios_base::failbit); + else + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 409. Closing an fstream should clear error state + this->clear(); + } + + /** + * @brief Close the file. + * + * Calls @c std::basic_filebuf::close(). If that function + * fails, @c failbit is set in the stream's error state. + */ + void + close() + { + if (!_M_filebuf.close()) + this->setstate(ios_base::failbit); + } + }; + + + // [27.8.1.8] Template class basic_ofstream + /** + * @brief Controlling output for files. + * + * This class supports reading from named files, using the inherited + * functions from std::basic_ostream. To control the associated + * sequence, an instance of std::basic_filebuf is used, which this page + * refers to as @c sb. + */ + template + class basic_ofstream : public basic_ostream<_CharT,_Traits> + { + public: + // Types: + typedef _CharT char_type; + typedef _Traits traits_type; + typedef typename traits_type::int_type int_type; + typedef typename traits_type::pos_type pos_type; + typedef typename traits_type::off_type off_type; + + // Non-standard types: + typedef basic_filebuf __filebuf_type; + typedef basic_ostream __ostream_type; + + private: + __filebuf_type _M_filebuf; + + public: + // Constructors: + /** + * @brief Default constructor. + * + * Initializes @c sb using its default constructor, and passes + * @c &sb to the base class initializer. Does not open any files + * (you haven't given it a filename to open). + */ + basic_ofstream(): __ostream_type(), _M_filebuf() + { this->init(&_M_filebuf); } + + /** + * @brief Create an output file stream. + * @param s Null terminated string specifying the filename. + * @param mode Open file in specified mode (see std::ios_base). + * + * @c ios_base::out|ios_base::trunc is automatically included in + * @a mode. + * + * Tip: When using std::string to hold the filename, you must use + * .c_str() before passing it to this constructor. + */ + explicit + basic_ofstream(const char* __s, + ios_base::openmode __mode = ios_base::out|ios_base::trunc) + : __ostream_type(), _M_filebuf() + { + this->init(&_M_filebuf); + this->open(__s, __mode); + } + + /** + * @brief The destructor does nothing. + * + * The file is closed by the filebuf object, not the formatting + * stream. + */ + ~basic_ofstream() + { } + + // Members: + /** + * @brief Accessing the underlying buffer. + * @return The current basic_filebuf buffer. + * + * This hides both signatures of std::basic_ios::rdbuf(). + */ + __filebuf_type* + rdbuf() const + { return const_cast<__filebuf_type*>(&_M_filebuf); } + + /** + * @brief Wrapper to test for an open file. + * @return @c rdbuf()->is_open() + */ + bool + is_open() + { return _M_filebuf.is_open(); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 365. Lack of const-qualification in clause 27 + bool + is_open() const + { return _M_filebuf.is_open(); } + + /** + * @brief Opens an external file. + * @param s The name of the file. + * @param mode The open mode flags. + * + * Calls @c std::basic_filebuf::open(s,mode|out|trunc). If that + * function fails, @c failbit is set in the stream's error state. + * + * Tip: When using std::string to hold the filename, you must use + * .c_str() before passing it to this constructor. + */ + void + open(const char* __s, + ios_base::openmode __mode = ios_base::out | ios_base::trunc) + { + if (!_M_filebuf.open(__s, __mode | ios_base::out)) + this->setstate(ios_base::failbit); + else + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 409. Closing an fstream should clear error state + this->clear(); + } + + /** + * @brief Close the file. + * + * Calls @c std::basic_filebuf::close(). If that function + * fails, @c failbit is set in the stream's error state. + */ + void + close() + { + if (!_M_filebuf.close()) + this->setstate(ios_base::failbit); + } + }; + + + // [27.8.1.11] Template class basic_fstream + /** + * @brief Controlling intput and output for files. + * + * This class supports reading from and writing to named files, using + * the inherited functions from std::basic_iostream. To control the + * associated sequence, an instance of std::basic_filebuf is used, which + * this page refers to as @c sb. + */ + template + class basic_fstream : public basic_iostream<_CharT, _Traits> + { + public: + // Types: + typedef _CharT char_type; + typedef _Traits traits_type; + typedef typename traits_type::int_type int_type; + typedef typename traits_type::pos_type pos_type; + typedef typename traits_type::off_type off_type; + + // Non-standard types: + typedef basic_filebuf __filebuf_type; + typedef basic_ios __ios_type; + typedef basic_iostream __iostream_type; + + private: + __filebuf_type _M_filebuf; + + public: + // Constructors/destructor: + /** + * @brief Default constructor. + * + * Initializes @c sb using its default constructor, and passes + * @c &sb to the base class initializer. Does not open any files + * (you haven't given it a filename to open). + */ + basic_fstream() + : __iostream_type(), _M_filebuf() + { this->init(&_M_filebuf); } + + /** + * @brief Create an input/output file stream. + * @param s Null terminated string specifying the filename. + * @param mode Open file in specified mode (see std::ios_base). + * + * Tip: When using std::string to hold the filename, you must use + * .c_str() before passing it to this constructor. + */ + explicit + basic_fstream(const char* __s, + ios_base::openmode __mode = ios_base::in | ios_base::out) + : __iostream_type(NULL), _M_filebuf() + { + this->init(&_M_filebuf); + this->open(__s, __mode); + } + + /** + * @brief The destructor does nothing. + * + * The file is closed by the filebuf object, not the formatting + * stream. + */ + ~basic_fstream() + { } + + // Members: + /** + * @brief Accessing the underlying buffer. + * @return The current basic_filebuf buffer. + * + * This hides both signatures of std::basic_ios::rdbuf(). + */ + __filebuf_type* + rdbuf() const + { return const_cast<__filebuf_type*>(&_M_filebuf); } + + /** + * @brief Wrapper to test for an open file. + * @return @c rdbuf()->is_open() + */ + bool + is_open() + { return _M_filebuf.is_open(); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 365. Lack of const-qualification in clause 27 + bool + is_open() const + { return _M_filebuf.is_open(); } + + /** + * @brief Opens an external file. + * @param s The name of the file. + * @param mode The open mode flags. + * + * Calls @c std::basic_filebuf::open(s,mode). If that + * function fails, @c failbit is set in the stream's error state. + * + * Tip: When using std::string to hold the filename, you must use + * .c_str() before passing it to this constructor. + */ + void + open(const char* __s, + ios_base::openmode __mode = ios_base::in | ios_base::out) + { + if (!_M_filebuf.open(__s, __mode)) + this->setstate(ios_base::failbit); + else + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 409. Closing an fstream should clear error state + this->clear(); + } + + /** + * @brief Close the file. + * + * Calls @c std::basic_filebuf::close(). If that function + * fails, @c failbit is set in the stream's error state. + */ + void + close() + { + if (!_M_filebuf.close()) + this->setstate(ios_base::failbit); + } + }; + +} // namespace std + +#ifndef _GLIBCXX_EXPORT_TEMPLATE +# include +#endif + +#endif /* _GLIBCXX_FSTREAM */ diff --git a/cpp_src/fstream.tcc b/cpp_src/fstream.tcc new file mode 100644 index 0000000..a18653e --- /dev/null +++ b/cpp_src/fstream.tcc @@ -0,0 +1,908 @@ +// File based streams -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file fstream.tcc + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 27.8 File-based streams +// + +#ifndef _FSTREAM_TCC +#define _FSTREAM_TCC 1 + +#pragma GCC system_header + +namespace std { + + template + void + basic_filebuf<_CharT, _Traits>:: + _M_allocate_internal_buffer() + { + // Allocate internal buffer only if one doesn't already exist + // (either allocated or provided by the user via setbuf). + if (!_M_buf_allocated && !_M_buf) + { + _M_buf = new char_type[_M_buf_size]; + _M_buf_allocated = true; + } + } + + template + void + basic_filebuf<_CharT, _Traits>:: + _M_destroy_internal_buffer() throw() + { + if (_M_buf_allocated) + { + delete [] _M_buf; + _M_buf = NULL; + _M_buf_allocated = false; + } + delete [] _M_ext_buf; + _M_ext_buf = NULL; + _M_ext_buf_size = 0; + _M_ext_next = NULL; + _M_ext_end = NULL; + } + + template + basic_filebuf<_CharT, _Traits>:: + basic_filebuf() : __streambuf_type(), _M_lock(), _M_file(&_M_lock), + _M_mode(ios_base::openmode(0)), _M_state_beg(), _M_state_cur(), + _M_state_last(), _M_buf(NULL), _M_buf_size(BUFSIZ), + _M_buf_allocated(false), _M_reading(false), _M_writing(false), _M_pback(), + _M_pback_cur_save(0), _M_pback_end_save(0), _M_pback_init(false), + _M_codecvt(0), _M_ext_buf(0), _M_ext_buf_size(0), _M_ext_next(0), + _M_ext_end(0) + { + if (has_facet<__codecvt_type>(this->_M_buf_locale)) + _M_codecvt = &use_facet<__codecvt_type>(this->_M_buf_locale); + } + + template + typename basic_filebuf<_CharT, _Traits>::__filebuf_type* + basic_filebuf<_CharT, _Traits>:: + open(const char* __s, ios_base::openmode __mode) + { + __filebuf_type *__ret = NULL; + if (!this->is_open()) + { + _M_file.open(__s, __mode); + if (this->is_open()) + { + _M_allocate_internal_buffer(); + _M_mode = __mode; + + // Setup initial buffer to 'uncommitted' mode. + _M_reading = false; + _M_writing = false; + _M_set_buffer(-1); + + // Reset to initial state. + _M_state_last = _M_state_cur = _M_state_beg; + + // 27.8.1.3,4 + if ((__mode & ios_base::ate) + && this->seekoff(0, ios_base::end, __mode) + == pos_type(off_type(-1))) + this->close(); + else + __ret = this; + } + } + return __ret; + } + + template + typename basic_filebuf<_CharT, _Traits>::__filebuf_type* + basic_filebuf<_CharT, _Traits>:: + close() throw() + { + __filebuf_type* __ret = NULL; + if (this->is_open()) + { + bool __testfail = false; + try + { + if (!_M_terminate_output()) + __testfail = true; + } + catch(...) + { __testfail = true; } + + // NB: Do this here so that re-opened filebufs will be cool... + _M_mode = ios_base::openmode(0); + _M_pback_init = false; + _M_destroy_internal_buffer(); + _M_reading = false; + _M_writing = false; + _M_set_buffer(-1); + _M_state_last = _M_state_cur = _M_state_beg; + + if (!_M_file.close()) + __testfail = true; + + if (!__testfail) + __ret = this; + } + return __ret; + } + + template + streamsize + basic_filebuf<_CharT, _Traits>:: + showmanyc() + { + streamsize __ret = -1; + const bool __testin = _M_mode & ios_base::in; + if (__testin && this->is_open()) + { + // For a stateful encoding (-1) the pending sequence might be just + // shift and unshift prefixes with no actual character. + __ret = this->egptr() - this->gptr(); + +#if _GLIBCXX_HAVE_DOS_BASED_FILESYSTEM + // About this workaround, see libstdc++/20806. + const bool __testbinary = _M_mode & ios_base::binary; + if (__check_facet(_M_codecvt).encoding() >= 0 + && __testbinary) +#else + if (__check_facet(_M_codecvt).encoding() >= 0) +#endif + __ret += _M_file.showmanyc() / _M_codecvt->max_length(); + } + return __ret; + } + + template + typename basic_filebuf<_CharT, _Traits>::int_type + basic_filebuf<_CharT, _Traits>:: + underflow() + { + int_type __ret = traits_type::eof(); + const bool __testin = _M_mode & ios_base::in; + if (__testin && !_M_writing) + { + // Check for pback madness, and if so switch back to the + // normal buffers and jet outta here before expensive + // fileops happen... + _M_destroy_pback(); + + if (this->gptr() < this->egptr()) + return traits_type::to_int_type(*this->gptr()); + + // Get and convert input sequence. + const size_t __buflen = _M_buf_size > 1 ? _M_buf_size - 1 : 1; + + // Will be set to true if ::read() returns 0 indicating EOF. + bool __got_eof = false; + // Number of internal characters produced. + streamsize __ilen = 0; + codecvt_base::result __r = codecvt_base::ok; + if (__check_facet(_M_codecvt).always_noconv()) + { + __ilen = _M_file.xsgetn(reinterpret_cast(this->eback()), + __buflen); + if (__ilen == 0) + __got_eof = true; + } + else + { + // Worst-case number of external bytes. + // XXX Not done encoding() == -1. + const int __enc = _M_codecvt->encoding(); + streamsize __blen; // Minimum buffer size. + streamsize __rlen; // Number of chars to read. + if (__enc > 0) + __blen = __rlen = __buflen * __enc; + else + { + __blen = __buflen + _M_codecvt->max_length() - 1; + __rlen = __buflen; + } + const streamsize __remainder = _M_ext_end - _M_ext_next; + __rlen = __rlen > __remainder ? __rlen - __remainder : 0; + + // An imbue in 'read' mode implies first converting the external + // chars already present. + if (_M_reading && this->egptr() == this->eback() && __remainder) + __rlen = 0; + + // Allocate buffer if necessary and move unconverted + // bytes to front. + if (_M_ext_buf_size < __blen) + { + char* __buf = new char[__blen]; + if (__remainder) + std::memcpy(__buf, _M_ext_next, __remainder); + + delete [] _M_ext_buf; + _M_ext_buf = __buf; + _M_ext_buf_size = __blen; + } + else if (__remainder) + std::memmove(_M_ext_buf, _M_ext_next, __remainder); + + _M_ext_next = _M_ext_buf; + _M_ext_end = _M_ext_buf + __remainder; + _M_state_last = _M_state_cur; + + do + { + if (__rlen > 0) + { + // Sanity check! + // This may fail if the return value of + // codecvt::max_length() is bogus. + if (_M_ext_end - _M_ext_buf + __rlen > _M_ext_buf_size) + { + __throw_ios_failure(__N("basic_filebuf::underflow " + "codecvt::max_length() " + "is not valid")); + } + streamsize __elen = _M_file.xsgetn(_M_ext_end, __rlen); + if (__elen == 0) + __got_eof = true; + else if (__elen == -1) + break; + _M_ext_end += __elen; + } + + char_type* __iend; + __r = _M_codecvt->in(_M_state_cur, _M_ext_next, + _M_ext_end, _M_ext_next, this->eback(), + this->eback() + __buflen, __iend); + if (__r == codecvt_base::noconv) + { + size_t __avail = _M_ext_end - _M_ext_buf; + __ilen = std::min(__avail, __buflen); + traits_type::copy(this->eback(), + reinterpret_cast(_M_ext_buf), __ilen); + _M_ext_next = _M_ext_buf + __ilen; + } + else + __ilen = __iend - this->eback(); + + // _M_codecvt->in may return error while __ilen > 0: this is + // ok, and actually occurs in case of mixed encodings (e.g., + // XML files). + if (__r == codecvt_base::error) + break; + + __rlen = 1; + } + while (__ilen == 0 && !__got_eof); + } + + if (__ilen > 0) + { + _M_set_buffer(__ilen); + _M_reading = true; + __ret = traits_type::to_int_type(*this->gptr()); + } + else if (__got_eof) + { + // If the actual end of file is reached, set 'uncommitted' + // mode, thus allowing an immediate write without an + // intervening seek. + _M_set_buffer(-1); + _M_reading = false; + // However, reaching it while looping on partial means that + // the file has got an incomplete character. + if (__r == codecvt_base::partial) + __throw_ios_failure(__N("basic_filebuf::underflow " + "incomplete character in file")); + } + else if (__r == codecvt_base::error) + __throw_ios_failure(__N("basic_filebuf::underflow " + "invalid byte sequence in file")); + else + __throw_ios_failure(__N("basic_filebuf::underflow " + "error reading the file")); + } + return __ret; + } + + template + typename basic_filebuf<_CharT, _Traits>::int_type + basic_filebuf<_CharT, _Traits>:: + pbackfail(int_type __i) + { + int_type __ret = traits_type::eof(); + const bool __testin = _M_mode & ios_base::in; + if (__testin && !_M_writing) + { + // Remember whether the pback buffer is active, otherwise below + // we may try to store in it a second char (libstdc++/9761). + const bool __testpb = _M_pback_init; + const bool __testeof = traits_type::eq_int_type(__i, __ret); + int_type __tmp; + if (this->eback() < this->gptr()) + { + this->gbump(-1); + __tmp = traits_type::to_int_type(*this->gptr()); + } + else if (this->seekoff(-1, ios_base::cur) != pos_type(off_type(-1))) + { + __tmp = this->underflow(); + if (traits_type::eq_int_type(__tmp, __ret)) + return __ret; + } + else + { + // At the beginning of the buffer, need to make a + // putback position available. But the seek may fail + // (f.i., at the beginning of a file, see + // libstdc++/9439) and in that case we return + // traits_type::eof(). + return __ret; + } + + // Try to put back __i into input sequence in one of three ways. + // Order these tests done in is unspecified by the standard. + if (!__testeof && traits_type::eq_int_type(__i, __tmp)) + __ret = __i; + else if (__testeof) + __ret = traits_type::not_eof(__i); + else if (!__testpb) + { + _M_create_pback(); + _M_reading = true; + *this->gptr() = traits_type::to_char_type(__i); + __ret = __i; + } + } + return __ret; + } + + template + typename basic_filebuf<_CharT, _Traits>::int_type + basic_filebuf<_CharT, _Traits>:: + overflow(int_type __c) + { + int_type __ret = traits_type::eof(); + const bool __testeof = traits_type::eq_int_type(__c, __ret); + const bool __testout = _M_mode & ios_base::out; + if (__testout && !_M_reading) + { + if (this->pbase() < this->pptr()) + { + // If appropriate, append the overflow char. + if (!__testeof) + { + *this->pptr() = traits_type::to_char_type(__c); + this->pbump(1); + } + + // Convert pending sequence to external representation, + // and output. + if (_M_convert_to_external(this->pbase(), + this->pptr() - this->pbase())) + { + _M_set_buffer(0); + __ret = traits_type::not_eof(__c); + } + } + else if (_M_buf_size > 1) + { + // Overflow in 'uncommitted' mode: set _M_writing, set + // the buffer to the initial 'write' mode, and put __c + // into the buffer. + _M_set_buffer(0); + _M_writing = true; + if (!__testeof) + { + *this->pptr() = traits_type::to_char_type(__c); + this->pbump(1); + } + __ret = traits_type::not_eof(__c); + } + else + { + // Unbuffered. + char_type __conv = traits_type::to_char_type(__c); + if (__testeof || _M_convert_to_external(&__conv, 1)) + { + _M_writing = true; + __ret = traits_type::not_eof(__c); + } + } + } + return __ret; + } + + template + bool + basic_filebuf<_CharT, _Traits>:: + _M_convert_to_external(_CharT* __ibuf, streamsize __ilen) + { + // Sizes of external and pending output. + streamsize __elen; + streamsize __plen; + if (__check_facet(_M_codecvt).always_noconv()) + { + __elen = _M_file.xsputn(reinterpret_cast(__ibuf), __ilen); + __plen = __ilen; + } + else + { + // Worst-case number of external bytes needed. + // XXX Not done encoding() == -1. + streamsize __blen = __ilen * _M_codecvt->max_length(); + char* __buf = static_cast(__builtin_alloca(__blen)); + + char* __bend; + const char_type* __iend; + codecvt_base::result __r; + __r = _M_codecvt->out(_M_state_cur, __ibuf, __ibuf + __ilen, + __iend, __buf, __buf + __blen, __bend); + + if (__r == codecvt_base::ok || __r == codecvt_base::partial) + __blen = __bend - __buf; + else if (__r == codecvt_base::noconv) + { + // Same as the always_noconv case above. + __buf = reinterpret_cast(__ibuf); + __blen = __ilen; + } + else + __throw_ios_failure(__N("basic_filebuf::_M_convert_to_external " + "conversion error")); + + __elen = _M_file.xsputn(__buf, __blen); + __plen = __blen; + + // Try once more for partial conversions. + if (__r == codecvt_base::partial && __elen == __plen) + { + const char_type* __iresume = __iend; + streamsize __rlen = this->pptr() - __iend; + __r = _M_codecvt->out(_M_state_cur, __iresume, + __iresume + __rlen, __iend, __buf, + __buf + __blen, __bend); + if (__r != codecvt_base::error) + { + __rlen = __bend - __buf; + __elen = _M_file.xsputn(__buf, __rlen); + __plen = __rlen; + } + else + __throw_ios_failure(__N("basic_filebuf::_M_convert_to_external " + "conversion error")); + } + } + return __elen == __plen; + } + + template + streamsize + basic_filebuf<_CharT, _Traits>:: + xsgetn(_CharT* __s, streamsize __n) + { + // Clear out pback buffer before going on to the real deal... + streamsize __ret = 0; + if (_M_pback_init) + { + if (__n > 0 && this->gptr() == this->eback()) + { + *__s++ = *this->gptr(); + this->gbump(1); + __ret = 1; + --__n; + } + _M_destroy_pback(); + } + + // Optimization in the always_noconv() case, to be generalized in the + // future: when __n > __buflen we read directly instead of using the + // buffer repeatedly. + const bool __testin = _M_mode & ios_base::in; + const streamsize __buflen = _M_buf_size > 1 ? _M_buf_size - 1 : 1; + + if (__n > __buflen && __check_facet(_M_codecvt).always_noconv() + && __testin && !_M_writing) + { + // First, copy the chars already present in the buffer. + const streamsize __avail = this->egptr() - this->gptr(); + if (__avail != 0) + { + if (__avail == 1) + *__s = *this->gptr(); + else + traits_type::copy(__s, this->gptr(), __avail); + __s += __avail; + this->gbump(__avail); + __ret += __avail; + __n -= __avail; + } + + // Need to loop in case of short reads (relatively common + // with pipes). + streamsize __len; + for (;;) + { + __len = _M_file.xsgetn(reinterpret_cast(__s), + __n); + if (__len == -1) + __throw_ios_failure(__N("basic_filebuf::xsgetn " + "error reading the file")); + if (__len == 0) + break; + + __n -= __len; + __ret += __len; + if (__n == 0) + break; + + __s += __len; + } + + if (__n == 0) + { + _M_set_buffer(0); + _M_reading = true; + } + else if (__len == 0) + { + // If end of file is reached, set 'uncommitted' + // mode, thus allowing an immediate write without + // an intervening seek. + _M_set_buffer(-1); + _M_reading = false; + } + } + else + __ret += __streambuf_type::xsgetn(__s, __n); + + return __ret; + } + + template + streamsize + basic_filebuf<_CharT, _Traits>:: + xsputn(const _CharT* __s, streamsize __n) + { + // Optimization in the always_noconv() case, to be generalized in the + // future: when __n is sufficiently large we write directly instead of + // using the buffer. + streamsize __ret = 0; + const bool __testout = _M_mode & ios_base::out; + if (__check_facet(_M_codecvt).always_noconv() + && __testout && !_M_reading) + { + // Measurement would reveal the best choice. + const streamsize __chunk = 1ul << 10; + streamsize __bufavail = this->epptr() - this->pptr(); + + // Don't mistake 'uncommitted' mode buffered with unbuffered. + if (!_M_writing && _M_buf_size > 1) + __bufavail = _M_buf_size - 1; + + const streamsize __limit = std::min(__chunk, __bufavail); + if (__n >= __limit) + { + const streamsize __buffill = this->pptr() - this->pbase(); + const char* __buf = reinterpret_cast(this->pbase()); + __ret = _M_file.xsputn_2(__buf, __buffill, + reinterpret_cast(__s), + __n); + if (__ret == __buffill + __n) + { + _M_set_buffer(0); + _M_writing = true; + } + if (__ret > __buffill) + __ret -= __buffill; + else + __ret = 0; + } + else + __ret = __streambuf_type::xsputn(__s, __n); + } + else + __ret = __streambuf_type::xsputn(__s, __n); + return __ret; + } + + template + typename basic_filebuf<_CharT, _Traits>::__streambuf_type* + basic_filebuf<_CharT, _Traits>:: + setbuf(char_type* __s, streamsize __n) + { + if (!this->is_open()) + if (__s == 0 && __n == 0) + _M_buf_size = 1; + else if (__s && __n > 0) + { + // This is implementation-defined behavior, and assumes that + // an external char_type array of length __n exists and has + // been pre-allocated. If this is not the case, things will + // quickly blow up. When __n > 1, __n - 1 positions will be + // used for the get area, __n - 1 for the put area and 1 + // position to host the overflow char of a full put area. + // When __n == 1, 1 position will be used for the get area + // and 0 for the put area, as in the unbuffered case above. + _M_buf = __s; + _M_buf_size = __n; + } + return this; + } + + + // According to 27.8.1.4 p11 - 13, seekoff should ignore the last + // argument (of type openmode). + template + typename basic_filebuf<_CharT, _Traits>::pos_type + basic_filebuf<_CharT, _Traits>:: + seekoff(off_type __off, ios_base::seekdir __way, ios_base::openmode) + { + int __width = 0; + if (_M_codecvt) + __width = _M_codecvt->encoding(); + if (__width < 0) + __width = 0; + + pos_type __ret = pos_type(off_type(-1)); + const bool __testfail = __off != 0 && __width <= 0; + if (this->is_open() && !__testfail) + { + // Ditch any pback buffers to avoid confusion. + _M_destroy_pback(); + + // Correct state at destination. Note that this is the correct + // state for the current position during output, because + // codecvt::unshift() returns the state to the initial state. + // This is also the correct state at the end of the file because + // an unshift sequence should have been written at the end. + __state_type __state = _M_state_beg; + off_type __computed_off = __off * __width; + if (_M_reading && __way == ios_base::cur) + { + if (_M_codecvt->always_noconv()) + __computed_off += this->gptr() - this->egptr(); + else + { + // Calculate offset from _M_ext_buf that corresponds + // to gptr(). Note: uses _M_state_last, which + // corresponds to eback(). + const int __gptr_off = + _M_codecvt->length(_M_state_last, _M_ext_buf, _M_ext_next, + this->gptr() - this->eback()); + __computed_off += _M_ext_buf + __gptr_off - _M_ext_end; + + // _M_state_last is modified by codecvt::length() so + // it now corresponds to gptr(). + __state = _M_state_last; + } + } + __ret = _M_seek(__computed_off, __way, __state); + } + return __ret; + } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 171. Strange seekpos() semantics due to joint position + // According to the resolution of DR 171, seekpos should ignore the last + // argument (of type openmode). + template + typename basic_filebuf<_CharT, _Traits>::pos_type + basic_filebuf<_CharT, _Traits>:: + seekpos(pos_type __pos, ios_base::openmode) + { + pos_type __ret = pos_type(off_type(-1)); + if (this->is_open()) + { + // Ditch any pback buffers to avoid confusion. + _M_destroy_pback(); + __ret = _M_seek(off_type(__pos), ios_base::beg, __pos.state()); + } + return __ret; + } + + template + typename basic_filebuf<_CharT, _Traits>::pos_type + basic_filebuf<_CharT, _Traits>:: + _M_seek(off_type __off, ios_base::seekdir __way, __state_type __state) + { + pos_type __ret = pos_type(off_type(-1)); + if (_M_terminate_output()) + { + // Returns pos_type(off_type(-1)) in case of failure. + __ret = pos_type(_M_file.seekoff(__off, __way)); + if (__ret != pos_type(off_type(-1))) + { + _M_reading = false; + _M_writing = false; + _M_ext_next = _M_ext_end = _M_ext_buf; + _M_set_buffer(-1); + _M_state_cur = __state; + __ret.state(_M_state_cur); + } + } + return __ret; + } + + template + bool + basic_filebuf<_CharT, _Traits>:: + _M_terminate_output() + { + // Part one: update the output sequence. + bool __testvalid = true; + if (this->pbase() < this->pptr()) + { + const int_type __tmp = this->overflow(); + if (traits_type::eq_int_type(__tmp, traits_type::eof())) + __testvalid = false; + } + + // Part two: output unshift sequence. + if (_M_writing && !__check_facet(_M_codecvt).always_noconv() + && __testvalid) + { + // Note: this value is arbitrary, since there is no way to + // get the length of the unshift sequence from codecvt, + // without calling unshift. + const size_t __blen = 128; + char __buf[__blen]; + codecvt_base::result __r; + streamsize __ilen = 0; + + do + { + char* __next; + __r = _M_codecvt->unshift(_M_state_cur, __buf, + __buf + __blen, __next); + if (__r == codecvt_base::error) + __testvalid = false; + else if (__r == codecvt_base::ok || + __r == codecvt_base::partial) + { + __ilen = __next - __buf; + if (__ilen > 0) + { + const streamsize __elen = _M_file.xsputn(__buf, __ilen); + if (__elen != __ilen) + __testvalid = false; + } + } + } + while (__r == codecvt_base::partial && __ilen > 0 && __testvalid); + + if (__testvalid) + { + // This second call to overflow() is required by the standard, + // but it's not clear why it's needed, since the output buffer + // should be empty by this point (it should have been emptied + // in the first call to overflow()). + const int_type __tmp = this->overflow(); + if (traits_type::eq_int_type(__tmp, traits_type::eof())) + __testvalid = false; + } + } + return __testvalid; + } + + template + int + basic_filebuf<_CharT, _Traits>:: + sync() + { + // Make sure that the internal buffer resyncs its idea of + // the file position with the external file. + int __ret = 0; + if (this->pbase() < this->pptr()) + { + const int_type __tmp = this->overflow(); + if (traits_type::eq_int_type(__tmp, traits_type::eof())) + __ret = -1; + } + return __ret; + } + + template + void + basic_filebuf<_CharT, _Traits>:: + imbue(const locale& __loc) + { + bool __testvalid = true; + + const __codecvt_type* _M_codecvt_tmp = 0; + if (__builtin_expect(has_facet<__codecvt_type>(__loc), true)) + _M_codecvt_tmp = &use_facet<__codecvt_type>(__loc); + + if (this->is_open()) + { + // encoding() == -1 is ok only at the beginning. + if ((_M_reading || _M_writing) + && __check_facet(_M_codecvt).encoding() == -1) + __testvalid = false; + else + { + if (_M_reading) + { + if (__check_facet(_M_codecvt).always_noconv()) + { + if (_M_codecvt_tmp + && !__check_facet(_M_codecvt_tmp).always_noconv()) + __testvalid = this->seekoff(0, ios_base::cur, _M_mode) + != pos_type(off_type(-1)); + } + else + { + // External position corresponding to gptr(). + _M_ext_next = _M_ext_buf + + _M_codecvt->length(_M_state_last, _M_ext_buf, _M_ext_next, + this->gptr() - this->eback()); + const streamsize __remainder = _M_ext_end - _M_ext_next; + if (__remainder) + std::memmove(_M_ext_buf, _M_ext_next, __remainder); + + _M_ext_next = _M_ext_buf; + _M_ext_end = _M_ext_buf + __remainder; + _M_set_buffer(-1); + _M_state_last = _M_state_cur = _M_state_beg; + } + } + else if (_M_writing && (__testvalid = _M_terminate_output())) + _M_set_buffer(-1); + } + } + + if (__testvalid) + _M_codecvt = _M_codecvt_tmp; + else + _M_codecvt = 0; + } + + // Inhibit implicit instantiations for required instantiations, + // which are defined via explicit instantiations elsewhere. + // NB: This syntax is a GNU extension. +#if _GLIBCXX_EXTERN_TEMPLATE + extern template class basic_filebuf; + extern template class basic_ifstream; + extern template class basic_ofstream; + extern template class basic_fstream; + +#ifdef _GLIBCXX_USE_WCHAR_T + extern template class basic_filebuf; + extern template class basic_ifstream; + extern template class basic_ofstream; + extern template class basic_fstream; +#endif +#endif + +} // namespace std + +#endif diff --git a/cpp_src/functexcept.h b/cpp_src/functexcept.h new file mode 100644 index 0000000..2c29197 --- /dev/null +++ b/cpp_src/functexcept.h @@ -0,0 +1,95 @@ +// Function-Based Exception Support -*- C++ -*- + +// Copyright (C) 2001, 2004, 2005 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file functexcept.h + * This header provides support for -fno-exceptions. + */ + +// +// ISO C++ 14882: 19.1 Exception classes +// + +#ifndef _FUNCTEXCEPT_H +#define _FUNCTEXCEPT_H 1 + +#include +#include + +namespace std { + + // Helper for exception objects in + void + __throw_bad_exception(void) __attribute__((__noreturn__)); + + // Helper for exception objects in + void + __throw_bad_alloc(void) __attribute__((__noreturn__)); + + // Helper for exception objects in + void + __throw_bad_cast(void) __attribute__((__noreturn__)); + + void + __throw_bad_typeid(void) __attribute__((__noreturn__)); + + // Helpers for exception objects in + void + __throw_logic_error(const char*) __attribute__((__noreturn__)); + + void + __throw_domain_error(const char*) __attribute__((__noreturn__)); + + void + __throw_invalid_argument(const char*) __attribute__((__noreturn__)); + + void + __throw_length_error(const char*) __attribute__((__noreturn__)); + + void + __throw_out_of_range(const char*) __attribute__((__noreturn__)); + + void + __throw_runtime_error(const char*) __attribute__((__noreturn__)); + + void + __throw_range_error(const char*) __attribute__((__noreturn__)); + + void + __throw_overflow_error(const char*) __attribute__((__noreturn__)); + + void + __throw_underflow_error(const char*) __attribute__((__noreturn__)); + + // Helpers for exception objects in basic_ios + void + __throw_ios_failure(const char*) __attribute__((__noreturn__)); + +} // namespace std + +#endif diff --git a/cpp_src/functional b/cpp_src/functional new file mode 100644 index 0000000..feadaa2 --- /dev/null +++ b/cpp_src/functional @@ -0,0 +1,57 @@ +// -*- C++ -*- + +// Copyright (C) 2001, 2002 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * Copyright (c) 1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + */ + +/** @file include/functional + * This is a Standard C++ Library header. + */ + +#ifndef _GLIBCXX_FUNCTIONAL +#define _GLIBCXX_FUNCTIONAL 1 + +#pragma GCC system_header + +#include +#include +#include + +#endif /* _GLIBCXX_FUNCTIONAL */ diff --git a/cpp_src/gslice.h b/cpp_src/gslice.h new file mode 100644 index 0000000..0beb90f --- /dev/null +++ b/cpp_src/gslice.h @@ -0,0 +1,170 @@ +// The template and inlines for the -*- C++ -*- gslice class. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2004, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file gslice.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// Written by Gabriel Dos Reis + +#ifndef _GSLICE_H +#define _GSLICE_H 1 + +#pragma GCC system_header + +namespace std { + + /** + * @brief Class defining multi-dimensional subset of an array. + * + * The slice class represents a multi-dimensional subset of an array, + * specified by three parameter sets: start offset, size array, and stride + * array. The start offset is the index of the first element of the array + * that is part of the subset. The size and stride array describe each + * dimension of the slice. Size is the number of elements in that + * dimension, and stride is the distance in the array between successive + * elements in that dimension. Each dimension's size and stride is taken + * to begin at an array element described by the previous dimension. The + * size array and stride array must be the same size. + * + * For example, if you have offset==3, stride[0]==11, size[1]==3, + * stride[1]==3, then slice[0,0]==array[3], slice[0,1]==array[6], + * slice[0,2]==array[9], slice[1,0]==array[14], slice[1,1]==array[17], + * slice[1,2]==array[20]. + */ + class gslice + { + public: + /// Construct an empty slice. + gslice (); + + /** + * @brief Construct a slice. + * + * Constructs a slice with as many dimensions as the length of the @a l + * and @a s arrays. + * + * @param o Offset in array of first element. + * @param l Array of dimension lengths. + * @param s Array of dimension strides between array elements. + */ + gslice(size_t, const valarray&, const valarray&); + + // XXX: the IS says the copy-ctor and copy-assignment operators are + // synthetized by the compiler but they are just unsuitable + // for a ref-counted semantic + /// Copy constructor. + gslice(const gslice&); + + /// Destructor. + ~gslice(); + + // XXX: See the note above. + /// Assignment operator. + gslice& operator=(const gslice&); + + /// Return array offset of first slice element. + size_t start() const; + + /// Return array of sizes of slice dimensions. + valarray size() const; + + /// Return array of array strides for each dimension. + valarray stride() const; + + private: + struct _Indexer + { + size_t _M_count; + size_t _M_start; + valarray _M_size; + valarray _M_stride; + valarray _M_index; // Linear array of referenced indices + _Indexer(size_t, const valarray&, + const valarray&); + void + _M_increment_use() + { ++_M_count; } + + size_t + _M_decrement_use() + { return --_M_count; } + }; + + _Indexer* _M_index; + + template friend class valarray; + }; + + inline size_t + gslice::start () const + { return _M_index ? _M_index->_M_start : 0; } + + inline valarray + gslice::size () const + { return _M_index ? _M_index->_M_size : valarray(); } + + inline valarray + gslice::stride () const + { return _M_index ? _M_index->_M_stride : valarray(); } + + inline gslice::gslice () : _M_index(0) {} + + inline + gslice::gslice(size_t __o, const valarray& __l, + const valarray& __s) + : _M_index(new gslice::_Indexer(__o, __l, __s)) {} + + inline + gslice::gslice(const gslice& __g) : _M_index(__g._M_index) + { if (_M_index) _M_index->_M_increment_use(); } + + inline + gslice::~gslice() + { + if (_M_index && _M_index->_M_decrement_use() == 0) + delete _M_index; + } + + inline gslice& + gslice::operator= (const gslice& __g) + { + if (__g._M_index) + __g._M_index->_M_increment_use(); + if (_M_index && _M_index->_M_decrement_use() == 0) + delete _M_index; + _M_index = __g._M_index; + return *this; + } + +} // namespace std + +#endif /* _GSLICE_H */ diff --git a/cpp_src/gslice_array.h b/cpp_src/gslice_array.h new file mode 100644 index 0000000..74e99e3 --- /dev/null +++ b/cpp_src/gslice_array.h @@ -0,0 +1,214 @@ +// The template and inlines for the -*- C++ -*- gslice_array class. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2004, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file gslice_array.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// Written by Gabriel Dos Reis + +#ifndef _GSLICE_ARRAY_H +#define _GSLICE_ARRAY_H 1 + +#pragma GCC system_header + +namespace std { + + /** + * @brief Reference to multi-dimensional subset of an array. + * + * A gslice_array is a reference to the actual elements of an array + * specified by a gslice. The way to get a gslice_array is to call + * operator[](gslice) on a valarray. The returned gslice_array then + * permits carrying operations out on the referenced subset of elements in + * the original valarray. For example, operator+=(valarray) will add + * values to the subset of elements in the underlying valarray this + * gslice_array refers to. + * + * @param Tp Element type. + */ + template + class gslice_array + { + public: + typedef _Tp value_type; + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 253. valarray helper functions are almost entirely useless + + /// Copy constructor. Both slices refer to the same underlying array. + gslice_array(const gslice_array&); + + /// Assignment operator. Assigns slice elements to corresponding + /// elements of @a a. + gslice_array& operator=(const gslice_array&); + + /// Assign slice elements to corresponding elements of @a v. + void operator=(const valarray<_Tp>&) const; + /// Multiply slice elements by corresponding elements of @a v. + void operator*=(const valarray<_Tp>&) const; + /// Divide slice elements by corresponding elements of @a v. + void operator/=(const valarray<_Tp>&) const; + /// Modulo slice elements by corresponding elements of @a v. + void operator%=(const valarray<_Tp>&) const; + /// Add corresponding elements of @a v to slice elements. + void operator+=(const valarray<_Tp>&) const; + /// Subtract corresponding elements of @a v from slice elements. + void operator-=(const valarray<_Tp>&) const; + /// Logical xor slice elements with corresponding elements of @a v. + void operator^=(const valarray<_Tp>&) const; + /// Logical and slice elements with corresponding elements of @a v. + void operator&=(const valarray<_Tp>&) const; + /// Logical or slice elements with corresponding elements of @a v. + void operator|=(const valarray<_Tp>&) const; + /// Left shift slice elements by corresponding elements of @a v. + void operator<<=(const valarray<_Tp>&) const; + /// Right shift slice elements by corresponding elements of @a v. + void operator>>=(const valarray<_Tp>&) const; + /// Assign all slice elements to @a t. + void operator=(const _Tp&) const; + + template + void operator=(const _Expr<_Dom, _Tp>&) const; + template + void operator*=(const _Expr<_Dom, _Tp>&) const; + template + void operator/=(const _Expr<_Dom, _Tp>&) const; + template + void operator%=(const _Expr<_Dom, _Tp>&) const; + template + void operator+=(const _Expr<_Dom, _Tp>&) const; + template + void operator-=(const _Expr<_Dom, _Tp>&) const; + template + void operator^=(const _Expr<_Dom, _Tp>&) const; + template + void operator&=(const _Expr<_Dom, _Tp>&) const; + template + void operator|=(const _Expr<_Dom, _Tp>&) const; + template + void operator<<=(const _Expr<_Dom, _Tp>&) const; + template + void operator>>=(const _Expr<_Dom, _Tp>&) const; + + private: + _Array<_Tp> _M_array; + const valarray& _M_index; + + friend class valarray<_Tp>; + + gslice_array(_Array<_Tp>, const valarray&); + + // not implemented + gslice_array(); + }; + + template + inline + gslice_array<_Tp>::gslice_array(_Array<_Tp> __a, + const valarray& __i) + : _M_array(__a), _M_index(__i) {} + + template + inline + gslice_array<_Tp>::gslice_array(const gslice_array<_Tp>& __a) + : _M_array(__a._M_array), _M_index(__a._M_index) {} + + template + inline gslice_array<_Tp>& + gslice_array<_Tp>::operator=(const gslice_array<_Tp>& __a) + { + std::__valarray_copy(_Array<_Tp>(__a._M_array), + _Array(__a._M_index), _M_index.size(), + _M_array, _Array(_M_index)); + return *this; + } + + template + inline void + gslice_array<_Tp>::operator=(const _Tp& __t) const + { + std::__valarray_fill(_M_array, _Array(_M_index), + _M_index.size(), __t); + } + + template + inline void + gslice_array<_Tp>::operator=(const valarray<_Tp>& __v) const + { + std::__valarray_copy(_Array<_Tp>(__v), __v.size(), + _M_array, _Array(_M_index)); + } + + template + template + inline void + gslice_array<_Tp>::operator=(const _Expr<_Dom, _Tp>& __e) const + { + std::__valarray_copy (__e, _M_index.size(), _M_array, + _Array(_M_index)); + } + +#undef _DEFINE_VALARRAY_OPERATOR +#define _DEFINE_VALARRAY_OPERATOR(_Op, _Name) \ + template \ + inline void \ + gslice_array<_Tp>::operator _Op##=(const valarray<_Tp>& __v) const \ + { \ + _Array_augmented_##_Name(_M_array, _Array(_M_index), \ + _Array<_Tp>(__v), __v.size()); \ + } \ + \ + template \ + template \ + inline void \ + gslice_array<_Tp>::operator _Op##= (const _Expr<_Dom, _Tp>& __e) const\ + { \ + _Array_augmented_##_Name(_M_array, _Array(_M_index), __e,\ + _M_index.size()); \ + } + +_DEFINE_VALARRAY_OPERATOR(*, __multiplies) +_DEFINE_VALARRAY_OPERATOR(/, __divides) +_DEFINE_VALARRAY_OPERATOR(%, __modulus) +_DEFINE_VALARRAY_OPERATOR(+, __plus) +_DEFINE_VALARRAY_OPERATOR(-, __minus) +_DEFINE_VALARRAY_OPERATOR(^, __bitwise_xor) +_DEFINE_VALARRAY_OPERATOR(&, __bitwise_and) +_DEFINE_VALARRAY_OPERATOR(|, __bitwise_or) +_DEFINE_VALARRAY_OPERATOR(<<, __shift_left) +_DEFINE_VALARRAY_OPERATOR(>>, __shift_right) + +#undef _DEFINE_VALARRAY_OPERATOR + +} // namespace std + +#endif /* _GSLICE_ARRAY_H */ diff --git a/cpp_src/indirect_array.h b/cpp_src/indirect_array.h new file mode 100644 index 0000000..245bd99 --- /dev/null +++ b/cpp_src/indirect_array.h @@ -0,0 +1,208 @@ +// The template and inlines for the -*- C++ -*- indirect_array class. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2004, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file indirect_array.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// Written by Gabriel Dos Reis + +#ifndef _INDIRECT_ARRAY_H +#define _INDIRECT_ARRAY_H 1 + +#pragma GCC system_header + +namespace std { + + /** + * @brief Reference to arbitrary subset of an array. + * + * An indirect_array is a reference to the actual elements of an array + * specified by an ordered array of indices. The way to get an + * indirect_array is to call operator[](valarray) on a valarray. + * The returned indirect_array then permits carrying operations out on the + * referenced subset of elements in the original valarray. + * + * For example, if an indirect_array is obtained using the array (4,2,0) as + * an argument, and then assigned to an array containing (1,2,3), then the + * underlying array will have array[0]==3, array[2]==2, and array[4]==1. + * + * @param Tp Element type. + */ + template + class indirect_array + { + public: + typedef _Tp value_type; + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 253. valarray helper functions are almost entirely useless + + /// Copy constructor. Both slices refer to the same underlying array. + indirect_array(const indirect_array&); + + /// Assignment operator. Assigns elements to corresponding elements + /// of @a a. + indirect_array& operator=(const indirect_array&); + + /// Assign slice elements to corresponding elements of @a v. + void operator=(const valarray<_Tp>&) const; + /// Multiply slice elements by corresponding elements of @a v. + void operator*=(const valarray<_Tp>&) const; + /// Divide slice elements by corresponding elements of @a v. + void operator/=(const valarray<_Tp>&) const; + /// Modulo slice elements by corresponding elements of @a v. + void operator%=(const valarray<_Tp>&) const; + /// Add corresponding elements of @a v to slice elements. + void operator+=(const valarray<_Tp>&) const; + /// Subtract corresponding elements of @a v from slice elements. + void operator-=(const valarray<_Tp>&) const; + /// Logical xor slice elements with corresponding elements of @a v. + void operator^=(const valarray<_Tp>&) const; + /// Logical and slice elements with corresponding elements of @a v. + void operator&=(const valarray<_Tp>&) const; + /// Logical or slice elements with corresponding elements of @a v. + void operator|=(const valarray<_Tp>&) const; + /// Left shift slice elements by corresponding elements of @a v. + void operator<<=(const valarray<_Tp>&) const; + /// Right shift slice elements by corresponding elements of @a v. + void operator>>=(const valarray<_Tp>&) const; + /// Assign all slice elements to @a t. + void operator= (const _Tp&) const; + // ~indirect_array(); + + template + void operator=(const _Expr<_Dom, _Tp>&) const; + template + void operator*=(const _Expr<_Dom, _Tp>&) const; + template + void operator/=(const _Expr<_Dom, _Tp>&) const; + template + void operator%=(const _Expr<_Dom, _Tp>&) const; + template + void operator+=(const _Expr<_Dom, _Tp>&) const; + template + void operator-=(const _Expr<_Dom, _Tp>&) const; + template + void operator^=(const _Expr<_Dom, _Tp>&) const; + template + void operator&=(const _Expr<_Dom, _Tp>&) const; + template + void operator|=(const _Expr<_Dom, _Tp>&) const; + template + void operator<<=(const _Expr<_Dom, _Tp>&) const; + template + void operator>>=(const _Expr<_Dom, _Tp>&) const; + + private: + /// Copy constructor. Both slices refer to the same underlying array. + indirect_array(_Array<_Tp>, size_t, _Array); + + friend class valarray<_Tp>; + friend class gslice_array<_Tp>; + + const size_t _M_sz; + const _Array _M_index; + const _Array<_Tp> _M_array; + + // not implemented + indirect_array(); + }; + + template + inline + indirect_array<_Tp>::indirect_array(const indirect_array<_Tp>& __a) + : _M_sz(__a._M_sz), _M_index(__a._M_index), _M_array(__a._M_array) {} + + template + inline + indirect_array<_Tp>::indirect_array(_Array<_Tp> __a, size_t __s, + _Array __i) + : _M_sz(__s), _M_index(__i), _M_array(__a) {} + + template + inline indirect_array<_Tp>& + indirect_array<_Tp>::operator=(const indirect_array<_Tp>& __a) + { + std::__valarray_copy(__a._M_array, _M_sz, __a._M_index, _M_array, + _M_index); + return *this; + } + + template + inline void + indirect_array<_Tp>::operator=(const _Tp& __t) const + { std::__valarray_fill(_M_array, _M_index, _M_sz, __t); } + + template + inline void + indirect_array<_Tp>::operator=(const valarray<_Tp>& __v) const + { std::__valarray_copy(_Array<_Tp>(__v), _M_sz, _M_array, _M_index); } + + template + template + inline void + indirect_array<_Tp>::operator=(const _Expr<_Dom, _Tp>& __e) const + { std::__valarray_copy(__e, _M_sz, _M_array, _M_index); } + +#undef _DEFINE_VALARRAY_OPERATOR +#define _DEFINE_VALARRAY_OPERATOR(_Op, _Name) \ + template \ + inline void \ + indirect_array<_Tp>::operator _Op##=(const valarray<_Tp>& __v) const\ + { \ + _Array_augmented_##_Name(_M_array, _M_index, _Array<_Tp>(__v), _M_sz); \ + } \ + \ + template \ + template \ + inline void \ + indirect_array<_Tp>::operator _Op##=(const _Expr<_Dom,_Tp>& __e) const\ + { \ + _Array_augmented_##_Name(_M_array, _M_index, __e, _M_sz); \ + } + +_DEFINE_VALARRAY_OPERATOR(*, __multiplies) +_DEFINE_VALARRAY_OPERATOR(/, __divides) +_DEFINE_VALARRAY_OPERATOR(%, __modulus) +_DEFINE_VALARRAY_OPERATOR(+, __plus) +_DEFINE_VALARRAY_OPERATOR(-, __minus) +_DEFINE_VALARRAY_OPERATOR(^, __bitwise_xor) +_DEFINE_VALARRAY_OPERATOR(&, __bitwise_and) +_DEFINE_VALARRAY_OPERATOR(|, __bitwise_or) +_DEFINE_VALARRAY_OPERATOR(<<, __shift_left) +_DEFINE_VALARRAY_OPERATOR(>>, __shift_right) + +#undef _DEFINE_VALARRAY_OPERATOR + +} // namespace std + +#endif /* _INDIRECT_ARRAY_H */ diff --git a/cpp_src/iomanip b/cpp_src/iomanip new file mode 100644 index 0000000..730ff70 --- /dev/null +++ b/cpp_src/iomanip @@ -0,0 +1,300 @@ +// Standard stream manipulators -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2001, 2002, 2003, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file iomanip + * This is a Standard C++ Library header. + */ + +// +// ISO C++ 14882: 27.6.3 Standard manipulators +// + +#ifndef _GLIBCXX_IOMANIP +#define _GLIBCXX_IOMANIP 1 + +#pragma GCC system_header + +#include +#include +#include + +namespace std { + + // [27.6.3] standard manipulators + // Also see DR 183. + + struct _Resetiosflags { ios_base::fmtflags _M_mask; }; + + /** + * @brief Manipulator for @c setf. + * @param mask A format flags mask. + * + * Sent to a stream object, this manipulator resets the specified flags, + * via @e stream.setf(0,mask). + */ + inline _Resetiosflags + resetiosflags(ios_base::fmtflags __mask) + { + _Resetiosflags __x; + __x._M_mask = __mask; + return __x; + } + + template + inline basic_istream<_CharT,_Traits>& + operator>>(basic_istream<_CharT,_Traits>& __is, _Resetiosflags __f) + { + __is.setf(ios_base::fmtflags(0), __f._M_mask); + return __is; + } + + template + inline basic_ostream<_CharT,_Traits>& + operator<<(basic_ostream<_CharT,_Traits>& __os, _Resetiosflags __f) + { + __os.setf(ios_base::fmtflags(0), __f._M_mask); + return __os; + } + + + struct _Setiosflags { ios_base::fmtflags _M_mask; }; + + /** + * @brief Manipulator for @c setf. + * @param mask A format flags mask. + * + * Sent to a stream object, this manipulator sets the format flags + * to @a mask. + */ + inline _Setiosflags + setiosflags(ios_base::fmtflags __mask) + { + _Setiosflags __x; + __x._M_mask = __mask; + return __x; + } + + template + inline basic_istream<_CharT,_Traits>& + operator>>(basic_istream<_CharT,_Traits>& __is, _Setiosflags __f) + { + __is.setf(__f._M_mask); + return __is; + } + + template + inline basic_ostream<_CharT,_Traits>& + operator<<(basic_ostream<_CharT,_Traits>& __os, _Setiosflags __f) + { + __os.setf(__f._M_mask); + return __os; + } + + + struct _Setbase { int _M_base; }; + + /** + * @brief Manipulator for @c setf. + * @param base A numeric base. + * + * Sent to a stream object, this manipulator changes the + * @c ios_base::basefield flags to @c oct, @c dec, or @c hex when @a base + * is 8, 10, or 16, accordingly, and to 0 if @a base is any other value. + */ + inline _Setbase + setbase(int __base) + { + _Setbase __x; + __x._M_base = __base; + return __x; + } + + template + inline basic_istream<_CharT,_Traits>& + operator>>(basic_istream<_CharT,_Traits>& __is, _Setbase __f) + { + __is.setf(__f._M_base == 8 ? ios_base::oct : + __f._M_base == 10 ? ios_base::dec : + __f._M_base == 16 ? ios_base::hex : + ios_base::fmtflags(0), ios_base::basefield); + return __is; + } + + template + inline basic_ostream<_CharT,_Traits>& + operator<<(basic_ostream<_CharT,_Traits>& __os, _Setbase __f) + { + __os.setf(__f._M_base == 8 ? ios_base::oct : + __f._M_base == 10 ? ios_base::dec : + __f._M_base == 16 ? ios_base::hex : + ios_base::fmtflags(0), ios_base::basefield); + return __os; + } + + + template + struct _Setfill { _CharT _M_c; }; + + /** + * @brief Manipulator for @c fill. + * @param c The new fill character. + * + * Sent to a stream object, this manipulator calls @c fill(c) for that + * object. + */ + template + inline _Setfill<_CharT> + setfill(_CharT __c) + { + _Setfill<_CharT> __x; + __x._M_c = __c; + return __x; + } + + template + inline basic_istream<_CharT,_Traits>& + operator>>(basic_istream<_CharT,_Traits>& __is, _Setfill<_CharT> __f) + { + __is.fill(__f._M_c); + return __is; + } + + template + inline basic_ostream<_CharT,_Traits>& + operator<<(basic_ostream<_CharT,_Traits>& __os, _Setfill<_CharT> __f) + { + __os.fill(__f._M_c); + return __os; + } + + + struct _Setprecision { int _M_n; }; + + /** + * @brief Manipulator for @c precision. + * @param n The new precision. + * + * Sent to a stream object, this manipulator calls @c precision(n) for + * that object. + */ + inline _Setprecision + setprecision(int __n) + { + _Setprecision __x; + __x._M_n = __n; + return __x; + } + + template + inline basic_istream<_CharT,_Traits>& + operator>>(basic_istream<_CharT,_Traits>& __is, _Setprecision __f) + { + __is.precision(__f._M_n); + return __is; + } + + template + inline basic_ostream<_CharT,_Traits>& + operator<<(basic_ostream<_CharT,_Traits>& __os, _Setprecision __f) + { + __os.precision(__f._M_n); + return __os; + } + + + struct _Setw { int _M_n; }; + + /** + * @brief Manipulator for @c width. + * @param n The new width. + * + * Sent to a stream object, this manipulator calls @c width(n) for + * that object. + */ + inline _Setw + setw(int __n) + { + _Setw __x; + __x._M_n = __n; + return __x; + } + + template + inline basic_istream<_CharT,_Traits>& + operator>>(basic_istream<_CharT,_Traits>& __is, _Setw __f) + { + __is.width(__f._M_n); + return __is; + } + + template + inline basic_ostream<_CharT,_Traits>& + operator<<(basic_ostream<_CharT,_Traits>& __os, _Setw __f) + { + __os.width(__f._M_n); + return __os; + } + + // Inhibit implicit instantiations for required instantiations, + // which are defined via explicit instantiations elsewhere. + // NB: This syntax is a GNU extension. +#if _GLIBCXX_EXTERN_TEMPLATE + extern template ostream& operator<<(ostream&, _Setfill); + extern template ostream& operator<<(ostream&, _Setiosflags); + extern template ostream& operator<<(ostream&, _Resetiosflags); + extern template ostream& operator<<(ostream&, _Setbase); + extern template ostream& operator<<(ostream&, _Setprecision); + extern template ostream& operator<<(ostream&, _Setw); + extern template istream& operator>>(istream&, _Setfill); + extern template istream& operator>>(istream&, _Setiosflags); + extern template istream& operator>>(istream&, _Resetiosflags); + extern template istream& operator>>(istream&, _Setbase); + extern template istream& operator>>(istream&, _Setprecision); + extern template istream& operator>>(istream&, _Setw); + +#ifdef _GLIBCXX_USE_WCHAR_T + extern template wostream& operator<<(wostream&, _Setfill); + extern template wostream& operator<<(wostream&, _Setiosflags); + extern template wostream& operator<<(wostream&, _Resetiosflags); + extern template wostream& operator<<(wostream&, _Setbase); + extern template wostream& operator<<(wostream&, _Setprecision); + extern template wostream& operator<<(wostream&, _Setw); + extern template wistream& operator>>(wistream&, _Setfill); + extern template wistream& operator>>(wistream&, _Setiosflags); + extern template wistream& operator>>(wistream&, _Resetiosflags); + extern template wistream& operator>>(wistream&, _Setbase); + extern template wistream& operator>>(wistream&, _Setprecision); + extern template wistream& operator>>(wistream&, _Setw); +#endif +#endif + +} // namespace std + +#endif /* _GLIBCXX_IOMANIP */ diff --git a/cpp_src/ios b/cpp_src/ios new file mode 100644 index 0000000..f081115 --- /dev/null +++ b/cpp_src/ios @@ -0,0 +1,52 @@ +// Iostreams base classes -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2001, 2002 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file ios + * This is a Standard C++ Library header. + */ + +// +// ISO C++ 14882: 27.4 Iostreams base classes +// + +#ifndef _GLIBCXX_IOS +#define _GLIBCXX_IOS 1 + +#pragma GCC system_header + +#include +#include // For ios_base::failure +#include // For char_traits, streamoff, streamsize, fpos +#include // For SEEK_SET, SEEK_CUR, SEEK_END +#include // For class locale +#include // For ios_base declarations. +#include +#include + +#endif /* _GLIBCXX_IOS */ diff --git a/cpp_src/ios_base.h b/cpp_src/ios_base.h new file mode 100644 index 0000000..47492db --- /dev/null +++ b/cpp_src/ios_base.h @@ -0,0 +1,968 @@ +// Iostreams base classes -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file ios_base.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 27.4 Iostreams base classes +// + +#ifndef _IOS_BASE_H +#define _IOS_BASE_H 1 + +#pragma GCC system_header + +#include +#include +#include + +namespace std { + + // The following definitions of bitmask types are enums, not ints, + // as permitted (but not required) in the standard, in order to provide + // better type safety in iostream calls. A side effect is that + // expressions involving them are no longer compile-time constants. + enum _Ios_Fmtflags + { + _S_boolalpha = 1L << 0, + _S_dec = 1L << 1, + _S_fixed = 1L << 2, + _S_hex = 1L << 3, + _S_internal = 1L << 4, + _S_left = 1L << 5, + _S_oct = 1L << 6, + _S_right = 1L << 7, + _S_scientific = 1L << 8, + _S_showbase = 1L << 9, + _S_showpoint = 1L << 10, + _S_showpos = 1L << 11, + _S_skipws = 1L << 12, + _S_unitbuf = 1L << 13, + _S_uppercase = 1L << 14, + _S_adjustfield = _S_left | _S_right | _S_internal, + _S_basefield = _S_dec | _S_oct | _S_hex, + _S_floatfield = _S_scientific | _S_fixed, + _S_ios_fmtflags_end = 1L << 16 + }; + + inline _Ios_Fmtflags + operator&(_Ios_Fmtflags __a, _Ios_Fmtflags __b) + { return _Ios_Fmtflags(static_cast(__a) & static_cast(__b)); } + + inline _Ios_Fmtflags + operator|(_Ios_Fmtflags __a, _Ios_Fmtflags __b) + { return _Ios_Fmtflags(static_cast(__a) | static_cast(__b)); } + + inline _Ios_Fmtflags + operator^(_Ios_Fmtflags __a, _Ios_Fmtflags __b) + { return _Ios_Fmtflags(static_cast(__a) ^ static_cast(__b)); } + + inline _Ios_Fmtflags& + operator|=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b) + { return __a = __a | __b; } + + inline _Ios_Fmtflags& + operator&=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b) + { return __a = __a & __b; } + + inline _Ios_Fmtflags& + operator^=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b) + { return __a = __a ^ __b; } + + inline _Ios_Fmtflags + operator~(_Ios_Fmtflags __a) + { return _Ios_Fmtflags(~static_cast(__a)); } + + + enum _Ios_Openmode + { + _S_app = 1L << 0, + _S_ate = 1L << 1, + _S_bin = 1L << 2, + _S_in = 1L << 3, + _S_out = 1L << 4, + _S_trunc = 1L << 5, + _S_ios_openmode_end = 1L << 16 + }; + + inline _Ios_Openmode + operator&(_Ios_Openmode __a, _Ios_Openmode __b) + { return _Ios_Openmode(static_cast(__a) & static_cast(__b)); } + + inline _Ios_Openmode + operator|(_Ios_Openmode __a, _Ios_Openmode __b) + { return _Ios_Openmode(static_cast(__a) | static_cast(__b)); } + + inline _Ios_Openmode + operator^(_Ios_Openmode __a, _Ios_Openmode __b) + { return _Ios_Openmode(static_cast(__a) ^ static_cast(__b)); } + + inline _Ios_Openmode& + operator|=(_Ios_Openmode& __a, _Ios_Openmode __b) + { return __a = __a | __b; } + + inline _Ios_Openmode& + operator&=(_Ios_Openmode& __a, _Ios_Openmode __b) + { return __a = __a & __b; } + + inline _Ios_Openmode& + operator^=(_Ios_Openmode& __a, _Ios_Openmode __b) + { return __a = __a ^ __b; } + + inline _Ios_Openmode + operator~(_Ios_Openmode __a) + { return _Ios_Openmode(~static_cast(__a)); } + + + enum _Ios_Iostate + { + _S_goodbit = 0, + _S_badbit = 1L << 0, + _S_eofbit = 1L << 1, + _S_failbit = 1L << 2, + _S_ios_iostate_end = 1L << 16 + }; + + inline _Ios_Iostate + operator&(_Ios_Iostate __a, _Ios_Iostate __b) + { return _Ios_Iostate(static_cast(__a) & static_cast(__b)); } + + inline _Ios_Iostate + operator|(_Ios_Iostate __a, _Ios_Iostate __b) + { return _Ios_Iostate(static_cast(__a) | static_cast(__b)); } + + inline _Ios_Iostate + operator^(_Ios_Iostate __a, _Ios_Iostate __b) + { return _Ios_Iostate(static_cast(__a) ^ static_cast(__b)); } + + inline _Ios_Iostate& + operator|=(_Ios_Iostate& __a, _Ios_Iostate __b) + { return __a = __a | __b; } + + inline _Ios_Iostate& + operator&=(_Ios_Iostate& __a, _Ios_Iostate __b) + { return __a = __a & __b; } + + inline _Ios_Iostate& + operator^=(_Ios_Iostate& __a, _Ios_Iostate __b) + { return __a = __a ^ __b; } + + inline _Ios_Iostate + operator~(_Ios_Iostate __a) + { return _Ios_Iostate(~static_cast(__a)); } + + enum _Ios_Seekdir + { + _S_beg = 0, + _S_cur = SEEK_CUR, + _S_end = SEEK_END, + _S_ios_seekdir_end = 1L << 16 + }; + + // 27.4.2 Class ios_base + /** + * @brief The base of the I/O class hierarchy. + * + * This class defines everything that can be defined about I/O that does + * not depend on the type of characters being input or output. Most + * people will only see @c ios_base when they need to specify the full + * name of the various I/O flags (e.g., the openmodes). + */ + class ios_base + { + public: + + // 27.4.2.1.1 Class ios_base::failure + /// These are thrown to indicate problems. Doc me. + class failure : public exception + { + public: + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 48. Use of non-existent exception constructor + explicit + failure(const string& __str) throw(); + + // This declaration is not useless: + // http://gcc.gnu.org/onlinedocs/gcc-3.0.2/gcc_6.html#SEC118 + virtual + ~failure() throw(); + + virtual const char* + what() const throw(); + + private: + string _M_msg; + }; + + // 27.4.2.1.2 Type ios_base::fmtflags + /** + * @brief This is a bitmask type. + * + * @c "_Ios_Fmtflags" is implementation-defined, but it is valid to + * perform bitwise operations on these values and expect the Right + * Thing to happen. Defined objects of type fmtflags are: + * - boolalpha + * - dec + * - fixed + * - hex + * - internal + * - left + * - oct + * - right + * - scientific + * - showbase + * - showpoint + * - showpos + * - skipws + * - unitbuf + * - uppercase + * - adjustfield + * - basefield + * - floatfield + */ + typedef _Ios_Fmtflags fmtflags; + + /// Insert/extract @c bool in alphabetic rather than numeric format. + static const fmtflags boolalpha = _S_boolalpha; + + /// Converts integer input or generates integer output in decimal base. + static const fmtflags dec = _S_dec; + + /// Generate floating-point output in fixed-point notation. + static const fmtflags fixed = _S_fixed; + + /// Converts integer input or generates integer output in hexadecimal base. + static const fmtflags hex = _S_hex; + + /// Adds fill characters at a designated internal point in certain + /// generated output, or identical to @c right if no such point is + /// designated. + static const fmtflags internal = _S_internal; + + /// Adds fill characters on the right (final positions) of certain + /// generated output. (I.e., the thing you print is flush left.) + static const fmtflags left = _S_left; + + /// Converts integer input or generates integer output in octal base. + static const fmtflags oct = _S_oct; + + /// Adds fill characters on the left (initial positions) of certain + /// generated output. (I.e., the thing you print is flush right.) + static const fmtflags right = _S_right; + + /// Generates floating-point output in scientific notation. + static const fmtflags scientific = _S_scientific; + + /// Generates a prefix indicating the numeric base of generated integer + /// output. + static const fmtflags showbase = _S_showbase; + + /// Generates a decimal-point character unconditionally in generated + /// floating-point output. + static const fmtflags showpoint = _S_showpoint; + + /// Generates a + sign in non-negative generated numeric output. + static const fmtflags showpos = _S_showpos; + + /// Skips leading white space before certain input operations. + static const fmtflags skipws = _S_skipws; + + /// Flushes output after each output operation. + static const fmtflags unitbuf = _S_unitbuf; + + /// Replaces certain lowercase letters with their uppercase equivalents + /// in generated output. + static const fmtflags uppercase = _S_uppercase; + + /// A mask of left|right|internal. Useful for the 2-arg form of @c setf. + static const fmtflags adjustfield = _S_adjustfield; + + /// A mask of dec|oct|hex. Useful for the 2-arg form of @c setf. + static const fmtflags basefield = _S_basefield; + + /// A mask of scientific|fixed. Useful for the 2-arg form of @c setf. + static const fmtflags floatfield = _S_floatfield; + + // 27.4.2.1.3 Type ios_base::iostate + /** + * @brief This is a bitmask type. + * + * @c "_Ios_Iostate" is implementation-defined, but it is valid to + * perform bitwise operations on these values and expect the Right + * Thing to happen. Defined objects of type iostate are: + * - badbit + * - eofbit + * - failbit + * - goodbit + */ + typedef _Ios_Iostate iostate; + + /// Indicates a loss of integrity in an input or output sequence (such + /// as an irrecoverable read error from a file). + static const iostate badbit = _S_badbit; + + /// Indicates that an input operation reached the end of an input sequence. + static const iostate eofbit = _S_eofbit; + + /// Indicates that an input operation failed to read the expected + /// characters, or that an output operation failed to generate the + /// desired characters. + static const iostate failbit = _S_failbit; + + /// Indicates all is well. + static const iostate goodbit = _S_goodbit; + + // 27.4.2.1.4 Type ios_base::openmode + /** + * @brief This is a bitmask type. + * + * @c "_Ios_Openmode" is implementation-defined, but it is valid to + * perform bitwise operations on these values and expect the Right + * Thing to happen. Defined objects of type openmode are: + * - app + * - ate + * - binary + * - in + * - out + * - trunc + */ + typedef _Ios_Openmode openmode; + + /// Seek to end before each write. + static const openmode app = _S_app; + + /// Open and seek to end immediately after opening. + static const openmode ate = _S_ate; + + /// Perform input and output in binary mode (as opposed to text mode). + /// This is probably not what you think it is; see + /// http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#3 and + /// http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#7 for more. + static const openmode binary = _S_bin; + + /// Open for input. Default for @c ifstream and fstream. + static const openmode in = _S_in; + + /// Open for output. Default for @c ofstream and fstream. + static const openmode out = _S_out; + + /// Open for input. Default for @c ofstream. + static const openmode trunc = _S_trunc; + + // 27.4.2.1.5 Type ios_base::seekdir + /** + * @brief This is an enumerated type. + * + * @c "_Ios_Seekdir" is implementation-defined. Defined values + * of type seekdir are: + * - beg + * - cur, equivalent to @c SEEK_CUR in the C standard library. + * - end, equivalent to @c SEEK_END in the C standard library. + */ + typedef _Ios_Seekdir seekdir; + + /// Request a seek relative to the beginning of the stream. + static const seekdir beg = _S_beg; + + /// Request a seek relative to the current position within the sequence. + static const seekdir cur = _S_cur; + + /// Request a seek relative to the current end of the sequence. + static const seekdir end = _S_end; + + // Annex D.6 + typedef int io_state; + typedef int open_mode; + typedef int seek_dir; + + typedef std::streampos streampos; + typedef std::streamoff streamoff; + + // Callbacks; + /** + * @brief The set of events that may be passed to an event callback. + * + * erase_event is used during ~ios() and copyfmt(). imbue_event is used + * during imbue(). copyfmt_event is used during copyfmt(). + */ + enum event + { + erase_event, + imbue_event, + copyfmt_event + }; + + /** + * @brief The type of an event callback function. + * @param event One of the members of the event enum. + * @param ios_base Reference to the ios_base object. + * @param int The integer provided when the callback was registered. + * + * Event callbacks are user defined functions that get called during + * several ios_base and basic_ios functions, specifically imbue(), + * copyfmt(), and ~ios(). + */ + typedef void (*event_callback) (event, ios_base&, int); + + /** + * @brief Add the callback __fn with parameter __index. + * @param __fn The function to add. + * @param __index The integer to pass to the function when invoked. + * + * Registers a function as an event callback with an integer parameter to + * be passed to the function when invoked. Multiple copies of the + * function are allowed. If there are multiple callbacks, they are + * invoked in the order they were registered. + */ + void + register_callback(event_callback __fn, int __index); + + protected: + //@{ + /** + * @if maint + * ios_base data members (doc me) + * @endif + */ + streamsize _M_precision; + streamsize _M_width; + fmtflags _M_flags; + iostate _M_exception; + iostate _M_streambuf_state; + //@} + + // 27.4.2.6 Members for callbacks + // 27.4.2.6 ios_base callbacks + struct _Callback_list + { + // Data Members + _Callback_list* _M_next; + ios_base::event_callback _M_fn; + int _M_index; + _Atomic_word _M_refcount; // 0 means one reference. + + _Callback_list(ios_base::event_callback __fn, int __index, + _Callback_list* __cb) + : _M_next(__cb), _M_fn(__fn), _M_index(__index), _M_refcount(0) { } + + void + _M_add_reference() { __gnu_cxx::__atomic_add_dispatch(&_M_refcount, 1); } + + // 0 => OK to delete. + int + _M_remove_reference() + { return __gnu_cxx::__exchange_and_add_dispatch(&_M_refcount, -1); } + }; + + _Callback_list* _M_callbacks; + + void + _M_call_callbacks(event __ev) throw(); + + void + _M_dispose_callbacks(void); + + // 27.4.2.5 Members for iword/pword storage + struct _Words + { + void* _M_pword; + long _M_iword; + _Words() : _M_pword(0), _M_iword(0) { } + }; + + // Only for failed iword/pword calls. + _Words _M_word_zero; + + // Guaranteed storage. + // The first 5 iword and pword slots are reserved for internal use. + enum { _S_local_word_size = 8 }; + _Words _M_local_word[_S_local_word_size]; + + // Allocated storage. + int _M_word_size; + _Words* _M_word; + + _Words& + _M_grow_words(int __index, bool __iword); + + // Members for locale and locale caching. + locale _M_ios_locale; + + void + _M_init(); + + public: + + // 27.4.2.1.6 Class ios_base::Init + // Used to initialize standard streams. In theory, g++ could use + // -finit-priority to order this stuff correctly without going + // through these machinations. + class Init + { + friend class ios_base; + public: + Init(); + ~Init(); + + private: + static _Atomic_word _S_refcount; + static bool _S_synced_with_stdio; + }; + + // [27.4.2.2] fmtflags state functions + /** + * @brief Access to format flags. + * @return The format control flags for both input and output. + */ + inline fmtflags + flags() const { return _M_flags; } + + /** + * @brief Setting new format flags all at once. + * @param fmtfl The new flags to set. + * @return The previous format control flags. + * + * This function overwrites all the format flags with @a fmtfl. + */ + inline fmtflags + flags(fmtflags __fmtfl) + { + fmtflags __old = _M_flags; + _M_flags = __fmtfl; + return __old; + } + + /** + * @brief Setting new format flags. + * @param fmtfl Additional flags to set. + * @return The previous format control flags. + * + * This function sets additional flags in format control. Flags that + * were previously set remain set. + */ + inline fmtflags + setf(fmtflags __fmtfl) + { + fmtflags __old = _M_flags; + _M_flags |= __fmtfl; + return __old; + } + + /** + * @brief Setting new format flags. + * @param fmtfl Additional flags to set. + * @param mask The flags mask for @a fmtfl. + * @return The previous format control flags. + * + * This function clears @a mask in the format flags, then sets + * @a fmtfl @c & @a mask. An example mask is @c ios_base::adjustfield. + */ + inline fmtflags + setf(fmtflags __fmtfl, fmtflags __mask) + { + fmtflags __old = _M_flags; + _M_flags &= ~__mask; + _M_flags |= (__fmtfl & __mask); + return __old; + } + + /** + * @brief Clearing format flags. + * @param mask The flags to unset. + * + * This function clears @a mask in the format flags. + */ + inline void + unsetf(fmtflags __mask) { _M_flags &= ~__mask; } + + /** + * @brief Flags access. + * @return The precision to generate on certain output operations. + * + * @if maint + * Be careful if you try to give a definition of "precision" here; see + * DR 189. + * @endif + */ + inline streamsize + precision() const { return _M_precision; } + + /** + * @brief Changing flags. + * @param prec The new precision value. + * @return The previous value of precision(). + */ + inline streamsize + precision(streamsize __prec) + { + streamsize __old = _M_precision; + _M_precision = __prec; + return __old; + } + + /** + * @brief Flags access. + * @return The minimum field width to generate on output operations. + * + * "Minimum field width" refers to the number of characters. + */ + inline streamsize + width() const { return _M_width; } + + /** + * @brief Changing flags. + * @param wide The new width value. + * @return The previous value of width(). + */ + inline streamsize + width(streamsize __wide) + { + streamsize __old = _M_width; + _M_width = __wide; + return __old; + } + + // [27.4.2.4] ios_base static members + /** + * @brief Interaction with the standard C I/O objects. + * @param sync Whether to synchronize or not. + * @return True if the standard streams were previously synchronized. + * + * The synchronization referred to is @e only that between the standard + * C facilities (e.g., stdout) and the standard C++ objects (e.g., + * cout). User-declared streams are unaffected. See + * http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#8 for more. + */ + static bool + sync_with_stdio(bool __sync = true); + + // [27.4.2.3] ios_base locale functions + /** + * @brief Setting a new locale. + * @param loc The new locale. + * @return The previous locale. + * + * Sets the new locale for this stream, and then invokes each callback + * with imbue_event. + */ + locale + imbue(const locale& __loc); + + /** + * @brief Locale access + * @return A copy of the current locale. + * + * If @c imbue(loc) has previously been called, then this function + * returns @c loc. Otherwise, it returns a copy of @c std::locale(), + * the global C++ locale. + */ + inline locale + getloc() const { return _M_ios_locale; } + + /** + * @brief Locale access + * @return A reference to the current locale. + * + * Like getloc above, but returns a reference instead of + * generating a copy. + */ + inline const locale& + _M_getloc() const { return _M_ios_locale; } + + // [27.4.2.5] ios_base storage functions + /** + * @brief Access to unique indices. + * @return An integer different from all previous calls. + * + * This function returns a unique integer every time it is called. It + * can be used for any purpose, but is primarily intended to be a unique + * index for the iword and pword functions. The expectation is that an + * application calls xalloc in order to obtain an index in the iword and + * pword arrays that can be used without fear of conflict. + * + * The implementation maintains a static variable that is incremented and + * returned on each invocation. xalloc is guaranteed to return an index + * that is safe to use in the iword and pword arrays. + */ + static int + xalloc() throw(); + + /** + * @brief Access to integer array. + * @param __ix Index into the array. + * @return A reference to an integer associated with the index. + * + * The iword function provides access to an array of integers that can be + * used for any purpose. The array grows as required to hold the + * supplied index. All integers in the array are initialized to 0. + * + * The implementation reserves several indices. You should use xalloc to + * obtain an index that is safe to use. Also note that since the array + * can grow dynamically, it is not safe to hold onto the reference. + */ + inline long& + iword(int __ix) + { + _Words& __word = (__ix < _M_word_size) + ? _M_word[__ix] : _M_grow_words(__ix, true); + return __word._M_iword; + } + + /** + * @brief Access to void pointer array. + * @param __ix Index into the array. + * @return A reference to a void* associated with the index. + * + * The pword function provides access to an array of pointers that can be + * used for any purpose. The array grows as required to hold the + * supplied index. All pointers in the array are initialized to 0. + * + * The implementation reserves several indices. You should use xalloc to + * obtain an index that is safe to use. Also note that since the array + * can grow dynamically, it is not safe to hold onto the reference. + */ + inline void*& + pword(int __ix) + { + _Words& __word = (__ix < _M_word_size) + ? _M_word[__ix] : _M_grow_words(__ix, false); + return __word._M_pword; + } + + // Destructor + /** + * Invokes each callback with erase_event. Destroys local storage. + * + * Note that the ios_base object for the standard streams never gets + * destroyed. As a result, any callbacks registered with the standard + * streams will not get invoked with erase_event (unless copyfmt is + * used). + */ + virtual ~ios_base(); + + protected: + ios_base(); + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 50. Copy constructor and assignment operator of ios_base + private: + ios_base(const ios_base&); + + ios_base& + operator=(const ios_base&); + }; + + // [27.4.5.1] fmtflags manipulators + /// Calls base.setf(ios_base::boolalpha). + inline ios_base& + boolalpha(ios_base& __base) + { + __base.setf(ios_base::boolalpha); + return __base; + } + + /// Calls base.unsetf(ios_base::boolalpha). + inline ios_base& + noboolalpha(ios_base& __base) + { + __base.unsetf(ios_base::boolalpha); + return __base; + } + + /// Calls base.setf(ios_base::showbase). + inline ios_base& + showbase(ios_base& __base) + { + __base.setf(ios_base::showbase); + return __base; + } + + /// Calls base.unsetf(ios_base::showbase). + inline ios_base& + noshowbase(ios_base& __base) + { + __base.unsetf(ios_base::showbase); + return __base; + } + + /// Calls base.setf(ios_base::showpoint). + inline ios_base& + showpoint(ios_base& __base) + { + __base.setf(ios_base::showpoint); + return __base; + } + + /// Calls base.unsetf(ios_base::showpoint). + inline ios_base& + noshowpoint(ios_base& __base) + { + __base.unsetf(ios_base::showpoint); + return __base; + } + + /// Calls base.setf(ios_base::showpos). + inline ios_base& + showpos(ios_base& __base) + { + __base.setf(ios_base::showpos); + return __base; + } + + /// Calls base.unsetf(ios_base::showpos). + inline ios_base& + noshowpos(ios_base& __base) + { + __base.unsetf(ios_base::showpos); + return __base; + } + + /// Calls base.setf(ios_base::skipws). + inline ios_base& + skipws(ios_base& __base) + { + __base.setf(ios_base::skipws); + return __base; + } + + /// Calls base.unsetf(ios_base::skipws). + inline ios_base& + noskipws(ios_base& __base) + { + __base.unsetf(ios_base::skipws); + return __base; + } + + /// Calls base.setf(ios_base::uppercase). + inline ios_base& + uppercase(ios_base& __base) + { + __base.setf(ios_base::uppercase); + return __base; + } + + /// Calls base.unsetf(ios_base::uppercase). + inline ios_base& + nouppercase(ios_base& __base) + { + __base.unsetf(ios_base::uppercase); + return __base; + } + + /// Calls base.setf(ios_base::unitbuf). + inline ios_base& + unitbuf(ios_base& __base) + { + __base.setf(ios_base::unitbuf); + return __base; + } + + /// Calls base.unsetf(ios_base::unitbuf). + inline ios_base& + nounitbuf(ios_base& __base) + { + __base.unsetf(ios_base::unitbuf); + return __base; + } + + // [27.4.5.2] adjustfield anipulators + /// Calls base.setf(ios_base::internal, ios_base::adjustfield). + inline ios_base& + internal(ios_base& __base) + { + __base.setf(ios_base::internal, ios_base::adjustfield); + return __base; + } + + /// Calls base.setf(ios_base::left, ios_base::adjustfield). + inline ios_base& + left(ios_base& __base) + { + __base.setf(ios_base::left, ios_base::adjustfield); + return __base; + } + + /// Calls base.setf(ios_base::right, ios_base::adjustfield). + inline ios_base& + right(ios_base& __base) + { + __base.setf(ios_base::right, ios_base::adjustfield); + return __base; + } + + // [27.4.5.3] basefield anipulators + /// Calls base.setf(ios_base::dec, ios_base::basefield). + inline ios_base& + dec(ios_base& __base) + { + __base.setf(ios_base::dec, ios_base::basefield); + return __base; + } + + /// Calls base.setf(ios_base::hex, ios_base::basefield). + inline ios_base& + hex(ios_base& __base) + { + __base.setf(ios_base::hex, ios_base::basefield); + return __base; + } + + /// Calls base.setf(ios_base::oct, ios_base::basefield). + inline ios_base& + oct(ios_base& __base) + { + __base.setf(ios_base::oct, ios_base::basefield); + return __base; + } + + // [27.4.5.4] floatfield anipulators + /// Calls base.setf(ios_base::fixed, ios_base::floatfield). + inline ios_base& + fixed(ios_base& __base) + { + __base.setf(ios_base::fixed, ios_base::floatfield); + return __base; + } + + /// Calls base.setf(ios_base::scientific, ios_base::floatfield). + inline ios_base& + scientific(ios_base& __base) + { + __base.setf(ios_base::scientific, ios_base::floatfield); + return __base; + } + +} // namespace std + +#endif /* _IOS_BASE_H */ + diff --git a/cpp_src/iosfwd b/cpp_src/iosfwd new file mode 100644 index 0000000..708a83e --- /dev/null +++ b/cpp_src/iosfwd @@ -0,0 +1,168 @@ +// Forwarding declarations -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2001, 2002, 2003, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file iosfwd + * This is a Standard C++ Library header. + */ + +// +// ISO C++ 14882: 27.2 Forward declarations +// + +#ifndef _GLIBCXX_IOSFWD +#define _GLIBCXX_IOSFWD 1 + +#pragma GCC system_header + +#include +#include +#include +#include // For isspace, etc. +#include // For string forward declarations. +#include +#include + +namespace std { + + template > + class basic_ios; + + template > + class basic_streambuf; + + template > + class basic_istream; + + template > + class basic_ostream; + + template > + class basic_iostream; + + template, + typename _Alloc = allocator<_CharT> > + class basic_stringbuf; + + template, + typename _Alloc = allocator<_CharT> > + class basic_istringstream; + + template, + typename _Alloc = allocator<_CharT> > + class basic_ostringstream; + + template, + typename _Alloc = allocator<_CharT> > + class basic_stringstream; + + template > + class basic_filebuf; + + template > + class basic_ifstream; + + template > + class basic_ofstream; + + template > + class basic_fstream; + + template > + class istreambuf_iterator; + + template > + class ostreambuf_iterator; + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // Not included. (??? Apparently no LWG number?) + class ios_base; + + /** + * @defgroup s27_2_iosfwd I/O Forward Declarations + * + * Nearly all of the I/O classes are parameterized on the type of + * characters they read and write. (The major exception is ios_base at + * the top of the hierarchy.) This is a change from pre-Standard + * streams, which were not templates. + * + * For ease of use and compatibility, all of the basic_* I/O-related + * classes are given typedef names for both of the builtin character + * widths (wide and narrow). The typedefs are the same as the + * pre-Standard names, for example: + * + * @code + * typedef basic_ifstream ifstream; + * @endcode + * + * Because properly forward-declaring these classes can be difficult, you + * should not do it yourself. Instead, include the <iosfwd> + * header, which contains only declarations of all the I/O classes as + * well as the typedefs. Trying to forward-declare the typedefs + * themselves (e.g., "class ostream;") is not valid ISO C++. + * + * For more specific declarations, see + * http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#10 + * + * @{ + */ + typedef basic_ios ios; ///< @isiosfwd + typedef basic_streambuf streambuf; ///< @isiosfwd + typedef basic_istream istream; ///< @isiosfwd + typedef basic_ostream ostream; ///< @isiosfwd + typedef basic_iostream iostream; ///< @isiosfwd + typedef basic_stringbuf stringbuf; ///< @isiosfwd + typedef basic_istringstream istringstream; ///< @isiosfwd + typedef basic_ostringstream ostringstream; ///< @isiosfwd + typedef basic_stringstream stringstream; ///< @isiosfwd + typedef basic_filebuf filebuf; ///< @isiosfwd + typedef basic_ifstream ifstream; ///< @isiosfwd + typedef basic_ofstream ofstream; ///< @isiosfwd + typedef basic_fstream fstream; ///< @isiosfwd + +#ifdef _GLIBCXX_USE_WCHAR_T + typedef basic_ios wios; ///< @isiosfwd + typedef basic_streambuf wstreambuf; ///< @isiosfwd + typedef basic_istream wistream; ///< @isiosfwd + typedef basic_ostream wostream; ///< @isiosfwd + typedef basic_iostream wiostream; ///< @isiosfwd + typedef basic_stringbuf wstringbuf; ///< @isiosfwd + typedef basic_istringstream wistringstream; ///< @isiosfwd + typedef basic_ostringstream wostringstream; ///< @isiosfwd + typedef basic_stringstream wstringstream; ///< @isiosfwd + typedef basic_filebuf wfilebuf; ///< @isiosfwd + typedef basic_ifstream wifstream; ///< @isiosfwd + typedef basic_ofstream wofstream; ///< @isiosfwd + typedef basic_fstream wfstream; ///< @isiosfwd +#endif + /** @} */ + +} // namespace std + +#endif /* _GLIBCXX_IOSFWD */ diff --git a/cpp_src/iostream b/cpp_src/iostream new file mode 100644 index 0000000..3db0fe4 --- /dev/null +++ b/cpp_src/iostream @@ -0,0 +1,87 @@ +// Standard iostream objects -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2001, 2002, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file iostream + * This is a Standard C++ Library header. + */ + +// +// ISO C++ 14882: 27.3 Standard iostream objects +// + +#ifndef _GLIBCXX_IOSTREAM +#define _GLIBCXX_IOSTREAM 1 + +#pragma GCC system_header + +#include +#include +#include + +namespace std { + + /** + * @name Standard Stream Objects + * + * The <iostream> header declares the eight standard stream + * objects. For other declarations, see + * http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#10 and the + * @link s27_2_iosfwd I/O forward declarations @endlink + * + * They are required by default to cooperate with the global C library's + * @c FILE streams, and to be available during program startup and + * termination. For more information, see the HOWTO linked to above. + */ + //@{ + extern istream cin; ///< Linked to standard input + extern ostream cout; ///< Linked to standard output + extern ostream cerr; ///< Linked to standard error (unbuffered) + extern ostream clog; ///< Linked to standard error (buffered) + + // HACK by me for completion + static istream cin; ///< Linked to standard input + static ostream cout; ///< Linked to standard output + static ostream cerr; ///< Linked to standard error (unbuffered) + static ostream clog; ///< Linked to standard error (buffered) + +#ifdef _GLIBCXX_USE_WCHAR_T + extern wistream wcin; ///< Linked to standard input + extern wostream wcout; ///< Linked to standard output + extern wostream wcerr; ///< Linked to standard error (unbuffered) + extern wostream wclog; ///< Linked to standard error (buffered) +#endif + //@} + + // For construction of filebuffers for cout, cin, cerr, clog et. al. + static ios_base::Init __ioinit; + +} // namespace std + +#endif /* _GLIBCXX_IOSTREAM */ diff --git a/cpp_src/istream b/cpp_src/istream new file mode 100644 index 0000000..251786d --- /dev/null +++ b/cpp_src/istream @@ -0,0 +1,848 @@ +// Input streams -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +// +// ISO C++ 14882: 27.6.1 Input streams +// + +/** @file istream + * This is a Standard C++ Library header. + */ + +#ifndef _GLIBCXX_ISTREAM +#define _GLIBCXX_ISTREAM 1 + +#pragma GCC system_header + +#include +#include // For numeric_limits + +namespace std { + + // [27.6.1.1] Template class basic_istream + /** + * @brief Controlling input. + * + * This is the base class for all input streams. It provides text + * formatting of all builtin types, and communicates with any class + * derived from basic_streambuf to do the actual input. + */ + template + class basic_istream : virtual public basic_ios<_CharT, _Traits> + { + public: + // Types (inherited from basic_ios (27.4.4)): + typedef _CharT char_type; + typedef typename _Traits::int_type int_type; + typedef typename _Traits::pos_type pos_type; + typedef typename _Traits::off_type off_type; + typedef _Traits traits_type; + + // Non-standard Types: + typedef basic_streambuf<_CharT, _Traits> __streambuf_type; + typedef basic_ios<_CharT, _Traits> __ios_type; + typedef basic_istream<_CharT, _Traits> __istream_type; + typedef num_get<_CharT, istreambuf_iterator<_CharT, _Traits> > + __num_get_type; + typedef ctype<_CharT> __ctype_type; + + template + friend basic_istream<_CharT2, _Traits2>& + operator>>(basic_istream<_CharT2, _Traits2>&, _CharT2&); + + template + friend basic_istream<_CharT2, _Traits2>& + operator>>(basic_istream<_CharT2, _Traits2>&, _CharT2*); + + protected: + // Data Members: + /** + * @if maint + * The number of characters extracted in the previous unformatted + * function; see gcount(). + * @endif + */ + streamsize _M_gcount; + + public: + // [27.6.1.1.1] constructor/destructor + /** + * @brief Base constructor. + * + * This ctor is almost never called by the user directly, rather from + * derived classes' initialization lists, which pass a pointer to + * their own stream buffer. + */ + explicit + basic_istream(__streambuf_type* __sb): _M_gcount(streamsize(0)) + { this->init(__sb); } + + /** + * @brief Base destructor. + * + * This does very little apart from providing a virtual base dtor. + */ + virtual + ~basic_istream() + { _M_gcount = streamsize(0); } + + // [27.6.1.1.2] prefix/suffix + class sentry; + friend class sentry; + + // [27.6.1.2] formatted input + // [27.6.1.2.3] basic_istream::operator>> + //@{ + /** + * @brief Interface for manipulators. + * + * Manuipulators such as @c std::ws and @c std::dec use these + * functions in constructs like "std::cin >> std::ws". For more + * information, see the iomanip header. + */ + __istream_type& + operator>>(__istream_type& (*__pf)(__istream_type&)) + { return __pf(*this); } + + __istream_type& + operator>>(__ios_type& (*__pf)(__ios_type&)) + { + __pf(*this); + return *this; + } + + __istream_type& + operator>>(ios_base& (*__pf)(ios_base&)) + { + __pf(*this); + return *this; + } + //@} + + // [27.6.1.2.2] arithmetic extractors + /** + * @name Arithmetic Extractors + * + * All the @c operator>> functions (aka formatted input + * functions) have some common behavior. Each starts by + * constructing a temporary object of type std::basic_istream::sentry + * with the second argument (noskipws) set to false. This has several + * effects, concluding with the setting of a status flag; see the + * sentry documentation for more. + * + * If the sentry status is good, the function tries to extract + * whatever data is appropriate for the type of the argument. + * + * If an exception is thrown during extraction, ios_base::badbit + * will be turned on in the stream's error state without causing an + * ios_base::failure to be thrown. The original exception will then + * be rethrown. + */ + //@{ + /** + * @brief Basic arithmetic extractors + * @param A variable of builtin type. + * @return @c *this if successful + * + * These functions use the stream's current locale (specifically, the + * @c num_get facet) to parse the input data. + */ + __istream_type& + operator>>(bool& __n) + { return _M_extract(__n); } + + __istream_type& + operator>>(short& __n); + + __istream_type& + operator>>(unsigned short& __n) + { return _M_extract(__n); } + + __istream_type& + operator>>(int& __n); + + __istream_type& + operator>>(unsigned int& __n) + { return _M_extract(__n); } + + __istream_type& + operator>>(long& __n) + { return _M_extract(__n); } + + __istream_type& + operator>>(unsigned long& __n) + { return _M_extract(__n); } + +#ifdef _GLIBCXX_USE_LONG_LONG + __istream_type& + operator>>(long long& __n) + { return _M_extract(__n); } + + __istream_type& + operator>>(unsigned long long& __n) + { return _M_extract(__n); } +#endif + + __istream_type& + operator>>(float& __f) + { return _M_extract(__f); } + + __istream_type& + operator>>(double& __f) + { return _M_extract(__f); } + + __istream_type& + operator>>(long double& __f) + { return _M_extract(__f); } + + __istream_type& + operator>>(void*& __p) + { return _M_extract(__p); } + + /** + * @brief Extracting into another streambuf. + * @param sb A pointer to a streambuf + * + * This function behaves like one of the basic arithmetic extractors, + * in that it also constructs a sentry object and has the same error + * handling behavior. + * + * If @a sb is NULL, the stream will set failbit in its error state. + * + * Characters are extracted from this stream and inserted into the + * @a sb streambuf until one of the following occurs: + * + * - the input stream reaches end-of-file, + * - insertion into the output buffer fails (in this case, the + * character that would have been inserted is not extracted), or + * - an exception occurs (and in this case is caught) + * + * If the function inserts no characters, failbit is set. + */ + __istream_type& + operator>>(__streambuf_type* __sb); + //@} + + // [27.6.1.3] unformatted input + /** + * @brief Character counting + * @return The number of characters extracted by the previous + * unformatted input function dispatched for this stream. + */ + streamsize + gcount() const + { return _M_gcount; } + + /** + * @name Unformatted Input Functions + * + * All the unformatted input functions have some common behavior. + * Each starts by constructing a temporary object of type + * std::basic_istream::sentry with the second argument (noskipws) + * set to true. This has several effects, concluding with the + * setting of a status flag; see the sentry documentation for more. + * + * If the sentry status is good, the function tries to extract + * whatever data is appropriate for the type of the argument. + * + * The number of characters extracted is stored for later retrieval + * by gcount(). + * + * If an exception is thrown during extraction, ios_base::badbit + * will be turned on in the stream's error state without causing an + * ios_base::failure to be thrown. The original exception will then + * be rethrown. + */ + //@{ + /** + * @brief Simple extraction. + * @return A character, or eof(). + * + * Tries to extract a character. If none are available, sets failbit + * and returns traits::eof(). + */ + int_type + get(); + + /** + * @brief Simple extraction. + * @param c The character in which to store data. + * @return *this + * + * Tries to extract a character and store it in @a c. If none are + * available, sets failbit and returns traits::eof(). + * + * @note This function is not overloaded on signed char and + * unsigned char. + */ + __istream_type& + get(char_type& __c); + + /** + * @brief Simple multiple-character extraction. + * @param s Pointer to an array. + * @param n Maximum number of characters to store in @a s. + * @param delim A "stop" character. + * @return *this + * + * Characters are extracted and stored into @a s until one of the + * following happens: + * + * - @c n-1 characters are stored + * - the input sequence reaches EOF + * - the next character equals @a delim, in which case the character + * is not extracted + * + * If no characters are stored, failbit is set in the stream's error + * state. + * + * In any case, a null character is stored into the next location in + * the array. + * + * @note This function is not overloaded on signed char and + * unsigned char. + */ + __istream_type& + get(char_type* __s, streamsize __n, char_type __delim); + + /** + * @brief Simple multiple-character extraction. + * @param s Pointer to an array. + * @param n Maximum number of characters to store in @a s. + * @return *this + * + * Returns @c get(s,n,widen('\n')). + */ + __istream_type& + get(char_type* __s, streamsize __n) + { return this->get(__s, __n, this->widen('\n')); } + + /** + * @brief Extraction into another streambuf. + * @param sb A streambuf in which to store data. + * @param delim A "stop" character. + * @return *this + * + * Characters are extracted and inserted into @a sb until one of the + * following happens: + * + * - the input sequence reaches EOF + * - insertion into the output buffer fails (in this case, the + * character that would have been inserted is not extracted) + * - the next character equals @a delim (in this case, the character + * is not extracted) + * - an exception occurs (and in this case is caught) + * + * If no characters are stored, failbit is set in the stream's error + * state. + */ + __istream_type& + get(__streambuf_type& __sb, char_type __delim); + + /** + * @brief Extraction into another streambuf. + * @param sb A streambuf in which to store data. + * @return *this + * + * Returns @c get(sb,widen('\n')). + */ + __istream_type& + get(__streambuf_type& __sb) + { return this->get(__sb, this->widen('\n')); } + + /** + * @brief String extraction. + * @param s A character array in which to store the data. + * @param n Maximum number of characters to extract. + * @param delim A "stop" character. + * @return *this + * + * Extracts and stores characters into @a s until one of the + * following happens. Note that these criteria are required to be + * tested in the order listed here, to allow an input line to exactly + * fill the @a s array without setting failbit. + * + * -# the input sequence reaches end-of-file, in which case eofbit + * is set in the stream error state + * -# the next character equals @c delim, in which case the character + * is extracted (and therefore counted in @c gcount()) but not stored + * -# @c n-1 characters are stored, in which case failbit is set + * in the stream error state + * + * If no characters are extracted, failbit is set. (An empty line of + * input should therefore not cause failbit to be set.) + * + * In any case, a null character is stored in the next location in + * the array. + */ + __istream_type& + getline(char_type* __s, streamsize __n, char_type __delim); + + /** + * @brief String extraction. + * @param s A character array in which to store the data. + * @param n Maximum number of characters to extract. + * @return *this + * + * Returns @c getline(s,n,widen('\n')). + */ + __istream_type& + getline(char_type* __s, streamsize __n) + { return this->getline(__s, __n, this->widen('\n')); } + + /** + * @brief Discarding characters + * @param n Number of characters to discard. + * @param delim A "stop" character. + * @return *this + * + * Extracts characters and throws them away until one of the + * following happens: + * - if @a n @c != @c std::numeric_limits::max(), @a n + * characters are extracted + * - the input sequence reaches end-of-file + * - the next character equals @a delim (in this case, the character + * is extracted); note that this condition will never occur if + * @a delim equals @c traits::eof(). + * + * NB: Provide three overloads, instead of the single function + * (with defaults) mandated by the Standard: this leads to a + * better performing implementation, while still conforming to + * the Standard. + */ + __istream_type& + ignore(); + + __istream_type& + ignore(streamsize __n); + + __istream_type& + ignore(streamsize __n, int_type __delim); + + /** + * @brief Looking ahead in the stream + * @return The next character, or eof(). + * + * If, after constructing the sentry object, @c good() is false, + * returns @c traits::eof(). Otherwise reads but does not extract + * the next input character. + */ + int_type + peek(); + + /** + * @brief Extraction without delimiters. + * @param s A character array. + * @param n Maximum number of characters to store. + * @return *this + * + * If the stream state is @c good(), extracts characters and stores + * them into @a s until one of the following happens: + * - @a n characters are stored + * - the input sequence reaches end-of-file, in which case the error + * state is set to @c failbit|eofbit. + * + * @note This function is not overloaded on signed char and + * unsigned char. + */ + __istream_type& + read(char_type* __s, streamsize __n); + + /** + * @brief Extraction until the buffer is exhausted, but no more. + * @param s A character array. + * @param n Maximum number of characters to store. + * @return The number of characters extracted. + * + * Extracts characters and stores them into @a s depending on the + * number of characters remaining in the streambuf's buffer, + * @c rdbuf()->in_avail(), called @c A here: + * - if @c A @c == @c -1, sets eofbit and extracts no characters + * - if @c A @c == @c 0, extracts no characters + * - if @c A @c > @c 0, extracts @c min(A,n) + * + * The goal is to empty the current buffer, and to not request any + * more from the external input sequence controlled by the streambuf. + */ + streamsize + readsome(char_type* __s, streamsize __n); + + /** + * @brief Unextracting a single character. + * @param c The character to push back into the input stream. + * @return *this + * + * If @c rdbuf() is not null, calls @c rdbuf()->sputbackc(c). + * + * If @c rdbuf() is null or if @c sputbackc() fails, sets badbit in + * the error state. + * + * @note Since no characters are extracted, the next call to + * @c gcount() will return 0, as required by DR 60. + */ + __istream_type& + putback(char_type __c); + + /** + * @brief Unextracting the previous character. + * @return *this + * + * If @c rdbuf() is not null, calls @c rdbuf()->sungetc(c). + * + * If @c rdbuf() is null or if @c sungetc() fails, sets badbit in + * the error state. + * + * @note Since no characters are extracted, the next call to + * @c gcount() will return 0, as required by DR 60. + */ + __istream_type& + unget(); + + /** + * @brief Synchronizing the stream buffer. + * @return 0 on success, -1 on failure + * + * If @c rdbuf() is a null pointer, returns -1. + * + * Otherwise, calls @c rdbuf()->pubsync(), and if that returns -1, + * sets badbit and returns -1. + * + * Otherwise, returns 0. + * + * @note This function does not count the number of characters + * extracted, if any, and therefore does not affect the next + * call to @c gcount(). + */ + int + sync(); + + /** + * @brief Getting the current read position. + * @return A file position object. + * + * If @c fail() is not false, returns @c pos_type(-1) to indicate + * failure. Otherwise returns @c rdbuf()->pubseekoff(0,cur,in). + * + * @note This function does not count the number of characters + * extracted, if any, and therefore does not affect the next + * call to @c gcount(). + */ + pos_type + tellg(); + + /** + * @brief Changing the current read position. + * @param pos A file position object. + * @return *this + * + * If @c fail() is not true, calls @c rdbuf()->pubseekpos(pos). If + * that function fails, sets failbit. + * + * @note This function does not count the number of characters + * extracted, if any, and therefore does not affect the next + * call to @c gcount(). + */ + __istream_type& + seekg(pos_type); + + /** + * @brief Changing the current read position. + * @param off A file offset object. + * @param dir The direction in which to seek. + * @return *this + * + * If @c fail() is not true, calls @c rdbuf()->pubseekoff(off,dir). + * If that function fails, sets failbit. + * + * @note This function does not count the number of characters + * extracted, if any, and therefore does not affect the next + * call to @c gcount(). + */ + __istream_type& + seekg(off_type, ios_base::seekdir); + //@} + + protected: + explicit + basic_istream(): _M_gcount(streamsize(0)) { } + + template + __istream_type& + _M_extract(_ValueT& __v); + }; + + // Explicit specialization declarations, defined in src/istream.cc. + template<> + basic_istream& + basic_istream:: + getline(char_type* __s, streamsize __n, char_type __delim); + + template<> + basic_istream& + basic_istream:: + ignore(streamsize __n); + + template<> + basic_istream& + basic_istream:: + ignore(streamsize __n, int_type __delim); + +#ifdef _GLIBCXX_USE_WCHAR_T + template<> + basic_istream& + basic_istream:: + getline(char_type* __s, streamsize __n, char_type __delim); + + template<> + basic_istream& + basic_istream:: + ignore(streamsize __n); + + template<> + basic_istream& + basic_istream:: + ignore(streamsize __n, int_type __delim); +#endif + + /** + * @brief Performs setup work for input streams. + * + * Objects of this class are created before all of the standard + * extractors are run. It is responsible for "exception-safe prefix and + * suffix operations," although only prefix actions are currently required + * by the standard. Additional actions may be added by the + * implementation, and we list them in + * http://gcc.gnu.org/onlinedocs/libstdc++/17_intro/howto.html#5 + * under [27.6] notes. + */ + template + class basic_istream<_CharT, _Traits>::sentry + { + public: + /// Easy access to dependant types. + typedef _Traits traits_type; + typedef basic_streambuf<_CharT, _Traits> __streambuf_type; + typedef basic_istream<_CharT, _Traits> __istream_type; + typedef typename __istream_type::__ctype_type __ctype_type; + typedef typename _Traits::int_type __int_type; + + /** + * @brief The constructor performs all the work. + * @param is The input stream to guard. + * @param noskipws Whether to consume whitespace or not. + * + * If the stream state is good (@a is.good() is true), then the + * following actions are performed, otherwise the sentry state is + * false ("not okay") and failbit is set in the stream state. + * + * The sentry's preparatory actions are: + * + * -# if the stream is tied to an output stream, @c is.tie()->flush() + * is called to synchronize the output sequence + * -# if @a noskipws is false, and @c ios_base::skipws is set in + * @c is.flags(), the sentry extracts and discards whitespace + * characters from the stream. The currently imbued locale is + * used to determine whether each character is whitespace. + * + * If the stream state is still good, then the sentry state becomes + * true ("okay"). + */ + explicit + sentry(basic_istream<_CharT, _Traits>& __is, bool __noskipws = false); + + /** + * @brief Quick status checking. + * @return The sentry state. + * + * For ease of use, sentries may be converted to booleans. The + * return value is that of the sentry state (true == okay). + */ + operator bool() const + { return _M_ok; } + + private: + bool _M_ok; + }; + + // [27.6.1.2.3] character extraction templates + //@{ + /** + * @brief Character extractors + * @param in An input stream. + * @param c A character reference. + * @return in + * + * Behaves like one of the formatted arithmetic extractors described in + * std::basic_istream. After constructing a sentry object with good + * status, this function extracts a character (if one is available) and + * stores it in @a c. Otherwise, sets failbit in the input stream. + */ + template + basic_istream<_CharT, _Traits>& + operator>>(basic_istream<_CharT, _Traits>& __in, _CharT& __c); + + template + inline basic_istream& + operator>>(basic_istream& __in, unsigned char& __c) + { return (__in >> reinterpret_cast(__c)); } + + template + inline basic_istream& + operator>>(basic_istream& __in, signed char& __c) + { return (__in >> reinterpret_cast(__c)); } + //@} + + //@{ + /** + * @brief Character string extractors + * @param in An input stream. + * @param s A pointer to a character array. + * @return in + * + * Behaves like one of the formatted arithmetic extractors described in + * std::basic_istream. After constructing a sentry object with good + * status, this function extracts up to @c n characters and stores them + * into the array starting at @a s. @c n is defined as: + * + * - if @c width() is greater than zero, @c n is width() + * - otherwise @c n is "the number of elements of the largest array of + * @c char_type that can store a terminating @c eos." [27.6.1.2.3]/6 + * + * Characters are extracted and stored until one of the following happens: + * - @c n-1 characters are stored + * - EOF is reached + * - the next character is whitespace according to the current locale + * - the next character is a null byte (i.e., @c charT() ) + * + * @c width(0) is then called for the input stream. + * + * If no characters are extracted, sets failbit. + */ + template + basic_istream<_CharT, _Traits>& + operator>>(basic_istream<_CharT, _Traits>& __in, _CharT* __s); + + // Explicit specialization declaration, defined in src/istream.cc. + template<> + basic_istream& + operator>>(basic_istream& __in, char* __s); + + template + inline basic_istream& + operator>>(basic_istream& __in, unsigned char* __s) + { return (__in >> reinterpret_cast(__s)); } + + template + inline basic_istream& + operator>>(basic_istream& __in, signed char* __s) + { return (__in >> reinterpret_cast(__s)); } + //@} + + // 27.6.1.5 Template class basic_iostream + /** + * @brief Merging istream and ostream capabilities. + * + * This class multiply inherits from the input and output stream classes + * simply to provide a single interface. + */ + template + class basic_iostream + : public basic_istream<_CharT, _Traits>, + public basic_ostream<_CharT, _Traits> + { + public: + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 271. basic_iostream missing typedefs + // Types (inherited): + typedef _CharT char_type; + typedef typename _Traits::int_type int_type; + typedef typename _Traits::pos_type pos_type; + typedef typename _Traits::off_type off_type; + typedef _Traits traits_type; + + // Non-standard Types: + typedef basic_istream<_CharT, _Traits> __istream_type; + typedef basic_ostream<_CharT, _Traits> __ostream_type; + + /** + * @brief Constructor does nothing. + * + * Both of the parent classes are initialized with the same + * streambuf pointer passed to this constructor. + */ + explicit + basic_iostream(basic_streambuf<_CharT, _Traits>* __sb) + : __istream_type(), __ostream_type() + { this->init(__sb); } + + /** + * @brief Destructor does nothing. + */ + virtual + ~basic_iostream() { } + + protected: + explicit + basic_iostream() : __istream_type(), __ostream_type() + { } + }; + + // [27.6.1.4] standard basic_istream manipulators + /** + * @brief Quick and easy way to eat whitespace + * + * This manipulator extracts whitespace characters, stopping when the + * next character is non-whitespace, or when the input sequence is empty. + * If the sequence is empty, @c eofbit is set in the stream, but not + * @c failbit. + * + * The current locale is used to distinguish whitespace characters. + * + * Example: + * @code + * MyClass mc; + * + * std::cin >> std::ws >> mc; + * @endcode + * will skip leading whitespace before calling operator>> on cin and your + * object. Note that the same effect can be achieved by creating a + * std::basic_istream::sentry inside your definition of operator>>. + */ + template + basic_istream<_CharT, _Traits>& + ws(basic_istream<_CharT, _Traits>& __is); + +} // namespace std + +#ifndef _GLIBCXX_EXPORT_TEMPLATE +# include +#endif + +#endif /* _GLIBCXX_ISTREAM */ diff --git a/cpp_src/istream.tcc b/cpp_src/istream.tcc new file mode 100644 index 0000000..5caf5d3 --- /dev/null +++ b/cpp_src/istream.tcc @@ -0,0 +1,1047 @@ +// istream classes -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file istream.tcc + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 27.6.1 Input streams +// + +#ifndef _ISTREAM_TCC +#define _ISTREAM_TCC 1 + +#pragma GCC system_header + +#include +#include // For flush() + +namespace std { + + template + basic_istream<_CharT, _Traits>::sentry:: + sentry(basic_istream<_CharT, _Traits>& __in, bool __noskip) : _M_ok(false) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + if (__in.good()) + { + if (__in.tie()) + __in.tie()->flush(); + if (!__noskip && (__in.flags() & ios_base::skipws)) + { + const __int_type __eof = traits_type::eof(); + __streambuf_type* __sb = __in.rdbuf(); + __int_type __c = __sb->sgetc(); + + const __ctype_type& __ct = __check_facet(__in._M_ctype); + while (!traits_type::eq_int_type(__c, __eof) + && __ct.is(ctype_base::space, + traits_type::to_char_type(__c))) + __c = __sb->snextc(); + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 195. Should basic_istream::sentry's constructor ever + // set eofbit? + if (traits_type::eq_int_type(__c, __eof)) + __err |= ios_base::eofbit; + } + } + + if (__in.good() && __err == ios_base::goodbit) + _M_ok = true; + else + { + __err |= ios_base::failbit; + __in.setstate(__err); + } + } + + template + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + _M_extract(_ValueT& __v) + { + sentry __cerb(*this, false); + if (__cerb) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + try + { + const __num_get_type& __ng = __check_facet(this->_M_num_get); + __ng.get(*this, 0, *this, __err, __v); + } + catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + } + return *this; + } + + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + operator>>(short& __n) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 118. basic_istream uses nonexistent num_get member functions. + long __l; + _M_extract(__l); + if (!this->fail()) + { + if (numeric_limits::min() <= __l + && __l <= numeric_limits::max()) + __n = __l; + else + this->setstate(ios_base::failbit); + } + return *this; + } + + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + operator>>(int& __n) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 118. basic_istream uses nonexistent num_get member functions. + long __l; + _M_extract(__l); + if (!this->fail()) + { + if (numeric_limits::min() <= __l + && __l <= numeric_limits::max()) + __n = __l; + else + this->setstate(ios_base::failbit); + } + return *this; + } + + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + operator>>(__streambuf_type* __sbout) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + sentry __cerb(*this, false); + if (__cerb && __sbout) + { + try + { + bool __ineof; + if (!__copy_streambufs_eof(this->rdbuf(), __sbout, __ineof)) + __err |= ios_base::failbit; + if (__ineof) + __err |= ios_base::eofbit; + } + catch(...) + { this->_M_setstate(ios_base::failbit); } + } + else if (!__sbout) + __err |= ios_base::failbit; + if (__err) + this->setstate(__err); + return *this; + } + + template + typename basic_istream<_CharT, _Traits>::int_type + basic_istream<_CharT, _Traits>:: + get(void) + { + const int_type __eof = traits_type::eof(); + int_type __c = __eof; + _M_gcount = 0; + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + sentry __cerb(*this, true); + if (__cerb) + { + try + { + __c = this->rdbuf()->sbumpc(); + // 27.6.1.1 paragraph 3 + if (!traits_type::eq_int_type(__c, __eof)) + _M_gcount = 1; + else + __err |= ios_base::eofbit; + } + catch(...) + { this->_M_setstate(ios_base::badbit); } + } + if (!_M_gcount) + __err |= ios_base::failbit; + if (__err) + this->setstate(__err); + return __c; + } + + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + get(char_type& __c) + { + _M_gcount = 0; + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + sentry __cerb(*this, true); + if (__cerb) + { + try + { + const int_type __cb = this->rdbuf()->sbumpc(); + // 27.6.1.1 paragraph 3 + if (!traits_type::eq_int_type(__cb, traits_type::eof())) + { + _M_gcount = 1; + __c = traits_type::to_char_type(__cb); + } + else + __err |= ios_base::eofbit; + } + catch(...) + { this->_M_setstate(ios_base::badbit); } + } + if (!_M_gcount) + __err |= ios_base::failbit; + if (__err) + this->setstate(__err); + return *this; + } + + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + get(char_type* __s, streamsize __n, char_type __delim) + { + _M_gcount = 0; + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + sentry __cerb(*this, true); + if (__cerb) + { + try + { + const int_type __idelim = traits_type::to_int_type(__delim); + const int_type __eof = traits_type::eof(); + __streambuf_type* __sb = this->rdbuf(); + int_type __c = __sb->sgetc(); + + while (_M_gcount + 1 < __n + && !traits_type::eq_int_type(__c, __eof) + && !traits_type::eq_int_type(__c, __idelim)) + { + *__s++ = traits_type::to_char_type(__c); + ++_M_gcount; + __c = __sb->snextc(); + } + if (traits_type::eq_int_type(__c, __eof)) + __err |= ios_base::eofbit; + } + catch(...) + { this->_M_setstate(ios_base::badbit); } + } + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 243. get and getline when sentry reports failure. + if (__n > 0) + *__s = char_type(); + if (!_M_gcount) + __err |= ios_base::failbit; + if (__err) + this->setstate(__err); + return *this; + } + + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + get(__streambuf_type& __sb, char_type __delim) + { + _M_gcount = 0; + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + sentry __cerb(*this, true); + if (__cerb) + { + try + { + const int_type __idelim = traits_type::to_int_type(__delim); + const int_type __eof = traits_type::eof(); + __streambuf_type* __this_sb = this->rdbuf(); + int_type __c = __this_sb->sgetc(); + char_type __c2 = traits_type::to_char_type(__c); + + while (!traits_type::eq_int_type(__c, __eof) + && !traits_type::eq_int_type(__c, __idelim) + && !traits_type::eq_int_type(__sb.sputc(__c2), __eof)) + { + ++_M_gcount; + __c = __this_sb->snextc(); + __c2 = traits_type::to_char_type(__c); + } + if (traits_type::eq_int_type(__c, __eof)) + __err |= ios_base::eofbit; + } + catch(...) + { this->_M_setstate(ios_base::badbit); } + } + if (!_M_gcount) + __err |= ios_base::failbit; + if (__err) + this->setstate(__err); + return *this; + } + + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + getline(char_type* __s, streamsize __n, char_type __delim) + { + _M_gcount = 0; + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + sentry __cerb(*this, true); + if (__cerb) + { + try + { + const int_type __idelim = traits_type::to_int_type(__delim); + const int_type __eof = traits_type::eof(); + __streambuf_type* __sb = this->rdbuf(); + int_type __c = __sb->sgetc(); + + while (_M_gcount + 1 < __n + && !traits_type::eq_int_type(__c, __eof) + && !traits_type::eq_int_type(__c, __idelim)) + { + *__s++ = traits_type::to_char_type(__c); + __c = __sb->snextc(); + ++_M_gcount; + } + if (traits_type::eq_int_type(__c, __eof)) + __err |= ios_base::eofbit; + else + { + if (traits_type::eq_int_type(__c, __idelim)) + { + __sb->sbumpc(); + ++_M_gcount; + } + else + __err |= ios_base::failbit; + } + } + catch(...) + { this->_M_setstate(ios_base::badbit); } + } + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 243. get and getline when sentry reports failure. + if (__n > 0) + *__s = char_type(); + if (!_M_gcount) + __err |= ios_base::failbit; + if (__err) + this->setstate(__err); + return *this; + } + + // We provide three overloads, since the first two are much simpler + // than the general case. Also, the latter two can thus adopt the + // same "batchy" strategy used by getline above. + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + ignore(void) + { + _M_gcount = 0; + sentry __cerb(*this, true); + if (__cerb) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + try + { + const int_type __eof = traits_type::eof(); + __streambuf_type* __sb = this->rdbuf(); + + if (traits_type::eq_int_type(__sb->sbumpc(), __eof)) + __err |= ios_base::eofbit; + else + _M_gcount = 1; + } + catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + } + return *this; + } + + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + ignore(streamsize __n) + { + _M_gcount = 0; + sentry __cerb(*this, true); + if (__cerb && __n > 0) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + try + { + const int_type __eof = traits_type::eof(); + __streambuf_type* __sb = this->rdbuf(); + int_type __c = __sb->sgetc(); + + // N.B. On LFS-enabled platforms streamsize is still 32 bits + // wide: if we want to implement the standard mandated behavior + // for n == max() (see 27.6.1.3/24) we are at risk of signed + // integer overflow: thus these contortions. Also note that, + // by definition, when more than 2G chars are actually ignored, + // _M_gcount (the return value of gcount, that is) cannot be + // really correct, being unavoidably too small. + bool __large_ignore = false; + while (true) + { + while (_M_gcount < __n + && !traits_type::eq_int_type(__c, __eof)) + { + ++_M_gcount; + __c = __sb->snextc(); + } + if (__n == numeric_limits::max() + && !traits_type::eq_int_type(__c, __eof)) + { + _M_gcount = numeric_limits::min(); + __large_ignore = true; + } + else + break; + } + + if (__large_ignore) + _M_gcount = numeric_limits::max(); + + if (traits_type::eq_int_type(__c, __eof)) + __err |= ios_base::eofbit; + } + catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + } + return *this; + } + + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + ignore(streamsize __n, int_type __delim) + { + _M_gcount = 0; + sentry __cerb(*this, true); + if (__cerb && __n > 0) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + try + { + const int_type __eof = traits_type::eof(); + __streambuf_type* __sb = this->rdbuf(); + int_type __c = __sb->sgetc(); + + // See comment above. + bool __large_ignore = false; + while (true) + { + while (_M_gcount < __n + && !traits_type::eq_int_type(__c, __eof) + && !traits_type::eq_int_type(__c, __delim)) + { + ++_M_gcount; + __c = __sb->snextc(); + } + if (__n == numeric_limits::max() + && !traits_type::eq_int_type(__c, __eof) + && !traits_type::eq_int_type(__c, __delim)) + { + _M_gcount = numeric_limits::min(); + __large_ignore = true; + } + else + break; + } + + if (__large_ignore) + _M_gcount = numeric_limits::max(); + + if (traits_type::eq_int_type(__c, __eof)) + __err |= ios_base::eofbit; + else if (traits_type::eq_int_type(__c, __delim)) + { + if (_M_gcount < numeric_limits::max()) + ++_M_gcount; + __sb->sbumpc(); + } + } + catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + } + return *this; + } + + template + typename basic_istream<_CharT, _Traits>::int_type + basic_istream<_CharT, _Traits>:: + peek(void) + { + int_type __c = traits_type::eof(); + _M_gcount = 0; + sentry __cerb(*this, true); + if (__cerb) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + try + { + __c = this->rdbuf()->sgetc(); + if (traits_type::eq_int_type(__c, traits_type::eof())) + __err |= ios_base::eofbit; + } + catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + } + return __c; + } + + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + read(char_type* __s, streamsize __n) + { + _M_gcount = 0; + sentry __cerb(*this, true); + if (__cerb) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + try + { + _M_gcount = this->rdbuf()->sgetn(__s, __n); + if (_M_gcount != __n) + __err |= (ios_base::eofbit | ios_base::failbit); + } + catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + } + return *this; + } + + template + streamsize + basic_istream<_CharT, _Traits>:: + readsome(char_type* __s, streamsize __n) + { + _M_gcount = 0; + sentry __cerb(*this, true); + if (__cerb) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + try + { + // Cannot compare int_type with streamsize generically. + const streamsize __num = this->rdbuf()->in_avail(); + if (__num > 0) + _M_gcount = this->rdbuf()->sgetn(__s, std::min(__num, __n)); + else if (__num == -1) + __err |= ios_base::eofbit; + } + catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + } + return _M_gcount; + } + + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + putback(char_type __c) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 60. What is a formatted input function? + _M_gcount = 0; + sentry __cerb(*this, true); + if (__cerb) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + try + { + const int_type __eof = traits_type::eof(); + __streambuf_type* __sb = this->rdbuf(); + if (!__sb + || traits_type::eq_int_type(__sb->sputbackc(__c), __eof)) + __err |= ios_base::badbit; + } + catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + } + return *this; + } + + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + unget(void) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 60. What is a formatted input function? + _M_gcount = 0; + sentry __cerb(*this, true); + if (__cerb) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + try + { + const int_type __eof = traits_type::eof(); + __streambuf_type* __sb = this->rdbuf(); + if (!__sb + || traits_type::eq_int_type(__sb->sungetc(), __eof)) + __err |= ios_base::badbit; + } + catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + } + return *this; + } + + template + int + basic_istream<_CharT, _Traits>:: + sync(void) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR60. Do not change _M_gcount. + int __ret = -1; + sentry __cerb(*this, true); + if (__cerb) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + try + { + __streambuf_type* __sb = this->rdbuf(); + if (__sb) + { + if (__sb->pubsync() == -1) + __err |= ios_base::badbit; + else + __ret = 0; + } + } + catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + } + return __ret; + } + + template + typename basic_istream<_CharT, _Traits>::pos_type + basic_istream<_CharT, _Traits>:: + tellg(void) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR60. Do not change _M_gcount. + pos_type __ret = pos_type(-1); + try + { + if (!this->fail()) + __ret = this->rdbuf()->pubseekoff(0, ios_base::cur, + ios_base::in); + } + catch(...) + { this->_M_setstate(ios_base::badbit); } + return __ret; + } + + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + seekg(pos_type __pos) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR60. Do not change _M_gcount. + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + try + { + if (!this->fail()) + { + // 136. seekp, seekg setting wrong streams? + const pos_type __p = this->rdbuf()->pubseekpos(__pos, + ios_base::in); + + // 129. Need error indication from seekp() and seekg() + if (__p == pos_type(off_type(-1))) + __err |= ios_base::failbit; + } + } + catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + return *this; + } + + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + seekg(off_type __off, ios_base::seekdir __dir) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR60. Do not change _M_gcount. + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + try + { + if (!this->fail()) + { + // 136. seekp, seekg setting wrong streams? + const pos_type __p = this->rdbuf()->pubseekoff(__off, __dir, + ios_base::in); + + // 129. Need error indication from seekp() and seekg() + if (__p == pos_type(off_type(-1))) + __err |= ios_base::failbit; + } + } + catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + return *this; + } + + // 27.6.1.2.3 Character extraction templates + template + basic_istream<_CharT, _Traits>& + operator>>(basic_istream<_CharT, _Traits>& __in, _CharT& __c) + { + typedef basic_istream<_CharT, _Traits> __istream_type; + typedef typename __istream_type::int_type __int_type; + + typename __istream_type::sentry __cerb(__in, false); + if (__cerb) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + try + { + const __int_type __cb = __in.rdbuf()->sbumpc(); + if (!_Traits::eq_int_type(__cb, _Traits::eof())) + __c = _Traits::to_char_type(__cb); + else + __err |= (ios_base::eofbit | ios_base::failbit); + } + catch(...) + { __in._M_setstate(ios_base::badbit); } + if (__err) + __in.setstate(__err); + } + return __in; + } + + template + basic_istream<_CharT, _Traits>& + operator>>(basic_istream<_CharT, _Traits>& __in, _CharT* __s) + { + typedef basic_istream<_CharT, _Traits> __istream_type; + typedef typename __istream_type::__streambuf_type __streambuf_type; + typedef typename _Traits::int_type int_type; + typedef _CharT char_type; + typedef ctype<_CharT> __ctype_type; + + streamsize __extracted = 0; + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + typename __istream_type::sentry __cerb(__in, false); + if (__cerb) + { + try + { + // Figure out how many characters to extract. + streamsize __num = __in.width(); + if (__num <= 0) + __num = numeric_limits::max(); + + const __ctype_type& __ct = use_facet<__ctype_type>(__in.getloc()); + + const int_type __eof = _Traits::eof(); + __streambuf_type* __sb = __in.rdbuf(); + int_type __c = __sb->sgetc(); + + while (__extracted < __num - 1 + && !_Traits::eq_int_type(__c, __eof) + && !__ct.is(ctype_base::space, + _Traits::to_char_type(__c))) + { + *__s++ = _Traits::to_char_type(__c); + ++__extracted; + __c = __sb->snextc(); + } + if (_Traits::eq_int_type(__c, __eof)) + __err |= ios_base::eofbit; + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 68. Extractors for char* should store null at end + *__s = char_type(); + __in.width(0); + } + catch(...) + { __in._M_setstate(ios_base::badbit); } + } + if (!__extracted) + __err |= ios_base::failbit; + if (__err) + __in.setstate(__err); + return __in; + } + + // 27.6.1.4 Standard basic_istream manipulators + template + basic_istream<_CharT,_Traits>& + ws(basic_istream<_CharT,_Traits>& __in) + { + typedef basic_istream<_CharT, _Traits> __istream_type; + typedef typename __istream_type::__streambuf_type __streambuf_type; + typedef typename __istream_type::__ctype_type __ctype_type; + typedef typename __istream_type::int_type __int_type; + + const __ctype_type& __ct = use_facet<__ctype_type>(__in.getloc()); + const __int_type __eof = _Traits::eof(); + __streambuf_type* __sb = __in.rdbuf(); + __int_type __c = __sb->sgetc(); + + while (!_Traits::eq_int_type(__c, __eof) + && __ct.is(ctype_base::space, _Traits::to_char_type(__c))) + __c = __sb->snextc(); + + if (_Traits::eq_int_type(__c, __eof)) + __in.setstate(ios_base::eofbit); + return __in; + } + + // 21.3.7.9 basic_string::getline and operators + template + basic_istream<_CharT, _Traits>& + operator>>(basic_istream<_CharT, _Traits>& __in, + basic_string<_CharT, _Traits, _Alloc>& __str) + { + typedef basic_istream<_CharT, _Traits> __istream_type; + typedef typename __istream_type::int_type __int_type; + typedef typename __istream_type::__streambuf_type __streambuf_type; + typedef typename __istream_type::__ctype_type __ctype_type; + typedef basic_string<_CharT, _Traits, _Alloc> __string_type; + typedef typename __string_type::size_type __size_type; + + __size_type __extracted = 0; + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + typename __istream_type::sentry __cerb(__in, false); + if (__cerb) + { + try + { + // Avoid reallocation for common case. + __str.erase(); + _CharT __buf[128]; + __size_type __len = 0; + const streamsize __w = __in.width(); + const __size_type __n = __w > 0 ? static_cast<__size_type>(__w) + : __str.max_size(); + const __ctype_type& __ct = use_facet<__ctype_type>(__in.getloc()); + const __int_type __eof = _Traits::eof(); + __streambuf_type* __sb = __in.rdbuf(); + __int_type __c = __sb->sgetc(); + + while (__extracted < __n + && !_Traits::eq_int_type(__c, __eof) + && !__ct.is(ctype_base::space, _Traits::to_char_type(__c))) + { + if (__len == sizeof(__buf) / sizeof(_CharT)) + { + __str.append(__buf, sizeof(__buf) / sizeof(_CharT)); + __len = 0; + } + __buf[__len++] = _Traits::to_char_type(__c); + ++__extracted; + __c = __sb->snextc(); + } + __str.append(__buf, __len); + + if (_Traits::eq_int_type(__c, __eof)) + __err |= ios_base::eofbit; + __in.width(0); + } + catch(...) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 91. Description of operator>> and getline() for string<> + // might cause endless loop + __in._M_setstate(ios_base::badbit); + } + } + // 211. operator>>(istream&, string&) doesn't set failbit + if (!__extracted) + __err |= ios_base::failbit; + if (__err) + __in.setstate(__err); + return __in; + } + + template + basic_istream<_CharT, _Traits>& + getline(basic_istream<_CharT, _Traits>& __in, + basic_string<_CharT, _Traits, _Alloc>& __str, _CharT __delim) + { + typedef basic_istream<_CharT, _Traits> __istream_type; + typedef typename __istream_type::int_type __int_type; + typedef typename __istream_type::__streambuf_type __streambuf_type; + typedef typename __istream_type::__ctype_type __ctype_type; + typedef basic_string<_CharT, _Traits, _Alloc> __string_type; + typedef typename __string_type::size_type __size_type; + + __size_type __extracted = 0; + const __size_type __n = __str.max_size(); + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + typename __istream_type::sentry __cerb(__in, true); + if (__cerb) + { + try + { + __str.erase(); + const __int_type __idelim = _Traits::to_int_type(__delim); + const __int_type __eof = _Traits::eof(); + __streambuf_type* __sb = __in.rdbuf(); + __int_type __c = __sb->sgetc(); + + while (__extracted < __n + && !_Traits::eq_int_type(__c, __eof) + && !_Traits::eq_int_type(__c, __idelim)) + { + __str += _Traits::to_char_type(__c); + ++__extracted; + __c = __sb->snextc(); + } + + if (_Traits::eq_int_type(__c, __eof)) + __err |= ios_base::eofbit; + else if (_Traits::eq_int_type(__c, __idelim)) + { + ++__extracted; + __sb->sbumpc(); + } + else + __err |= ios_base::failbit; + } + catch(...) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 91. Description of operator>> and getline() for string<> + // might cause endless loop + __in._M_setstate(ios_base::badbit); + } + } + if (!__extracted) + __err |= ios_base::failbit; + if (__err) + __in.setstate(__err); + return __in; + } + + // Inhibit implicit instantiations for required instantiations, + // which are defined via explicit instantiations elsewhere. + // NB: This syntax is a GNU extension. +#if _GLIBCXX_EXTERN_TEMPLATE + extern template class basic_istream; + extern template istream& ws(istream&); + extern template istream& operator>>(istream&, char&); + extern template istream& operator>>(istream&, char*); + extern template istream& operator>>(istream&, unsigned char&); + extern template istream& operator>>(istream&, signed char&); + extern template istream& operator>>(istream&, unsigned char*); + extern template istream& operator>>(istream&, signed char*); + + extern template istream& istream::_M_extract(unsigned short&); + extern template istream& istream::_M_extract(unsigned int&); + extern template istream& istream::_M_extract(long&); + extern template istream& istream::_M_extract(unsigned long&); + extern template istream& istream::_M_extract(bool&); +#ifdef _GLIBCXX_USE_LONG_LONG + extern template istream& istream::_M_extract(long long&); + extern template istream& istream::_M_extract(unsigned long long&); +#endif + extern template istream& istream::_M_extract(float&); + extern template istream& istream::_M_extract(double&); + extern template istream& istream::_M_extract(long double&); + extern template istream& istream::_M_extract(void*&); + + extern template class basic_iostream; + +#ifdef _GLIBCXX_USE_WCHAR_T + extern template class basic_istream; + extern template wistream& ws(wistream&); + extern template wistream& operator>>(wistream&, wchar_t&); + extern template wistream& operator>>(wistream&, wchar_t*); + + extern template wistream& wistream::_M_extract(unsigned short&); + extern template wistream& wistream::_M_extract(unsigned int&); + extern template wistream& wistream::_M_extract(long&); + extern template wistream& wistream::_M_extract(unsigned long&); + extern template wistream& wistream::_M_extract(bool&); +#ifdef _GLIBCXX_USE_LONG_LONG + extern template wistream& wistream::_M_extract(long long&); + extern template wistream& wistream::_M_extract(unsigned long long&); +#endif + extern template wistream& wistream::_M_extract(float&); + extern template wistream& wistream::_M_extract(double&); + extern template wistream& wistream::_M_extract(long double&); + extern template wistream& wistream::_M_extract(void*&); + + extern template class basic_iostream; +#endif +#endif + +} // namespace std + +#endif diff --git a/cpp_src/iterator b/cpp_src/iterator new file mode 100644 index 0000000..f0317b4 --- /dev/null +++ b/cpp_src/iterator @@ -0,0 +1,75 @@ +// -*- C++ -*- + +// Copyright (C) 2001, 2002 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file include/iterator + * This is a Standard C++ Library header. + */ + +#ifndef _GLIBCXX_ITERATOR +#define _GLIBCXX_ITERATOR 1 + +#pragma GCC system_header + +#include +#include +#include +#include +#include +#include +#include +#include +#include + +#endif /* _GLIBCXX_ITERATOR */ diff --git a/cpp_src/limits b/cpp_src/limits new file mode 100644 index 0000000..8e85544 --- /dev/null +++ b/cpp_src/limits @@ -0,0 +1,1160 @@ +// The template and inlines for the numeric_limits classes. -*- C++ -*- + +// Copyright (C) 1999, 2000, 2001, 2002, 2003, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file limits + * This is a Standard C++ Library header. + */ + +// Note: this is not a conforming implementation. +// Written by Gabriel Dos Reis + +// +// ISO 14882:1998 +// 18.2.1 +// + +#ifndef _GLIBCXX_NUMERIC_LIMITS +#define _GLIBCXX_NUMERIC_LIMITS 1 + +#pragma GCC system_header + +#include + +// +// The numeric_limits<> traits document implementation-defined aspects +// of fundamental arithmetic data types (integers and floating points). +// From Standard C++ point of view, there are 13 such types: +// * integers +// bool (1) +// char, signed char, unsigned char (3) +// short, unsigned short (2) +// int, unsigned (2) +// long, unsigned long (2) +// +// * floating points +// float (1) +// double (1) +// long double (1) +// +// GNU C++ undertstands (where supported by the host C-library) +// * integer +// long long, unsigned long long (2) +// +// which brings us to 15 fundamental arithmetic data types in GNU C++. +// +// +// Since a numeric_limits<> is a bit tricky to get right, we rely on +// an interface composed of macros which should be defined in config/os +// or config/cpu when they differ from the generic (read arbitrary) +// definitions given here. +// + +// These values can be overridden in the target configuration file. +// The default values are appropriate for many 32-bit targets. + +// GCC only intrinsicly supports modulo integral types. The only remaining +// integral exceptional values is division by zero. Only targets that do not +// signal division by zero in some "hard to ignore" way should use false. +#ifndef __glibcxx_integral_traps +# define __glibcxx_integral_traps true +#endif + +// float +// + +// Default values. Should be overriden in configuration files if necessary. + +#ifndef __glibcxx_float_has_denorm_loss +# define __glibcxx_float_has_denorm_loss false +#endif +#ifndef __glibcxx_float_traps +# define __glibcxx_float_traps false +#endif +#ifndef __glibcxx_float_tinyness_before +# define __glibcxx_float_tinyness_before false +#endif + +// double + +// Default values. Should be overriden in configuration files if necessary. + +#ifndef __glibcxx_double_has_denorm_loss +# define __glibcxx_double_has_denorm_loss false +#endif +#ifndef __glibcxx_double_traps +# define __glibcxx_double_traps false +#endif +#ifndef __glibcxx_double_tinyness_before +# define __glibcxx_double_tinyness_before false +#endif + +// long double + +// Default values. Should be overriden in configuration files if necessary. + +#ifndef __glibcxx_long_double_has_denorm_loss +# define __glibcxx_long_double_has_denorm_loss false +#endif +#ifndef __glibcxx_long_double_traps +# define __glibcxx_long_double_traps false +#endif +#ifndef __glibcxx_long_double_tinyness_before +# define __glibcxx_long_double_tinyness_before false +#endif + +// You should not need to define any macros below this point. + +#define __glibcxx_signed(T) ((T)(-1) < 0) + +#define __glibcxx_min(T) \ + (__glibcxx_signed (T) ? (T)1 << __glibcxx_digits (T) : (T)0) + +#define __glibcxx_max(T) \ + (__glibcxx_signed (T) ? ((T)1 << __glibcxx_digits (T)) - 1 : ~(T)0) + +#define __glibcxx_digits(T) \ + (sizeof(T) * __CHAR_BIT__ - __glibcxx_signed (T)) + +// The fraction 643/2136 approximates log10(2) to 7 significant digits. +#define __glibcxx_digits10(T) \ + (__glibcxx_digits (T) * 643 / 2136) + + +namespace std { + + /** + * @brief Describes the rounding style for floating-point types. + * + * This is used in the std::numeric_limits class. + */ + enum float_round_style + { + round_indeterminate = -1, ///< Self-explanatory. + round_toward_zero = 0, ///< Self-explanatory. + round_to_nearest = 1, ///< To the nearest representable value. + round_toward_infinity = 2, ///< Self-explanatory. + round_toward_neg_infinity = 3 ///< Self-explanatory. + }; + + /** + * @brief Describes the denormalization for floating-point types. + * + * These values represent the presence or absence of a variable number + * of exponent bits. This type is used in the std::numeric_limits class. + */ + enum float_denorm_style + { + /// Indeterminate at compile time whether denormalized values are allowed. + denorm_indeterminate = -1, + /// The type does not allow denormalized values. + denorm_absent = 0, + /// The type allows denormalized values. + denorm_present = 1 + }; + + /** + * @brief Part of std::numeric_limits. + * + * The @c static @c const members are usable as integral constant + * expressions. + * + * @note This is a seperate class for purposes of efficiency; you + * should only access these members as part of an instantiation + * of the std::numeric_limits class. + */ + struct __numeric_limits_base + { + /** This will be true for all fundamental types (which have + specializations), and false for everything else. */ + static const bool is_specialized = false; + + /** The number of @c radix digits that be represented without change: for + integer types, the number of non-sign bits in the mantissa; for + floating types, the number of @c radix digits in the mantissa. */ + static const int digits = 0; + /** The number of base 10 digits that can be represented without change. */ + static const int digits10 = 0; + /** True if the type is signed. */ + static const bool is_signed = false; + /** True if the type is integer. + * @if maint + * Is this supposed to be "if the type is integral"? + * @endif + */ + static const bool is_integer = false; + /** True if the type uses an exact representation. "All integer types are + exact, but not all exact types are integer. For example, rational and + fixed-exponent representations are exact but not integer." + [18.2.1.2]/15 */ + static const bool is_exact = false; + /** For integer types, specifies the base of the representation. For + floating types, specifies the base of the exponent representation. */ + static const int radix = 0; + + /** The minimum negative integer such that @c radix raised to the power of + (one less than that integer) is a normalized floating point number. */ + static const int min_exponent = 0; + /** The minimum negative integer such that 10 raised to that power is in + the range of normalized floating point numbers. */ + static const int min_exponent10 = 0; + /** The maximum positive integer such that @c radix raised to the power of + (one less than that integer) is a representable finite floating point + number. */ + static const int max_exponent = 0; + /** The maximum positive integer such that 10 raised to that power is in + the range of representable finite floating point numbers. */ + static const int max_exponent10 = 0; + + /** True if the type has a representation for positive infinity. */ + static const bool has_infinity = false; + /** True if the type has a representation for a quiet (non-signaling) + "Not a Number." */ + static const bool has_quiet_NaN = false; + /** True if the type has a representation for a signaling + "Not a Number." */ + static const bool has_signaling_NaN = false; + /** See std::float_denorm_style for more information. */ + static const float_denorm_style has_denorm = denorm_absent; + /** "True if loss of accuracy is detected as a denormalization loss, + rather than as an inexact result." [18.2.1.2]/42 */ + static const bool has_denorm_loss = false; + + /** True if-and-only-if the type adheres to the IEC 559 standard, also + known as IEEE 754. (Only makes sense for floating point types.) */ + static const bool is_iec559 = false; + /** "True if the set of values representable by the type is finite. All + built-in types are bounded, this member would be false for arbitrary + precision types." [18.2.1.2]/54 */ + static const bool is_bounded = false; + /** True if the type is @e modulo, that is, if it is possible to add two + positive numbers and have a result that wraps around to a third number + that is less. Typically false for floating types, true for unsigned + integers, and true for signed integers. */ + static const bool is_modulo = false; + + /** True if trapping is implemented for this type. */ + static const bool traps = false; + /** True if tinyness is detected before rounding. (see IEC 559) */ + static const bool tinyness_before = false; + /** See std::float_round_style for more information. This is only + meaningful for floating types; integer types will all be + round_toward_zero. */ + static const float_round_style round_style = round_toward_zero; + }; + + /** + * @brief Properties of fundamental types. + * + * This class allows a program to obtain information about the + * representation of a fundamental type on a given platform. For + * non-fundamental types, the functions will return 0 and the data + * members will all be @c false. + * + * @if maint + * _GLIBCXX_RESOLVE_LIB_DEFECTS: DRs 201 and 184 (hi Gaby!) are + * noted, but not incorporated in this documented (yet). + * @endif + */ + template + struct numeric_limits : public __numeric_limits_base + { + /** The minimum finite value, or for floating types with + denormalization, the minimum positive normalized value. */ + static _Tp min() throw() { return static_cast<_Tp>(0); } + /** The maximum finite value. */ + static _Tp max() throw() { return static_cast<_Tp>(0); } + /** The @e machine @e epsilon: the difference between 1 and the least + value greater than 1 that is representable. */ + static _Tp epsilon() throw() { return static_cast<_Tp>(0); } + /** The maximum rounding error measurement (see LIA-1). */ + static _Tp round_error() throw() { return static_cast<_Tp>(0); } + /** The representation of positive infinity, if @c has_infinity. */ + static _Tp infinity() throw() { return static_cast<_Tp>(0); } + /** The representation of a quiet "Not a Number," if @c has_quiet_NaN. */ + static _Tp quiet_NaN() throw() { return static_cast<_Tp>(0); } + /** The representation of a signaling "Not a Number," if + @c has_signaling_NaN. */ + static _Tp signaling_NaN() throw() { return static_cast<_Tp>(0); } + /** The minimum positive denormalized value. For types where + @c has_denorm is false, this is the minimum positive normalized + value. */ + static _Tp denorm_min() throw() { return static_cast<_Tp>(0); } + }; + + // Now there follow 15 explicit specializations. Yes, 15. Make sure + // you get the count right. + + /// numeric_limits specialization. + template<> + struct numeric_limits + { + static const bool is_specialized = true; + + static bool min() throw() + { return false; } + static bool max() throw() + { return true; } + + static const int digits = 1; + static const int digits10 = 0; + static const bool is_signed = false; + static const bool is_integer = true; + static const bool is_exact = true; + static const int radix = 2; + static bool epsilon() throw() + { return false; } + static bool round_error() throw() + { return false; } + + static const int min_exponent = 0; + static const int min_exponent10 = 0; + static const int max_exponent = 0; + static const int max_exponent10 = 0; + + static const bool has_infinity = false; + static const bool has_quiet_NaN = false; + static const bool has_signaling_NaN = false; + static const float_denorm_style has_denorm = denorm_absent; + static const bool has_denorm_loss = false; + + static bool infinity() throw() + { return false; } + static bool quiet_NaN() throw() + { return false; } + static bool signaling_NaN() throw() + { return false; } + static bool denorm_min() throw() + { return false; } + + static const bool is_iec559 = false; + static const bool is_bounded = true; + static const bool is_modulo = false; + + // It is not clear what it means for a boolean type to trap. + // This is a DR on the LWG issue list. Here, I use integer + // promotion semantics. + static const bool traps = __glibcxx_integral_traps; + static const bool tinyness_before = false; + static const float_round_style round_style = round_toward_zero; + }; + + /// numeric_limits specialization. + template<> + struct numeric_limits + { + static const bool is_specialized = true; + + static char min() throw() + { return __glibcxx_min(char); } + static char max() throw() + { return __glibcxx_max(char); } + + static const int digits = __glibcxx_digits (char); + static const int digits10 = __glibcxx_digits10 (char); + static const bool is_signed = __glibcxx_signed (char); + static const bool is_integer = true; + static const bool is_exact = true; + static const int radix = 2; + static char epsilon() throw() + { return 0; } + static char round_error() throw() + { return 0; } + + static const int min_exponent = 0; + static const int min_exponent10 = 0; + static const int max_exponent = 0; + static const int max_exponent10 = 0; + + static const bool has_infinity = false; + static const bool has_quiet_NaN = false; + static const bool has_signaling_NaN = false; + static const float_denorm_style has_denorm = denorm_absent; + static const bool has_denorm_loss = false; + + static char infinity() throw() + { return char(); } + static char quiet_NaN() throw() + { return char(); } + static char signaling_NaN() throw() + { return char(); } + static char denorm_min() throw() + { return static_cast(0); } + + static const bool is_iec559 = false; + static const bool is_bounded = true; + static const bool is_modulo = true; + + static const bool traps = __glibcxx_integral_traps; + static const bool tinyness_before = false; + static const float_round_style round_style = round_toward_zero; + }; + + /// numeric_limits specialization. + template<> + struct numeric_limits + { + static const bool is_specialized = true; + + static signed char min() throw() + { return -__SCHAR_MAX__ - 1; } + static signed char max() throw() + { return __SCHAR_MAX__; } + + static const int digits = __glibcxx_digits (signed char); + static const int digits10 = __glibcxx_digits10 (signed char); + static const bool is_signed = true; + static const bool is_integer = true; + static const bool is_exact = true; + static const int radix = 2; + static signed char epsilon() throw() + { return 0; } + static signed char round_error() throw() + { return 0; } + + static const int min_exponent = 0; + static const int min_exponent10 = 0; + static const int max_exponent = 0; + static const int max_exponent10 = 0; + + static const bool has_infinity = false; + static const bool has_quiet_NaN = false; + static const bool has_signaling_NaN = false; + static const float_denorm_style has_denorm = denorm_absent; + static const bool has_denorm_loss = false; + + static signed char infinity() throw() + { return static_cast(0); } + static signed char quiet_NaN() throw() + { return static_cast(0); } + static signed char signaling_NaN() throw() + { return static_cast(0); } + static signed char denorm_min() throw() + { return static_cast(0); } + + static const bool is_iec559 = false; + static const bool is_bounded = true; + static const bool is_modulo = true; + + static const bool traps = __glibcxx_integral_traps; + static const bool tinyness_before = false; + static const float_round_style round_style = round_toward_zero; + }; + + /// numeric_limits specialization. + template<> + struct numeric_limits + { + static const bool is_specialized = true; + + static unsigned char min() throw() + { return 0; } + static unsigned char max() throw() + { return __SCHAR_MAX__ * 2U + 1; } + + static const int digits = __glibcxx_digits (unsigned char); + static const int digits10 = __glibcxx_digits10 (unsigned char); + static const bool is_signed = false; + static const bool is_integer = true; + static const bool is_exact = true; + static const int radix = 2; + static unsigned char epsilon() throw() + { return 0; } + static unsigned char round_error() throw() + { return 0; } + + static const int min_exponent = 0; + static const int min_exponent10 = 0; + static const int max_exponent = 0; + static const int max_exponent10 = 0; + + static const bool has_infinity = false; + static const bool has_quiet_NaN = false; + static const bool has_signaling_NaN = false; + static const float_denorm_style has_denorm = denorm_absent; + static const bool has_denorm_loss = false; + + static unsigned char infinity() throw() + { return static_cast(0); } + static unsigned char quiet_NaN() throw() + { return static_cast(0); } + static unsigned char signaling_NaN() throw() + { return static_cast(0); } + static unsigned char denorm_min() throw() + { return static_cast(0); } + + static const bool is_iec559 = false; + static const bool is_bounded = true; + static const bool is_modulo = true; + + static const bool traps = __glibcxx_integral_traps; + static const bool tinyness_before = false; + static const float_round_style round_style = round_toward_zero; + }; + + /// numeric_limits specialization. + template<> + struct numeric_limits + { + static const bool is_specialized = true; + + static wchar_t min() throw() + { return __glibcxx_min (wchar_t); } + static wchar_t max() throw() + { return __glibcxx_max (wchar_t); } + + static const int digits = __glibcxx_digits (wchar_t); + static const int digits10 = __glibcxx_digits10 (wchar_t); + static const bool is_signed = __glibcxx_signed (wchar_t); + static const bool is_integer = true; + static const bool is_exact = true; + static const int radix = 2; + static wchar_t epsilon() throw() + { return 0; } + static wchar_t round_error() throw() + { return 0; } + + static const int min_exponent = 0; + static const int min_exponent10 = 0; + static const int max_exponent = 0; + static const int max_exponent10 = 0; + + static const bool has_infinity = false; + static const bool has_quiet_NaN = false; + static const bool has_signaling_NaN = false; + static const float_denorm_style has_denorm = denorm_absent; + static const bool has_denorm_loss = false; + + static wchar_t infinity() throw() + { return wchar_t(); } + static wchar_t quiet_NaN() throw() + { return wchar_t(); } + static wchar_t signaling_NaN() throw() + { return wchar_t(); } + static wchar_t denorm_min() throw() + { return wchar_t(); } + + static const bool is_iec559 = false; + static const bool is_bounded = true; + static const bool is_modulo = true; + + static const bool traps = __glibcxx_integral_traps; + static const bool tinyness_before = false; + static const float_round_style round_style = round_toward_zero; + }; + + /// numeric_limits specialization. + template<> + struct numeric_limits + { + static const bool is_specialized = true; + + static short min() throw() + { return -__SHRT_MAX__ - 1; } + static short max() throw() + { return __SHRT_MAX__; } + + static const int digits = __glibcxx_digits (short); + static const int digits10 = __glibcxx_digits10 (short); + static const bool is_signed = true; + static const bool is_integer = true; + static const bool is_exact = true; + static const int radix = 2; + static short epsilon() throw() + { return 0; } + static short round_error() throw() + { return 0; } + + static const int min_exponent = 0; + static const int min_exponent10 = 0; + static const int max_exponent = 0; + static const int max_exponent10 = 0; + + static const bool has_infinity = false; + static const bool has_quiet_NaN = false; + static const bool has_signaling_NaN = false; + static const float_denorm_style has_denorm = denorm_absent; + static const bool has_denorm_loss = false; + + static short infinity() throw() + { return short(); } + static short quiet_NaN() throw() + { return short(); } + static short signaling_NaN() throw() + { return short(); } + static short denorm_min() throw() + { return short(); } + + static const bool is_iec559 = false; + static const bool is_bounded = true; + static const bool is_modulo = true; + + static const bool traps = __glibcxx_integral_traps; + static const bool tinyness_before = false; + static const float_round_style round_style = round_toward_zero; + }; + + /// numeric_limits specialization. + template<> + struct numeric_limits + { + static const bool is_specialized = true; + + static unsigned short min() throw() + { return 0; } + static unsigned short max() throw() + { return __SHRT_MAX__ * 2U + 1; } + + static const int digits = __glibcxx_digits (unsigned short); + static const int digits10 = __glibcxx_digits10 (unsigned short); + static const bool is_signed = false; + static const bool is_integer = true; + static const bool is_exact = true; + static const int radix = 2; + static unsigned short epsilon() throw() + { return 0; } + static unsigned short round_error() throw() + { return 0; } + + static const int min_exponent = 0; + static const int min_exponent10 = 0; + static const int max_exponent = 0; + static const int max_exponent10 = 0; + + static const bool has_infinity = false; + static const bool has_quiet_NaN = false; + static const bool has_signaling_NaN = false; + static const float_denorm_style has_denorm = denorm_absent; + static const bool has_denorm_loss = false; + + static unsigned short infinity() throw() + { return static_cast(0); } + static unsigned short quiet_NaN() throw() + { return static_cast(0); } + static unsigned short signaling_NaN() throw() + { return static_cast(0); } + static unsigned short denorm_min() throw() + { return static_cast(0); } + + static const bool is_iec559 = false; + static const bool is_bounded = true; + static const bool is_modulo = true; + + static const bool traps = __glibcxx_integral_traps; + static const bool tinyness_before = false; + static const float_round_style round_style = round_toward_zero; + }; + + /// numeric_limits specialization. + template<> + struct numeric_limits + { + static const bool is_specialized = true; + + static int min() throw() + { return -__INT_MAX__ - 1; } + static int max() throw() + { return __INT_MAX__; } + + static const int digits = __glibcxx_digits (int); + static const int digits10 = __glibcxx_digits10 (int); + static const bool is_signed = true; + static const bool is_integer = true; + static const bool is_exact = true; + static const int radix = 2; + static int epsilon() throw() + { return 0; } + static int round_error() throw() + { return 0; } + + static const int min_exponent = 0; + static const int min_exponent10 = 0; + static const int max_exponent = 0; + static const int max_exponent10 = 0; + + static const bool has_infinity = false; + static const bool has_quiet_NaN = false; + static const bool has_signaling_NaN = false; + static const float_denorm_style has_denorm = denorm_absent; + static const bool has_denorm_loss = false; + + static int infinity() throw() + { return static_cast(0); } + static int quiet_NaN() throw() + { return static_cast(0); } + static int signaling_NaN() throw() + { return static_cast(0); } + static int denorm_min() throw() + { return static_cast(0); } + + static const bool is_iec559 = false; + static const bool is_bounded = true; + static const bool is_modulo = true; + + static const bool traps = __glibcxx_integral_traps; + static const bool tinyness_before = false; + static const float_round_style round_style = round_toward_zero; + }; + + /// numeric_limits specialization. + template<> + struct numeric_limits + { + static const bool is_specialized = true; + + static unsigned int min() throw() + { return 0; } + static unsigned int max() throw() + { return __INT_MAX__ * 2U + 1; } + + static const int digits = __glibcxx_digits (unsigned int); + static const int digits10 = __glibcxx_digits10 (unsigned int); + static const bool is_signed = false; + static const bool is_integer = true; + static const bool is_exact = true; + static const int radix = 2; + static unsigned int epsilon() throw() + { return 0; } + static unsigned int round_error() throw() + { return 0; } + + static const int min_exponent = 0; + static const int min_exponent10 = 0; + static const int max_exponent = 0; + static const int max_exponent10 = 0; + + static const bool has_infinity = false; + static const bool has_quiet_NaN = false; + static const bool has_signaling_NaN = false; + static const float_denorm_style has_denorm = denorm_absent; + static const bool has_denorm_loss = false; + + static unsigned int infinity() throw() + { return static_cast(0); } + static unsigned int quiet_NaN() throw() + { return static_cast(0); } + static unsigned int signaling_NaN() throw() + { return static_cast(0); } + static unsigned int denorm_min() throw() + { return static_cast(0); } + + static const bool is_iec559 = false; + static const bool is_bounded = true; + static const bool is_modulo = true; + + static const bool traps = __glibcxx_integral_traps; + static const bool tinyness_before = false; + static const float_round_style round_style = round_toward_zero; + }; + + /// numeric_limits specialization. + template<> + struct numeric_limits + { + static const bool is_specialized = true; + + static long min() throw() + { return -__LONG_MAX__ - 1; } + static long max() throw() + { return __LONG_MAX__; } + + static const int digits = __glibcxx_digits (long); + static const int digits10 = __glibcxx_digits10 (long); + static const bool is_signed = true; + static const bool is_integer = true; + static const bool is_exact = true; + static const int radix = 2; + static long epsilon() throw() + { return 0; } + static long round_error() throw() + { return 0; } + + static const int min_exponent = 0; + static const int min_exponent10 = 0; + static const int max_exponent = 0; + static const int max_exponent10 = 0; + + static const bool has_infinity = false; + static const bool has_quiet_NaN = false; + static const bool has_signaling_NaN = false; + static const float_denorm_style has_denorm = denorm_absent; + static const bool has_denorm_loss = false; + + static long infinity() throw() + { return static_cast(0); } + static long quiet_NaN() throw() + { return static_cast(0); } + static long signaling_NaN() throw() + { return static_cast(0); } + static long denorm_min() throw() + { return static_cast(0); } + + static const bool is_iec559 = false; + static const bool is_bounded = true; + static const bool is_modulo = true; + + static const bool traps = __glibcxx_integral_traps; + static const bool tinyness_before = false; + static const float_round_style round_style = round_toward_zero; + }; + + /// numeric_limits specialization. + template<> + struct numeric_limits + { + static const bool is_specialized = true; + + static unsigned long min() throw() + { return 0; } + static unsigned long max() throw() + { return __LONG_MAX__ * 2UL + 1; } + + static const int digits = __glibcxx_digits (unsigned long); + static const int digits10 = __glibcxx_digits10 (unsigned long); + static const bool is_signed = false; + static const bool is_integer = true; + static const bool is_exact = true; + static const int radix = 2; + static unsigned long epsilon() throw() + { return 0; } + static unsigned long round_error() throw() + { return 0; } + + static const int min_exponent = 0; + static const int min_exponent10 = 0; + static const int max_exponent = 0; + static const int max_exponent10 = 0; + + static const bool has_infinity = false; + static const bool has_quiet_NaN = false; + static const bool has_signaling_NaN = false; + static const float_denorm_style has_denorm = denorm_absent; + static const bool has_denorm_loss = false; + + static unsigned long infinity() throw() + { return static_cast(0); } + static unsigned long quiet_NaN() throw() + { return static_cast(0); } + static unsigned long signaling_NaN() throw() + { return static_cast(0); } + static unsigned long denorm_min() throw() + { return static_cast(0); } + + static const bool is_iec559 = false; + static const bool is_bounded = true; + static const bool is_modulo = true; + + static const bool traps = __glibcxx_integral_traps; + static const bool tinyness_before = false; + static const float_round_style round_style = round_toward_zero; + }; + + /// numeric_limits specialization. + template<> + struct numeric_limits + { + static const bool is_specialized = true; + + static long long min() throw() + { return -__LONG_LONG_MAX__ - 1; } + static long long max() throw() + { return __LONG_LONG_MAX__; } + + static const int digits = __glibcxx_digits (long long); + static const int digits10 = __glibcxx_digits10 (long long); + static const bool is_signed = true; + static const bool is_integer = true; + static const bool is_exact = true; + static const int radix = 2; + static long long epsilon() throw() + { return 0; } + static long long round_error() throw() + { return 0; } + + static const int min_exponent = 0; + static const int min_exponent10 = 0; + static const int max_exponent = 0; + static const int max_exponent10 = 0; + + static const bool has_infinity = false; + static const bool has_quiet_NaN = false; + static const bool has_signaling_NaN = false; + static const float_denorm_style has_denorm = denorm_absent; + static const bool has_denorm_loss = false; + + static long long infinity() throw() + { return static_cast(0); } + static long long quiet_NaN() throw() + { return static_cast(0); } + static long long signaling_NaN() throw() + { return static_cast(0); } + static long long denorm_min() throw() + { return static_cast(0); } + + static const bool is_iec559 = false; + static const bool is_bounded = true; + static const bool is_modulo = true; + + static const bool traps = __glibcxx_integral_traps; + static const bool tinyness_before = false; + static const float_round_style round_style = round_toward_zero; + }; + + /// numeric_limits specialization. + template<> + struct numeric_limits + { + static const bool is_specialized = true; + + static unsigned long long min() throw() + { return 0; } + static unsigned long long max() throw() + { return __LONG_LONG_MAX__ * 2ULL + 1; } + + static const int digits = __glibcxx_digits (unsigned long long); + static const int digits10 = __glibcxx_digits10 (unsigned long long); + static const bool is_signed = false; + static const bool is_integer = true; + static const bool is_exact = true; + static const int radix = 2; + static unsigned long long epsilon() throw() + { return 0; } + static unsigned long long round_error() throw() + { return 0; } + + static const int min_exponent = 0; + static const int min_exponent10 = 0; + static const int max_exponent = 0; + static const int max_exponent10 = 0; + + static const bool has_infinity = false; + static const bool has_quiet_NaN = false; + static const bool has_signaling_NaN = false; + static const float_denorm_style has_denorm = denorm_absent; + static const bool has_denorm_loss = false; + + static unsigned long long infinity() throw() + { return static_cast(0); } + static unsigned long long quiet_NaN() throw() + { return static_cast(0); } + static unsigned long long signaling_NaN() throw() + { return static_cast(0); } + static unsigned long long denorm_min() throw() + { return static_cast(0); } + + static const bool is_iec559 = false; + static const bool is_bounded = true; + static const bool is_modulo = true; + + static const bool traps = __glibcxx_integral_traps; + static const bool tinyness_before = false; + static const float_round_style round_style = round_toward_zero; + }; + + /// numeric_limits specialization. + template<> + struct numeric_limits + { + static const bool is_specialized = true; + + static float min() throw() + { return __FLT_MIN__; } + static float max() throw() + { return __FLT_MAX__; } + + static const int digits = __FLT_MANT_DIG__; + static const int digits10 = __FLT_DIG__; + static const bool is_signed = true; + static const bool is_integer = false; + static const bool is_exact = false; + static const int radix = __FLT_RADIX__; + static float epsilon() throw() + { return __FLT_EPSILON__; } + static float round_error() throw() + { return 0.5F; } + + static const int min_exponent = __FLT_MIN_EXP__; + static const int min_exponent10 = __FLT_MIN_10_EXP__; + static const int max_exponent = __FLT_MAX_EXP__; + static const int max_exponent10 = __FLT_MAX_10_EXP__; + + static const bool has_infinity = __FLT_HAS_INFINITY__; + static const bool has_quiet_NaN = __FLT_HAS_QUIET_NAN__; + static const bool has_signaling_NaN = has_quiet_NaN; + static const float_denorm_style has_denorm + = bool(__FLT_HAS_DENORM__) ? denorm_present : denorm_absent; + static const bool has_denorm_loss = __glibcxx_float_has_denorm_loss; + + static float infinity() throw() + { return __builtin_huge_valf (); } + static float quiet_NaN() throw() + { return __builtin_nanf (""); } + static float signaling_NaN() throw() + { return __builtin_nansf (""); } + static float denorm_min() throw() + { return __FLT_DENORM_MIN__; } + + static const bool is_iec559 + = has_infinity && has_quiet_NaN && has_denorm == denorm_present; + static const bool is_bounded = true; + static const bool is_modulo = false; + + static const bool traps = __glibcxx_float_traps; + static const bool tinyness_before = __glibcxx_float_tinyness_before; + static const float_round_style round_style = round_to_nearest; + }; + +#undef __glibcxx_float_has_denorm_loss +#undef __glibcxx_float_traps +#undef __glibcxx_float_tinyness_before + + /// numeric_limits specialization. + template<> + struct numeric_limits + { + static const bool is_specialized = true; + + static double min() throw() + { return __DBL_MIN__; } + static double max() throw() + { return __DBL_MAX__; } + + static const int digits = __DBL_MANT_DIG__; + static const int digits10 = __DBL_DIG__; + static const bool is_signed = true; + static const bool is_integer = false; + static const bool is_exact = false; + static const int radix = __FLT_RADIX__; + static double epsilon() throw() + { return __DBL_EPSILON__; } + static double round_error() throw() + { return 0.5; } + + static const int min_exponent = __DBL_MIN_EXP__; + static const int min_exponent10 = __DBL_MIN_10_EXP__; + static const int max_exponent = __DBL_MAX_EXP__; + static const int max_exponent10 = __DBL_MAX_10_EXP__; + + static const bool has_infinity = __DBL_HAS_INFINITY__; + static const bool has_quiet_NaN = __DBL_HAS_QUIET_NAN__; + static const bool has_signaling_NaN = has_quiet_NaN; + static const float_denorm_style has_denorm + = bool(__DBL_HAS_DENORM__) ? denorm_present : denorm_absent; + static const bool has_denorm_loss = __glibcxx_double_has_denorm_loss; + + static double infinity() throw() + { return __builtin_huge_val(); } + static double quiet_NaN() throw() + { return __builtin_nan (""); } + static double signaling_NaN() throw() + { return __builtin_nans (""); } + static double denorm_min() throw() + { return __DBL_DENORM_MIN__; } + + static const bool is_iec559 + = has_infinity && has_quiet_NaN && has_denorm == denorm_present; + static const bool is_bounded = true; + static const bool is_modulo = false; + + static const bool traps = __glibcxx_double_traps; + static const bool tinyness_before = __glibcxx_double_tinyness_before; + static const float_round_style round_style = round_to_nearest; + }; + +#undef __glibcxx_double_has_denorm_loss +#undef __glibcxx_double_traps +#undef __glibcxx_double_tinyness_before + + /// numeric_limits specialization. + template<> + struct numeric_limits + { + static const bool is_specialized = true; + + static long double min() throw() + { return __LDBL_MIN__; } + static long double max() throw() + { return __LDBL_MAX__; } + + static const int digits = __LDBL_MANT_DIG__; + static const int digits10 = __LDBL_DIG__; + static const bool is_signed = true; + static const bool is_integer = false; + static const bool is_exact = false; + static const int radix = __FLT_RADIX__; + static long double epsilon() throw() + { return __LDBL_EPSILON__; } + static long double round_error() throw() + { return 0.5L; } + + static const int min_exponent = __LDBL_MIN_EXP__; + static const int min_exponent10 = __LDBL_MIN_10_EXP__; + static const int max_exponent = __LDBL_MAX_EXP__; + static const int max_exponent10 = __LDBL_MAX_10_EXP__; + + static const bool has_infinity = __LDBL_HAS_INFINITY__; + static const bool has_quiet_NaN = __LDBL_HAS_QUIET_NAN__; + static const bool has_signaling_NaN = has_quiet_NaN; + static const float_denorm_style has_denorm + = bool(__LDBL_HAS_DENORM__) ? denorm_present : denorm_absent; + static const bool has_denorm_loss + = __glibcxx_long_double_has_denorm_loss; + + static long double infinity() throw() + { return __builtin_huge_vall (); } + static long double quiet_NaN() throw() + { return __builtin_nanl (""); } + static long double signaling_NaN() throw() + { return __builtin_nansl (""); } + static long double denorm_min() throw() + { return __LDBL_DENORM_MIN__; } + + static const bool is_iec559 + = has_infinity && has_quiet_NaN && has_denorm == denorm_present; + static const bool is_bounded = true; + static const bool is_modulo = false; + + static const bool traps = __glibcxx_long_double_traps; + static const bool tinyness_before = __glibcxx_long_double_tinyness_before; + static const float_round_style round_style = round_to_nearest; + }; + +#undef __glibcxx_long_double_has_denorm_loss +#undef __glibcxx_long_double_traps +#undef __glibcxx_long_double_tinyness_before + +} // namespace std + +#undef __glibcxx_signed +#undef __glibcxx_min +#undef __glibcxx_max +#undef __glibcxx_digits +#undef __glibcxx_digits10 + +#endif // _GLIBCXX_NUMERIC_LIMITS diff --git a/cpp_src/list b/cpp_src/list new file mode 100644 index 0000000..b46f654 --- /dev/null +++ b/cpp_src/list @@ -0,0 +1,81 @@ +// -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file include/list + * This is a Standard C++ Library header. + */ + +#ifndef _GLIBCXX_LIST +#define _GLIBCXX_LIST 1 + +#pragma GCC system_header + +#include +#include +#include +#include +#include +#include + +#ifndef _GLIBCXX_EXPORT_TEMPLATE +# include +#endif + +#ifdef _GLIBCXX_DEBUG +# include +#endif + +#endif /* _GLIBCXX_LIST */ + diff --git a/cpp_src/list.tcc b/cpp_src/list.tcc new file mode 100644 index 0000000..5a17662 --- /dev/null +++ b/cpp_src/list.tcc @@ -0,0 +1,385 @@ +// List implementation (out of line) -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file list.tcc + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _LIST_TCC +#define _LIST_TCC 1 + +namespace std { + + template + void + _List_base<_Tp, _Alloc>:: + _M_clear() + { + typedef _List_node<_Tp> _Node; + _Node* __cur = static_cast<_Node*>(this->_M_impl._M_node._M_next); + while (__cur != &this->_M_impl._M_node) + { + _Node* __tmp = __cur; + __cur = static_cast<_Node*>(__cur->_M_next); + _M_get_Tp_allocator().destroy(&__tmp->_M_data); + _M_put_node(__tmp); + } + } + + template + typename list<_Tp, _Alloc>::iterator + list<_Tp, _Alloc>:: + insert(iterator __position, const value_type& __x) + { + _Node* __tmp = _M_create_node(__x); + __tmp->hook(__position._M_node); + return iterator(__tmp); + } + + template + typename list<_Tp, _Alloc>::iterator + list<_Tp, _Alloc>:: + erase(iterator __position) + { + iterator __ret = iterator(__position._M_node->_M_next); + _M_erase(__position); + return __ret; + } + + template + void + list<_Tp, _Alloc>:: + resize(size_type __new_size, value_type __x) + { + iterator __i = begin(); + size_type __len = 0; + for (; __i != end() && __len < __new_size; ++__i, ++__len) + ; + if (__len == __new_size) + erase(__i, end()); + else // __i == end() + insert(end(), __new_size - __len, __x); + } + + template + list<_Tp, _Alloc>& + list<_Tp, _Alloc>:: + operator=(const list& __x) + { + if (this != &__x) + { + iterator __first1 = begin(); + iterator __last1 = end(); + const_iterator __first2 = __x.begin(); + const_iterator __last2 = __x.end(); + for (; __first1 != __last1 && __first2 != __last2; + ++__first1, ++__first2) + *__first1 = *__first2; + if (__first2 == __last2) + erase(__first1, __last1); + else + insert(__last1, __first2, __last2); + } + return *this; + } + + template + void + list<_Tp, _Alloc>:: + _M_fill_assign(size_type __n, const value_type& __val) + { + iterator __i = begin(); + for (; __i != end() && __n > 0; ++__i, --__n) + *__i = __val; + if (__n > 0) + insert(end(), __n, __val); + else + erase(__i, end()); + } + + template + template + void + list<_Tp, _Alloc>:: + _M_assign_dispatch(_InputIterator __first2, _InputIterator __last2, + __false_type) + { + iterator __first1 = begin(); + iterator __last1 = end(); + for (; __first1 != __last1 && __first2 != __last2; + ++__first1, ++__first2) + *__first1 = *__first2; + if (__first2 == __last2) + erase(__first1, __last1); + else + insert(__last1, __first2, __last2); + } + + template + void + list<_Tp, _Alloc>:: + remove(const value_type& __value) + { + iterator __first = begin(); + iterator __last = end(); + while (__first != __last) + { + iterator __next = __first; + ++__next; + if (*__first == __value) + _M_erase(__first); + __first = __next; + } + } + + template + void + list<_Tp, _Alloc>:: + unique() + { + iterator __first = begin(); + iterator __last = end(); + if (__first == __last) + return; + iterator __next = __first; + while (++__next != __last) + { + if (*__first == *__next) + _M_erase(__next); + else + __first = __next; + __next = __first; + } + } + + template + void + list<_Tp, _Alloc>:: + merge(list& __x) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 300. list::merge() specification incomplete + if (this != &__x) + { + _M_check_equal_allocators(__x); + + iterator __first1 = begin(); + iterator __last1 = end(); + iterator __first2 = __x.begin(); + iterator __last2 = __x.end(); + while (__first1 != __last1 && __first2 != __last2) + if (*__first2 < *__first1) + { + iterator __next = __first2; + _M_transfer(__first1, __first2, ++__next); + __first2 = __next; + } + else + ++__first1; + if (__first2 != __last2) + _M_transfer(__last1, __first2, __last2); + } + } + + template + template + void + list<_Tp, _Alloc>:: + merge(list& __x, _StrictWeakOrdering __comp) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 300. list::merge() specification incomplete + if (this != &__x) + { + _M_check_equal_allocators(__x); + + iterator __first1 = begin(); + iterator __last1 = end(); + iterator __first2 = __x.begin(); + iterator __last2 = __x.end(); + while (__first1 != __last1 && __first2 != __last2) + if (__comp(*__first2, *__first1)) + { + iterator __next = __first2; + _M_transfer(__first1, __first2, ++__next); + __first2 = __next; + } + else + ++__first1; + if (__first2 != __last2) + _M_transfer(__last1, __first2, __last2); + } + } + + template + void + list<_Tp, _Alloc>:: + sort() + { + // Do nothing if the list has length 0 or 1. + if (this->_M_impl._M_node._M_next != &this->_M_impl._M_node + && this->_M_impl._M_node._M_next->_M_next != &this->_M_impl._M_node) + { + list __carry; + list __tmp[64]; + list * __fill = &__tmp[0]; + list * __counter; + + do + { + __carry.splice(__carry.begin(), *this, begin()); + + for(__counter = &__tmp[0]; + __counter != __fill && !__counter->empty(); + ++__counter) + { + __counter->merge(__carry); + __carry.swap(*__counter); + } + __carry.swap(*__counter); + if (__counter == __fill) + ++__fill; + } + while ( !empty() ); + + for (__counter = &__tmp[1]; __counter != __fill; ++__counter) + __counter->merge(*(__counter - 1)); + swap( *(__fill - 1) ); + } + } + + template + template + void + list<_Tp, _Alloc>:: + remove_if(_Predicate __pred) + { + iterator __first = begin(); + iterator __last = end(); + while (__first != __last) + { + iterator __next = __first; + ++__next; + if (__pred(*__first)) + _M_erase(__first); + __first = __next; + } + } + + template + template + void + list<_Tp, _Alloc>:: + unique(_BinaryPredicate __binary_pred) + { + iterator __first = begin(); + iterator __last = end(); + if (__first == __last) + return; + iterator __next = __first; + while (++__next != __last) + { + if (__binary_pred(*__first, *__next)) + _M_erase(__next); + else + __first = __next; + __next = __first; + } + } + + template + template + void + list<_Tp, _Alloc>:: + sort(_StrictWeakOrdering __comp) + { + // Do nothing if the list has length 0 or 1. + if (this->_M_impl._M_node._M_next != &this->_M_impl._M_node + && this->_M_impl._M_node._M_next->_M_next != &this->_M_impl._M_node) + { + list __carry; + list __tmp[64]; + list * __fill = &__tmp[0]; + list * __counter; + + do + { + __carry.splice(__carry.begin(), *this, begin()); + + for(__counter = &__tmp[0]; + __counter != __fill && !__counter->empty(); + ++__counter) + { + __counter->merge(__carry, __comp); + __carry.swap(*__counter); + } + __carry.swap(*__counter); + if (__counter == __fill) + ++__fill; + } + while ( !empty() ); + + for (__counter = &__tmp[1]; __counter != __fill; ++__counter) + __counter->merge(*(__counter - 1), __comp); + swap(*(__fill - 1)); + } + } + +} // namespace std + +#endif /* _LIST_TCC */ + diff --git a/cpp_src/locale b/cpp_src/locale new file mode 100644 index 0000000..5223f90 --- /dev/null +++ b/cpp_src/locale @@ -0,0 +1,48 @@ +// Locale support -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2002, 2003 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +// +// ISO C++ 14882: 22.1 Locales +// + +/** @file locale + * This is a Standard C++ Library header. + */ + +#ifndef _GLIBCXX_LOCALE +#define _GLIBCXX_LOCALE 1 + +#pragma GCC system_header + +#include +#include +#include +#include + +#endif /* _GLIBCXX_LOCALE */ diff --git a/cpp_src/locale_classes.h b/cpp_src/locale_classes.h new file mode 100644 index 0000000..b69a54d --- /dev/null +++ b/cpp_src/locale_classes.h @@ -0,0 +1,582 @@ +// Locale support -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file locale_classes.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 22.1 Locales +// + +#ifndef _LOCALE_CLASSES_H +#define _LOCALE_CLASSES_H 1 + +#pragma GCC system_header + +#include +#include // For strcmp. +#include +#include + +namespace std { + + // 22.1.1 Class locale + /** + * @brief Container class for localization functionality. + * + * The locale class is first a class wrapper for C library locales. It is + * also an extensible container for user-defined localization. A locale is + * a collection of facets that implement various localization features such + * as money, time, and number printing. + * + * Constructing C++ locales does not change the C library locale. + * + * This library supports efficient construction and copying of locales + * through a reference counting implementation of the locale class. + */ + class locale + { + public: + // Types: + /// Definition of locale::category. + typedef int category; + + // Forward decls and friends: + class facet; + class id; + class _Impl; + + friend class facet; + friend class _Impl; + + template + friend bool + has_facet(const locale&) throw(); + + template + friend const _Facet& + use_facet(const locale&); + + template + friend struct __use_cache; + + //@{ + /** + * @brief Category values. + * + * The standard category values are none, ctype, numeric, collate, time, + * monetary, and messages. They form a bitmask that supports union and + * intersection. The category all is the union of these values. + * + * @if maint + * NB: Order must match _S_facet_categories definition in locale.cc + * @endif + */ + static const category none = 0; + static const category ctype = 1L << 0; + static const category numeric = 1L << 1; + static const category collate = 1L << 2; + static const category time = 1L << 3; + static const category monetary = 1L << 4; + static const category messages = 1L << 5; + static const category all = (ctype | numeric | collate | + time | monetary | messages); + //@} + + // Construct/copy/destroy: + + /** + * @brief Default constructor. + * + * Constructs a copy of the global locale. If no locale has been + * explicitly set, this is the "C" locale. + */ + locale() throw(); + + /** + * @brief Copy constructor. + * + * Constructs a copy of @a other. + * + * @param other The locale to copy. + */ + locale(const locale& __other) throw(); + + /** + * @brief Named locale constructor. + * + * Constructs a copy of the named C library locale. + * + * @param s Name of the locale to construct. + * @throw std::runtime_error if s is null or an undefined locale. + */ + explicit + locale(const char* __s); + + /** + * @brief Construct locale with facets from another locale. + * + * Constructs a copy of the locale @a base. The facets specified by @a + * cat are replaced with those from the locale named by @a s. If base is + * named, this locale instance will also be named. + * + * @param base The locale to copy. + * @param s Name of the locale to use facets from. + * @param cat Set of categories defining the facets to use from s. + * @throw std::runtime_error if s is null or an undefined locale. + */ + locale(const locale& __base, const char* __s, category __cat); + + /** + * @brief Construct locale with facets from another locale. + * + * Constructs a copy of the locale @a base. The facets specified by @a + * cat are replaced with those from the locale @a add. If @a base and @a + * add are named, this locale instance will also be named. + * + * @param base The locale to copy. + * @param add The locale to use facets from. + * @param cat Set of categories defining the facets to use from add. + */ + locale(const locale& __base, const locale& __add, category __cat); + + /** + * @brief Construct locale with another facet. + * + * Constructs a copy of the locale @a other. The facet @f is added to + * @other, replacing an existing facet of type Facet if there is one. If + * @f is null, this locale is a copy of @a other. + * + * @param other The locale to copy. + * @param f The facet to add in. + */ + template + locale(const locale& __other, _Facet* __f); + + /// Locale destructor. + ~locale() throw(); + + /** + * @brief Assignment operator. + * + * Set this locale to be a copy of @a other. + * + * @param other The locale to copy. + * @return A reference to this locale. + */ + const locale& + operator=(const locale& __other) throw(); + + /** + * @brief Construct locale with another facet. + * + * Constructs and returns a new copy of this locale. Adds or replaces an + * existing facet of type Facet from the locale @a other into the new + * locale. + * + * @param Facet The facet type to copy from other + * @param other The locale to copy from. + * @return Newly constructed locale. + * @throw std::runtime_error if other has no facet of type Facet. + */ + template + locale + combine(const locale& __other) const; + + // Locale operations: + /** + * @brief Return locale name. + * @return Locale name or "*" if unnamed. + */ + string + name() const; + + /** + * @brief Locale equality. + * + * @param other The locale to compare against. + * @return True if other and this refer to the same locale instance, are + * copies, or have the same name. False otherwise. + */ + bool + operator==(const locale& __other) const throw (); + + /** + * @brief Locale inequality. + * + * @param other The locale to compare against. + * @return ! (*this == other) + */ + inline bool + operator!=(const locale& __other) const throw () + { return !(this->operator==(__other)); } + + /** + * @brief Compare two strings according to collate. + * + * Template operator to compare two strings using the compare function of + * the collate facet in this locale. One use is to provide the locale to + * the sort function. For example, a vector v of strings could be sorted + * according to locale loc by doing: + * @code + * std::sort(v.begin(), v.end(), loc); + * @endcode + * + * @param s1 First string to compare. + * @param s2 Second string to compare. + * @return True if collate facet compares s1 < s2, else false. + */ + template + bool + operator()(const basic_string<_Char, _Traits, _Alloc>& __s1, + const basic_string<_Char, _Traits, _Alloc>& __s2) const; + + // Global locale objects: + /** + * @brief Set global locale + * + * This function sets the global locale to the argument and returns a + * copy of the previous global locale. If the argument has a name, it + * will also call std::setlocale(LC_ALL, loc.name()). + * + * @param locale The new locale to make global. + * @return Copy of the old global locale. + */ + static locale + global(const locale&); + + /** + * @brief Return reference to the "C" locale. + */ + static const locale& + classic(); + + private: + // The (shared) implementation + _Impl* _M_impl; + + // The "C" reference locale + static _Impl* _S_classic; + + // Current global locale + static _Impl* _S_global; + + // Names of underlying locale categories. + // NB: locale::global() has to know how to modify all the + // underlying categories, not just the ones required by the C++ + // standard. + static const char* const* const _S_categories; + + // Number of standard categories. For C++, these categories are + // collate, ctype, monetary, numeric, time, and messages. These + // directly correspond to ISO C99 macros LC_COLLATE, LC_CTYPE, + // LC_MONETARY, LC_NUMERIC, and LC_TIME. In addition, POSIX (IEEE + // 1003.1-2001) specifies LC_MESSAGES. + // In addition to the standard categories, the underlying + // operating system is allowed to define extra LC_* + // macros. For GNU systems, the following are also valid: + // LC_PAPER, LC_NAME, LC_ADDRESS, LC_TELEPHONE, LC_MEASUREMENT, + // and LC_IDENTIFICATION. + enum { _S_categories_size = 6 + _GLIBCXX_NUM_CATEGORIES }; + +#ifdef __GTHREADS + static __gthread_once_t _S_once; +#endif + + explicit + locale(_Impl*) throw(); + + static void + _S_initialize(); + + static void + _S_initialize_once(); + + static category + _S_normalize_category(category); + + void + _M_coalesce(const locale& __base, const locale& __add, category __cat); + }; + + + // 22.1.1.1.2 Class locale::facet + /** + * @brief Localization functionality base class. + * + * The facet class is the base class for a localization feature, such as + * money, time, and number printing. It provides common support for facets + * and reference management. + * + * Facets may not be copied or assigned. + */ + class locale::facet + { + private: + friend class locale; + friend class locale::_Impl; + + mutable _Atomic_word _M_refcount; + + // Contains data from the underlying "C" library for the classic locale. + static __c_locale _S_c_locale; + + // String literal for the name of the classic locale. + static const char _S_c_name[2]; + +#ifdef __GTHREADS + static __gthread_once_t _S_once; +#endif + + static void + _S_initialize_once(); + + protected: + /** + * @brief Facet constructor. + * + * This is the constructor provided by the standard. If refs is 0, the + * facet is destroyed when the last referencing locale is destroyed. + * Otherwise the facet will never be destroyed. + * + * @param refs The initial value for reference count. + */ + explicit + facet(size_t __refs = 0) throw() : _M_refcount(__refs ? 1 : 0) + { } + + /// Facet destructor. + virtual + ~facet(); + + static void + _S_create_c_locale(__c_locale& __cloc, const char* __s, + __c_locale __old = 0); + + static __c_locale + _S_clone_c_locale(__c_locale& __cloc); + + static void + _S_destroy_c_locale(__c_locale& __cloc); + + // Returns data from the underlying "C" library data for the + // classic locale. + static __c_locale + _S_get_c_locale(); + + static const char* + _S_get_c_name(); + + private: + inline void + _M_add_reference() const throw() + { __gnu_cxx::__atomic_add_dispatch(&_M_refcount, 1); } + + inline void + _M_remove_reference() const throw() + { + if (__gnu_cxx::__exchange_and_add_dispatch(&_M_refcount, -1) == 1) + { + try + { delete this; } + catch (...) + { } + } + } + + facet(const facet&); // Not defined. + + facet& + operator=(const facet&); // Not defined. + }; + + + // 22.1.1.1.3 Class locale::id + /** + * @brief Facet ID class. + * + * The ID class provides facets with an index used to identify them. + * Every facet class must define a public static member locale::id, or be + * derived from a facet that provides this member, otherwise the facet + * cannot be used in a locale. The locale::id ensures that each class + * type gets a unique identifier. + */ + class locale::id + { + private: + friend class locale; + friend class locale::_Impl; + + template + friend const _Facet& + use_facet(const locale&); + + template + friend bool + has_facet(const locale&) throw (); + + // NB: There is no accessor for _M_index because it may be used + // before the constructor is run; the effect of calling a member + // function (even an inline) would be undefined. + mutable size_t _M_index; + + // Last id number assigned. + static _Atomic_word _S_refcount; + + void + operator=(const id&); // Not defined. + + id(const id&); // Not defined. + + public: + // NB: This class is always a static data member, and thus can be + // counted on to be zero-initialized. + /// Constructor. + id() { } + + size_t + _M_id() const; + }; + + + // Implementation object for locale. + class locale::_Impl + { + public: + // Friends. + friend class locale; + friend class locale::facet; + + template + friend bool + has_facet(const locale&) throw(); + + template + friend const _Facet& + use_facet(const locale&); + + template + friend struct __use_cache; + + private: + // Data Members. + _Atomic_word _M_refcount; + const facet** _M_facets; + size_t _M_facets_size; + const facet** _M_caches; + char** _M_names; + static const locale::id* const _S_id_ctype[]; + static const locale::id* const _S_id_numeric[]; + static const locale::id* const _S_id_collate[]; + static const locale::id* const _S_id_time[]; + static const locale::id* const _S_id_monetary[]; + static const locale::id* const _S_id_messages[]; + static const locale::id* const* const _S_facet_categories[]; + + inline void + _M_add_reference() throw() + { __gnu_cxx::__atomic_add_dispatch(&_M_refcount, 1); } + + inline void + _M_remove_reference() throw() + { + if (__gnu_cxx::__exchange_and_add_dispatch(&_M_refcount, -1) == 1) + { + try + { delete this; } + catch(...) + { } + } + } + + _Impl(const _Impl&, size_t); + _Impl(const char*, size_t); + _Impl(size_t) throw(); + + ~_Impl() throw(); + + _Impl(const _Impl&); // Not defined. + + void + operator=(const _Impl&); // Not defined. + + inline bool + _M_check_same_name() + { + bool __ret = true; + if (_M_names[1]) + // We must actually compare all the _M_names: can be all equal! + for (size_t __i = 0; __ret && __i < _S_categories_size - 1; ++__i) + __ret = std::strcmp(_M_names[__i], _M_names[__i + 1]) == 0; + return __ret; + } + + void + _M_replace_categories(const _Impl*, category); + + void + _M_replace_category(const _Impl*, const locale::id* const*); + + void + _M_replace_facet(const _Impl*, const locale::id*); + + void + _M_install_facet(const locale::id*, const facet*); + + template + inline void + _M_init_facet(_Facet* __facet) + { _M_install_facet(&_Facet::id, __facet); } + + void + _M_install_cache(const facet*, size_t); + }; + + template + locale::locale(const locale& __other, _Facet* __f) + { + _M_impl = new _Impl(*__other._M_impl, 1); + + try + { _M_impl->_M_install_facet(&_Facet::id, __f); } + catch(...) + { + _M_impl->_M_remove_reference(); + __throw_exception_again; + } + delete [] _M_impl->_M_names[0]; + _M_impl->_M_names[0] = 0; // Unnamed. + } + +} // namespace std + +#endif diff --git a/cpp_src/locale_facets.h b/cpp_src/locale_facets.h new file mode 100644 index 0000000..88ebc9d --- /dev/null +++ b/cpp_src/locale_facets.h @@ -0,0 +1,4688 @@ +// Locale support -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file locale_facets.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 22.1 Locales +// + +#ifndef _LOCALE_FACETS_H +#define _LOCALE_FACETS_H 1 + +#pragma GCC system_header + +#include // For struct tm +#include // For wctype_t +#include +#include +#include // For ios_base, ios_base::iostate +#include +#include + +namespace std { + + // NB: Don't instantiate required wchar_t facets if no wchar_t support. +#ifdef _GLIBCXX_USE_WCHAR_T +# define _GLIBCXX_NUM_FACETS 28 +#else +# define _GLIBCXX_NUM_FACETS 14 +#endif + + // Convert string to numeric value of type _Tv and store results. + // NB: This is specialized for all required types, there is no + // generic definition. + template + void + __convert_to_v(const char* __in, _Tv& __out, ios_base::iostate& __err, + const __c_locale& __cloc); + + // Explicit specializations for required types. + template<> + void + __convert_to_v(const char*, float&, ios_base::iostate&, + const __c_locale&); + + template<> + void + __convert_to_v(const char*, double&, ios_base::iostate&, + const __c_locale&); + + template<> + void + __convert_to_v(const char*, long double&, ios_base::iostate&, + const __c_locale&); + + // NB: __pad is a struct, rather than a function, so it can be + // partially-specialized. + template + struct __pad + { + static void + _S_pad(ios_base& __io, _CharT __fill, _CharT* __news, + const _CharT* __olds, const streamsize __newlen, + const streamsize __oldlen, const bool __num); + }; + + // Used by both numeric and monetary facets. + // Inserts "group separator" characters into an array of characters. + // It's recursive, one iteration per group. It moves the characters + // in the buffer this way: "xxxx12345" -> "12,345xxx". Call this + // only with __glen != 0. + template + _CharT* + __add_grouping(_CharT* __s, _CharT __sep, + const char* __gbeg, size_t __gsize, + const _CharT* __first, const _CharT* __last); + + // This template permits specializing facet output code for + // ostreambuf_iterator. For ostreambuf_iterator, sputn is + // significantly more efficient than incrementing iterators. + template + inline + ostreambuf_iterator<_CharT> + __write(ostreambuf_iterator<_CharT> __s, const _CharT* __ws, int __len) + { + __s._M_put(__ws, __len); + return __s; + } + + // This is the unspecialized form of the template. + template + inline + _OutIter + __write(_OutIter __s, const _CharT* __ws, int __len) + { + for (int __j = 0; __j < __len; __j++, ++__s) + *__s = __ws[__j]; + return __s; + } + + + // 22.2.1.1 Template class ctype + // Include host and configuration specific ctype enums for ctype_base. + + // Common base for ctype<_CharT>. + /** + * @brief Common base for ctype facet + * + * This template class provides implementations of the public functions + * that forward to the protected virtual functions. + * + * This template also provides abtract stubs for the protected virtual + * functions. + */ + template + class __ctype_abstract_base : public locale::facet, public ctype_base + { + public: + // Types: + /// Typedef for the template parameter + typedef _CharT char_type; + + /** + * @brief Test char_type classification. + * + * This function finds a mask M for @a c and compares it to mask @a m. + * It does so by returning the value of ctype::do_is(). + * + * @param c The char_type to compare the mask of. + * @param m The mask to compare against. + * @return (M & m) != 0. + */ + bool + is(mask __m, char_type __c) const + { return this->do_is(__m, __c); } + + /** + * @brief Return a mask array. + * + * This function finds the mask for each char_type in the range [lo,hi) + * and successively writes it to vec. vec must have as many elements + * as the char array. It does so by returning the value of + * ctype::do_is(). + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @param vec Pointer to an array of mask storage. + * @return @a hi. + */ + const char_type* + is(const char_type *__lo, const char_type *__hi, mask *__vec) const + { return this->do_is(__lo, __hi, __vec); } + + /** + * @brief Find char_type matching a mask + * + * This function searches for and returns the first char_type c in + * [lo,hi) for which is(m,c) is true. It does so by returning + * ctype::do_scan_is(). + * + * @param m The mask to compare against. + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @return Pointer to matching char_type if found, else @a hi. + */ + const char_type* + scan_is(mask __m, const char_type* __lo, const char_type* __hi) const + { return this->do_scan_is(__m, __lo, __hi); } + + /** + * @brief Find char_type not matching a mask + * + * This function searches for and returns the first char_type c in + * [lo,hi) for which is(m,c) is false. It does so by returning + * ctype::do_scan_not(). + * + * @param m The mask to compare against. + * @param lo Pointer to first char in range. + * @param hi Pointer to end of range. + * @return Pointer to non-matching char if found, else @a hi. + */ + const char_type* + scan_not(mask __m, const char_type* __lo, const char_type* __hi) const + { return this->do_scan_not(__m, __lo, __hi); } + + /** + * @brief Convert to uppercase. + * + * This function converts the argument to uppercase if possible. + * If not possible (for example, '2'), returns the argument. It does + * so by returning ctype::do_toupper(). + * + * @param c The char_type to convert. + * @return The uppercase char_type if convertible, else @a c. + */ + char_type + toupper(char_type __c) const + { return this->do_toupper(__c); } + + /** + * @brief Convert array to uppercase. + * + * This function converts each char_type in the range [lo,hi) to + * uppercase if possible. Other elements remain untouched. It does so + * by returning ctype:: do_toupper(lo, hi). + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @return @a hi. + */ + const char_type* + toupper(char_type *__lo, const char_type* __hi) const + { return this->do_toupper(__lo, __hi); } + + /** + * @brief Convert to lowercase. + * + * This function converts the argument to lowercase if possible. If + * not possible (for example, '2'), returns the argument. It does so + * by returning ctype::do_tolower(c). + * + * @param c The char_type to convert. + * @return The lowercase char_type if convertible, else @a c. + */ + char_type + tolower(char_type __c) const + { return this->do_tolower(__c); } + + /** + * @brief Convert array to lowercase. + * + * This function converts each char_type in the range [lo,hi) to + * lowercase if possible. Other elements remain untouched. It does so + * by returning ctype:: do_tolower(lo, hi). + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @return @a hi. + */ + const char_type* + tolower(char_type* __lo, const char_type* __hi) const + { return this->do_tolower(__lo, __hi); } + + /** + * @brief Widen char to char_type + * + * This function converts the char argument to char_type using the + * simplest reasonable transformation. It does so by returning + * ctype::do_widen(c). + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param c The char to convert. + * @return The converted char_type. + */ + char_type + widen(char __c) const + { return this->do_widen(__c); } + + /** + * @brief Widen array to char_type + * + * This function converts each char in the input to char_type using the + * simplest reasonable transformation. It does so by returning + * ctype::do_widen(c). + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @param to Pointer to the destination array. + * @return @a hi. + */ + const char* + widen(const char* __lo, const char* __hi, char_type* __to) const + { return this->do_widen(__lo, __hi, __to); } + + /** + * @brief Narrow char_type to char + * + * This function converts the char_type to char using the simplest + * reasonable transformation. If the conversion fails, dfault is + * returned instead. It does so by returning + * ctype::do_narrow(c). + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param c The char_type to convert. + * @param dfault Char to return if conversion fails. + * @return The converted char. + */ + char + narrow(char_type __c, char __dfault) const + { return this->do_narrow(__c, __dfault); } + + /** + * @brief Narrow array to char array + * + * This function converts each char_type in the input to char using the + * simplest reasonable transformation and writes the results to the + * destination array. For any char_type in the input that cannot be + * converted, @a dfault is used instead. It does so by returning + * ctype::do_narrow(lo, hi, dfault, to). + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @param dfault Char to use if conversion fails. + * @param to Pointer to the destination array. + * @return @a hi. + */ + const char_type* + narrow(const char_type* __lo, const char_type* __hi, + char __dfault, char *__to) const + { return this->do_narrow(__lo, __hi, __dfault, __to); } + + protected: + explicit + __ctype_abstract_base(size_t __refs = 0): facet(__refs) { } + + virtual + ~__ctype_abstract_base() { } + + /** + * @brief Test char_type classification. + * + * This function finds a mask M for @a c and compares it to mask @a m. + * + * do_is() is a hook for a derived facet to change the behavior of + * classifying. do_is() must always return the same result for the + * same input. + * + * @param c The char_type to find the mask of. + * @param m The mask to compare against. + * @return (M & m) != 0. + */ + virtual bool + do_is(mask __m, char_type __c) const = 0; + + /** + * @brief Return a mask array. + * + * This function finds the mask for each char_type in the range [lo,hi) + * and successively writes it to vec. vec must have as many elements + * as the input. + * + * do_is() is a hook for a derived facet to change the behavior of + * classifying. do_is() must always return the same result for the + * same input. + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @param vec Pointer to an array of mask storage. + * @return @a hi. + */ + virtual const char_type* + do_is(const char_type* __lo, const char_type* __hi, + mask* __vec) const = 0; + + /** + * @brief Find char_type matching mask + * + * This function searches for and returns the first char_type c in + * [lo,hi) for which is(m,c) is true. + * + * do_scan_is() is a hook for a derived facet to change the behavior of + * match searching. do_is() must always return the same result for the + * same input. + * + * @param m The mask to compare against. + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @return Pointer to a matching char_type if found, else @a hi. + */ + virtual const char_type* + do_scan_is(mask __m, const char_type* __lo, + const char_type* __hi) const = 0; + + /** + * @brief Find char_type not matching mask + * + * This function searches for and returns a pointer to the first + * char_type c of [lo,hi) for which is(m,c) is false. + * + * do_scan_is() is a hook for a derived facet to change the behavior of + * match searching. do_is() must always return the same result for the + * same input. + * + * @param m The mask to compare against. + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @return Pointer to a non-matching char_type if found, else @a hi. + */ + virtual const char_type* + do_scan_not(mask __m, const char_type* __lo, + const char_type* __hi) const = 0; + + /** + * @brief Convert to uppercase. + * + * This virtual function converts the char_type argument to uppercase + * if possible. If not possible (for example, '2'), returns the + * argument. + * + * do_toupper() is a hook for a derived facet to change the behavior of + * uppercasing. do_toupper() must always return the same result for + * the same input. + * + * @param c The char_type to convert. + * @return The uppercase char_type if convertible, else @a c. + */ + virtual char_type + do_toupper(char_type) const = 0; + + /** + * @brief Convert array to uppercase. + * + * This virtual function converts each char_type in the range [lo,hi) + * to uppercase if possible. Other elements remain untouched. + * + * do_toupper() is a hook for a derived facet to change the behavior of + * uppercasing. do_toupper() must always return the same result for + * the same input. + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @return @a hi. + */ + virtual const char_type* + do_toupper(char_type* __lo, const char_type* __hi) const = 0; + + /** + * @brief Convert to lowercase. + * + * This virtual function converts the argument to lowercase if + * possible. If not possible (for example, '2'), returns the argument. + * + * do_tolower() is a hook for a derived facet to change the behavior of + * lowercasing. do_tolower() must always return the same result for + * the same input. + * + * @param c The char_type to convert. + * @return The lowercase char_type if convertible, else @a c. + */ + virtual char_type + do_tolower(char_type) const = 0; + + /** + * @brief Convert array to lowercase. + * + * This virtual function converts each char_type in the range [lo,hi) + * to lowercase if possible. Other elements remain untouched. + * + * do_tolower() is a hook for a derived facet to change the behavior of + * lowercasing. do_tolower() must always return the same result for + * the same input. + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @return @a hi. + */ + virtual const char_type* + do_tolower(char_type* __lo, const char_type* __hi) const = 0; + + /** + * @brief Widen char + * + * This virtual function converts the char to char_type using the + * simplest reasonable transformation. + * + * do_widen() is a hook for a derived facet to change the behavior of + * widening. do_widen() must always return the same result for the + * same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param c The char to convert. + * @return The converted char_type + */ + virtual char_type + do_widen(char) const = 0; + + /** + * @brief Widen char array + * + * This function converts each char in the input to char_type using the + * simplest reasonable transformation. + * + * do_widen() is a hook for a derived facet to change the behavior of + * widening. do_widen() must always return the same result for the + * same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param lo Pointer to start range. + * @param hi Pointer to end of range. + * @param to Pointer to the destination array. + * @return @a hi. + */ + virtual const char* + do_widen(const char* __lo, const char* __hi, + char_type* __dest) const = 0; + + /** + * @brief Narrow char_type to char + * + * This virtual function converts the argument to char using the + * simplest reasonable transformation. If the conversion fails, dfault + * is returned instead. + * + * do_narrow() is a hook for a derived facet to change the behavior of + * narrowing. do_narrow() must always return the same result for the + * same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param c The char_type to convert. + * @param dfault Char to return if conversion fails. + * @return The converted char. + */ + virtual char + do_narrow(char_type, char __dfault) const = 0; + + /** + * @brief Narrow char_type array to char + * + * This virtual function converts each char_type in the range [lo,hi) to + * char using the simplest reasonable transformation and writes the + * results to the destination array. For any element in the input that + * cannot be converted, @a dfault is used instead. + * + * do_narrow() is a hook for a derived facet to change the behavior of + * narrowing. do_narrow() must always return the same result for the + * same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @param dfault Char to use if conversion fails. + * @param to Pointer to the destination array. + * @return @a hi. + */ + virtual const char_type* + do_narrow(const char_type* __lo, const char_type* __hi, + char __dfault, char* __dest) const = 0; + }; + + // NB: Generic, mostly useless implementation. + /** + * @brief Template ctype facet + * + * This template class defines classification and conversion functions for + * character sets. It wraps functionality. Ctype gets used by + * streams for many I/O operations. + * + * This template provides the protected virtual functions the developer + * will have to replace in a derived class or specialization to make a + * working facet. The public functions that access them are defined in + * __ctype_abstract_base, to allow for implementation flexibility. See + * ctype for an example. The functions are documented in + * __ctype_abstract_base. + * + * Note: implementations are provided for all the protected virtual + * functions, but will likely not be useful. + */ + template + class ctype : public __ctype_abstract_base<_CharT> + { + public: + // Types: + typedef _CharT char_type; + typedef typename __ctype_abstract_base<_CharT>::mask mask; + + /// The facet id for ctype + static locale::id id; + + explicit + ctype(size_t __refs = 0) : __ctype_abstract_base<_CharT>(__refs) { } + + protected: + virtual + ~ctype(); + + virtual bool + do_is(mask __m, char_type __c) const; + + virtual const char_type* + do_is(const char_type* __lo, const char_type* __hi, mask* __vec) const; + + virtual const char_type* + do_scan_is(mask __m, const char_type* __lo, const char_type* __hi) const; + + virtual const char_type* + do_scan_not(mask __m, const char_type* __lo, + const char_type* __hi) const; + + virtual char_type + do_toupper(char_type __c) const; + + virtual const char_type* + do_toupper(char_type* __lo, const char_type* __hi) const; + + virtual char_type + do_tolower(char_type __c) const; + + virtual const char_type* + do_tolower(char_type* __lo, const char_type* __hi) const; + + virtual char_type + do_widen(char __c) const; + + virtual const char* + do_widen(const char* __lo, const char* __hi, char_type* __dest) const; + + virtual char + do_narrow(char_type, char __dfault) const; + + virtual const char_type* + do_narrow(const char_type* __lo, const char_type* __hi, + char __dfault, char* __dest) const; + }; + + template + locale::id ctype<_CharT>::id; + + // 22.2.1.3 ctype specialization. + /** + * @brief The ctype specialization. + * + * This class defines classification and conversion functions for + * the char type. It gets used by char streams for many I/O + * operations. The char specialization provides a number of + * optimizations as well. + */ + template<> + class ctype : public locale::facet, public ctype_base + { + public: + // Types: + /// Typedef for the template parameter char. + typedef char char_type; + + protected: + // Data Members: + __c_locale _M_c_locale_ctype; + bool _M_del; + __to_type _M_toupper; + __to_type _M_tolower; + const mask* _M_table; + mutable char _M_widen_ok; + mutable char _M_widen[1 + static_cast(-1)]; + mutable char _M_narrow[1 + static_cast(-1)]; + mutable char _M_narrow_ok; // 0 uninitialized, 1 init, + // 2 memcpy can't be used + + public: + /// The facet id for ctype + static locale::id id; + /// The size of the mask table. It is SCHAR_MAX + 1. + static const size_t table_size = 1 + static_cast(-1); + + /** + * @brief Constructor performs initialization. + * + * This is the constructor provided by the standard. + * + * @param table If non-zero, table is used as the per-char mask. + * Else classic_table() is used. + * @param del If true, passes ownership of table to this facet. + * @param refs Passed to the base facet class. + */ + explicit + ctype(const mask* __table = 0, bool __del = false, size_t __refs = 0); + + /** + * @brief Constructor performs static initialization. + * + * This constructor is used to construct the initial C locale facet. + * + * @param cloc Handle to C locale data. + * @param table If non-zero, table is used as the per-char mask. + * @param del If true, passes ownership of table to this facet. + * @param refs Passed to the base facet class. + */ + explicit + ctype(__c_locale __cloc, const mask* __table = 0, bool __del = false, + size_t __refs = 0); + + /** + * @brief Test char classification. + * + * This function compares the mask table[c] to @a m. + * + * @param c The char to compare the mask of. + * @param m The mask to compare against. + * @return True if m & table[c] is true, false otherwise. + */ + inline bool + is(mask __m, char __c) const; + + /** + * @brief Return a mask array. + * + * This function finds the mask for each char in the range [lo, hi) and + * successively writes it to vec. vec must have as many elements as + * the char array. + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @param vec Pointer to an array of mask storage. + * @return @a hi. + */ + inline const char* + is(const char* __lo, const char* __hi, mask* __vec) const; + + /** + * @brief Find char matching a mask + * + * This function searches for and returns the first char in [lo,hi) for + * which is(m,char) is true. + * + * @param m The mask to compare against. + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @return Pointer to a matching char if found, else @a hi. + */ + inline const char* + scan_is(mask __m, const char* __lo, const char* __hi) const; + + /** + * @brief Find char not matching a mask + * + * This function searches for and returns a pointer to the first char + * in [lo,hi) for which is(m,char) is false. + * + * @param m The mask to compare against. + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @return Pointer to a non-matching char if found, else @a hi. + */ + inline const char* + scan_not(mask __m, const char* __lo, const char* __hi) const; + + /** + * @brief Convert to uppercase. + * + * This function converts the char argument to uppercase if possible. + * If not possible (for example, '2'), returns the argument. + * + * toupper() acts as if it returns ctype::do_toupper(c). + * do_toupper() must always return the same result for the same input. + * + * @param c The char to convert. + * @return The uppercase char if convertible, else @a c. + */ + char_type + toupper(char_type __c) const + { return this->do_toupper(__c); } + + /** + * @brief Convert array to uppercase. + * + * This function converts each char in the range [lo,hi) to uppercase + * if possible. Other chars remain untouched. + * + * toupper() acts as if it returns ctype:: do_toupper(lo, hi). + * do_toupper() must always return the same result for the same input. + * + * @param lo Pointer to first char in range. + * @param hi Pointer to end of range. + * @return @a hi. + */ + const char_type* + toupper(char_type *__lo, const char_type* __hi) const + { return this->do_toupper(__lo, __hi); } + + /** + * @brief Convert to lowercase. + * + * This function converts the char argument to lowercase if possible. + * If not possible (for example, '2'), returns the argument. + * + * tolower() acts as if it returns ctype::do_tolower(c). + * do_tolower() must always return the same result for the same input. + * + * @param c The char to convert. + * @return The lowercase char if convertible, else @a c. + */ + char_type + tolower(char_type __c) const + { return this->do_tolower(__c); } + + /** + * @brief Convert array to lowercase. + * + * This function converts each char in the range [lo,hi) to lowercase + * if possible. Other chars remain untouched. + * + * tolower() acts as if it returns ctype:: do_tolower(lo, hi). + * do_tolower() must always return the same result for the same input. + * + * @param lo Pointer to first char in range. + * @param hi Pointer to end of range. + * @return @a hi. + */ + const char_type* + tolower(char_type* __lo, const char_type* __hi) const + { return this->do_tolower(__lo, __hi); } + + /** + * @brief Widen char + * + * This function converts the char to char_type using the simplest + * reasonable transformation. For an underived ctype facet, the + * argument will be returned unchanged. + * + * This function works as if it returns ctype::do_widen(c). + * do_widen() must always return the same result for the same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param c The char to convert. + * @return The converted character. + */ + char_type + widen(char __c) const + { + if (_M_widen_ok) + return _M_widen[static_cast(__c)]; + this->_M_widen_init(); + return this->do_widen(__c); + } + + /** + * @brief Widen char array + * + * This function converts each char in the input to char using the + * simplest reasonable transformation. For an underived ctype + * facet, the argument will be copied unchanged. + * + * This function works as if it returns ctype::do_widen(c). + * do_widen() must always return the same result for the same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param lo Pointer to first char in range. + * @param hi Pointer to end of range. + * @param to Pointer to the destination array. + * @return @a hi. + */ + const char* + widen(const char* __lo, const char* __hi, char_type* __to) const + { + if (_M_widen_ok == 1) + { + memcpy(__to, __lo, __hi - __lo); + return __hi; + } + if (!_M_widen_ok) + _M_widen_init(); + return this->do_widen(__lo, __hi, __to); + } + + /** + * @brief Narrow char + * + * This function converts the char to char using the simplest + * reasonable transformation. If the conversion fails, dfault is + * returned instead. For an underived ctype facet, @a c + * will be returned unchanged. + * + * This function works as if it returns ctype::do_narrow(c). + * do_narrow() must always return the same result for the same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param c The char to convert. + * @param dfault Char to return if conversion fails. + * @return The converted character. + */ + char + narrow(char_type __c, char __dfault) const + { + if (_M_narrow[static_cast(__c)]) + return _M_narrow[static_cast(__c)]; + const char __t = do_narrow(__c, __dfault); + if (__t != __dfault) + _M_narrow[static_cast(__c)] = __t; + return __t; + } + + /** + * @brief Narrow char array + * + * This function converts each char in the input to char using the + * simplest reasonable transformation and writes the results to the + * destination array. For any char in the input that cannot be + * converted, @a dfault is used instead. For an underived ctype + * facet, the argument will be copied unchanged. + * + * This function works as if it returns ctype::do_narrow(lo, hi, + * dfault, to). do_narrow() must always return the same result for the + * same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @param dfault Char to use if conversion fails. + * @param to Pointer to the destination array. + * @return @a hi. + */ + const char_type* + narrow(const char_type* __lo, const char_type* __hi, + char __dfault, char *__to) const + { + if (__builtin_expect(_M_narrow_ok == 1, true)) + { + memcpy(__to, __lo, __hi - __lo); + return __hi; + } + if (!_M_narrow_ok) + _M_narrow_init(); + return this->do_narrow(__lo, __hi, __dfault, __to); + } + + protected: + /// Returns a pointer to the mask table provided to the constructor, or + /// the default from classic_table() if none was provided. + const mask* + table() const throw() + { return _M_table; } + + /// Returns a pointer to the C locale mask table. + static const mask* + classic_table() throw(); + + /** + * @brief Destructor. + * + * This function deletes table() if @a del was true in the + * constructor. + */ + virtual + ~ctype(); + + /** + * @brief Convert to uppercase. + * + * This virtual function converts the char argument to uppercase if + * possible. If not possible (for example, '2'), returns the argument. + * + * do_toupper() is a hook for a derived facet to change the behavior of + * uppercasing. do_toupper() must always return the same result for + * the same input. + * + * @param c The char to convert. + * @return The uppercase char if convertible, else @a c. + */ + virtual char_type + do_toupper(char_type) const; + + /** + * @brief Convert array to uppercase. + * + * This virtual function converts each char in the range [lo,hi) to + * uppercase if possible. Other chars remain untouched. + * + * do_toupper() is a hook for a derived facet to change the behavior of + * uppercasing. do_toupper() must always return the same result for + * the same input. + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @return @a hi. + */ + virtual const char_type* + do_toupper(char_type* __lo, const char_type* __hi) const; + + /** + * @brief Convert to lowercase. + * + * This virtual function converts the char argument to lowercase if + * possible. If not possible (for example, '2'), returns the argument. + * + * do_tolower() is a hook for a derived facet to change the behavior of + * lowercasing. do_tolower() must always return the same result for + * the same input. + * + * @param c The char to convert. + * @return The lowercase char if convertible, else @a c. + */ + virtual char_type + do_tolower(char_type) const; + + /** + * @brief Convert array to lowercase. + * + * This virtual function converts each char in the range [lo,hi) to + * lowercase if possible. Other chars remain untouched. + * + * do_tolower() is a hook for a derived facet to change the behavior of + * lowercasing. do_tolower() must always return the same result for + * the same input. + * + * @param lo Pointer to first char in range. + * @param hi Pointer to end of range. + * @return @a hi. + */ + virtual const char_type* + do_tolower(char_type* __lo, const char_type* __hi) const; + + /** + * @brief Widen char + * + * This virtual function converts the char to char using the simplest + * reasonable transformation. For an underived ctype facet, the + * argument will be returned unchanged. + * + * do_widen() is a hook for a derived facet to change the behavior of + * widening. do_widen() must always return the same result for the + * same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param c The char to convert. + * @return The converted character. + */ + virtual char_type + do_widen(char __c) const + { return __c; } + + /** + * @brief Widen char array + * + * This function converts each char in the range [lo,hi) to char using + * the simplest reasonable transformation. For an underived + * ctype facet, the argument will be copied unchanged. + * + * do_widen() is a hook for a derived facet to change the behavior of + * widening. do_widen() must always return the same result for the + * same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @param to Pointer to the destination array. + * @return @a hi. + */ + virtual const char* + do_widen(const char* __lo, const char* __hi, char_type* __dest) const + { + memcpy(__dest, __lo, __hi - __lo); + return __hi; + } + + /** + * @brief Narrow char + * + * This virtual function converts the char to char using the simplest + * reasonable transformation. If the conversion fails, dfault is + * returned instead. For an underived ctype facet, @a c will be + * returned unchanged. + * + * do_narrow() is a hook for a derived facet to change the behavior of + * narrowing. do_narrow() must always return the same result for the + * same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param c The char to convert. + * @param dfault Char to return if conversion fails. + * @return The converted char. + */ + virtual char + do_narrow(char_type __c, char) const + { return __c; } + + /** + * @brief Narrow char array to char array + * + * This virtual function converts each char in the range [lo,hi) to + * char using the simplest reasonable transformation and writes the + * results to the destination array. For any char in the input that + * cannot be converted, @a dfault is used instead. For an underived + * ctype facet, the argument will be copied unchanged. + * + * do_narrow() is a hook for a derived facet to change the behavior of + * narrowing. do_narrow() must always return the same result for the + * same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @param dfault Char to use if conversion fails. + * @param to Pointer to the destination array. + * @return @a hi. + */ + virtual const char_type* + do_narrow(const char_type* __lo, const char_type* __hi, + char, char* __dest) const + { + memcpy(__dest, __lo, __hi - __lo); + return __hi; + } + + private: + + void _M_widen_init() const + { + char __tmp[sizeof(_M_widen)]; + for (size_t __i = 0; __i < sizeof(_M_widen); ++__i) + __tmp[__i] = __i; + do_widen(__tmp, __tmp + sizeof(__tmp), _M_widen); + + _M_widen_ok = 1; + // Set _M_widen_ok to 2 if memcpy can't be used. + if (memcmp(__tmp, _M_widen, sizeof(_M_widen))) + _M_widen_ok = 2; + } + + // Fill in the narrowing cache and flag whether all values are + // valid or not. _M_narrow_ok is set to 2 if memcpy can't + // be used. + void _M_narrow_init() const + { + char __tmp[sizeof(_M_narrow)]; + for (size_t __i = 0; __i < sizeof(_M_narrow); ++__i) + __tmp[__i] = __i; + do_narrow(__tmp, __tmp + sizeof(__tmp), 0, _M_narrow); + + _M_narrow_ok = 1; + if (memcmp(__tmp, _M_narrow, sizeof(_M_narrow))) + _M_narrow_ok = 2; + else + { + // Deal with the special case of zero: renarrow with a + // different default and compare. + char __c; + do_narrow(__tmp, __tmp + 1, 1, &__c); + if (__c == 1) + _M_narrow_ok = 2; + } + } + }; + + template<> + const ctype& + use_facet >(const locale& __loc); + +#ifdef _GLIBCXX_USE_WCHAR_T + // 22.2.1.3 ctype specialization + /** + * @brief The ctype specialization. + * + * This class defines classification and conversion functions for the + * wchar_t type. It gets used by wchar_t streams for many I/O operations. + * The wchar_t specialization provides a number of optimizations as well. + * + * ctype inherits its public methods from + * __ctype_abstract_base. + */ + template<> + class ctype : public __ctype_abstract_base + { + public: + // Types: + /// Typedef for the template parameter wchar_t. + typedef wchar_t char_type; + typedef wctype_t __wmask_type; + + protected: + __c_locale _M_c_locale_ctype; + + // Pre-computed narrowed and widened chars. + bool _M_narrow_ok; + char _M_narrow[128]; + wint_t _M_widen[1 + static_cast(-1)]; + + // Pre-computed elements for do_is. + mask _M_bit[16]; + __wmask_type _M_wmask[16]; + + public: + // Data Members: + /// The facet id for ctype + static locale::id id; + + /** + * @brief Constructor performs initialization. + * + * This is the constructor provided by the standard. + * + * @param refs Passed to the base facet class. + */ + explicit + ctype(size_t __refs = 0); + + /** + * @brief Constructor performs static initialization. + * + * This constructor is used to construct the initial C locale facet. + * + * @param cloc Handle to C locale data. + * @param refs Passed to the base facet class. + */ + explicit + ctype(__c_locale __cloc, size_t __refs = 0); + + protected: + __wmask_type + _M_convert_to_wmask(const mask __m) const; + + /// Destructor + virtual + ~ctype(); + + /** + * @brief Test wchar_t classification. + * + * This function finds a mask M for @a c and compares it to mask @a m. + * + * do_is() is a hook for a derived facet to change the behavior of + * classifying. do_is() must always return the same result for the + * same input. + * + * @param c The wchar_t to find the mask of. + * @param m The mask to compare against. + * @return (M & m) != 0. + */ + virtual bool + do_is(mask __m, char_type __c) const; + + /** + * @brief Return a mask array. + * + * This function finds the mask for each wchar_t in the range [lo,hi) + * and successively writes it to vec. vec must have as many elements + * as the input. + * + * do_is() is a hook for a derived facet to change the behavior of + * classifying. do_is() must always return the same result for the + * same input. + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @param vec Pointer to an array of mask storage. + * @return @a hi. + */ + virtual const char_type* + do_is(const char_type* __lo, const char_type* __hi, mask* __vec) const; + + /** + * @brief Find wchar_t matching mask + * + * This function searches for and returns the first wchar_t c in + * [lo,hi) for which is(m,c) is true. + * + * do_scan_is() is a hook for a derived facet to change the behavior of + * match searching. do_is() must always return the same result for the + * same input. + * + * @param m The mask to compare against. + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @return Pointer to a matching wchar_t if found, else @a hi. + */ + virtual const char_type* + do_scan_is(mask __m, const char_type* __lo, const char_type* __hi) const; + + /** + * @brief Find wchar_t not matching mask + * + * This function searches for and returns a pointer to the first + * wchar_t c of [lo,hi) for which is(m,c) is false. + * + * do_scan_is() is a hook for a derived facet to change the behavior of + * match searching. do_is() must always return the same result for the + * same input. + * + * @param m The mask to compare against. + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @return Pointer to a non-matching wchar_t if found, else @a hi. + */ + virtual const char_type* + do_scan_not(mask __m, const char_type* __lo, + const char_type* __hi) const; + + /** + * @brief Convert to uppercase. + * + * This virtual function converts the wchar_t argument to uppercase if + * possible. If not possible (for example, '2'), returns the argument. + * + * do_toupper() is a hook for a derived facet to change the behavior of + * uppercasing. do_toupper() must always return the same result for + * the same input. + * + * @param c The wchar_t to convert. + * @return The uppercase wchar_t if convertible, else @a c. + */ + virtual char_type + do_toupper(char_type) const; + + /** + * @brief Convert array to uppercase. + * + * This virtual function converts each wchar_t in the range [lo,hi) to + * uppercase if possible. Other elements remain untouched. + * + * do_toupper() is a hook for a derived facet to change the behavior of + * uppercasing. do_toupper() must always return the same result for + * the same input. + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @return @a hi. + */ + virtual const char_type* + do_toupper(char_type* __lo, const char_type* __hi) const; + + /** + * @brief Convert to lowercase. + * + * This virtual function converts the argument to lowercase if + * possible. If not possible (for example, '2'), returns the argument. + * + * do_tolower() is a hook for a derived facet to change the behavior of + * lowercasing. do_tolower() must always return the same result for + * the same input. + * + * @param c The wchar_t to convert. + * @return The lowercase wchar_t if convertible, else @a c. + */ + virtual char_type + do_tolower(char_type) const; + + /** + * @brief Convert array to lowercase. + * + * This virtual function converts each wchar_t in the range [lo,hi) to + * lowercase if possible. Other elements remain untouched. + * + * do_tolower() is a hook for a derived facet to change the behavior of + * lowercasing. do_tolower() must always return the same result for + * the same input. + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @return @a hi. + */ + virtual const char_type* + do_tolower(char_type* __lo, const char_type* __hi) const; + + /** + * @brief Widen char to wchar_t + * + * This virtual function converts the char to wchar_t using the + * simplest reasonable transformation. For an underived ctype + * facet, the argument will be cast to wchar_t. + * + * do_widen() is a hook for a derived facet to change the behavior of + * widening. do_widen() must always return the same result for the + * same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param c The char to convert. + * @return The converted wchar_t. + */ + virtual char_type + do_widen(char) const; + + /** + * @brief Widen char array to wchar_t array + * + * This function converts each char in the input to wchar_t using the + * simplest reasonable transformation. For an underived ctype + * facet, the argument will be copied, casting each element to wchar_t. + * + * do_widen() is a hook for a derived facet to change the behavior of + * widening. do_widen() must always return the same result for the + * same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param lo Pointer to start range. + * @param hi Pointer to end of range. + * @param to Pointer to the destination array. + * @return @a hi. + */ + virtual const char* + do_widen(const char* __lo, const char* __hi, char_type* __dest) const; + + /** + * @brief Narrow wchar_t to char + * + * This virtual function converts the argument to char using + * the simplest reasonable transformation. If the conversion + * fails, dfault is returned instead. For an underived + * ctype facet, @a c will be cast to char and + * returned. + * + * do_narrow() is a hook for a derived facet to change the + * behavior of narrowing. do_narrow() must always return the + * same result for the same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param c The wchar_t to convert. + * @param dfault Char to return if conversion fails. + * @return The converted char. + */ + virtual char + do_narrow(char_type, char __dfault) const; + + /** + * @brief Narrow wchar_t array to char array + * + * This virtual function converts each wchar_t in the range [lo,hi) to + * char using the simplest reasonable transformation and writes the + * results to the destination array. For any wchar_t in the input that + * cannot be converted, @a dfault is used instead. For an underived + * ctype facet, the argument will be copied, casting each + * element to char. + * + * do_narrow() is a hook for a derived facet to change the behavior of + * narrowing. do_narrow() must always return the same result for the + * same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @param dfault Char to use if conversion fails. + * @param to Pointer to the destination array. + * @return @a hi. + */ + virtual const char_type* + do_narrow(const char_type* __lo, const char_type* __hi, + char __dfault, char* __dest) const; + + // For use at construction time only. + void + _M_initialize_ctype(); + }; + + template<> + const ctype& + use_facet >(const locale& __loc); +#endif //_GLIBCXX_USE_WCHAR_T + + /// @brief class ctype_byname [22.2.1.2]. + template + class ctype_byname : public ctype<_CharT> + { + public: + typedef _CharT char_type; + + explicit + ctype_byname(const char* __s, size_t __refs = 0); + + protected: + virtual + ~ctype_byname() { }; + }; + + /// 22.2.1.4 Class ctype_byname specializations. + template<> + ctype_byname::ctype_byname(const char*, size_t refs); + + template<> + ctype_byname::ctype_byname(const char*, size_t refs); + +} // namespace std + +// Include host and configuration specific ctype inlines. +#include + +// 22.2.1.5 Template class codecvt +#include + +namespace std { + + // 22.2.2 The numeric category. + class __num_base + { + public: + // NB: Code depends on the order of _S_atoms_out elements. + // Below are the indices into _S_atoms_out. + enum + { + _S_ominus, + _S_oplus, + _S_ox, + _S_oX, + _S_odigits, + _S_odigits_end = _S_odigits + 16, + _S_oudigits = _S_odigits_end, + _S_oudigits_end = _S_oudigits + 16, + _S_oe = _S_odigits + 14, // For scientific notation, 'e' + _S_oE = _S_oudigits + 14, // For scientific notation, 'E' + _S_oend = _S_oudigits_end + }; + + // A list of valid numeric literals for output. This array + // contains chars that will be passed through the current locale's + // ctype<_CharT>.widen() and then used to render numbers. + // For the standard "C" locale, this is + // "-+xX0123456789abcdef0123456789ABCDEF". + static const char* _S_atoms_out; + + // String literal of acceptable (narrow) input, for num_get. + // "-+xX0123456789abcdefABCDEF" + static const char* _S_atoms_in; + + enum + { + _S_iminus, + _S_iplus, + _S_ix, + _S_iX, + _S_izero, + _S_ie = _S_izero + 14, + _S_iE = _S_izero + 20, + _S_iend = 26 + }; + + // num_put + // Construct and return valid scanf format for floating point types. + static void + _S_format_float(const ios_base& __io, char* __fptr, char __mod); + }; + + template + struct __numpunct_cache : public locale::facet + { + const char* _M_grouping; + size_t _M_grouping_size; + bool _M_use_grouping; + const _CharT* _M_truename; + size_t _M_truename_size; + const _CharT* _M_falsename; + size_t _M_falsename_size; + _CharT _M_decimal_point; + _CharT _M_thousands_sep; + + // A list of valid numeric literals for output: in the standard + // "C" locale, this is "-+xX0123456789abcdef0123456789ABCDEF". + // This array contains the chars after having been passed + // through the current locale's ctype<_CharT>.widen(). + _CharT _M_atoms_out[__num_base::_S_oend]; + + // A list of valid numeric literals for input: in the standard + // "C" locale, this is "-+xX0123456789abcdefABCDEF" + // This array contains the chars after having been passed + // through the current locale's ctype<_CharT>.widen(). + _CharT _M_atoms_in[__num_base::_S_iend]; + + bool _M_allocated; + + __numpunct_cache(size_t __refs = 0) : facet(__refs), + _M_grouping(NULL), _M_grouping_size(0), _M_use_grouping(false), + _M_truename(NULL), _M_truename_size(0), _M_falsename(NULL), + _M_falsename_size(0), _M_decimal_point(_CharT()), + _M_thousands_sep(_CharT()), _M_allocated(false) + { } + + ~__numpunct_cache(); + + void + _M_cache(const locale& __loc); + + private: + __numpunct_cache& + operator=(const __numpunct_cache&); + + explicit + __numpunct_cache(const __numpunct_cache&); + }; + + template + __numpunct_cache<_CharT>::~__numpunct_cache() + { + if (_M_allocated) + { + delete [] _M_grouping; + delete [] _M_truename; + delete [] _M_falsename; + } + } + + /** + * @brief Numpunct facet. + * + * This facet stores several pieces of information related to printing and + * scanning numbers, such as the decimal point character. It takes a + * template parameter specifying the char type. The numpunct facet is + * used by streams for many I/O operations involving numbers. + * + * The numpunct template uses protected virtual functions to provide the + * actual results. The public accessors forward the call to the virtual + * functions. These virtual functions are hooks for developers to + * implement the behavior they require from a numpunct facet. + */ + template + class numpunct : public locale::facet + { + public: + // Types: + //@{ + /// Public typedefs + typedef _CharT char_type; + typedef basic_string<_CharT> string_type; + //@} + typedef __numpunct_cache<_CharT> __cache_type; + + protected: + __cache_type* _M_data; + + public: + /// Numpunct facet id. + static locale::id id; + + /** + * @brief Numpunct constructor. + * + * @param refs Refcount to pass to the base class. + */ + explicit + numpunct(size_t __refs = 0) : facet(__refs), _M_data(NULL) + { _M_initialize_numpunct(); } + + /** + * @brief Internal constructor. Not for general use. + * + * This is a constructor for use by the library itself to set up the + * predefined locale facets. + * + * @param cache __numpunct_cache object. + * @param refs Refcount to pass to the base class. + */ + explicit + numpunct(__cache_type* __cache, size_t __refs = 0) + : facet(__refs), _M_data(__cache) + { _M_initialize_numpunct(); } + + /** + * @brief Internal constructor. Not for general use. + * + * This is a constructor for use by the library itself to set up new + * locales. + * + * @param cloc The "C" locale. + * @param refs Refcount to pass to the base class. + */ + explicit + numpunct(__c_locale __cloc, size_t __refs = 0) + : facet(__refs), _M_data(NULL) + { _M_initialize_numpunct(__cloc); } + + /** + * @brief Return decimal point character. + * + * This function returns a char_type to use as a decimal point. It + * does so by returning returning + * numpunct::do_decimal_point(). + * + * @return @a char_type representing a decimal point. + */ + char_type + decimal_point() const + { return this->do_decimal_point(); } + + /** + * @brief Return thousands separator character. + * + * This function returns a char_type to use as a thousands + * separator. It does so by returning returning + * numpunct::do_thousands_sep(). + * + * @return char_type representing a thousands separator. + */ + char_type + thousands_sep() const + { return this->do_thousands_sep(); } + + /** + * @brief Return grouping specification. + * + * This function returns a string representing groupings for the + * integer part of a number. Groupings indicate where thousands + * separators should be inserted in the integer part of a number. + * + * Each char in the return string is interpret as an integer + * rather than a character. These numbers represent the number + * of digits in a group. The first char in the string + * represents the number of digits in the least significant + * group. If a char is negative, it indicates an unlimited + * number of digits for the group. If more chars from the + * string are required to group a number, the last char is used + * repeatedly. + * + * For example, if the grouping() returns "\003\002" and is + * applied to the number 123456789, this corresponds to + * 12,34,56,789. Note that if the string was "32", this would + * put more than 50 digits into the least significant group if + * the character set is ASCII. + * + * The string is returned by calling + * numpunct::do_grouping(). + * + * @return string representing grouping specification. + */ + string + grouping() const + { return this->do_grouping(); } + + /** + * @brief Return string representation of bool true. + * + * This function returns a string_type containing the text + * representation for true bool variables. It does so by calling + * numpunct::do_truename(). + * + * @return string_type representing printed form of true. + */ + string_type + truename() const + { return this->do_truename(); } + + /** + * @brief Return string representation of bool false. + * + * This function returns a string_type containing the text + * representation for false bool variables. It does so by calling + * numpunct::do_falsename(). + * + * @return string_type representing printed form of false. + */ + string_type + falsename() const + { return this->do_falsename(); } + + protected: + /// Destructor. + virtual + ~numpunct(); + + /** + * @brief Return decimal point character. + * + * Returns a char_type to use as a decimal point. This function is a + * hook for derived classes to change the value returned. + * + * @return @a char_type representing a decimal point. + */ + virtual char_type + do_decimal_point() const + { return _M_data->_M_decimal_point; } + + /** + * @brief Return thousands separator character. + * + * Returns a char_type to use as a thousands separator. This function + * is a hook for derived classes to change the value returned. + * + * @return @a char_type representing a thousands separator. + */ + virtual char_type + do_thousands_sep() const + { return _M_data->_M_thousands_sep; } + + /** + * @brief Return grouping specification. + * + * Returns a string representing groupings for the integer part of a + * number. This function is a hook for derived classes to change the + * value returned. @see grouping() for details. + * + * @return String representing grouping specification. + */ + virtual string + do_grouping() const + { return _M_data->_M_grouping; } + + /** + * @brief Return string representation of bool true. + * + * Returns a string_type containing the text representation for true + * bool variables. This function is a hook for derived classes to + * change the value returned. + * + * @return string_type representing printed form of true. + */ + virtual string_type + do_truename() const + { return _M_data->_M_truename; } + + /** + * @brief Return string representation of bool false. + * + * Returns a string_type containing the text representation for false + * bool variables. This function is a hook for derived classes to + * change the value returned. + * + * @return string_type representing printed form of false. + */ + virtual string_type + do_falsename() const + { return _M_data->_M_falsename; } + + // For use at construction time only. + void + _M_initialize_numpunct(__c_locale __cloc = NULL); + }; + + template + locale::id numpunct<_CharT>::id; + + template<> + numpunct::~numpunct(); + + template<> + void + numpunct::_M_initialize_numpunct(__c_locale __cloc); + +#ifdef _GLIBCXX_USE_WCHAR_T + template<> + numpunct::~numpunct(); + + template<> + void + numpunct::_M_initialize_numpunct(__c_locale __cloc); +#endif + + /// @brief class numpunct_byname [22.2.3.2]. + template + class numpunct_byname : public numpunct<_CharT> + { + public: + typedef _CharT char_type; + typedef basic_string<_CharT> string_type; + + explicit + numpunct_byname(const char* __s, size_t __refs = 0) + : numpunct<_CharT>(__refs) + { + if (std::strcmp(__s, "C") != 0 && std::strcmp(__s, "POSIX") != 0) + { + __c_locale __tmp; + this->_S_create_c_locale(__tmp, __s); + this->_M_initialize_numpunct(__tmp); + this->_S_destroy_c_locale(__tmp); + } + } + + protected: + virtual + ~numpunct_byname() { } + }; + +_GLIBCXX_BEGIN_LDBL_NAMESPACE + /** + * @brief Facet for parsing number strings. + * + * This facet encapsulates the code to parse and return a number + * from a string. It is used by the istream numeric extraction + * operators. + * + * The num_get template uses protected virtual functions to provide the + * actual results. The public accessors forward the call to the virtual + * functions. These virtual functions are hooks for developers to + * implement the behavior they require from the num_get facet. + */ + template + class num_get : public locale::facet + { + public: + // Types: + //@{ + /// Public typedefs + typedef _CharT char_type; + typedef _InIter iter_type; + //@} + + /// Numpunct facet id. + static locale::id id; + + /** + * @brief Constructor performs initialization. + * + * This is the constructor provided by the standard. + * + * @param refs Passed to the base facet class. + */ + explicit + num_get(size_t __refs = 0) : facet(__refs) { } + + /** + * @brief Numeric parsing. + * + * Parses the input stream into the bool @a v. It does so by calling + * num_get::do_get(). + * + * If ios_base::boolalpha is set, attempts to read + * ctype::truename() or ctype::falsename(). Sets + * @a v to true or false if successful. Sets err to + * ios_base::failbit if reading the string fails. Sets err to + * ios_base::eofbit if the stream is emptied. + * + * If ios_base::boolalpha is not set, proceeds as with reading a long, + * except if the value is 1, sets @a v to true, if the value is 0, sets + * @a v to false, and otherwise set err to ios_base::failbit. + * + * @param in Start of input stream. + * @param end End of input stream. + * @param io Source of locale and flags. + * @param err Error flags to set. + * @param v Value to format and insert. + * @return Iterator after reading. + */ + iter_type + get(iter_type __in, iter_type __end, ios_base& __io, + ios_base::iostate& __err, bool& __v) const + { return this->do_get(__in, __end, __io, __err, __v); } + + //@{ + /** + * @brief Numeric parsing. + * + * Parses the input stream into the integral variable @a v. It does so + * by calling num_get::do_get(). + * + * Parsing is affected by the flag settings in @a io. + * + * The basic parse is affected by the value of io.flags() & + * ios_base::basefield. If equal to ios_base::oct, parses like the + * scanf %o specifier. Else if equal to ios_base::hex, parses like %X + * specifier. Else if basefield equal to 0, parses like the %i + * specifier. Otherwise, parses like %d for signed and %u for unsigned + * types. The matching type length modifier is also used. + * + * Digit grouping is intrepreted according to numpunct::grouping() and + * numpunct::thousands_sep(). If the pattern of digit groups isn't + * consistent, sets err to ios_base::failbit. + * + * If parsing the string yields a valid value for @a v, @a v is set. + * Otherwise, sets err to ios_base::failbit and leaves @a v unaltered. + * Sets err to ios_base::eofbit if the stream is emptied. + * + * @param in Start of input stream. + * @param end End of input stream. + * @param io Source of locale and flags. + * @param err Error flags to set. + * @param v Value to format and insert. + * @return Iterator after reading. + */ + iter_type + get(iter_type __in, iter_type __end, ios_base& __io, + ios_base::iostate& __err, long& __v) const + { return this->do_get(__in, __end, __io, __err, __v); } + + iter_type + get(iter_type __in, iter_type __end, ios_base& __io, + ios_base::iostate& __err, unsigned short& __v) const + { return this->do_get(__in, __end, __io, __err, __v); } + + iter_type + get(iter_type __in, iter_type __end, ios_base& __io, + ios_base::iostate& __err, unsigned int& __v) const + { return this->do_get(__in, __end, __io, __err, __v); } + + iter_type + get(iter_type __in, iter_type __end, ios_base& __io, + ios_base::iostate& __err, unsigned long& __v) const + { return this->do_get(__in, __end, __io, __err, __v); } + +#ifdef _GLIBCXX_USE_LONG_LONG + iter_type + get(iter_type __in, iter_type __end, ios_base& __io, + ios_base::iostate& __err, long long& __v) const + { return this->do_get(__in, __end, __io, __err, __v); } + + iter_type + get(iter_type __in, iter_type __end, ios_base& __io, + ios_base::iostate& __err, unsigned long long& __v) const + { return this->do_get(__in, __end, __io, __err, __v); } +#endif + //@} + + //@{ + /** + * @brief Numeric parsing. + * + * Parses the input stream into the integral variable @a v. It does so + * by calling num_get::do_get(). + * + * The input characters are parsed like the scanf %g specifier. The + * matching type length modifier is also used. + * + * The decimal point character used is numpunct::decimal_point(). + * Digit grouping is intrepreted according to numpunct::grouping() and + * numpunct::thousands_sep(). If the pattern of digit groups isn't + * consistent, sets err to ios_base::failbit. + * + * If parsing the string yields a valid value for @a v, @a v is set. + * Otherwise, sets err to ios_base::failbit and leaves @a v unaltered. + * Sets err to ios_base::eofbit if the stream is emptied. + * + * @param in Start of input stream. + * @param end End of input stream. + * @param io Source of locale and flags. + * @param err Error flags to set. + * @param v Value to format and insert. + * @return Iterator after reading. + */ + iter_type + get(iter_type __in, iter_type __end, ios_base& __io, + ios_base::iostate& __err, float& __v) const + { return this->do_get(__in, __end, __io, __err, __v); } + + iter_type + get(iter_type __in, iter_type __end, ios_base& __io, + ios_base::iostate& __err, double& __v) const + { return this->do_get(__in, __end, __io, __err, __v); } + + iter_type + get(iter_type __in, iter_type __end, ios_base& __io, + ios_base::iostate& __err, long double& __v) const + { return this->do_get(__in, __end, __io, __err, __v); } + //@} + + /** + * @brief Numeric parsing. + * + * Parses the input stream into the pointer variable @a v. It does so + * by calling num_get::do_get(). + * + * The input characters are parsed like the scanf %p specifier. + * + * Digit grouping is intrepreted according to numpunct::grouping() and + * numpunct::thousands_sep(). If the pattern of digit groups isn't + * consistent, sets err to ios_base::failbit. + * + * Note that the digit grouping effect for pointers is a bit ambiguous + * in the standard and shouldn't be relied on. See DR 344. + * + * If parsing the string yields a valid value for @a v, @a v is set. + * Otherwise, sets err to ios_base::failbit and leaves @a v unaltered. + * Sets err to ios_base::eofbit if the stream is emptied. + * + * @param in Start of input stream. + * @param end End of input stream. + * @param io Source of locale and flags. + * @param err Error flags to set. + * @param v Value to format and insert. + * @return Iterator after reading. + */ + iter_type + get(iter_type __in, iter_type __end, ios_base& __io, + ios_base::iostate& __err, void*& __v) const + { return this->do_get(__in, __end, __io, __err, __v); } + + protected: + /// Destructor. + virtual ~num_get() { } + + iter_type + _M_extract_float(iter_type, iter_type, ios_base&, ios_base::iostate&, + string& __xtrc) const; + + template + iter_type + _M_extract_int(iter_type, iter_type, ios_base&, ios_base::iostate&, + _ValueT& __v) const; + + template + typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, int>::__type + _M_find(const _CharT2*, size_t __len, _CharT2 __c) const + { + int __ret = -1; + if (__len <= 10) + { + if (__c >= _CharT2('0') && __c < _CharT2(_CharT2('0') + __len)) + __ret = __c - _CharT2('0'); + } + else + { + if (__c >= _CharT2('0') && __c <= _CharT2('9')) + __ret = __c - _CharT2('0'); + else if (__c >= _CharT2('a') && __c <= _CharT2('f')) + __ret = 10 + (__c - _CharT2('a')); + else if (__c >= _CharT2('A') && __c <= _CharT2('F')) + __ret = 10 + (__c - _CharT2('A')); + } + return __ret; + } + + template + typename __gnu_cxx::__enable_if::__value, + int>::__type + _M_find(const _CharT2* __zero, size_t __len, _CharT2 __c) const + { + int __ret = -1; + const char_type* __q = char_traits<_CharT2>::find(__zero, __len, __c); + if (__q) + { + __ret = __q - __zero; + if (__ret > 15) + __ret -= 6; + } + return __ret; + } + + //@{ + /** + * @brief Numeric parsing. + * + * Parses the input stream into the variable @a v. This function is a + * hook for derived classes to change the value returned. @see get() + * for more details. + * + * @param in Start of input stream. + * @param end End of input stream. + * @param io Source of locale and flags. + * @param err Error flags to set. + * @param v Value to format and insert. + * @return Iterator after reading. + */ + virtual iter_type + do_get(iter_type, iter_type, ios_base&, ios_base::iostate&, bool&) const; + + + virtual iter_type + do_get(iter_type, iter_type, ios_base&, ios_base::iostate&, long&) const; + + virtual iter_type + do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err, + unsigned short&) const; + + virtual iter_type + do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err, + unsigned int&) const; + + virtual iter_type + do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err, + unsigned long&) const; + +#ifdef _GLIBCXX_USE_LONG_LONG + virtual iter_type + do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err, + long long&) const; + + virtual iter_type + do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err, + unsigned long long&) const; +#endif + + virtual iter_type + do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err, + float&) const; + + virtual iter_type + do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err, + double&) const; + + // XXX GLIBCXX_ABI Deprecated +#if defined _GLIBCXX_LONG_DOUBLE_COMPAT && defined __LONG_DOUBLE_128__ + virtual iter_type + __do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err, + double&) const; +#else + virtual iter_type + do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err, + long double&) const; +#endif + + virtual iter_type + do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err, + void*&) const; + + // XXX GLIBCXX_ABI Deprecated +#if defined _GLIBCXX_LONG_DOUBLE_COMPAT && defined __LONG_DOUBLE_128__ + virtual iter_type + do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err, + long double&) const; +#endif + //@} + }; + + template + locale::id num_get<_CharT, _InIter>::id; + + + /** + * @brief Facet for converting numbers to strings. + * + * This facet encapsulates the code to convert a number to a string. It is + * used by the ostream numeric insertion operators. + * + * The num_put template uses protected virtual functions to provide the + * actual results. The public accessors forward the call to the virtual + * functions. These virtual functions are hooks for developers to + * implement the behavior they require from the num_put facet. + */ + template + class num_put : public locale::facet + { + public: + // Types: + //@{ + /// Public typedefs + typedef _CharT char_type; + typedef _OutIter iter_type; + //@} + + /// Numpunct facet id. + static locale::id id; + + /** + * @brief Constructor performs initialization. + * + * This is the constructor provided by the standard. + * + * @param refs Passed to the base facet class. + */ + explicit + num_put(size_t __refs = 0) : facet(__refs) { } + + /** + * @brief Numeric formatting. + * + * Formats the boolean @a v and inserts it into a stream. It does so + * by calling num_put::do_put(). + * + * If ios_base::boolalpha is set, writes ctype::truename() or + * ctype::falsename(). Otherwise formats @a v as an int. + * + * @param s Stream to write to. + * @param io Source of locale and flags. + * @param fill Char_type to use for filling. + * @param v Value to format and insert. + * @return Iterator after writing. + */ + iter_type + put(iter_type __s, ios_base& __f, char_type __fill, bool __v) const + { return this->do_put(__s, __f, __fill, __v); } + + //@{ + /** + * @brief Numeric formatting. + * + * Formats the integral value @a v and inserts it into a + * stream. It does so by calling num_put::do_put(). + * + * Formatting is affected by the flag settings in @a io. + * + * The basic format is affected by the value of io.flags() & + * ios_base::basefield. If equal to ios_base::oct, formats like the + * printf %o specifier. Else if equal to ios_base::hex, formats like + * %x or %X with ios_base::uppercase unset or set respectively. + * Otherwise, formats like %d, %ld, %lld for signed and %u, %lu, %llu + * for unsigned values. Note that if both oct and hex are set, neither + * will take effect. + * + * If ios_base::showpos is set, '+' is output before positive values. + * If ios_base::showbase is set, '0' precedes octal values (except 0) + * and '0[xX]' precedes hex values. + * + * Thousands separators are inserted according to numpunct::grouping() + * and numpunct::thousands_sep(). The decimal point character used is + * numpunct::decimal_point(). + * + * If io.width() is non-zero, enough @a fill characters are inserted to + * make the result at least that wide. If + * (io.flags() & ios_base::adjustfield) == ios_base::left, result is + * padded at the end. If ios_base::internal, then padding occurs + * immediately after either a '+' or '-' or after '0x' or '0X'. + * Otherwise, padding occurs at the beginning. + * + * @param s Stream to write to. + * @param io Source of locale and flags. + * @param fill Char_type to use for filling. + * @param v Value to format and insert. + * @return Iterator after writing. + */ + iter_type + put(iter_type __s, ios_base& __f, char_type __fill, long __v) const + { return this->do_put(__s, __f, __fill, __v); } + + iter_type + put(iter_type __s, ios_base& __f, char_type __fill, + unsigned long __v) const + { return this->do_put(__s, __f, __fill, __v); } + +#ifdef _GLIBCXX_USE_LONG_LONG + iter_type + put(iter_type __s, ios_base& __f, char_type __fill, long long __v) const + { return this->do_put(__s, __f, __fill, __v); } + + iter_type + put(iter_type __s, ios_base& __f, char_type __fill, + unsigned long long __v) const + { return this->do_put(__s, __f, __fill, __v); } +#endif + //@} + + //@{ + /** + * @brief Numeric formatting. + * + * Formats the floating point value @a v and inserts it into a stream. + * It does so by calling num_put::do_put(). + * + * Formatting is affected by the flag settings in @a io. + * + * The basic format is affected by the value of io.flags() & + * ios_base::floatfield. If equal to ios_base::fixed, formats like the + * printf %f specifier. Else if equal to ios_base::scientific, formats + * like %e or %E with ios_base::uppercase unset or set respectively. + * Otherwise, formats like %g or %G depending on uppercase. Note that + * if both fixed and scientific are set, the effect will also be like + * %g or %G. + * + * The output precision is given by io.precision(). This precision is + * capped at numeric_limits::digits10 + 2 (different for double and + * long double). The default precision is 6. + * + * If ios_base::showpos is set, '+' is output before positive values. + * If ios_base::showpoint is set, a decimal point will always be + * output. + * + * Thousands separators are inserted according to numpunct::grouping() + * and numpunct::thousands_sep(). The decimal point character used is + * numpunct::decimal_point(). + * + * If io.width() is non-zero, enough @a fill characters are inserted to + * make the result at least that wide. If + * (io.flags() & ios_base::adjustfield) == ios_base::left, result is + * padded at the end. If ios_base::internal, then padding occurs + * immediately after either a '+' or '-' or after '0x' or '0X'. + * Otherwise, padding occurs at the beginning. + * + * @param s Stream to write to. + * @param io Source of locale and flags. + * @param fill Char_type to use for filling. + * @param v Value to format and insert. + * @return Iterator after writing. + */ + iter_type + put(iter_type __s, ios_base& __f, char_type __fill, double __v) const + { return this->do_put(__s, __f, __fill, __v); } + + iter_type + put(iter_type __s, ios_base& __f, char_type __fill, + long double __v) const + { return this->do_put(__s, __f, __fill, __v); } + //@} + + /** + * @brief Numeric formatting. + * + * Formats the pointer value @a v and inserts it into a stream. It + * does so by calling num_put::do_put(). + * + * This function formats @a v as an unsigned long with ios_base::hex + * and ios_base::showbase set. + * + * @param s Stream to write to. + * @param io Source of locale and flags. + * @param fill Char_type to use for filling. + * @param v Value to format and insert. + * @return Iterator after writing. + */ + iter_type + put(iter_type __s, ios_base& __f, char_type __fill, + const void* __v) const + { return this->do_put(__s, __f, __fill, __v); } + + protected: + template + iter_type + _M_insert_float(iter_type, ios_base& __io, char_type __fill, + char __mod, _ValueT __v) const; + + void + _M_group_float(const char* __grouping, size_t __grouping_size, + char_type __sep, const char_type* __p, char_type* __new, + char_type* __cs, int& __len) const; + + template + iter_type + _M_insert_int(iter_type, ios_base& __io, char_type __fill, + _ValueT __v) const; + + void + _M_group_int(const char* __grouping, size_t __grouping_size, + char_type __sep, ios_base& __io, char_type* __new, + char_type* __cs, int& __len) const; + + void + _M_pad(char_type __fill, streamsize __w, ios_base& __io, + char_type* __new, const char_type* __cs, int& __len) const; + + /// Destructor. + virtual + ~num_put() { }; + + //@{ + /** + * @brief Numeric formatting. + * + * These functions do the work of formatting numeric values and + * inserting them into a stream. This function is a hook for derived + * classes to change the value returned. + * + * @param s Stream to write to. + * @param io Source of locale and flags. + * @param fill Char_type to use for filling. + * @param v Value to format and insert. + * @return Iterator after writing. + */ + virtual iter_type + do_put(iter_type, ios_base&, char_type __fill, bool __v) const; + + virtual iter_type + do_put(iter_type, ios_base&, char_type __fill, long __v) const; + + virtual iter_type + do_put(iter_type, ios_base&, char_type __fill, unsigned long) const; + +#ifdef _GLIBCXX_USE_LONG_LONG + virtual iter_type + do_put(iter_type, ios_base&, char_type __fill, long long __v) const; + + virtual iter_type + do_put(iter_type, ios_base&, char_type __fill, unsigned long long) const; +#endif + + virtual iter_type + do_put(iter_type, ios_base&, char_type __fill, double __v) const; + + // XXX GLIBCXX_ABI Deprecated +#if defined _GLIBCXX_LONG_DOUBLE_COMPAT && defined __LONG_DOUBLE_128__ + virtual iter_type + __do_put(iter_type, ios_base&, char_type __fill, double __v) const; +#else + virtual iter_type + do_put(iter_type, ios_base&, char_type __fill, long double __v) const; +#endif + + virtual iter_type + do_put(iter_type, ios_base&, char_type __fill, const void* __v) const; + + // XXX GLIBCXX_ABI Deprecated +#if defined _GLIBCXX_LONG_DOUBLE_COMPAT && defined __LONG_DOUBLE_128__ + virtual iter_type + do_put(iter_type, ios_base&, char_type __fill, long double __v) const; +#endif + //@} + }; + + template + locale::id num_put<_CharT, _OutIter>::id; + +_GLIBCXX_END_LDBL_NAMESPACE + + /** + * @brief Facet for localized string comparison. + * + * This facet encapsulates the code to compare strings in a localized + * manner. + * + * The collate template uses protected virtual functions to provide + * the actual results. The public accessors forward the call to + * the virtual functions. These virtual functions are hooks for + * developers to implement the behavior they require from the + * collate facet. + */ + template + class collate : public locale::facet + { + public: + // Types: + //@{ + /// Public typedefs + typedef _CharT char_type; + typedef basic_string<_CharT> string_type; + //@} + + protected: + // Underlying "C" library locale information saved from + // initialization, needed by collate_byname as well. + __c_locale _M_c_locale_collate; + + public: + /// Numpunct facet id. + static locale::id id; + + /** + * @brief Constructor performs initialization. + * + * This is the constructor provided by the standard. + * + * @param refs Passed to the base facet class. + */ + explicit + collate(size_t __refs = 0) + : facet(__refs), _M_c_locale_collate(_S_get_c_locale()) + { } + + /** + * @brief Internal constructor. Not for general use. + * + * This is a constructor for use by the library itself to set up new + * locales. + * + * @param cloc The "C" locale. + * @param refs Passed to the base facet class. + */ + explicit + collate(__c_locale __cloc, size_t __refs = 0) + : facet(__refs), _M_c_locale_collate(_S_clone_c_locale(__cloc)) + { } + + /** + * @brief Compare two strings. + * + * This function compares two strings and returns the result by calling + * collate::do_compare(). + * + * @param lo1 Start of string 1. + * @param hi1 End of string 1. + * @param lo2 Start of string 2. + * @param hi2 End of string 2. + * @return 1 if string1 > string2, -1 if string1 < string2, else 0. + */ + int + compare(const _CharT* __lo1, const _CharT* __hi1, + const _CharT* __lo2, const _CharT* __hi2) const + { return this->do_compare(__lo1, __hi1, __lo2, __hi2); } + + /** + * @brief Transform string to comparable form. + * + * This function is a wrapper for strxfrm functionality. It takes the + * input string and returns a modified string that can be directly + * compared to other transformed strings. In the "C" locale, this + * function just returns a copy of the input string. In some other + * locales, it may replace two chars with one, change a char for + * another, etc. It does so by returning collate::do_transform(). + * + * @param lo Start of string. + * @param hi End of string. + * @return Transformed string_type. + */ + string_type + transform(const _CharT* __lo, const _CharT* __hi) const + { return this->do_transform(__lo, __hi); } + + /** + * @brief Return hash of a string. + * + * This function computes and returns a hash on the input string. It + * does so by returning collate::do_hash(). + * + * @param lo Start of string. + * @param hi End of string. + * @return Hash value. + */ + long + hash(const _CharT* __lo, const _CharT* __hi) const + { return this->do_hash(__lo, __hi); } + + // Used to abstract out _CharT bits in virtual member functions, below. + int + _M_compare(const _CharT*, const _CharT*) const; + + size_t + _M_transform(_CharT*, const _CharT*, size_t) const; + + protected: + /// Destructor. + virtual + ~collate() + { _S_destroy_c_locale(_M_c_locale_collate); } + + /** + * @brief Compare two strings. + * + * This function is a hook for derived classes to change the value + * returned. @see compare(). + * + * @param lo1 Start of string 1. + * @param hi1 End of string 1. + * @param lo2 Start of string 2. + * @param hi2 End of string 2. + * @return 1 if string1 > string2, -1 if string1 < string2, else 0. + */ + virtual int + do_compare(const _CharT* __lo1, const _CharT* __hi1, + const _CharT* __lo2, const _CharT* __hi2) const; + + /** + * @brief Transform string to comparable form. + * + * This function is a hook for derived classes to change the value + * returned. + * + * @param lo1 Start of string 1. + * @param hi1 End of string 1. + * @param lo2 Start of string 2. + * @param hi2 End of string 2. + * @return 1 if string1 > string2, -1 if string1 < string2, else 0. + */ + virtual string_type + do_transform(const _CharT* __lo, const _CharT* __hi) const; + + /** + * @brief Return hash of a string. + * + * This function computes and returns a hash on the input string. This + * function is a hook for derived classes to change the value returned. + * + * @param lo Start of string. + * @param hi End of string. + * @return Hash value. + */ + virtual long + do_hash(const _CharT* __lo, const _CharT* __hi) const; + }; + + template + locale::id collate<_CharT>::id; + + // Specializations. + template<> + int + collate::_M_compare(const char*, const char*) const; + + template<> + size_t + collate::_M_transform(char*, const char*, size_t) const; + +#ifdef _GLIBCXX_USE_WCHAR_T + template<> + int + collate::_M_compare(const wchar_t*, const wchar_t*) const; + + template<> + size_t + collate::_M_transform(wchar_t*, const wchar_t*, size_t) const; +#endif + + /// @brief class collate_byname [22.2.4.2]. + template + class collate_byname : public collate<_CharT> + { + public: + //@{ + /// Public typedefs + typedef _CharT char_type; + typedef basic_string<_CharT> string_type; + //@} + + explicit + collate_byname(const char* __s, size_t __refs = 0) + : collate<_CharT>(__refs) + { + if (std::strcmp(__s, "C") != 0 && std::strcmp(__s, "POSIX") != 0) + { + this->_S_destroy_c_locale(this->_M_c_locale_collate); + this->_S_create_c_locale(this->_M_c_locale_collate, __s); + } + } + + protected: + virtual + ~collate_byname() { } + }; + + + /** + * @brief Time format ordering data. + * + * This class provides an enum representing different orderings of day, + * month, and year. + */ + class time_base + { + public: + enum dateorder { no_order, dmy, mdy, ymd, ydm }; + }; + + template + struct __timepunct_cache : public locale::facet + { + // List of all known timezones, with GMT first. + static const _CharT* _S_timezones[14]; + + const _CharT* _M_date_format; + const _CharT* _M_date_era_format; + const _CharT* _M_time_format; + const _CharT* _M_time_era_format; + const _CharT* _M_date_time_format; + const _CharT* _M_date_time_era_format; + const _CharT* _M_am; + const _CharT* _M_pm; + const _CharT* _M_am_pm_format; + + // Day names, starting with "C"'s Sunday. + const _CharT* _M_day1; + const _CharT* _M_day2; + const _CharT* _M_day3; + const _CharT* _M_day4; + const _CharT* _M_day5; + const _CharT* _M_day6; + const _CharT* _M_day7; + + // Abbreviated day names, starting with "C"'s Sun. + const _CharT* _M_aday1; + const _CharT* _M_aday2; + const _CharT* _M_aday3; + const _CharT* _M_aday4; + const _CharT* _M_aday5; + const _CharT* _M_aday6; + const _CharT* _M_aday7; + + // Month names, starting with "C"'s January. + const _CharT* _M_month01; + const _CharT* _M_month02; + const _CharT* _M_month03; + const _CharT* _M_month04; + const _CharT* _M_month05; + const _CharT* _M_month06; + const _CharT* _M_month07; + const _CharT* _M_month08; + const _CharT* _M_month09; + const _CharT* _M_month10; + const _CharT* _M_month11; + const _CharT* _M_month12; + + // Abbreviated month names, starting with "C"'s Jan. + const _CharT* _M_amonth01; + const _CharT* _M_amonth02; + const _CharT* _M_amonth03; + const _CharT* _M_amonth04; + const _CharT* _M_amonth05; + const _CharT* _M_amonth06; + const _CharT* _M_amonth07; + const _CharT* _M_amonth08; + const _CharT* _M_amonth09; + const _CharT* _M_amonth10; + const _CharT* _M_amonth11; + const _CharT* _M_amonth12; + + bool _M_allocated; + + __timepunct_cache(size_t __refs = 0) : facet(__refs), + _M_date_format(NULL), _M_date_era_format(NULL), _M_time_format(NULL), + _M_time_era_format(NULL), _M_date_time_format(NULL), + _M_date_time_era_format(NULL), _M_am(NULL), _M_pm(NULL), + _M_am_pm_format(NULL), _M_day1(NULL), _M_day2(NULL), _M_day3(NULL), + _M_day4(NULL), _M_day5(NULL), _M_day6(NULL), _M_day7(NULL), + _M_aday1(NULL), _M_aday2(NULL), _M_aday3(NULL), _M_aday4(NULL), + _M_aday5(NULL), _M_aday6(NULL), _M_aday7(NULL), _M_month01(NULL), + _M_month02(NULL), _M_month03(NULL), _M_month04(NULL), _M_month05(NULL), + _M_month06(NULL), _M_month07(NULL), _M_month08(NULL), _M_month09(NULL), + _M_month10(NULL), _M_month11(NULL), _M_month12(NULL), _M_amonth01(NULL), + _M_amonth02(NULL), _M_amonth03(NULL), _M_amonth04(NULL), + _M_amonth05(NULL), _M_amonth06(NULL), _M_amonth07(NULL), + _M_amonth08(NULL), _M_amonth09(NULL), _M_amonth10(NULL), + _M_amonth11(NULL), _M_amonth12(NULL), _M_allocated(false) + { } + + ~__timepunct_cache(); + + void + _M_cache(const locale& __loc); + + private: + __timepunct_cache& + operator=(const __timepunct_cache&); + + explicit + __timepunct_cache(const __timepunct_cache&); + }; + + template + __timepunct_cache<_CharT>::~__timepunct_cache() + { + if (_M_allocated) + { + // Unused. + } + } + + // Specializations. + template<> + const char* + __timepunct_cache::_S_timezones[14]; + +#ifdef _GLIBCXX_USE_WCHAR_T + template<> + const wchar_t* + __timepunct_cache::_S_timezones[14]; +#endif + + // Generic. + template + const _CharT* __timepunct_cache<_CharT>::_S_timezones[14]; + + template + class __timepunct : public locale::facet + { + public: + // Types: + typedef _CharT __char_type; + typedef basic_string<_CharT> __string_type; + typedef __timepunct_cache<_CharT> __cache_type; + + protected: + __cache_type* _M_data; + __c_locale _M_c_locale_timepunct; + const char* _M_name_timepunct; + + public: + /// Numpunct facet id. + static locale::id id; + + explicit + __timepunct(size_t __refs = 0); + + explicit + __timepunct(__cache_type* __cache, size_t __refs = 0); + + /** + * @brief Internal constructor. Not for general use. + * + * This is a constructor for use by the library itself to set up new + * locales. + * + * @param cloc The "C" locale. + * @param s The name of a locale. + * @param refs Passed to the base facet class. + */ + explicit + __timepunct(__c_locale __cloc, const char* __s, size_t __refs = 0); + + // FIXME: for error checking purposes _M_put should return the return + // value of strftime/wcsftime. + void + _M_put(_CharT* __s, size_t __maxlen, const _CharT* __format, + const tm* __tm) const; + + void + _M_date_formats(const _CharT** __date) const + { + // Always have default first. + __date[0] = _M_data->_M_date_format; + __date[1] = _M_data->_M_date_era_format; + } + + void + _M_time_formats(const _CharT** __time) const + { + // Always have default first. + __time[0] = _M_data->_M_time_format; + __time[1] = _M_data->_M_time_era_format; + } + + void + _M_date_time_formats(const _CharT** __dt) const + { + // Always have default first. + __dt[0] = _M_data->_M_date_time_format; + __dt[1] = _M_data->_M_date_time_era_format; + } + + void + _M_am_pm_format(const _CharT* __ampm) const + { __ampm = _M_data->_M_am_pm_format; } + + void + _M_am_pm(const _CharT** __ampm) const + { + __ampm[0] = _M_data->_M_am; + __ampm[1] = _M_data->_M_pm; + } + + void + _M_days(const _CharT** __days) const + { + __days[0] = _M_data->_M_day1; + __days[1] = _M_data->_M_day2; + __days[2] = _M_data->_M_day3; + __days[3] = _M_data->_M_day4; + __days[4] = _M_data->_M_day5; + __days[5] = _M_data->_M_day6; + __days[6] = _M_data->_M_day7; + } + + void + _M_days_abbreviated(const _CharT** __days) const + { + __days[0] = _M_data->_M_aday1; + __days[1] = _M_data->_M_aday2; + __days[2] = _M_data->_M_aday3; + __days[3] = _M_data->_M_aday4; + __days[4] = _M_data->_M_aday5; + __days[5] = _M_data->_M_aday6; + __days[6] = _M_data->_M_aday7; + } + + void + _M_months(const _CharT** __months) const + { + __months[0] = _M_data->_M_month01; + __months[1] = _M_data->_M_month02; + __months[2] = _M_data->_M_month03; + __months[3] = _M_data->_M_month04; + __months[4] = _M_data->_M_month05; + __months[5] = _M_data->_M_month06; + __months[6] = _M_data->_M_month07; + __months[7] = _M_data->_M_month08; + __months[8] = _M_data->_M_month09; + __months[9] = _M_data->_M_month10; + __months[10] = _M_data->_M_month11; + __months[11] = _M_data->_M_month12; + } + + void + _M_months_abbreviated(const _CharT** __months) const + { + __months[0] = _M_data->_M_amonth01; + __months[1] = _M_data->_M_amonth02; + __months[2] = _M_data->_M_amonth03; + __months[3] = _M_data->_M_amonth04; + __months[4] = _M_data->_M_amonth05; + __months[5] = _M_data->_M_amonth06; + __months[6] = _M_data->_M_amonth07; + __months[7] = _M_data->_M_amonth08; + __months[8] = _M_data->_M_amonth09; + __months[9] = _M_data->_M_amonth10; + __months[10] = _M_data->_M_amonth11; + __months[11] = _M_data->_M_amonth12; + } + + protected: + virtual + ~__timepunct(); + + // For use at construction time only. + void + _M_initialize_timepunct(__c_locale __cloc = NULL); + }; + + template + locale::id __timepunct<_CharT>::id; + + // Specializations. + template<> + void + __timepunct::_M_initialize_timepunct(__c_locale __cloc); + + template<> + void + __timepunct::_M_put(char*, size_t, const char*, const tm*) const; + +#ifdef _GLIBCXX_USE_WCHAR_T + template<> + void + __timepunct::_M_initialize_timepunct(__c_locale __cloc); + + template<> + void + __timepunct::_M_put(wchar_t*, size_t, const wchar_t*, + const tm*) const; +#endif + +} // namespace std + + // Include host and configuration specific timepunct functions. + #include + +namespace std { + + /** + * @brief Facet for parsing dates and times. + * + * This facet encapsulates the code to parse and return a date or + * time from a string. It is used by the istream numeric + * extraction operators. + * + * The time_get template uses protected virtual functions to provide the + * actual results. The public accessors forward the call to the virtual + * functions. These virtual functions are hooks for developers to + * implement the behavior they require from the time_get facet. + */ + template + class time_get : public locale::facet, public time_base + { + public: + // Types: + //@{ + /// Public typedefs + typedef _CharT char_type; + typedef _InIter iter_type; + //@} + typedef basic_string<_CharT> __string_type; + + /// Numpunct facet id. + static locale::id id; + + /** + * @brief Constructor performs initialization. + * + * This is the constructor provided by the standard. + * + * @param refs Passed to the base facet class. + */ + explicit + time_get(size_t __refs = 0) + : facet (__refs) { } + + /** + * @brief Return preferred order of month, day, and year. + * + * This function returns an enum from timebase::dateorder giving the + * preferred ordering if the format "x" given to time_put::put() only + * uses month, day, and year. If the format "x" for the associated + * locale uses other fields, this function returns + * timebase::dateorder::noorder. + * + * NOTE: The library always returns noorder at the moment. + * + * @return A member of timebase::dateorder. + */ + dateorder + date_order() const + { return this->do_date_order(); } + + /** + * @brief Parse input time string. + * + * This function parses a time according to the format "x" and puts the + * results into a user-supplied struct tm. The result is returned by + * calling time_get::do_get_time(). + * + * If there is a valid time string according to format "x", @a tm will + * be filled in accordingly and the returned iterator will point to the + * first character beyond the time string. If an error occurs before + * the end, err |= ios_base::failbit. If parsing reads all the + * characters, err |= ios_base::eofbit. + * + * @param beg Start of string to parse. + * @param end End of string to parse. + * @param io Source of the locale. + * @param err Error flags to set. + * @param tm Pointer to struct tm to fill in. + * @return Iterator to first char beyond time string. + */ + iter_type + get_time(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, tm* __tm) const + { return this->do_get_time(__beg, __end, __io, __err, __tm); } + + /** + * @brief Parse input date string. + * + * This function parses a date according to the format "X" and puts the + * results into a user-supplied struct tm. The result is returned by + * calling time_get::do_get_date(). + * + * If there is a valid date string according to format "X", @a tm will + * be filled in accordingly and the returned iterator will point to the + * first character beyond the date string. If an error occurs before + * the end, err |= ios_base::failbit. If parsing reads all the + * characters, err |= ios_base::eofbit. + * + * @param beg Start of string to parse. + * @param end End of string to parse. + * @param io Source of the locale. + * @param err Error flags to set. + * @param tm Pointer to struct tm to fill in. + * @return Iterator to first char beyond date string. + */ + iter_type + get_date(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, tm* __tm) const + { return this->do_get_date(__beg, __end, __io, __err, __tm); } + + /** + * @brief Parse input weekday string. + * + * This function parses a weekday name and puts the results into a + * user-supplied struct tm. The result is returned by calling + * time_get::do_get_weekday(). + * + * Parsing starts by parsing an abbreviated weekday name. If a valid + * abbreviation is followed by a character that would lead to the full + * weekday name, parsing continues until the full name is found or an + * error occurs. Otherwise parsing finishes at the end of the + * abbreviated name. + * + * If an error occurs before the end, err |= ios_base::failbit. If + * parsing reads all the characters, err |= ios_base::eofbit. + * + * @param beg Start of string to parse. + * @param end End of string to parse. + * @param io Source of the locale. + * @param err Error flags to set. + * @param tm Pointer to struct tm to fill in. + * @return Iterator to first char beyond weekday name. + */ + iter_type + get_weekday(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, tm* __tm) const + { return this->do_get_weekday(__beg, __end, __io, __err, __tm); } + + /** + * @brief Parse input month string. + * + * This function parses a month name and puts the results into a + * user-supplied struct tm. The result is returned by calling + * time_get::do_get_monthname(). + * + * Parsing starts by parsing an abbreviated month name. If a valid + * abbreviation is followed by a character that would lead to the full + * month name, parsing continues until the full name is found or an + * error occurs. Otherwise parsing finishes at the end of the + * abbreviated name. + * + * If an error occurs before the end, err |= ios_base::failbit. If + * parsing reads all the characters, err |= + * ios_base::eofbit. + * + * @param beg Start of string to parse. + * @param end End of string to parse. + * @param io Source of the locale. + * @param err Error flags to set. + * @param tm Pointer to struct tm to fill in. + * @return Iterator to first char beyond month name. + */ + iter_type + get_monthname(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, tm* __tm) const + { return this->do_get_monthname(__beg, __end, __io, __err, __tm); } + + /** + * @brief Parse input year string. + * + * This function reads up to 4 characters to parse a year string and + * puts the results into a user-supplied struct tm. The result is + * returned by calling time_get::do_get_year(). + * + * 4 consecutive digits are interpreted as a full year. If there are + * exactly 2 consecutive digits, the library interprets this as the + * number of years since 1900. + * + * If an error occurs before the end, err |= ios_base::failbit. If + * parsing reads all the characters, err |= ios_base::eofbit. + * + * @param beg Start of string to parse. + * @param end End of string to parse. + * @param io Source of the locale. + * @param err Error flags to set. + * @param tm Pointer to struct tm to fill in. + * @return Iterator to first char beyond year. + */ + iter_type + get_year(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, tm* __tm) const + { return this->do_get_year(__beg, __end, __io, __err, __tm); } + + protected: + /// Destructor. + virtual + ~time_get() { } + + /** + * @brief Return preferred order of month, day, and year. + * + * This function returns an enum from timebase::dateorder giving the + * preferred ordering if the format "x" given to time_put::put() only + * uses month, day, and year. This function is a hook for derived + * classes to change the value returned. + * + * @return A member of timebase::dateorder. + */ + virtual dateorder + do_date_order() const; + + /** + * @brief Parse input time string. + * + * This function parses a time according to the format "x" and puts the + * results into a user-supplied struct tm. This function is a hook for + * derived classes to change the value returned. @see get_time() for + * details. + * + * @param beg Start of string to parse. + * @param end End of string to parse. + * @param io Source of the locale. + * @param err Error flags to set. + * @param tm Pointer to struct tm to fill in. + * @return Iterator to first char beyond time string. + */ + virtual iter_type + do_get_time(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, tm* __tm) const; + + /** + * @brief Parse input date string. + * + * This function parses a date according to the format "X" and puts the + * results into a user-supplied struct tm. This function is a hook for + * derived classes to change the value returned. @see get_date() for + * details. + * + * @param beg Start of string to parse. + * @param end End of string to parse. + * @param io Source of the locale. + * @param err Error flags to set. + * @param tm Pointer to struct tm to fill in. + * @return Iterator to first char beyond date string. + */ + virtual iter_type + do_get_date(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, tm* __tm) const; + + /** + * @brief Parse input weekday string. + * + * This function parses a weekday name and puts the results into a + * user-supplied struct tm. This function is a hook for derived + * classes to change the value returned. @see get_weekday() for + * details. + * + * @param beg Start of string to parse. + * @param end End of string to parse. + * @param io Source of the locale. + * @param err Error flags to set. + * @param tm Pointer to struct tm to fill in. + * @return Iterator to first char beyond weekday name. + */ + virtual iter_type + do_get_weekday(iter_type __beg, iter_type __end, ios_base&, + ios_base::iostate& __err, tm* __tm) const; + + /** + * @brief Parse input month string. + * + * This function parses a month name and puts the results into a + * user-supplied struct tm. This function is a hook for derived + * classes to change the value returned. @see get_monthname() for + * details. + * + * @param beg Start of string to parse. + * @param end End of string to parse. + * @param io Source of the locale. + * @param err Error flags to set. + * @param tm Pointer to struct tm to fill in. + * @return Iterator to first char beyond month name. + */ + virtual iter_type + do_get_monthname(iter_type __beg, iter_type __end, ios_base&, + ios_base::iostate& __err, tm* __tm) const; + + /** + * @brief Parse input year string. + * + * This function reads up to 4 characters to parse a year string and + * puts the results into a user-supplied struct tm. This function is a + * hook for derived classes to change the value returned. @see + * get_year() for details. + * + * @param beg Start of string to parse. + * @param end End of string to parse. + * @param io Source of the locale. + * @param err Error flags to set. + * @param tm Pointer to struct tm to fill in. + * @return Iterator to first char beyond year. + */ + virtual iter_type + do_get_year(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, tm* __tm) const; + + // Extract numeric component of length __len. + iter_type + _M_extract_num(iter_type __beg, iter_type __end, int& __member, + int __min, int __max, size_t __len, + ios_base& __io, ios_base::iostate& __err) const; + + // Extract day or month name, or any unique array of string + // literals in a const _CharT* array. + iter_type + _M_extract_name(iter_type __beg, iter_type __end, int& __member, + const _CharT** __names, size_t __indexlen, + ios_base& __io, ios_base::iostate& __err) const; + + // Extract on a component-by-component basis, via __format argument. + iter_type + _M_extract_via_format(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, tm* __tm, + const _CharT* __format) const; + }; + + template + locale::id time_get<_CharT, _InIter>::id; + + /// @brief class time_get_byname [22.2.5.2]. + template + class time_get_byname : public time_get<_CharT, _InIter> + { + public: + // Types: + typedef _CharT char_type; + typedef _InIter iter_type; + + explicit + time_get_byname(const char*, size_t __refs = 0) + : time_get<_CharT, _InIter>(__refs) { } + + protected: + virtual + ~time_get_byname() { } + }; + + /** + * @brief Facet for outputting dates and times. + * + * This facet encapsulates the code to format and output dates and times + * according to formats used by strftime(). + * + * The time_put template uses protected virtual functions to provide the + * actual results. The public accessors forward the call to the virtual + * functions. These virtual functions are hooks for developers to + * implement the behavior they require from the time_put facet. + */ + template + class time_put : public locale::facet + { + public: + // Types: + //@{ + /// Public typedefs + typedef _CharT char_type; + typedef _OutIter iter_type; + //@} + + /// Numpunct facet id. + static locale::id id; + + /** + * @brief Constructor performs initialization. + * + * This is the constructor provided by the standard. + * + * @param refs Passed to the base facet class. + */ + explicit + time_put(size_t __refs = 0) + : facet(__refs) { } + + /** + * @brief Format and output a time or date. + * + * This function formats the data in struct tm according to the + * provided format string. The format string is interpreted as by + * strftime(). + * + * @param s The stream to write to. + * @param io Source of locale. + * @param fill char_type to use for padding. + * @param tm Struct tm with date and time info to format. + * @param beg Start of format string. + * @param end End of format string. + * @return Iterator after writing. + */ + iter_type + put(iter_type __s, ios_base& __io, char_type __fill, const tm* __tm, + const _CharT* __beg, const _CharT* __end) const; + + /** + * @brief Format and output a time or date. + * + * This function formats the data in struct tm according to the + * provided format char and optional modifier. The format and modifier + * are interpreted as by strftime(). It does so by returning + * time_put::do_put(). + * + * @param s The stream to write to. + * @param io Source of locale. + * @param fill char_type to use for padding. + * @param tm Struct tm with date and time info to format. + * @param format Format char. + * @param mod Optional modifier char. + * @return Iterator after writing. + */ + iter_type + put(iter_type __s, ios_base& __io, char_type __fill, + const tm* __tm, char __format, char __mod = 0) const + { return this->do_put(__s, __io, __fill, __tm, __format, __mod); } + + protected: + /// Destructor. + virtual + ~time_put() + { } + + /** + * @brief Format and output a time or date. + * + * This function formats the data in struct tm according to the + * provided format char and optional modifier. This function is a hook + * for derived classes to change the value returned. @see put() for + * more details. + * + * @param s The stream to write to. + * @param io Source of locale. + * @param fill char_type to use for padding. + * @param tm Struct tm with date and time info to format. + * @param format Format char. + * @param mod Optional modifier char. + * @return Iterator after writing. + */ + virtual iter_type + do_put(iter_type __s, ios_base& __io, char_type __fill, const tm* __tm, + char __format, char __mod) const; + }; + + template + locale::id time_put<_CharT, _OutIter>::id; + + /// @brief class time_put_byname [22.2.5.4]. + template + class time_put_byname : public time_put<_CharT, _OutIter> + { + public: + // Types: + typedef _CharT char_type; + typedef _OutIter iter_type; + + explicit + time_put_byname(const char*, size_t __refs = 0) + : time_put<_CharT, _OutIter>(__refs) + { }; + + protected: + virtual + ~time_put_byname() { } + }; + + + /** + * @brief Money format ordering data. + * + * This class contains an ordered array of 4 fields to represent the + * pattern for formatting a money amount. Each field may contain one entry + * from the part enum. symbol, sign, and value must be present and the + * remaining field must contain either none or space. @see + * moneypunct::pos_format() and moneypunct::neg_format() for details of how + * these fields are interpreted. + */ + class money_base + { + public: + enum part { none, space, symbol, sign, value }; + struct pattern { char field[4]; }; + + static const pattern _S_default_pattern; + + enum + { + _S_minus, + _S_zero, + _S_end = 11 + }; + + // String literal of acceptable (narrow) input/output, for + // money_get/money_put. "-0123456789" + static const char* _S_atoms; + + // Construct and return valid pattern consisting of some combination of: + // space none symbol sign value + static pattern + _S_construct_pattern(char __precedes, char __space, char __posn); + }; + + template + struct __moneypunct_cache : public locale::facet + { + const char* _M_grouping; + size_t _M_grouping_size; + bool _M_use_grouping; + _CharT _M_decimal_point; + _CharT _M_thousands_sep; + const _CharT* _M_curr_symbol; + size_t _M_curr_symbol_size; + const _CharT* _M_positive_sign; + size_t _M_positive_sign_size; + const _CharT* _M_negative_sign; + size_t _M_negative_sign_size; + int _M_frac_digits; + money_base::pattern _M_pos_format; + money_base::pattern _M_neg_format; + + // A list of valid numeric literals for input and output: in the standard + // "C" locale, this is "-0123456789". This array contains the chars after + // having been passed through the current locale's ctype<_CharT>.widen(). + _CharT _M_atoms[money_base::_S_end]; + + bool _M_allocated; + + __moneypunct_cache(size_t __refs = 0) : facet(__refs), + _M_grouping(NULL), _M_grouping_size(0), _M_use_grouping(false), + _M_decimal_point(_CharT()), _M_thousands_sep(_CharT()), + _M_curr_symbol(NULL), _M_curr_symbol_size(0), + _M_positive_sign(NULL), _M_positive_sign_size(0), + _M_negative_sign(NULL), _M_negative_sign_size(0), + _M_frac_digits(0), + _M_pos_format(money_base::pattern()), + _M_neg_format(money_base::pattern()), _M_allocated(false) + { } + + ~__moneypunct_cache(); + + void + _M_cache(const locale& __loc); + + private: + __moneypunct_cache& + operator=(const __moneypunct_cache&); + + explicit + __moneypunct_cache(const __moneypunct_cache&); + }; + + template + __moneypunct_cache<_CharT, _Intl>::~__moneypunct_cache() + { + if (_M_allocated) + { + delete [] _M_grouping; + delete [] _M_curr_symbol; + delete [] _M_positive_sign; + delete [] _M_negative_sign; + } + } + + /** + * @brief Facet for formatting data for money amounts. + * + * This facet encapsulates the punctuation, grouping and other formatting + * features of money amount string representations. + */ + template + class moneypunct : public locale::facet, public money_base + { + public: + // Types: + //@{ + /// Public typedefs + typedef _CharT char_type; + typedef basic_string<_CharT> string_type; + //@} + typedef __moneypunct_cache<_CharT, _Intl> __cache_type; + + private: + __cache_type* _M_data; + + public: + /// This value is provided by the standard, but no reason for its + /// existence. + static const bool intl = _Intl; + /// Numpunct facet id. + static locale::id id; + + /** + * @brief Constructor performs initialization. + * + * This is the constructor provided by the standard. + * + * @param refs Passed to the base facet class. + */ + explicit + moneypunct(size_t __refs = 0) : facet(__refs), _M_data(NULL) + { _M_initialize_moneypunct(); } + + /** + * @brief Constructor performs initialization. + * + * This is an internal constructor. + * + * @param cache Cache for optimization. + * @param refs Passed to the base facet class. + */ + explicit + moneypunct(__cache_type* __cache, size_t __refs = 0) + : facet(__refs), _M_data(__cache) + { _M_initialize_moneypunct(); } + + /** + * @brief Internal constructor. Not for general use. + * + * This is a constructor for use by the library itself to set up new + * locales. + * + * @param cloc The "C" locale. + * @param s The name of a locale. + * @param refs Passed to the base facet class. + */ + explicit + moneypunct(__c_locale __cloc, const char* __s, size_t __refs = 0) + : facet(__refs), _M_data(NULL) + { _M_initialize_moneypunct(__cloc, __s); } + + /** + * @brief Return decimal point character. + * + * This function returns a char_type to use as a decimal point. It + * does so by returning returning + * moneypunct::do_decimal_point(). + * + * @return @a char_type representing a decimal point. + */ + char_type + decimal_point() const + { return this->do_decimal_point(); } + + /** + * @brief Return thousands separator character. + * + * This function returns a char_type to use as a thousands + * separator. It does so by returning returning + * moneypunct::do_thousands_sep(). + * + * @return char_type representing a thousands separator. + */ + char_type + thousands_sep() const + { return this->do_thousands_sep(); } + + /** + * @brief Return grouping specification. + * + * This function returns a string representing groupings for the + * integer part of an amount. Groupings indicate where thousands + * separators should be inserted. + * + * Each char in the return string is interpret as an integer rather + * than a character. These numbers represent the number of digits in a + * group. The first char in the string represents the number of digits + * in the least significant group. If a char is negative, it indicates + * an unlimited number of digits for the group. If more chars from the + * string are required to group a number, the last char is used + * repeatedly. + * + * For example, if the grouping() returns "\003\002" and is applied to + * the number 123456789, this corresponds to 12,34,56,789. Note that + * if the string was "32", this would put more than 50 digits into the + * least significant group if the character set is ASCII. + * + * The string is returned by calling + * moneypunct::do_grouping(). + * + * @return string representing grouping specification. + */ + string + grouping() const + { return this->do_grouping(); } + + /** + * @brief Return currency symbol string. + * + * This function returns a string_type to use as a currency symbol. It + * does so by returning returning + * moneypunct::do_curr_symbol(). + * + * @return @a string_type representing a currency symbol. + */ + string_type + curr_symbol() const + { return this->do_curr_symbol(); } + + /** + * @brief Return positive sign string. + * + * This function returns a string_type to use as a sign for positive + * amounts. It does so by returning returning + * moneypunct::do_positive_sign(). + * + * If the return value contains more than one character, the first + * character appears in the position indicated by pos_format() and the + * remainder appear at the end of the formatted string. + * + * @return @a string_type representing a positive sign. + */ + string_type + positive_sign() const + { return this->do_positive_sign(); } + + /** + * @brief Return negative sign string. + * + * This function returns a string_type to use as a sign for negative + * amounts. It does so by returning returning + * moneypunct::do_negative_sign(). + * + * If the return value contains more than one character, the first + * character appears in the position indicated by neg_format() and the + * remainder appear at the end of the formatted string. + * + * @return @a string_type representing a negative sign. + */ + string_type + negative_sign() const + { return this->do_negative_sign(); } + + /** + * @brief Return number of digits in fraction. + * + * This function returns the exact number of digits that make up the + * fractional part of a money amount. It does so by returning + * returning moneypunct::do_frac_digits(). + * + * The fractional part of a money amount is optional. But if it is + * present, there must be frac_digits() digits. + * + * @return Number of digits in amount fraction. + */ + int + frac_digits() const + { return this->do_frac_digits(); } + + //@{ + /** + * @brief Return pattern for money values. + * + * This function returns a pattern describing the formatting of a + * positive or negative valued money amount. It does so by returning + * returning moneypunct::do_pos_format() or + * moneypunct::do_neg_format(). + * + * The pattern has 4 fields describing the ordering of symbol, sign, + * value, and none or space. There must be one of each in the pattern. + * The none and space enums may not appear in the first field and space + * may not appear in the final field. + * + * The parts of a money string must appear in the order indicated by + * the fields of the pattern. The symbol field indicates that the + * value of curr_symbol() may be present. The sign field indicates + * that the value of positive_sign() or negative_sign() must be + * present. The value field indicates that the absolute value of the + * money amount is present. none indicates 0 or more whitespace + * characters, except at the end, where it permits no whitespace. + * space indicates that 1 or more whitespace characters must be + * present. + * + * For example, for the US locale and pos_format() pattern + * {symbol,sign,value,none}, curr_symbol() == '$' positive_sign() == + * '+', and value 10.01, and options set to force the symbol, the + * corresponding string is "$+10.01". + * + * @return Pattern for money values. + */ + pattern + pos_format() const + { return this->do_pos_format(); } + + pattern + neg_format() const + { return this->do_neg_format(); } + //@} + + protected: + /// Destructor. + virtual + ~moneypunct(); + + /** + * @brief Return decimal point character. + * + * Returns a char_type to use as a decimal point. This function is a + * hook for derived classes to change the value returned. + * + * @return @a char_type representing a decimal point. + */ + virtual char_type + do_decimal_point() const + { return _M_data->_M_decimal_point; } + + /** + * @brief Return thousands separator character. + * + * Returns a char_type to use as a thousands separator. This function + * is a hook for derived classes to change the value returned. + * + * @return @a char_type representing a thousands separator. + */ + virtual char_type + do_thousands_sep() const + { return _M_data->_M_thousands_sep; } + + /** + * @brief Return grouping specification. + * + * Returns a string representing groupings for the integer part of a + * number. This function is a hook for derived classes to change the + * value returned. @see grouping() for details. + * + * @return String representing grouping specification. + */ + virtual string + do_grouping() const + { return _M_data->_M_grouping; } + + /** + * @brief Return currency symbol string. + * + * This function returns a string_type to use as a currency symbol. + * This function is a hook for derived classes to change the value + * returned. @see curr_symbol() for details. + * + * @return @a string_type representing a currency symbol. + */ + virtual string_type + do_curr_symbol() const + { return _M_data->_M_curr_symbol; } + + /** + * @brief Return positive sign string. + * + * This function returns a string_type to use as a sign for positive + * amounts. This function is a hook for derived classes to change the + * value returned. @see positive_sign() for details. + * + * @return @a string_type representing a positive sign. + */ + virtual string_type + do_positive_sign() const + { return _M_data->_M_positive_sign; } + + /** + * @brief Return negative sign string. + * + * This function returns a string_type to use as a sign for negative + * amounts. This function is a hook for derived classes to change the + * value returned. @see negative_sign() for details. + * + * @return @a string_type representing a negative sign. + */ + virtual string_type + do_negative_sign() const + { return _M_data->_M_negative_sign; } + + /** + * @brief Return number of digits in fraction. + * + * This function returns the exact number of digits that make up the + * fractional part of a money amount. This function is a hook for + * derived classes to change the value returned. @see frac_digits() + * for details. + * + * @return Number of digits in amount fraction. + */ + virtual int + do_frac_digits() const + { return _M_data->_M_frac_digits; } + + /** + * @brief Return pattern for money values. + * + * This function returns a pattern describing the formatting of a + * positive valued money amount. This function is a hook for derived + * classes to change the value returned. @see pos_format() for + * details. + * + * @return Pattern for money values. + */ + virtual pattern + do_pos_format() const + { return _M_data->_M_pos_format; } + + /** + * @brief Return pattern for money values. + * + * This function returns a pattern describing the formatting of a + * negative valued money amount. This function is a hook for derived + * classes to change the value returned. @see neg_format() for + * details. + * + * @return Pattern for money values. + */ + virtual pattern + do_neg_format() const + { return _M_data->_M_neg_format; } + + // For use at construction time only. + void + _M_initialize_moneypunct(__c_locale __cloc = NULL, + const char* __name = NULL); + }; + + template + locale::id moneypunct<_CharT, _Intl>::id; + + template + const bool moneypunct<_CharT, _Intl>::intl; + + template<> + moneypunct::~moneypunct(); + + template<> + moneypunct::~moneypunct(); + + template<> + void + moneypunct::_M_initialize_moneypunct(__c_locale, const char*); + + template<> + void + moneypunct::_M_initialize_moneypunct(__c_locale, const char*); + +#ifdef _GLIBCXX_USE_WCHAR_T + template<> + moneypunct::~moneypunct(); + + template<> + moneypunct::~moneypunct(); + + template<> + void + moneypunct::_M_initialize_moneypunct(__c_locale, + const char*); + + template<> + void + moneypunct::_M_initialize_moneypunct(__c_locale, + const char*); +#endif + + /// @brief class moneypunct_byname [22.2.6.4]. + template + class moneypunct_byname : public moneypunct<_CharT, _Intl> + { + public: + typedef _CharT char_type; + typedef basic_string<_CharT> string_type; + + static const bool intl = _Intl; + + explicit + moneypunct_byname(const char* __s, size_t __refs = 0) + : moneypunct<_CharT, _Intl>(__refs) + { + if (std::strcmp(__s, "C") != 0 && std::strcmp(__s, "POSIX") != 0) + { + __c_locale __tmp; + this->_S_create_c_locale(__tmp, __s); + this->_M_initialize_moneypunct(__tmp); + this->_S_destroy_c_locale(__tmp); + } + } + + protected: + virtual + ~moneypunct_byname() { } + }; + + template + const bool moneypunct_byname<_CharT, _Intl>::intl; + +_GLIBCXX_BEGIN_LDBL_NAMESPACE + /** + * @brief Facet for parsing monetary amounts. + * + * This facet encapsulates the code to parse and return a monetary + * amount from a string. + * + * The money_get template uses protected virtual functions to + * provide the actual results. The public accessors forward the + * call to the virtual functions. These virtual functions are + * hooks for developers to implement the behavior they require from + * the money_get facet. + */ + template + class money_get : public locale::facet + { + public: + // Types: + //@{ + /// Public typedefs + typedef _CharT char_type; + typedef _InIter iter_type; + typedef basic_string<_CharT> string_type; + //@} + + /// Numpunct facet id. + static locale::id id; + + /** + * @brief Constructor performs initialization. + * + * This is the constructor provided by the standard. + * + * @param refs Passed to the base facet class. + */ + explicit + money_get(size_t __refs = 0) : facet(__refs) { } + + /** + * @brief Read and parse a monetary value. + * + * This function reads characters from @a s, interprets them as a + * monetary value according to moneypunct and ctype facets retrieved + * from io.getloc(), and returns the result in @a units as an integral + * value moneypunct::frac_digits() * the actual amount. For example, + * the string $10.01 in a US locale would store 1001 in @a units. + * + * Any characters not part of a valid money amount are not consumed. + * + * If a money value cannot be parsed from the input stream, sets + * err=(err|io.failbit). If the stream is consumed before finishing + * parsing, sets err=(err|io.failbit|io.eofbit). @a units is + * unchanged if parsing fails. + * + * This function works by returning the result of do_get(). + * + * @param s Start of characters to parse. + * @param end End of characters to parse. + * @param intl Parameter to use_facet >. + * @param io Source of facets and io state. + * @param err Error field to set if parsing fails. + * @param units Place to store result of parsing. + * @return Iterator referencing first character beyond valid money + * amount. + */ + iter_type + get(iter_type __s, iter_type __end, bool __intl, ios_base& __io, + ios_base::iostate& __err, long double& __units) const + { return this->do_get(__s, __end, __intl, __io, __err, __units); } + + /** + * @brief Read and parse a monetary value. + * + * This function reads characters from @a s, interprets them as a + * monetary value according to moneypunct and ctype facets retrieved + * from io.getloc(), and returns the result in @a digits. For example, + * the string $10.01 in a US locale would store "1001" in @a digits. + * + * Any characters not part of a valid money amount are not consumed. + * + * If a money value cannot be parsed from the input stream, sets + * err=(err|io.failbit). If the stream is consumed before finishing + * parsing, sets err=(err|io.failbit|io.eofbit). + * + * This function works by returning the result of do_get(). + * + * @param s Start of characters to parse. + * @param end End of characters to parse. + * @param intl Parameter to use_facet >. + * @param io Source of facets and io state. + * @param err Error field to set if parsing fails. + * @param digits Place to store result of parsing. + * @return Iterator referencing first character beyond valid money + * amount. + */ + iter_type + get(iter_type __s, iter_type __end, bool __intl, ios_base& __io, + ios_base::iostate& __err, string_type& __digits) const + { return this->do_get(__s, __end, __intl, __io, __err, __digits); } + + protected: + /// Destructor. + virtual + ~money_get() { } + + /** + * @brief Read and parse a monetary value. + * + * This function reads and parses characters representing a monetary + * value. This function is a hook for derived classes to change the + * value returned. @see get() for details. + */ + // XXX GLIBCXX_ABI Deprecated +#if defined _GLIBCXX_LONG_DOUBLE_COMPAT && defined __LONG_DOUBLE_128__ + virtual iter_type + __do_get(iter_type __s, iter_type __end, bool __intl, ios_base& __io, + ios_base::iostate& __err, double& __units) const; +#else + virtual iter_type + do_get(iter_type __s, iter_type __end, bool __intl, ios_base& __io, + ios_base::iostate& __err, long double& __units) const; +#endif + + /** + * @brief Read and parse a monetary value. + * + * This function reads and parses characters representing a monetary + * value. This function is a hook for derived classes to change the + * value returned. @see get() for details. + */ + virtual iter_type + do_get(iter_type __s, iter_type __end, bool __intl, ios_base& __io, + ios_base::iostate& __err, string_type& __digits) const; + + // XXX GLIBCXX_ABI Deprecated +#if defined _GLIBCXX_LONG_DOUBLE_COMPAT && defined __LONG_DOUBLE_128__ + virtual iter_type + do_get(iter_type __s, iter_type __end, bool __intl, ios_base& __io, + ios_base::iostate& __err, long double& __units) const; +#endif + + template + iter_type + _M_extract(iter_type __s, iter_type __end, ios_base& __io, + ios_base::iostate& __err, string& __digits) const; + }; + + template + locale::id money_get<_CharT, _InIter>::id; + + /** + * @brief Facet for outputting monetary amounts. + * + * This facet encapsulates the code to format and output a monetary + * amount. + * + * The money_put template uses protected virtual functions to + * provide the actual results. The public accessors forward the + * call to the virtual functions. These virtual functions are + * hooks for developers to implement the behavior they require from + * the money_put facet. + */ + template + class money_put : public locale::facet + { + public: + //@{ + /// Public typedefs + typedef _CharT char_type; + typedef _OutIter iter_type; + typedef basic_string<_CharT> string_type; + //@} + + /// Numpunct facet id. + static locale::id id; + + /** + * @brief Constructor performs initialization. + * + * This is the constructor provided by the standard. + * + * @param refs Passed to the base facet class. + */ + explicit + money_put(size_t __refs = 0) : facet(__refs) { } + + /** + * @brief Format and output a monetary value. + * + * This function formats @a units as a monetary value according to + * moneypunct and ctype facets retrieved from io.getloc(), and writes + * the resulting characters to @a s. For example, the value 1001 in a + * US locale would write "$10.01" to @a s. + * + * This function works by returning the result of do_put(). + * + * @param s The stream to write to. + * @param intl Parameter to use_facet >. + * @param io Source of facets and io state. + * @param fill char_type to use for padding. + * @param units Place to store result of parsing. + * @return Iterator after writing. + */ + iter_type + put(iter_type __s, bool __intl, ios_base& __io, + char_type __fill, long double __units) const + { return this->do_put(__s, __intl, __io, __fill, __units); } + + /** + * @brief Format and output a monetary value. + * + * This function formats @a digits as a monetary value according to + * moneypunct and ctype facets retrieved from io.getloc(), and writes + * the resulting characters to @a s. For example, the string "1001" in + * a US locale would write "$10.01" to @a s. + * + * This function works by returning the result of do_put(). + * + * @param s The stream to write to. + * @param intl Parameter to use_facet >. + * @param io Source of facets and io state. + * @param fill char_type to use for padding. + * @param units Place to store result of parsing. + * @return Iterator after writing. + */ + iter_type + put(iter_type __s, bool __intl, ios_base& __io, + char_type __fill, const string_type& __digits) const + { return this->do_put(__s, __intl, __io, __fill, __digits); } + + protected: + /// Destructor. + virtual + ~money_put() { } + + /** + * @brief Format and output a monetary value. + * + * This function formats @a units as a monetary value according to + * moneypunct and ctype facets retrieved from io.getloc(), and writes + * the resulting characters to @a s. For example, the value 1001 in a + * US locale would write "$10.01" to @a s. + * + * This function is a hook for derived classes to change the value + * returned. @see put(). + * + * @param s The stream to write to. + * @param intl Parameter to use_facet >. + * @param io Source of facets and io state. + * @param fill char_type to use for padding. + * @param units Place to store result of parsing. + * @return Iterator after writing. + */ + // XXX GLIBCXX_ABI Deprecated +#if defined _GLIBCXX_LONG_DOUBLE_COMPAT && defined __LONG_DOUBLE_128__ + virtual iter_type + __do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill, + double __units) const; +#else + virtual iter_type + do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill, + long double __units) const; +#endif + + /** + * @brief Format and output a monetary value. + * + * This function formats @a digits as a monetary value according to + * moneypunct and ctype facets retrieved from io.getloc(), and writes + * the resulting characters to @a s. For example, the string "1001" in + * a US locale would write "$10.01" to @a s. + * + * This function is a hook for derived classes to change the value + * returned. @see put(). + * + * @param s The stream to write to. + * @param intl Parameter to use_facet >. + * @param io Source of facets and io state. + * @param fill char_type to use for padding. + * @param units Place to store result of parsing. + * @return Iterator after writing. + */ + virtual iter_type + do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill, + const string_type& __digits) const; + + // XXX GLIBCXX_ABI Deprecated +#if defined _GLIBCXX_LONG_DOUBLE_COMPAT && defined __LONG_DOUBLE_128__ + virtual iter_type + do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill, + long double __units) const; +#endif + + template + iter_type + _M_insert(iter_type __s, ios_base& __io, char_type __fill, + const string_type& __digits) const; + }; + + template + locale::id money_put<_CharT, _OutIter>::id; + +_GLIBCXX_END_LDBL_NAMESPACE + + /** + * @brief Messages facet base class providing catalog typedef. + */ + struct messages_base + { + typedef int catalog; + }; + + /** + * @brief Facet for handling message catalogs + * + * This facet encapsulates the code to retrieve messages from + * message catalogs. The only thing defined by the standard for this facet + * is the interface. All underlying functionality is + * implementation-defined. + * + * This library currently implements 3 versions of the message facet. The + * first version (gnu) is a wrapper around gettext, provided by libintl. + * The second version (ieee) is a wrapper around catgets. The final + * version (default) does no actual translation. These implementations are + * only provided for char and wchar_t instantiations. + * + * The messages template uses protected virtual functions to + * provide the actual results. The public accessors forward the + * call to the virtual functions. These virtual functions are + * hooks for developers to implement the behavior they require from + * the messages facet. + */ + template + class messages : public locale::facet, public messages_base + { + public: + // Types: + //@{ + /// Public typedefs + typedef _CharT char_type; + typedef basic_string<_CharT> string_type; + //@} + + protected: + // Underlying "C" library locale information saved from + // initialization, needed by messages_byname as well. + __c_locale _M_c_locale_messages; + const char* _M_name_messages; + + public: + /// Numpunct facet id. + static locale::id id; + + /** + * @brief Constructor performs initialization. + * + * This is the constructor provided by the standard. + * + * @param refs Passed to the base facet class. + */ + explicit + messages(size_t __refs = 0); + + // Non-standard. + /** + * @brief Internal constructor. Not for general use. + * + * This is a constructor for use by the library itself to set up new + * locales. + * + * @param cloc The "C" locale. + * @param s The name of a locale. + * @param refs Refcount to pass to the base class. + */ + explicit + messages(__c_locale __cloc, const char* __s, size_t __refs = 0); + + /* + * @brief Open a message catalog. + * + * This function opens and returns a handle to a message catalog by + * returning do_open(s, loc). + * + * @param s The catalog to open. + * @param loc Locale to use for character set conversions. + * @return Handle to the catalog or value < 0 if open fails. + */ + catalog + open(const basic_string& __s, const locale& __loc) const + { return this->do_open(__s, __loc); } + + // Non-standard and unorthodox, yet effective. + /* + * @brief Open a message catalog. + * + * This non-standard function opens and returns a handle to a message + * catalog by returning do_open(s, loc). The third argument provides a + * message catalog root directory for gnu gettext and is ignored + * otherwise. + * + * @param s The catalog to open. + * @param loc Locale to use for character set conversions. + * @param dir Message catalog root directory. + * @return Handle to the catalog or value < 0 if open fails. + */ + catalog + open(const basic_string&, const locale&, const char*) const; + + /* + * @brief Look up a string in a message catalog. + * + * This function retrieves and returns a message from a catalog by + * returning do_get(c, set, msgid, s). + * + * For gnu, @a set and @a msgid are ignored. Returns gettext(s). + * For default, returns s. For ieee, returns catgets(c,set,msgid,s). + * + * @param c The catalog to access. + * @param set Implementation-defined. + * @param msgid Implementation-defined. + * @param s Default return value if retrieval fails. + * @return Retrieved message or @a s if get fails. + */ + string_type + get(catalog __c, int __set, int __msgid, const string_type& __s) const + { return this->do_get(__c, __set, __msgid, __s); } + + /* + * @brief Close a message catalog. + * + * Closes catalog @a c by calling do_close(c). + * + * @param c The catalog to close. + */ + void + close(catalog __c) const + { return this->do_close(__c); } + + protected: + /// Destructor. + virtual + ~messages(); + + /* + * @brief Open a message catalog. + * + * This function opens and returns a handle to a message catalog in an + * implementation-defined manner. This function is a hook for derived + * classes to change the value returned. + * + * @param s The catalog to open. + * @param loc Locale to use for character set conversions. + * @return Handle to the opened catalog, value < 0 if open failed. + */ + virtual catalog + do_open(const basic_string&, const locale&) const; + + /* + * @brief Look up a string in a message catalog. + * + * This function retrieves and returns a message from a catalog in an + * implementation-defined manner. This function is a hook for derived + * classes to change the value returned. + * + * For gnu, @a set and @a msgid are ignored. Returns gettext(s). + * For default, returns s. For ieee, returns catgets(c,set,msgid,s). + * + * @param c The catalog to access. + * @param set Implementation-defined. + * @param msgid Implementation-defined. + * @param s Default return value if retrieval fails. + * @return Retrieved message or @a s if get fails. + */ + virtual string_type + do_get(catalog, int, int, const string_type& __dfault) const; + + /* + * @brief Close a message catalog. + * + * @param c The catalog to close. + */ + virtual void + do_close(catalog) const; + + // Returns a locale and codeset-converted string, given a char* message. + char* + _M_convert_to_char(const string_type& __msg) const + { + // XXX + return reinterpret_cast(const_cast<_CharT*>(__msg.c_str())); + } + + // Returns a locale and codeset-converted string, given a char* message. + string_type + _M_convert_from_char(char*) const + { +#if 0 + // Length of message string without terminating null. + size_t __len = char_traits::length(__msg) - 1; + + // "everybody can easily convert the string using + // mbsrtowcs/wcsrtombs or with iconv()" + + // Convert char* to _CharT in locale used to open catalog. + // XXX need additional template parameter on messages class for this.. + // typedef typename codecvt __codecvt_type; + typedef typename codecvt __codecvt_type; + + __codecvt_type::state_type __state; + // XXX may need to initialize state. + //initialize_state(__state._M_init()); + + char* __from_next; + // XXX what size for this string? + _CharT* __to = static_cast<_CharT*>(__builtin_alloca(__len + 1)); + const __codecvt_type& __cvt = use_facet<__codecvt_type>(_M_locale_conv); + __cvt.out(__state, __msg, __msg + __len, __from_next, + __to, __to + __len + 1, __to_next); + return string_type(__to); +#endif +#if 0 + typedef ctype<_CharT> __ctype_type; + // const __ctype_type& __cvt = use_facet<__ctype_type>(_M_locale_msg); + const __ctype_type& __cvt = use_facet<__ctype_type>(locale()); + // XXX Again, proper length of converted string an issue here. + // For now, assume the converted length is not larger. + _CharT* __dest = static_cast<_CharT*>(__builtin_alloca(__len + 1)); + __cvt.widen(__msg, __msg + __len, __dest); + return basic_string<_CharT>(__dest); +#endif + return string_type(); + } + }; + + template + locale::id messages<_CharT>::id; + + // Specializations for required instantiations. + template<> + string + messages::do_get(catalog, int, int, const string&) const; + +#ifdef _GLIBCXX_USE_WCHAR_T + template<> + wstring + messages::do_get(catalog, int, int, const wstring&) const; +#endif + + /// @brief class messages_byname [22.2.7.2]. + template + class messages_byname : public messages<_CharT> + { + public: + typedef _CharT char_type; + typedef basic_string<_CharT> string_type; + + explicit + messages_byname(const char* __s, size_t __refs = 0); + + protected: + virtual + ~messages_byname() + { } + }; + +} // namespace std + + // Include host and configuration specific messages functions. + #include + +namespace std { + + // Subclause convenience interfaces, inlines. + // NB: These are inline because, when used in a loop, some compilers + // can hoist the body out of the loop; then it's just as fast as the + // C is*() function. + + /// Convenience interface to ctype.is(ctype_base::space, __c). + template + inline bool + isspace(_CharT __c, const locale& __loc) + { return use_facet >(__loc).is(ctype_base::space, __c); } + + /// Convenience interface to ctype.is(ctype_base::print, __c). + template + inline bool + isprint(_CharT __c, const locale& __loc) + { return use_facet >(__loc).is(ctype_base::print, __c); } + + /// Convenience interface to ctype.is(ctype_base::cntrl, __c). + template + inline bool + iscntrl(_CharT __c, const locale& __loc) + { return use_facet >(__loc).is(ctype_base::cntrl, __c); } + + /// Convenience interface to ctype.is(ctype_base::upper, __c). + template + inline bool + isupper(_CharT __c, const locale& __loc) + { return use_facet >(__loc).is(ctype_base::upper, __c); } + + /// Convenience interface to ctype.is(ctype_base::lower, __c). + template + inline bool + islower(_CharT __c, const locale& __loc) + { return use_facet >(__loc).is(ctype_base::lower, __c); } + + /// Convenience interface to ctype.is(ctype_base::alpha, __c). + template + inline bool + isalpha(_CharT __c, const locale& __loc) + { return use_facet >(__loc).is(ctype_base::alpha, __c); } + + /// Convenience interface to ctype.is(ctype_base::digit, __c). + template + inline bool + isdigit(_CharT __c, const locale& __loc) + { return use_facet >(__loc).is(ctype_base::digit, __c); } + + /// Convenience interface to ctype.is(ctype_base::punct, __c). + template + inline bool + ispunct(_CharT __c, const locale& __loc) + { return use_facet >(__loc).is(ctype_base::punct, __c); } + + /// Convenience interface to ctype.is(ctype_base::xdigit, __c). + template + inline bool + isxdigit(_CharT __c, const locale& __loc) + { return use_facet >(__loc).is(ctype_base::xdigit, __c); } + + /// Convenience interface to ctype.is(ctype_base::alnum, __c). + template + inline bool + isalnum(_CharT __c, const locale& __loc) + { return use_facet >(__loc).is(ctype_base::alnum, __c); } + + /// Convenience interface to ctype.is(ctype_base::graph, __c). + template + inline bool + isgraph(_CharT __c, const locale& __loc) + { return use_facet >(__loc).is(ctype_base::graph, __c); } + + /// Convenience interface to ctype.toupper(__c). + template + inline _CharT + toupper(_CharT __c, const locale& __loc) + { return use_facet >(__loc).toupper(__c); } + + /// Convenience interface to ctype.tolower(__c). + template + inline _CharT + tolower(_CharT __c, const locale& __loc) + { return use_facet >(__loc).tolower(__c); } + +} // namespace std + +#endif diff --git a/cpp_src/locale_facets.tcc b/cpp_src/locale_facets.tcc new file mode 100644 index 0000000..4d9b4b0 --- /dev/null +++ b/cpp_src/locale_facets.tcc @@ -0,0 +1,2879 @@ +// Locale support -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2008 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file locale_facets.tcc + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _LOCALE_FACETS_TCC +#define _LOCALE_FACETS_TCC 1 + +#pragma GCC system_header + +#include // For numeric_limits +#include // For bad_cast. +#include +#include + +namespace std { + + template + locale + locale::combine(const locale& __other) const + { + _Impl* __tmp = new _Impl(*_M_impl, 1); + try + { + __tmp->_M_replace_facet(__other._M_impl, &_Facet::id); + } + catch(...) + { + __tmp->_M_remove_reference(); + __throw_exception_again; + } + return locale(__tmp); + } + + template + bool + locale::operator()(const basic_string<_CharT, _Traits, _Alloc>& __s1, + const basic_string<_CharT, _Traits, _Alloc>& __s2) const + { + typedef std::collate<_CharT> __collate_type; + const __collate_type& __collate = use_facet<__collate_type>(*this); + return (__collate.compare(__s1.data(), __s1.data() + __s1.length(), + __s2.data(), __s2.data() + __s2.length()) < 0); + } + + /** + * @brief Test for the presence of a facet. + * + * has_facet tests the locale argument for the presence of the facet type + * provided as the template parameter. Facets derived from the facet + * parameter will also return true. + * + * @param Facet The facet type to test the presence of. + * @param locale The locale to test. + * @return true if locale contains a facet of type Facet, else false. + */ + template + inline bool + has_facet(const locale& __loc) throw() + { + const size_t __i = _Facet::id._M_id(); + const locale::facet** __facets = __loc._M_impl->_M_facets; + return (__i < __loc._M_impl->_M_facets_size && __facets[__i]); + } + + /** + * @brief Return a facet. + * + * use_facet looks for and returns a reference to a facet of type Facet + * where Facet is the template parameter. If has_facet(locale) is true, + * there is a suitable facet to return. It throws std::bad_cast if the + * locale doesn't contain a facet of type Facet. + * + * @param Facet The facet type to access. + * @param locale The locale to use. + * @return Reference to facet of type Facet. + * @throw std::bad_cast if locale doesn't contain a facet of type Facet. + */ + template + inline const _Facet& + use_facet(const locale& __loc) + { + const size_t __i = _Facet::id._M_id(); + const locale::facet** __facets = __loc._M_impl->_M_facets; + if (!(__i < __loc._M_impl->_M_facets_size && __facets[__i])) + __throw_bad_cast(); + return static_cast(*__facets[__i]); + } + + + // Routine to access a cache for the facet. If the cache didn't + // exist before, it gets constructed on the fly. + template + struct __use_cache + { + const _Facet* + operator() (const locale& __loc) const; + }; + + // Specializations. + template + struct __use_cache<__numpunct_cache<_CharT> > + { + const __numpunct_cache<_CharT>* + operator() (const locale& __loc) const + { + const size_t __i = numpunct<_CharT>::id._M_id(); + const locale::facet** __caches = __loc._M_impl->_M_caches; + if (!__caches[__i]) + { + __numpunct_cache<_CharT>* __tmp = NULL; + try + { + __tmp = new __numpunct_cache<_CharT>; + __tmp->_M_cache(__loc); + } + catch(...) + { + delete __tmp; + __throw_exception_again; + } + __loc._M_impl->_M_install_cache(__tmp, __i); + } + return static_cast*>(__caches[__i]); + } + }; + + template + struct __use_cache<__moneypunct_cache<_CharT, _Intl> > + { + const __moneypunct_cache<_CharT, _Intl>* + operator() (const locale& __loc) const + { + const size_t __i = moneypunct<_CharT, _Intl>::id._M_id(); + const locale::facet** __caches = __loc._M_impl->_M_caches; + if (!__caches[__i]) + { + __moneypunct_cache<_CharT, _Intl>* __tmp = NULL; + try + { + __tmp = new __moneypunct_cache<_CharT, _Intl>; + __tmp->_M_cache(__loc); + } + catch(...) + { + delete __tmp; + __throw_exception_again; + } + __loc._M_impl->_M_install_cache(__tmp, __i); + } + return static_cast< + const __moneypunct_cache<_CharT, _Intl>*>(__caches[__i]); + } + }; + + template + void + __numpunct_cache<_CharT>::_M_cache(const locale& __loc) + { + _M_allocated = true; + + const numpunct<_CharT>& __np = use_facet >(__loc); + + _M_grouping_size = __np.grouping().size(); + char* __grouping = new char[_M_grouping_size]; + __np.grouping().copy(__grouping, _M_grouping_size); + _M_grouping = __grouping; + _M_use_grouping = (_M_grouping_size + && static_cast(__np.grouping()[0]) > 0); + + _M_truename_size = __np.truename().size(); + _CharT* __truename = new _CharT[_M_truename_size]; + __np.truename().copy(__truename, _M_truename_size); + _M_truename = __truename; + + _M_falsename_size = __np.falsename().size(); + _CharT* __falsename = new _CharT[_M_falsename_size]; + __np.falsename().copy(__falsename, _M_falsename_size); + _M_falsename = __falsename; + + _M_decimal_point = __np.decimal_point(); + _M_thousands_sep = __np.thousands_sep(); + + const ctype<_CharT>& __ct = use_facet >(__loc); + __ct.widen(__num_base::_S_atoms_out, + __num_base::_S_atoms_out + __num_base::_S_oend, _M_atoms_out); + __ct.widen(__num_base::_S_atoms_in, + __num_base::_S_atoms_in + __num_base::_S_iend, _M_atoms_in); + } + + template + void + __moneypunct_cache<_CharT, _Intl>::_M_cache(const locale& __loc) + { + _M_allocated = true; + + const moneypunct<_CharT, _Intl>& __mp = + use_facet >(__loc); + + _M_grouping_size = __mp.grouping().size(); + char* __grouping = new char[_M_grouping_size]; + __mp.grouping().copy(__grouping, _M_grouping_size); + _M_grouping = __grouping; + _M_use_grouping = (_M_grouping_size + && static_cast(__mp.grouping()[0]) > 0); + + _M_decimal_point = __mp.decimal_point(); + _M_thousands_sep = __mp.thousands_sep(); + _M_frac_digits = __mp.frac_digits(); + + _M_curr_symbol_size = __mp.curr_symbol().size(); + _CharT* __curr_symbol = new _CharT[_M_curr_symbol_size]; + __mp.curr_symbol().copy(__curr_symbol, _M_curr_symbol_size); + _M_curr_symbol = __curr_symbol; + + _M_positive_sign_size = __mp.positive_sign().size(); + _CharT* __positive_sign = new _CharT[_M_positive_sign_size]; + __mp.positive_sign().copy(__positive_sign, _M_positive_sign_size); + _M_positive_sign = __positive_sign; + + _M_negative_sign_size = __mp.negative_sign().size(); + _CharT* __negative_sign = new _CharT[_M_negative_sign_size]; + __mp.negative_sign().copy(__negative_sign, _M_negative_sign_size); + _M_negative_sign = __negative_sign; + + _M_pos_format = __mp.pos_format(); + _M_neg_format = __mp.neg_format(); + + const ctype<_CharT>& __ct = use_facet >(__loc); + __ct.widen(money_base::_S_atoms, + money_base::_S_atoms + money_base::_S_end, _M_atoms); + } + + + // Used by both numeric and monetary facets. + // Check to make sure that the __grouping_tmp string constructed in + // money_get or num_get matches the canonical grouping for a given + // locale. + // __grouping_tmp is parsed L to R + // 1,222,444 == __grouping_tmp of "\1\3\3" + // __grouping is parsed R to L + // 1,222,444 == __grouping of "\3" == "\3\3\3" + static bool + __verify_grouping(const char* __grouping, size_t __grouping_size, + const string& __grouping_tmp); + +_GLIBCXX_BEGIN_LDBL_NAMESPACE + + template + _InIter + num_get<_CharT, _InIter>:: + _M_extract_float(_InIter __beg, _InIter __end, ios_base& __io, + ios_base::iostate& __err, string& __xtrc) const + { + typedef char_traits<_CharT> __traits_type; + typedef __numpunct_cache<_CharT> __cache_type; + __use_cache<__cache_type> __uc; + const locale& __loc = __io._M_getloc(); + const __cache_type* __lc = __uc(__loc); + const _CharT* __lit = __lc->_M_atoms_in; + char_type __c = char_type(); + + // True if __beg becomes equal to __end. + bool __testeof = __beg == __end; + + // First check for sign. + if (!__testeof) + { + __c = *__beg; + const bool __plus = __c == __lit[__num_base::_S_iplus]; + if ((__plus || __c == __lit[__num_base::_S_iminus]) + && !(__lc->_M_use_grouping && __c == __lc->_M_thousands_sep) + && !(__c == __lc->_M_decimal_point)) + { + __xtrc += __plus ? '+' : '-'; + if (++__beg != __end) + __c = *__beg; + else + __testeof = true; + } + } + + // Next, look for leading zeros. + bool __found_mantissa = false; + int __sep_pos = 0; + while (!__testeof) + { + if (__lc->_M_use_grouping && __c == __lc->_M_thousands_sep + || __c == __lc->_M_decimal_point) + break; + else if (__c == __lit[__num_base::_S_izero]) + { + if (!__found_mantissa) + { + __xtrc += '0'; + __found_mantissa = true; + } + ++__sep_pos; + + if (++__beg != __end) + __c = *__beg; + else + __testeof = true; + } + else + break; + } + + // Only need acceptable digits for floating point numbers. + bool __found_dec = false; + bool __found_sci = false; + string __found_grouping; + if (__lc->_M_use_grouping) + __found_grouping.reserve(32); + const char_type* __lit_zero = __lit + __num_base::_S_izero; + + if (!__lc->_M_allocated) + // "C" locale + while (!__testeof) + { + const int __digit = _M_find(__lit_zero, 10, __c); + if (__digit != -1) + { + __xtrc += '0' + __digit; + __found_mantissa = true; + } + else if (__c == __lc->_M_decimal_point + && !__found_dec && !__found_sci) + { + __xtrc += '.'; + __found_dec = true; + } + else if ((__c == __lit[__num_base::_S_ie] + || __c == __lit[__num_base::_S_iE]) + && !__found_sci && __found_mantissa) + { + // Scientific notation. + __xtrc += 'e'; + __found_sci = true; + + // Remove optional plus or minus sign, if they exist. + if (++__beg != __end) + { + __c = *__beg; + const bool __plus = __c == __lit[__num_base::_S_iplus]; + if (__plus || __c == __lit[__num_base::_S_iminus]) + __xtrc += __plus ? '+' : '-'; + else + continue; + } + else + { + __testeof = true; + break; + } + } + else + break; + + if (++__beg != __end) + __c = *__beg; + else + __testeof = true; + } + else + while (!__testeof) + { + // According to 22.2.2.1.2, p8-9, first look for thousands_sep + // and decimal_point. + if (__lc->_M_use_grouping && __c == __lc->_M_thousands_sep) + { + if (!__found_dec && !__found_sci) + { + // NB: Thousands separator at the beginning of a string + // is a no-no, as is two consecutive thousands separators. + if (__sep_pos) + { + __found_grouping += static_cast(__sep_pos); + __sep_pos = 0; + } + else + { + // NB: __convert_to_v will not assign __v and will + // set the failbit. + __xtrc.clear(); + break; + } + } + else + break; + } + else if (__c == __lc->_M_decimal_point) + { + if (!__found_dec && !__found_sci) + { + // If no grouping chars are seen, no grouping check + // is applied. Therefore __found_grouping is adjusted + // only if decimal_point comes after some thousands_sep. + if (__found_grouping.size()) + __found_grouping += static_cast(__sep_pos); + __xtrc += '.'; + __found_dec = true; + } + else + break; + } + else + { + const char_type* __q = + __traits_type::find(__lit_zero, 10, __c); + if (__q) + { + __xtrc += '0' + (__q - __lit_zero); + __found_mantissa = true; + ++__sep_pos; + } + else if ((__c == __lit[__num_base::_S_ie] + || __c == __lit[__num_base::_S_iE]) + && !__found_sci && __found_mantissa) + { + // Scientific notation. + if (__found_grouping.size() && !__found_dec) + __found_grouping += static_cast(__sep_pos); + __xtrc += 'e'; + __found_sci = true; + + // Remove optional plus or minus sign, if they exist. + if (++__beg != __end) + { + __c = *__beg; + const bool __plus = __c == __lit[__num_base::_S_iplus]; + if ((__plus || __c == __lit[__num_base::_S_iminus]) + && !(__lc->_M_use_grouping + && __c == __lc->_M_thousands_sep) + && !(__c == __lc->_M_decimal_point)) + __xtrc += __plus ? '+' : '-'; + else + continue; + } + else + { + __testeof = true; + break; + } + } + else + break; + } + + if (++__beg != __end) + __c = *__beg; + else + __testeof = true; + } + + // Digit grouping is checked. If grouping and found_grouping don't + // match, then get very very upset, and set failbit. + if (__found_grouping.size()) + { + // Add the ending grouping if a decimal or 'e'/'E' wasn't found. + if (!__found_dec && !__found_sci) + __found_grouping += static_cast(__sep_pos); + + if (!std::__verify_grouping(__lc->_M_grouping, + __lc->_M_grouping_size, + __found_grouping)) + __err |= ios_base::failbit; + } + + // Finish up. + if (__testeof) + __err |= ios_base::eofbit; + return __beg; + } + +_GLIBCXX_END_LDBL_NAMESPACE + +_GLIBCXX_BEGIN_LDBL_NAMESPACE + + template + template + _InIter + num_get<_CharT, _InIter>:: + _M_extract_int(_InIter __beg, _InIter __end, ios_base& __io, + ios_base::iostate& __err, _ValueT& __v) const + { + typedef char_traits<_CharT> __traits_type; + using __gnu_cxx::__add_unsigned; + typedef typename __add_unsigned<_ValueT>::__type __unsigned_type; + typedef __numpunct_cache<_CharT> __cache_type; + __use_cache<__cache_type> __uc; + const locale& __loc = __io._M_getloc(); + const __cache_type* __lc = __uc(__loc); + const _CharT* __lit = __lc->_M_atoms_in; + char_type __c = char_type(); + + // NB: Iff __basefield == 0, __base can change based on contents. + const ios_base::fmtflags __basefield = __io.flags() + & ios_base::basefield; + const bool __oct = __basefield == ios_base::oct; + int __base = __oct ? 8 : (__basefield == ios_base::hex ? 16 : 10); + + // True if __beg becomes equal to __end. + bool __testeof = __beg == __end; + + // First check for sign. + bool __negative = false; + if (!__testeof) + { + __c = *__beg; + if (numeric_limits<_ValueT>::is_signed) + __negative = __c == __lit[__num_base::_S_iminus]; + if ((__negative || __c == __lit[__num_base::_S_iplus]) + && !(__lc->_M_use_grouping && __c == __lc->_M_thousands_sep) + && !(__c == __lc->_M_decimal_point)) + { + if (++__beg != __end) + __c = *__beg; + else + __testeof = true; + } + } + + // Next, look for leading zeros and check required digits + // for base formats. + bool __found_zero = false; + int __sep_pos = 0; + while (!__testeof) + { + if (__lc->_M_use_grouping && __c == __lc->_M_thousands_sep + || __c == __lc->_M_decimal_point) + break; + else if (__c == __lit[__num_base::_S_izero] + && (!__found_zero || __base == 10)) + { + __found_zero = true; + ++__sep_pos; + if (__basefield == 0) + __base = 8; + if (__base == 8) + __sep_pos = 0; + } + else if (__found_zero + && (__c == __lit[__num_base::_S_ix] + || __c == __lit[__num_base::_S_iX])) + { + if (__basefield == 0) + __base = 16; + if (__base == 16) + { + __found_zero = false; + __sep_pos = 0; + } + else + break; + } + else + break; + + if (++__beg != __end) + { + __c = *__beg; + if (!__found_zero) + break; + } + else + __testeof = true; + } + + // At this point, base is determined. If not hex, only allow + // base digits as valid input. + const size_t __len = (__base == 16 ? __num_base::_S_iend + - __num_base::_S_izero : __base); + + // Extract. + string __found_grouping; + if (__lc->_M_use_grouping) + __found_grouping.reserve(32); + bool __testfail = false; + const __unsigned_type __max = __negative ? + -numeric_limits<_ValueT>::min() : numeric_limits<_ValueT>::max(); + const __unsigned_type __smax = __max / __base; + __unsigned_type __result = 0; + int __digit = 0; + const char_type* __lit_zero = __lit + __num_base::_S_izero; + + if (!__lc->_M_allocated) + // "C" locale + while (!__testeof) + { + __digit = _M_find(__lit_zero, __len, __c); + if (__digit == -1) + break; + + if (__result > __smax) + __testfail = true; + else + { + __result *= __base; + __testfail |= __result > __max - __digit; + __result += __digit; + ++__sep_pos; + } + + if (++__beg != __end) + __c = *__beg; + else + __testeof = true; + } + else + while (!__testeof) + { + // According to 22.2.2.1.2, p8-9, first look for thousands_sep + // and decimal_point. + if (__lc->_M_use_grouping && __c == __lc->_M_thousands_sep) + { + // NB: Thousands separator at the beginning of a string + // is a no-no, as is two consecutive thousands separators. + if (__sep_pos) + { + __found_grouping += static_cast(__sep_pos); + __sep_pos = 0; + } + else + { + __testfail = true; + break; + } + } + else if (__c == __lc->_M_decimal_point) + break; + else + { + const char_type* __q = + __traits_type::find(__lit_zero, __len, __c); + if (!__q) + break; + + __digit = __q - __lit_zero; + if (__digit > 15) + __digit -= 6; + if (__result > __smax) + __testfail = true; + else + { + __result *= __base; + __testfail |= __result > __max - __digit; + __result += __digit; + ++__sep_pos; + } + } + + if (++__beg != __end) + __c = *__beg; + else + __testeof = true; + } + + // Digit grouping is checked. If grouping and found_grouping don't + // match, then get very very upset, and set failbit. + if (__found_grouping.size()) + { + // Add the ending grouping. + __found_grouping += static_cast(__sep_pos); + + if (!std::__verify_grouping(__lc->_M_grouping, + __lc->_M_grouping_size, + __found_grouping)) + __err |= ios_base::failbit; + } + + if (!__testfail && (__sep_pos || __found_zero + || __found_grouping.size())) + __v = __negative ? -__result : __result; + else + __err |= ios_base::failbit; + + if (__testeof) + __err |= ios_base::eofbit; + return __beg; + } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 17. Bad bool parsing + template + _InIter + num_get<_CharT, _InIter>:: + do_get(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, bool& __v) const + { + if (!(__io.flags() & ios_base::boolalpha)) + { + // Parse bool values as long. + // NB: We can't just call do_get(long) here, as it might + // refer to a derived class. + long __l = -1; + __beg = _M_extract_int(__beg, __end, __io, __err, __l); + if (__l == 0 || __l == 1) + __v = __l; + else + __err |= ios_base::failbit; + } + else + { + // Parse bool values as alphanumeric. + typedef __numpunct_cache<_CharT> __cache_type; + __use_cache<__cache_type> __uc; + const locale& __loc = __io._M_getloc(); + const __cache_type* __lc = __uc(__loc); + + bool __testf = true; + bool __testt = true; + size_t __n; + bool __testeof = __beg == __end; + for (__n = 0; !__testeof; ++__n) + { + const char_type __c = *__beg; + + if (__testf) + if (__n < __lc->_M_falsename_size) + __testf = __c == __lc->_M_falsename[__n]; + else + break; + + if (__testt) + if (__n < __lc->_M_truename_size) + __testt = __c == __lc->_M_truename[__n]; + else + break; + + if (!__testf && !__testt) + break; + + if (++__beg == __end) + __testeof = true; + } + if (__testf && __n == __lc->_M_falsename_size) + __v = 0; + else if (__testt && __n == __lc->_M_truename_size) + __v = 1; + else + __err |= ios_base::failbit; + + if (__testeof) + __err |= ios_base::eofbit; + } + return __beg; + } + + template + _InIter + num_get<_CharT, _InIter>:: + do_get(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, long& __v) const + { return _M_extract_int(__beg, __end, __io, __err, __v); } + + template + _InIter + num_get<_CharT, _InIter>:: + do_get(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, unsigned short& __v) const + { return _M_extract_int(__beg, __end, __io, __err, __v); } + + template + _InIter + num_get<_CharT, _InIter>:: + do_get(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, unsigned int& __v) const + { return _M_extract_int(__beg, __end, __io, __err, __v); } + + template + _InIter + num_get<_CharT, _InIter>:: + do_get(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, unsigned long& __v) const + { return _M_extract_int(__beg, __end, __io, __err, __v); } + +#ifdef _GLIBCXX_USE_LONG_LONG + template + _InIter + num_get<_CharT, _InIter>:: + do_get(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, long long& __v) const + { return _M_extract_int(__beg, __end, __io, __err, __v); } + + template + _InIter + num_get<_CharT, _InIter>:: + do_get(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, unsigned long long& __v) const + { return _M_extract_int(__beg, __end, __io, __err, __v); } +#endif + + template + _InIter + num_get<_CharT, _InIter>:: + do_get(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, float& __v) const + { + string __xtrc; + __xtrc.reserve(32); + __beg = _M_extract_float(__beg, __end, __io, __err, __xtrc); + std::__convert_to_v(__xtrc.c_str(), __v, __err, _S_get_c_locale()); + return __beg; + } + + template + _InIter + num_get<_CharT, _InIter>:: + do_get(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, double& __v) const + { + string __xtrc; + __xtrc.reserve(32); + __beg = _M_extract_float(__beg, __end, __io, __err, __xtrc); + std::__convert_to_v(__xtrc.c_str(), __v, __err, _S_get_c_locale()); + return __beg; + } + +#if defined _GLIBCXX_LONG_DOUBLE_COMPAT && defined __LONG_DOUBLE_128__ + template + _InIter + num_get<_CharT, _InIter>:: + __do_get(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, double& __v) const + { + string __xtrc; + __xtrc.reserve(32); + __beg = _M_extract_float(__beg, __end, __io, __err, __xtrc); + std::__convert_to_v(__xtrc.c_str(), __v, __err, _S_get_c_locale()); + return __beg; + } +#endif + + template + _InIter + num_get<_CharT, _InIter>:: + do_get(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, long double& __v) const + { + string __xtrc; + __xtrc.reserve(32); + __beg = _M_extract_float(__beg, __end, __io, __err, __xtrc); + std::__convert_to_v(__xtrc.c_str(), __v, __err, _S_get_c_locale()); + return __beg; + } + + template + _InIter + num_get<_CharT, _InIter>:: + do_get(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, void*& __v) const + { + // Prepare for hex formatted input. + typedef ios_base::fmtflags fmtflags; + const fmtflags __fmt = __io.flags(); + __io.flags(__fmt & ~ios_base::basefield | ios_base::hex); + + unsigned long __ul; + __beg = _M_extract_int(__beg, __end, __io, __err, __ul); + + // Reset from hex formatted input. + __io.flags(__fmt); + + if (!(__err & ios_base::failbit)) + __v = reinterpret_cast(__ul); + return __beg; + } + + // For use by integer and floating-point types after they have been + // converted into a char_type string. + template + void + num_put<_CharT, _OutIter>:: + _M_pad(_CharT __fill, streamsize __w, ios_base& __io, + _CharT* __new, const _CharT* __cs, int& __len) const + { + // [22.2.2.2.2] Stage 3. + // If necessary, pad. + __pad<_CharT, char_traits<_CharT> >::_S_pad(__io, __fill, __new, __cs, + __w, __len, true); + __len = static_cast(__w); + } + +_GLIBCXX_END_LDBL_NAMESPACE + + template + int + __int_to_char(_CharT* __bufend, _ValueT __v, const _CharT* __lit, + ios_base::fmtflags __flags, bool __dec) + { + _CharT* __buf = __bufend; + if (__builtin_expect(__dec, true)) + { + // Decimal. + do + { + *--__buf = __lit[(__v % 10) + __num_base::_S_odigits]; + __v /= 10; + } + while (__v != 0); + } + else if ((__flags & ios_base::basefield) == ios_base::oct) + { + // Octal. + do + { + *--__buf = __lit[(__v & 0x7) + __num_base::_S_odigits]; + __v >>= 3; + } + while (__v != 0); + } + else + { + // Hex. + const bool __uppercase = __flags & ios_base::uppercase; + const int __case_offset = __uppercase ? __num_base::_S_oudigits + : __num_base::_S_odigits; + do + { + *--__buf = __lit[(__v & 0xf) + __case_offset]; + __v >>= 4; + } + while (__v != 0); + } + return __bufend - __buf; + } + +_GLIBCXX_BEGIN_LDBL_NAMESPACE + + template + void + num_put<_CharT, _OutIter>:: + _M_group_int(const char* __grouping, size_t __grouping_size, _CharT __sep, + ios_base&, _CharT* __new, _CharT* __cs, int& __len) const + { + _CharT* __p = std::__add_grouping(__new, __sep, __grouping, + __grouping_size, __cs, __cs + __len); + __len = __p - __new; + } + + template + template + _OutIter + num_put<_CharT, _OutIter>:: + _M_insert_int(_OutIter __s, ios_base& __io, _CharT __fill, + _ValueT __v) const + { + using __gnu_cxx::__add_unsigned; + typedef typename __add_unsigned<_ValueT>::__type __unsigned_type; + typedef __numpunct_cache<_CharT> __cache_type; + __use_cache<__cache_type> __uc; + const locale& __loc = __io._M_getloc(); + const __cache_type* __lc = __uc(__loc); + const _CharT* __lit = __lc->_M_atoms_out; + const ios_base::fmtflags __flags = __io.flags(); + + // Long enough to hold hex, dec, and octal representations. + const int __ilen = 5 * sizeof(_ValueT); + _CharT* __cs = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) + * __ilen)); + + // [22.2.2.2.2] Stage 1, numeric conversion to character. + // Result is returned right-justified in the buffer. + const ios_base::fmtflags __basefield = __flags & ios_base::basefield; + const bool __dec = (__basefield != ios_base::oct + && __basefield != ios_base::hex); + const __unsigned_type __u = (__v > 0 || !__dec) ? __v : -__v; + int __len = __int_to_char(__cs + __ilen, __u, __lit, __flags, __dec); + __cs += __ilen - __len; + + // Add grouping, if necessary. + if (__lc->_M_use_grouping) + { + // Grouping can add (almost) as many separators as the number + // of digits + space is reserved for numeric base or sign. + _CharT* __cs2 = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) + * (__len + 1) + * 2)); + _M_group_int(__lc->_M_grouping, __lc->_M_grouping_size, + __lc->_M_thousands_sep, __io, __cs2 + 2, __cs, __len); + __cs = __cs2 + 2; + } + + // Complete Stage 1, prepend numeric base or sign. + if (__builtin_expect(__dec, true)) + { + // Decimal. + if (__v >= 0) + { + if (__flags & ios_base::showpos + && numeric_limits<_ValueT>::is_signed) + *--__cs = __lit[__num_base::_S_oplus], ++__len; + } + else + *--__cs = __lit[__num_base::_S_ominus], ++__len; + } + else if (__flags & ios_base::showbase && __v) + { + if (__basefield == ios_base::oct) + *--__cs = __lit[__num_base::_S_odigits], ++__len; + else + { + // 'x' or 'X' + const bool __uppercase = __flags & ios_base::uppercase; + *--__cs = __lit[__num_base::_S_ox + __uppercase]; + // '0' + *--__cs = __lit[__num_base::_S_odigits]; + __len += 2; + } + } + + // Pad. + const streamsize __w = __io.width(); + if (__w > static_cast(__len)) + { + _CharT* __cs3 = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) + * __w)); + _M_pad(__fill, __w, __io, __cs3, __cs, __len); + __cs = __cs3; + } + __io.width(0); + + // [22.2.2.2.2] Stage 4. + // Write resulting, fully-formatted string to output iterator. + return std::__write(__s, __cs, __len); + } + + template + void + num_put<_CharT, _OutIter>:: + _M_group_float(const char* __grouping, size_t __grouping_size, + _CharT __sep, const _CharT* __p, _CharT* __new, + _CharT* __cs, int& __len) const + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 282. What types does numpunct grouping refer to? + // Add grouping, if necessary. + const int __declen = __p ? __p - __cs : __len; + _CharT* __p2 = std::__add_grouping(__new, __sep, __grouping, + __grouping_size, + __cs, __cs + __declen); + + // Tack on decimal part. + int __newlen = __p2 - __new; + if (__p) + { + char_traits<_CharT>::copy(__p2, __p, __len - __declen); + __newlen += __len - __declen; + } + __len = __newlen; + } + + // The following code uses vsnprintf (or vsprintf(), when + // _GLIBCXX_USE_C99 is not defined) to convert floating point values + // for insertion into a stream. An optimization would be to replace + // them with code that works directly on a wide buffer and then use + // __pad to do the padding. It would be good to replace them anyway + // to gain back the efficiency that C++ provides by knowing up front + // the type of the values to insert. Also, sprintf is dangerous + // since may lead to accidental buffer overruns. This + // implementation follows the C++ standard fairly directly as + // outlined in 22.2.2.2 [lib.locale.num.put] + template + template + _OutIter + num_put<_CharT, _OutIter>:: + _M_insert_float(_OutIter __s, ios_base& __io, _CharT __fill, char __mod, + _ValueT __v) const + { + typedef __numpunct_cache<_CharT> __cache_type; + __use_cache<__cache_type> __uc; + const locale& __loc = __io._M_getloc(); + const __cache_type* __lc = __uc(__loc); + + // Use default precision if out of range. + const streamsize __prec = __io.precision() < 0 ? 6 : __io.precision(); + + const int __max_digits = numeric_limits<_ValueT>::digits10; + + // [22.2.2.2.2] Stage 1, numeric conversion to character. + int __len; + // Long enough for the max format spec. + char __fbuf[16]; + __num_base::_S_format_float(__io, __fbuf, __mod); + +#ifdef _GLIBCXX_USE_C99 + // First try a buffer perhaps big enough (most probably sufficient + // for non-ios_base::fixed outputs) + int __cs_size = __max_digits * 3; + char* __cs = static_cast(__builtin_alloca(__cs_size)); + __len = std::__convert_from_v(_S_get_c_locale(), __cs, __cs_size, + __fbuf, __prec, __v); + + // If the buffer was not large enough, try again with the correct size. + if (__len >= __cs_size) + { + __cs_size = __len + 1; + __cs = static_cast(__builtin_alloca(__cs_size)); + __len = std::__convert_from_v(_S_get_c_locale(), __cs, __cs_size, + __fbuf, __prec, __v); + } +#else + // Consider the possibility of long ios_base::fixed outputs + const bool __fixed = __io.flags() & ios_base::fixed; + const int __max_exp = numeric_limits<_ValueT>::max_exponent10; + + // The size of the output string is computed as follows. + // ios_base::fixed outputs may need up to __max_exp + 1 chars + // for the integer part + __prec chars for the fractional part + // + 3 chars for sign, decimal point, '\0'. On the other hand, + // for non-fixed outputs __max_digits * 2 + __prec chars are + // largely sufficient. + const int __cs_size = __fixed ? __max_exp + __prec + 4 + : __max_digits * 2 + __prec; + char* __cs = static_cast(__builtin_alloca(__cs_size)); + __len = std::__convert_from_v(_S_get_c_locale(), __cs, 0, __fbuf, + __prec, __v); +#endif + + // [22.2.2.2.2] Stage 2, convert to char_type, using correct + // numpunct.decimal_point() values for '.' and adding grouping. + const ctype<_CharT>& __ctype = use_facet >(__loc); + + _CharT* __ws = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) + * __len)); + __ctype.widen(__cs, __cs + __len, __ws); + + // Replace decimal point. + _CharT* __wp = 0; + const char* __p = char_traits::find(__cs, __len, '.'); + if (__p) + { + __wp = __ws + (__p - __cs); + *__wp = __lc->_M_decimal_point; + } + + // Add grouping, if necessary. + // N.B. Make sure to not group things like 2e20, i.e., no decimal + // point, scientific notation. + if (__lc->_M_use_grouping + && (__wp || __len < 3 || (__cs[1] <= '9' && __cs[2] <= '9' + && __cs[1] >= '0' && __cs[2] >= '0'))) + { + // Grouping can add (almost) as many separators as the + // number of digits, but no more. + _CharT* __ws2 = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) + * __len * 2)); + + streamsize __off = 0; + if (__cs[0] == '-' || __cs[0] == '+') + { + __off = 1; + __ws2[0] = __ws[0]; + __len -= 1; + } + + _M_group_float(__lc->_M_grouping, __lc->_M_grouping_size, + __lc->_M_thousands_sep, __wp, __ws2 + __off, + __ws + __off, __len); + __len += __off; + + __ws = __ws2; + } + + // Pad. + const streamsize __w = __io.width(); + if (__w > static_cast(__len)) + { + _CharT* __ws3 = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) + * __w)); + _M_pad(__fill, __w, __io, __ws3, __ws, __len); + __ws = __ws3; + } + __io.width(0); + + // [22.2.2.2.2] Stage 4. + // Write resulting, fully-formatted string to output iterator. + return std::__write(__s, __ws, __len); + } + + template + _OutIter + num_put<_CharT, _OutIter>:: + do_put(iter_type __s, ios_base& __io, char_type __fill, bool __v) const + { + const ios_base::fmtflags __flags = __io.flags(); + if ((__flags & ios_base::boolalpha) == 0) + { + const long __l = __v; + __s = _M_insert_int(__s, __io, __fill, __l); + } + else + { + typedef __numpunct_cache<_CharT> __cache_type; + __use_cache<__cache_type> __uc; + const locale& __loc = __io._M_getloc(); + const __cache_type* __lc = __uc(__loc); + + const _CharT* __name = __v ? __lc->_M_truename + : __lc->_M_falsename; + int __len = __v ? __lc->_M_truename_size + : __lc->_M_falsename_size; + + const streamsize __w = __io.width(); + if (__w > static_cast(__len)) + { + _CharT* __cs + = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) + * __w)); + _M_pad(__fill, __w, __io, __cs, __name, __len); + __name = __cs; + } + __io.width(0); + __s = std::__write(__s, __name, __len); + } + return __s; + } + + template + _OutIter + num_put<_CharT, _OutIter>:: + do_put(iter_type __s, ios_base& __io, char_type __fill, long __v) const + { return _M_insert_int(__s, __io, __fill, __v); } + + template + _OutIter + num_put<_CharT, _OutIter>:: + do_put(iter_type __s, ios_base& __io, char_type __fill, + unsigned long __v) const + { return _M_insert_int(__s, __io, __fill, __v); } + +#ifdef _GLIBCXX_USE_LONG_LONG + template + _OutIter + num_put<_CharT, _OutIter>:: + do_put(iter_type __s, ios_base& __io, char_type __fill, long long __v) const + { return _M_insert_int(__s, __io, __fill, __v); } + + template + _OutIter + num_put<_CharT, _OutIter>:: + do_put(iter_type __s, ios_base& __io, char_type __fill, + unsigned long long __v) const + { return _M_insert_int(__s, __io, __fill, __v); } +#endif + + template + _OutIter + num_put<_CharT, _OutIter>:: + do_put(iter_type __s, ios_base& __io, char_type __fill, double __v) const + { return _M_insert_float(__s, __io, __fill, char(), __v); } + +#if defined _GLIBCXX_LONG_DOUBLE_COMPAT && defined __LONG_DOUBLE_128__ + template + _OutIter + num_put<_CharT, _OutIter>:: + __do_put(iter_type __s, ios_base& __io, char_type __fill, double __v) const + { return _M_insert_float(__s, __io, __fill, char(), __v); } +#endif + + template + _OutIter + num_put<_CharT, _OutIter>:: + do_put(iter_type __s, ios_base& __io, char_type __fill, + long double __v) const + { return _M_insert_float(__s, __io, __fill, 'L', __v); } + + template + _OutIter + num_put<_CharT, _OutIter>:: + do_put(iter_type __s, ios_base& __io, char_type __fill, + const void* __v) const + { + const ios_base::fmtflags __flags = __io.flags(); + const ios_base::fmtflags __fmt = ~(ios_base::basefield + | ios_base::uppercase + | ios_base::internal); + __io.flags(__flags & __fmt | (ios_base::hex | ios_base::showbase)); + + __s = _M_insert_int(__s, __io, __fill, + reinterpret_cast(__v)); + __io.flags(__flags); + return __s; + } + + template + template + _InIter + money_get<_CharT, _InIter>:: + _M_extract(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, string& __units) const + { + typedef char_traits<_CharT> __traits_type; + typedef typename string_type::size_type size_type; + typedef money_base::part part; + typedef __moneypunct_cache<_CharT, _Intl> __cache_type; + + const locale& __loc = __io._M_getloc(); + const ctype<_CharT>& __ctype = use_facet >(__loc); + + __use_cache<__cache_type> __uc; + const __cache_type* __lc = __uc(__loc); + const char_type* __lit = __lc->_M_atoms; + + // Deduced sign. + bool __negative = false; + // Sign size. + size_type __sign_size = 0; + // True if sign is mandatory. + const bool __mandatory_sign = (__lc->_M_positive_sign_size + && __lc->_M_negative_sign_size); + // String of grouping info from thousands_sep plucked from __units. + string __grouping_tmp; + if (__lc->_M_use_grouping) + __grouping_tmp.reserve(32); + // Last position before the decimal point. + int __last_pos = 0; + // Separator positions, then, possibly, fractional digits. + int __n = 0; + // If input iterator is in a valid state. + bool __testvalid = true; + // Flag marking when a decimal point is found. + bool __testdecfound = false; + + // The tentative returned string is stored here. + string __res; + __res.reserve(32); + + const char_type* __lit_zero = __lit + money_base::_S_zero; + const money_base::pattern __p = __lc->_M_neg_format; + for (int __i = 0; __i < 4 && __testvalid; ++__i) + { + const part __which = static_cast(__p.field[__i]); + switch (__which) + { + case money_base::symbol: + // According to 22.2.6.1.2, p2, symbol is required + // if (__io.flags() & ios_base::showbase), otherwise + // is optional and consumed only if other characters + // are needed to complete the format. + if (__io.flags() & ios_base::showbase || __sign_size > 1 + || __i == 0 + || (__i == 1 && (__mandatory_sign + || (static_cast(__p.field[0]) + == money_base::sign) + || (static_cast(__p.field[2]) + == money_base::space))) + || (__i == 2 && ((static_cast(__p.field[3]) + == money_base::value) + || __mandatory_sign + && (static_cast(__p.field[3]) + == money_base::sign)))) + { + const size_type __len = __lc->_M_curr_symbol_size; + size_type __j = 0; + for (; __beg != __end && __j < __len + && *__beg == __lc->_M_curr_symbol[__j]; + ++__beg, ++__j); + if (__j != __len + && (__j || __io.flags() & ios_base::showbase)) + __testvalid = false; + } + break; + case money_base::sign: + // Sign might not exist, or be more than one character long. + if (__lc->_M_positive_sign_size && __beg != __end + && *__beg == __lc->_M_positive_sign[0]) + { + __sign_size = __lc->_M_positive_sign_size; + ++__beg; + } + else if (__lc->_M_negative_sign_size && __beg != __end + && *__beg == __lc->_M_negative_sign[0]) + { + __negative = true; + __sign_size = __lc->_M_negative_sign_size; + ++__beg; + } + else if (__lc->_M_positive_sign_size + && !__lc->_M_negative_sign_size) + // "... if no sign is detected, the result is given the sign + // that corresponds to the source of the empty string" + __negative = true; + else if (__mandatory_sign) + __testvalid = false; + break; + case money_base::value: + // Extract digits, remove and stash away the + // grouping of found thousands separators. + for (; __beg != __end; ++__beg) + { + const char_type __c = *__beg; + const char_type* __q = __traits_type::find(__lit_zero, + 10, __c); + if (__q != 0) + { + __res += money_base::_S_atoms[__q - __lit]; + ++__n; + } + else if (__c == __lc->_M_decimal_point + && !__testdecfound) + { + __last_pos = __n; + __n = 0; + __testdecfound = true; + } + else if (__lc->_M_use_grouping + && __c == __lc->_M_thousands_sep + && !__testdecfound) + { + if (__n) + { + // Mark position for later analysis. + __grouping_tmp += static_cast(__n); + __n = 0; + } + else + { + __testvalid = false; + break; + } + } + else + break; + } + if (__res.empty()) + __testvalid = false; + break; + case money_base::space: + // At least one space is required. + if (__beg != __end && __ctype.is(ctype_base::space, *__beg)) + ++__beg; + else + __testvalid = false; + case money_base::none: + // Only if not at the end of the pattern. + if (__i != 3) + for (; __beg != __end + && __ctype.is(ctype_base::space, *__beg); ++__beg); + break; + } + } + + // Need to get the rest of the sign characters, if they exist. + if (__sign_size > 1 && __testvalid) + { + const char_type* __sign = __negative ? __lc->_M_negative_sign + : __lc->_M_positive_sign; + size_type __i = 1; + for (; __beg != __end && __i < __sign_size + && *__beg == __sign[__i]; ++__beg, ++__i); + + if (__i != __sign_size) + __testvalid = false; + } + + if (__testvalid) + { + // Strip leading zeros. + if (__res.size() > 1) + { + const size_type __first = __res.find_first_not_of('0'); + const bool __only_zeros = __first == string::npos; + if (__first) + __res.erase(0, __only_zeros ? __res.size() - 1 : __first); + } + + // 22.2.6.1.2, p4 + if (__negative && __res[0] != '0') + __res.insert(__res.begin(), '-'); + + // Test for grouping fidelity. + if (__grouping_tmp.size()) + { + // Add the ending grouping. + __grouping_tmp += static_cast(__testdecfound ? __last_pos + : __n); + if (!std::__verify_grouping(__lc->_M_grouping, + __lc->_M_grouping_size, + __grouping_tmp)) + __err |= ios_base::failbit; + } + + // Iff not enough digits were supplied after the decimal-point. + if (__testdecfound && __lc->_M_frac_digits > 0 + && __n != __lc->_M_frac_digits) + __testvalid = false; + } + + // Iff valid sequence is not recognized. + if (!__testvalid) + __err |= ios_base::failbit; + else + __units.swap(__res); + + // Iff no more characters are available. + if (__beg == __end) + __err |= ios_base::eofbit; + return __beg; + } + +#if defined _GLIBCXX_LONG_DOUBLE_COMPAT && defined __LONG_DOUBLE_128__ + template + _InIter + money_get<_CharT, _InIter>:: + __do_get(iter_type __beg, iter_type __end, bool __intl, ios_base& __io, + ios_base::iostate& __err, double& __units) const + { + string __str; + __beg = __intl ? _M_extract(__beg, __end, __io, __err, __str) + : _M_extract(__beg, __end, __io, __err, __str); + std::__convert_to_v(__str.c_str(), __units, __err, _S_get_c_locale()); + return __beg; + } +#endif + + template + _InIter + money_get<_CharT, _InIter>:: + do_get(iter_type __beg, iter_type __end, bool __intl, ios_base& __io, + ios_base::iostate& __err, long double& __units) const + { + string __str; + __beg = __intl ? _M_extract(__beg, __end, __io, __err, __str) + : _M_extract(__beg, __end, __io, __err, __str); + std::__convert_to_v(__str.c_str(), __units, __err, _S_get_c_locale()); + return __beg; + } + + template + _InIter + money_get<_CharT, _InIter>:: + do_get(iter_type __beg, iter_type __end, bool __intl, ios_base& __io, + ios_base::iostate& __err, string_type& __digits) const + { + typedef typename string::size_type size_type; + + const locale& __loc = __io._M_getloc(); + const ctype<_CharT>& __ctype = use_facet >(__loc); + + string __str; + __beg = __intl ? _M_extract(__beg, __end, __io, __err, __str) + : _M_extract(__beg, __end, __io, __err, __str); + const size_type __len = __str.size(); + if (__len) + { + __digits.resize(__len); + __ctype.widen(__str.data(), __str.data() + __len, &__digits[0]); + } + return __beg; + } + + template + template + _OutIter + money_put<_CharT, _OutIter>:: + _M_insert(iter_type __s, ios_base& __io, char_type __fill, + const string_type& __digits) const + { + typedef typename string_type::size_type size_type; + typedef money_base::part part; + typedef __moneypunct_cache<_CharT, _Intl> __cache_type; + + const locale& __loc = __io._M_getloc(); + const ctype<_CharT>& __ctype = use_facet >(__loc); + + __use_cache<__cache_type> __uc; + const __cache_type* __lc = __uc(__loc); + const char_type* __lit = __lc->_M_atoms; + + // Determine if negative or positive formats are to be used, and + // discard leading negative_sign if it is present. + const char_type* __beg = __digits.data(); + + money_base::pattern __p; + const char_type* __sign; + size_type __sign_size; + if (!(*__beg == __lit[money_base::_S_minus])) + { + __p = __lc->_M_pos_format; + __sign = __lc->_M_positive_sign; + __sign_size = __lc->_M_positive_sign_size; + } + else + { + __p = __lc->_M_neg_format; + __sign = __lc->_M_negative_sign; + __sign_size = __lc->_M_negative_sign_size; + if (__digits.size()) + ++__beg; + } + + // Look for valid numbers in the ctype facet within input digits. + size_type __len = __ctype.scan_not(ctype_base::digit, __beg, + __beg + __digits.size()) - __beg; + if (__len) + { + // Assume valid input, and attempt to format. + // Break down input numbers into base components, as follows: + // final_value = grouped units + (decimal point) + (digits) + string_type __value; + __value.reserve(2 * __len); + + // Add thousands separators to non-decimal digits, per + // grouping rules. + long __paddec = __len - __lc->_M_frac_digits; + if (__paddec > 0) + { + if (__lc->_M_frac_digits < 0) + __paddec = __len; + if (__lc->_M_grouping_size) + { + __value.assign(2 * __paddec, char_type()); + _CharT* __vend = + std::__add_grouping(&__value[0], __lc->_M_thousands_sep, + __lc->_M_grouping, + __lc->_M_grouping_size, + __beg, __beg + __paddec); + __value.erase(__vend - &__value[0]); + } + else + __value.assign(__beg, __paddec); + } + + // Deal with decimal point, decimal digits. + if (__lc->_M_frac_digits > 0) + { + __value += __lc->_M_decimal_point; + if (__paddec >= 0) + __value.append(__beg + __paddec, __lc->_M_frac_digits); + else + { + // Have to pad zeros in the decimal position. + __value.append(-__paddec, __lit[money_base::_S_zero]); + __value.append(__beg, __len); + } + } + + // Calculate length of resulting string. + const ios_base::fmtflags __f = __io.flags() + & ios_base::adjustfield; + __len = __value.size() + __sign_size; + __len += ((__io.flags() & ios_base::showbase) + ? __lc->_M_curr_symbol_size : 0); + + string_type __res; + __res.reserve(2 * __len); + + const size_type __width = static_cast(__io.width()); + const bool __testipad = (__f == ios_base::internal + && __len < __width); + // Fit formatted digits into the required pattern. + for (int __i = 0; __i < 4; ++__i) + { + const part __which = static_cast(__p.field[__i]); + switch (__which) + { + case money_base::symbol: + if (__io.flags() & ios_base::showbase) + __res.append(__lc->_M_curr_symbol, + __lc->_M_curr_symbol_size); + break; + case money_base::sign: + // Sign might not exist, or be more than one + // charater long. In that case, add in the rest + // below. + if (__sign_size) + __res += __sign[0]; + break; + case money_base::value: + __res += __value; + break; + case money_base::space: + // At least one space is required, but if internal + // formatting is required, an arbitrary number of + // fill spaces will be necessary. + if (__testipad) + __res.append(__width - __len, __fill); + else + __res += __fill; + break; + case money_base::none: + if (__testipad) + __res.append(__width - __len, __fill); + break; + } + } + + // Special case of multi-part sign parts. + if (__sign_size > 1) + __res.append(__sign + 1, __sign_size - 1); + + // Pad, if still necessary. + __len = __res.size(); + if (__width > __len) + { + if (__f == ios_base::left) + // After. + __res.append(__width - __len, __fill); + else + // Before. + __res.insert(0, __width - __len, __fill); + __len = __width; + } + + // Write resulting, fully-formatted string to output iterator. + __s = std::__write(__s, __res.data(), __len); + } + __io.width(0); + return __s; + } + +#if defined _GLIBCXX_LONG_DOUBLE_COMPAT && defined __LONG_DOUBLE_128__ + template + _OutIter + money_put<_CharT, _OutIter>:: + __do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill, + double __units) const + { return this->do_put(__s, __intl, __io, __fill, (long double) __units); } +#endif + + template + _OutIter + money_put<_CharT, _OutIter>:: + do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill, + long double __units) const + { + const locale __loc = __io.getloc(); + const ctype<_CharT>& __ctype = use_facet >(__loc); +#ifdef _GLIBCXX_USE_C99 + // First try a buffer perhaps big enough. + int __cs_size = 64; + char* __cs = static_cast(__builtin_alloca(__cs_size)); + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 328. Bad sprintf format modifier in money_put<>::do_put() + int __len = std::__convert_from_v(_S_get_c_locale(), __cs, __cs_size, + "%.*Lf", 0, __units); + // If the buffer was not large enough, try again with the correct size. + if (__len >= __cs_size) + { + __cs_size = __len + 1; + __cs = static_cast(__builtin_alloca(__cs_size)); + __len = std::__convert_from_v(_S_get_c_locale(), __cs, __cs_size, + "%.*Lf", 0, __units); + } +#else + // max_exponent10 + 1 for the integer part, + 2 for sign and '\0'. + const int __cs_size = numeric_limits::max_exponent10 + 3; + char* __cs = static_cast(__builtin_alloca(__cs_size)); + int __len = std::__convert_from_v(_S_get_c_locale(), __cs, 0, "%.*Lf", + 0, __units); +#endif + string_type __digits(__len, char_type()); + __ctype.widen(__cs, __cs + __len, &__digits[0]); + return __intl ? _M_insert(__s, __io, __fill, __digits) + : _M_insert(__s, __io, __fill, __digits); + } + + template + _OutIter + money_put<_CharT, _OutIter>:: + do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill, + const string_type& __digits) const + { return __intl ? _M_insert(__s, __io, __fill, __digits) + : _M_insert(__s, __io, __fill, __digits); } + +_GLIBCXX_END_LDBL_NAMESPACE + + // NB: Not especially useful. Without an ios_base object or some + // kind of locale reference, we are left clawing at the air where + // the side of the mountain used to be... + template + time_base::dateorder + time_get<_CharT, _InIter>::do_date_order() const + { return time_base::no_order; } + + // Expand a strftime format string and parse it. E.g., do_get_date() may + // pass %m/%d/%Y => extracted characters. + template + _InIter + time_get<_CharT, _InIter>:: + _M_extract_via_format(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, tm* __tm, + const _CharT* __format) const + { + const locale& __loc = __io._M_getloc(); + const __timepunct<_CharT>& __tp = use_facet<__timepunct<_CharT> >(__loc); + const ctype<_CharT>& __ctype = use_facet >(__loc); + const size_t __len = char_traits<_CharT>::length(__format); + + ios_base::iostate __tmperr = ios_base::goodbit; + for (size_t __i = 0; __beg != __end && __i < __len && !__tmperr; ++__i) + { + if (__ctype.narrow(__format[__i], 0) == '%') + { + // Verify valid formatting code, attempt to extract. + char __c = __ctype.narrow(__format[++__i], 0); + int __mem = 0; + if (__c == 'E' || __c == 'O') + __c = __ctype.narrow(__format[++__i], 0); + switch (__c) + { + const char* __cs; + _CharT __wcs[10]; + case 'a': + // Abbreviated weekday name [tm_wday] + const char_type* __days1[7]; + __tp._M_days_abbreviated(__days1); + __beg = _M_extract_name(__beg, __end, __tm->tm_wday, __days1, + 7, __io, __tmperr); + break; + case 'A': + // Weekday name [tm_wday]. + const char_type* __days2[7]; + __tp._M_days(__days2); + __beg = _M_extract_name(__beg, __end, __tm->tm_wday, __days2, + 7, __io, __tmperr); + break; + case 'h': + case 'b': + // Abbreviated month name [tm_mon] + const char_type* __months1[12]; + __tp._M_months_abbreviated(__months1); + __beg = _M_extract_name(__beg, __end, __tm->tm_mon, + __months1, 12, __io, __tmperr); + break; + case 'B': + // Month name [tm_mon]. + const char_type* __months2[12]; + __tp._M_months(__months2); + __beg = _M_extract_name(__beg, __end, __tm->tm_mon, + __months2, 12, __io, __tmperr); + break; + case 'c': + // Default time and date representation. + const char_type* __dt[2]; + __tp._M_date_time_formats(__dt); + __beg = _M_extract_via_format(__beg, __end, __io, __tmperr, + __tm, __dt[0]); + break; + case 'd': + // Day [01, 31]. [tm_mday] + __beg = _M_extract_num(__beg, __end, __tm->tm_mday, 1, 31, 2, + __io, __tmperr); + break; + case 'e': + // Day [1, 31], with single digits preceded by + // space. [tm_mday] + if (__ctype.is(ctype_base::space, *__beg)) + __beg = _M_extract_num(++__beg, __end, __tm->tm_mday, 1, 9, + 1, __io, __tmperr); + else + __beg = _M_extract_num(__beg, __end, __tm->tm_mday, 10, 31, + 2, __io, __tmperr); + break; + case 'D': + // Equivalent to %m/%d/%y.[tm_mon, tm_mday, tm_year] + __cs = "%m/%d/%y"; + __ctype.widen(__cs, __cs + 9, __wcs); + __beg = _M_extract_via_format(__beg, __end, __io, __tmperr, + __tm, __wcs); + break; + case 'H': + // Hour [00, 23]. [tm_hour] + __beg = _M_extract_num(__beg, __end, __tm->tm_hour, 0, 23, 2, + __io, __tmperr); + break; + case 'I': + // Hour [01, 12]. [tm_hour] + __beg = _M_extract_num(__beg, __end, __tm->tm_hour, 1, 12, 2, + __io, __tmperr); + break; + case 'm': + // Month [01, 12]. [tm_mon] + __beg = _M_extract_num(__beg, __end, __mem, 1, 12, 2, + __io, __tmperr); + if (!__tmperr) + __tm->tm_mon = __mem - 1; + break; + case 'M': + // Minute [00, 59]. [tm_min] + __beg = _M_extract_num(__beg, __end, __tm->tm_min, 0, 59, 2, + __io, __tmperr); + break; + case 'n': + if (__ctype.narrow(*__beg, 0) == '\n') + ++__beg; + else + __tmperr |= ios_base::failbit; + break; + case 'R': + // Equivalent to (%H:%M). + __cs = "%H:%M"; + __ctype.widen(__cs, __cs + 6, __wcs); + __beg = _M_extract_via_format(__beg, __end, __io, __tmperr, + __tm, __wcs); + break; + case 'S': + // Seconds. [tm_sec] + // [00, 60] in C99 (one leap-second), [00, 61] in C89. +#ifdef _GLIBCXX_USE_C99 + __beg = _M_extract_num(__beg, __end, __tm->tm_sec, 0, 60, 2, +#else + __beg = _M_extract_num(__beg, __end, __tm->tm_sec, 0, 61, 2, +#endif + __io, __tmperr); + break; + case 't': + if (__ctype.narrow(*__beg, 0) == '\t') + ++__beg; + else + __tmperr |= ios_base::failbit; + break; + case 'T': + // Equivalent to (%H:%M:%S). + __cs = "%H:%M:%S"; + __ctype.widen(__cs, __cs + 9, __wcs); + __beg = _M_extract_via_format(__beg, __end, __io, __tmperr, + __tm, __wcs); + break; + case 'x': + // Locale's date. + const char_type* __dates[2]; + __tp._M_date_formats(__dates); + __beg = _M_extract_via_format(__beg, __end, __io, __tmperr, + __tm, __dates[0]); + break; + case 'X': + // Locale's time. + const char_type* __times[2]; + __tp._M_time_formats(__times); + __beg = _M_extract_via_format(__beg, __end, __io, __tmperr, + __tm, __times[0]); + break; + case 'y': + case 'C': // C99 + // Two digit year. [tm_year] + __beg = _M_extract_num(__beg, __end, __tm->tm_year, 0, 99, 2, + __io, __tmperr); + break; + case 'Y': + // Year [1900). [tm_year] + __beg = _M_extract_num(__beg, __end, __mem, 0, 9999, 4, + __io, __tmperr); + if (!__tmperr) + __tm->tm_year = __mem - 1900; + break; + case 'Z': + // Timezone info. + if (__ctype.is(ctype_base::upper, *__beg)) + { + int __tmp; + __beg = _M_extract_name(__beg, __end, __tmp, + __timepunct_cache<_CharT>::_S_timezones, + 14, __io, __tmperr); + + // GMT requires special effort. + if (__beg != __end && !__tmperr && __tmp == 0 + && (*__beg == __ctype.widen('-') + || *__beg == __ctype.widen('+'))) + { + __beg = _M_extract_num(__beg, __end, __tmp, 0, 23, 2, + __io, __tmperr); + __beg = _M_extract_num(__beg, __end, __tmp, 0, 59, 2, + __io, __tmperr); + } + } + else + __tmperr |= ios_base::failbit; + break; + default: + // Not recognized. + __tmperr |= ios_base::failbit; + } + } + else + { + // Verify format and input match, extract and discard. + if (__format[__i] == *__beg) + ++__beg; + else + __tmperr |= ios_base::failbit; + } + } + + if (__tmperr) + __err |= ios_base::failbit; + + return __beg; + } + + template + _InIter + time_get<_CharT, _InIter>:: + _M_extract_num(iter_type __beg, iter_type __end, int& __member, + int __min, int __max, size_t __len, + ios_base& __io, ios_base::iostate& __err) const + { + const locale& __loc = __io._M_getloc(); + const ctype<_CharT>& __ctype = use_facet >(__loc); + + // As-is works for __len = 1, 2, 4, the values actually used. + int __mult = __len == 2 ? 10 : (__len == 4 ? 1000 : 1); + + ++__min; + size_t __i = 0; + int __value = 0; + for (; __beg != __end && __i < __len; ++__beg, ++__i) + { + const char __c = __ctype.narrow(*__beg, '*'); + if (__c >= '0' && __c <= '9') + { + __value = __value * 10 + (__c - '0'); + const int __valuec = __value * __mult; + if (__valuec > __max || __valuec + __mult < __min) + break; + __mult /= 10; + } + else + break; + } + if (__i == __len) + __member = __value; + else + __err |= ios_base::failbit; + + return __beg; + } + + // Assumptions: + // All elements in __names are unique. + template + _InIter + time_get<_CharT, _InIter>:: + _M_extract_name(iter_type __beg, iter_type __end, int& __member, + const _CharT** __names, size_t __indexlen, + ios_base& __io, ios_base::iostate& __err) const + { + typedef char_traits<_CharT> __traits_type; + const locale& __loc = __io._M_getloc(); + const ctype<_CharT>& __ctype = use_facet >(__loc); + + int* __matches = static_cast(__builtin_alloca(sizeof(int) + * __indexlen)); + size_t __nmatches = 0; + size_t __pos = 0; + bool __testvalid = true; + const char_type* __name; + + // Look for initial matches. + // NB: Some of the locale data is in the form of all lowercase + // names, and some is in the form of initially-capitalized + // names. Look for both. + if (__beg != __end) + { + const char_type __c = *__beg; + for (size_t __i1 = 0; __i1 < __indexlen; ++__i1) + if (__c == __names[__i1][0] + || __c == __ctype.toupper(__names[__i1][0])) + __matches[__nmatches++] = __i1; + } + + while (__nmatches > 1) + { + // Find smallest matching string. + size_t __minlen = __traits_type::length(__names[__matches[0]]); + for (size_t __i2 = 1; __i2 < __nmatches; ++__i2) + __minlen = std::min(__minlen, + __traits_type::length(__names[__matches[__i2]])); + ++__beg, ++__pos; + if (__pos < __minlen && __beg != __end) + for (size_t __i3 = 0; __i3 < __nmatches;) + { + __name = __names[__matches[__i3]]; + if (!(__name[__pos] == *__beg)) + __matches[__i3] = __matches[--__nmatches]; + else + ++__i3; + } + else + break; + } + + if (__nmatches == 1) + { + // Make sure found name is completely extracted. + ++__beg, ++__pos; + __name = __names[__matches[0]]; + const size_t __len = __traits_type::length(__name); + while (__pos < __len && __beg != __end && __name[__pos] == *__beg) + ++__beg, ++__pos; + + if (__len == __pos) + __member = __matches[0]; + else + __testvalid = false; + } + else + __testvalid = false; + if (!__testvalid) + __err |= ios_base::failbit; + + return __beg; + } + + template + _InIter + time_get<_CharT, _InIter>:: + do_get_time(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, tm* __tm) const + { + const locale& __loc = __io._M_getloc(); + const __timepunct<_CharT>& __tp = use_facet<__timepunct<_CharT> >(__loc); + const char_type* __times[2]; + __tp._M_time_formats(__times); + __beg = _M_extract_via_format(__beg, __end, __io, __err, + __tm, __times[0]); + if (__beg == __end) + __err |= ios_base::eofbit; + return __beg; + } + + template + _InIter + time_get<_CharT, _InIter>:: + do_get_date(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, tm* __tm) const + { + const locale& __loc = __io._M_getloc(); + const __timepunct<_CharT>& __tp = use_facet<__timepunct<_CharT> >(__loc); + const char_type* __dates[2]; + __tp._M_date_formats(__dates); + __beg = _M_extract_via_format(__beg, __end, __io, __err, + __tm, __dates[0]); + if (__beg == __end) + __err |= ios_base::eofbit; + return __beg; + } + + template + _InIter + time_get<_CharT, _InIter>:: + do_get_weekday(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, tm* __tm) const + { + typedef char_traits<_CharT> __traits_type; + const locale& __loc = __io._M_getloc(); + const __timepunct<_CharT>& __tp = use_facet<__timepunct<_CharT> >(__loc); + const ctype<_CharT>& __ctype = use_facet >(__loc); + const char_type* __days[7]; + __tp._M_days_abbreviated(__days); + int __tmpwday; + ios_base::iostate __tmperr = ios_base::goodbit; + __beg = _M_extract_name(__beg, __end, __tmpwday, __days, 7, + __io, __tmperr); + + // Check to see if non-abbreviated name exists, and extract. + // NB: Assumes both _M_days and _M_days_abbreviated organized in + // exact same order, first to last, such that the resulting + // __days array with the same index points to a day, and that + // day's abbreviated form. + // NB: Also assumes that an abbreviated name is a subset of the name. + if (!__tmperr && __beg != __end) + { + size_t __pos = __traits_type::length(__days[__tmpwday]); + __tp._M_days(__days); + const char_type* __name = __days[__tmpwday]; + if (__name[__pos] == *__beg) + { + // Extract the rest of it. + const size_t __len = __traits_type::length(__name); + while (__pos < __len && __beg != __end + && __name[__pos] == *__beg) + ++__beg, ++__pos; + if (__len != __pos) + __tmperr |= ios_base::failbit; + } + } + if (!__tmperr) + __tm->tm_wday = __tmpwday; + else + __err |= ios_base::failbit; + + if (__beg == __end) + __err |= ios_base::eofbit; + return __beg; + } + + template + _InIter + time_get<_CharT, _InIter>:: + do_get_monthname(iter_type __beg, iter_type __end, + ios_base& __io, ios_base::iostate& __err, tm* __tm) const + { + typedef char_traits<_CharT> __traits_type; + const locale& __loc = __io._M_getloc(); + const __timepunct<_CharT>& __tp = use_facet<__timepunct<_CharT> >(__loc); + const ctype<_CharT>& __ctype = use_facet >(__loc); + const char_type* __months[12]; + __tp._M_months_abbreviated(__months); + int __tmpmon; + ios_base::iostate __tmperr = ios_base::goodbit; + __beg = _M_extract_name(__beg, __end, __tmpmon, __months, 12, + __io, __tmperr); + + // Check to see if non-abbreviated name exists, and extract. + // NB: Assumes both _M_months and _M_months_abbreviated organized in + // exact same order, first to last, such that the resulting + // __months array with the same index points to a month, and that + // month's abbreviated form. + // NB: Also assumes that an abbreviated name is a subset of the name. + if (!__tmperr && __beg != __end) + { + size_t __pos = __traits_type::length(__months[__tmpmon]); + __tp._M_months(__months); + const char_type* __name = __months[__tmpmon]; + if (__name[__pos] == *__beg) + { + // Extract the rest of it. + const size_t __len = __traits_type::length(__name); + while (__pos < __len && __beg != __end + && __name[__pos] == *__beg) + ++__beg, ++__pos; + if (__len != __pos) + __tmperr |= ios_base::failbit; + } + } + if (!__tmperr) + __tm->tm_mon = __tmpmon; + else + __err |= ios_base::failbit; + + if (__beg == __end) + __err |= ios_base::eofbit; + return __beg; + } + + template + _InIter + time_get<_CharT, _InIter>:: + do_get_year(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, tm* __tm) const + { + const locale& __loc = __io._M_getloc(); + const ctype<_CharT>& __ctype = use_facet >(__loc); + + size_t __i = 0; + int __value = 0; + for (; __beg != __end && __i < 4; ++__beg, ++__i) + { + const char __c = __ctype.narrow(*__beg, '*'); + if (__c >= '0' && __c <= '9') + __value = __value * 10 + (__c - '0'); + else + break; + } + if (__i == 2 || __i == 4) + __tm->tm_year = __i == 2 ? __value : __value - 1900; + else + __err |= ios_base::failbit; + + if (__beg == __end) + __err |= ios_base::eofbit; + return __beg; + } + + template + _OutIter + time_put<_CharT, _OutIter>:: + put(iter_type __s, ios_base& __io, char_type __fill, const tm* __tm, + const _CharT* __beg, const _CharT* __end) const + { + const locale& __loc = __io._M_getloc(); + ctype<_CharT> const& __ctype = use_facet >(__loc); + for (; __beg != __end; ++__beg) + if (__ctype.narrow(*__beg, 0) != '%') + { + *__s = *__beg; + ++__s; + } + else if (++__beg != __end) + { + char __format; + char __mod = 0; + const char __c = __ctype.narrow(*__beg, 0); + if (__c != 'E' && __c != 'O') + __format = __c; + else if (++__beg != __end) + { + __mod = __c; + __format = __ctype.narrow(*__beg, 0); + } + else + break; + __s = this->do_put(__s, __io, __fill, __tm, __format, __mod); + } + else + break; + return __s; + } + + template + _OutIter + time_put<_CharT, _OutIter>:: + do_put(iter_type __s, ios_base& __io, char_type, const tm* __tm, + char __format, char __mod) const + { + const locale& __loc = __io._M_getloc(); + ctype<_CharT> const& __ctype = use_facet >(__loc); + __timepunct<_CharT> const& __tp = use_facet<__timepunct<_CharT> >(__loc); + + // NB: This size is arbitrary. Should this be a data member, + // initialized at construction? + const size_t __maxlen = 128; + char_type* __res = + static_cast(__builtin_alloca(sizeof(char_type) * __maxlen)); + + // NB: In IEE 1003.1-200x, and perhaps other locale models, it + // is possible that the format character will be longer than one + // character. Possibilities include 'E' or 'O' followed by a + // format character: if __mod is not the default argument, assume + // it's a valid modifier. + char_type __fmt[4]; + __fmt[0] = __ctype.widen('%'); + if (!__mod) + { + __fmt[1] = __format; + __fmt[2] = char_type(); + } + else + { + __fmt[1] = __mod; + __fmt[2] = __format; + __fmt[3] = char_type(); + } + + __tp._M_put(__res, __maxlen, __fmt, __tm); + + // Write resulting, fully-formatted string to output iterator. + return std::__write(__s, __res, char_traits::length(__res)); + } + + // Generic version does nothing. + template + int + collate<_CharT>::_M_compare(const _CharT*, const _CharT*) const + { return 0; } + + // Generic version does nothing. + template + size_t + collate<_CharT>::_M_transform(_CharT*, const _CharT*, size_t) const + { return 0; } + + template + int + collate<_CharT>:: + do_compare(const _CharT* __lo1, const _CharT* __hi1, + const _CharT* __lo2, const _CharT* __hi2) const + { + // strcoll assumes zero-terminated strings so we make a copy + // and then put a zero at the end. + const string_type __one(__lo1, __hi1); + const string_type __two(__lo2, __hi2); + + const _CharT* __p = __one.c_str(); + const _CharT* __pend = __one.data() + __one.length(); + const _CharT* __q = __two.c_str(); + const _CharT* __qend = __two.data() + __two.length(); + + // strcoll stops when it sees a nul character so we break + // the strings into zero-terminated substrings and pass those + // to strcoll. + for (;;) + { + const int __res = _M_compare(__p, __q); + if (__res) + return __res; + + __p += char_traits<_CharT>::length(__p); + __q += char_traits<_CharT>::length(__q); + if (__p == __pend && __q == __qend) + return 0; + else if (__p == __pend) + return -1; + else if (__q == __qend) + return 1; + + __p++; + __q++; + } + } + + template + typename collate<_CharT>::string_type + collate<_CharT>:: + do_transform(const _CharT* __lo, const _CharT* __hi) const + { + string_type __ret; + + // strxfrm assumes zero-terminated strings so we make a copy + const string_type __str(__lo, __hi); + + const _CharT* __p = __str.c_str(); + const _CharT* __pend = __str.data() + __str.length(); + + size_t __len = (__hi - __lo) * 2; + + _CharT* __c = new _CharT[__len]; + + try + { + // strxfrm stops when it sees a nul character so we break + // the string into zero-terminated substrings and pass those + // to strxfrm. + for (;;) + { + // First try a buffer perhaps big enough. + size_t __res = _M_transform(__c, __p, __len); + // If the buffer was not large enough, try again with the + // correct size. + if (__res >= __len) + { + __len = __res + 1; + delete [] __c, __c = 0; + __c = new _CharT[__len]; + __res = _M_transform(__c, __p, __len); + } + + __ret.append(__c, __res); + __p += char_traits<_CharT>::length(__p); + if (__p == __pend) + break; + + __p++; + __ret.push_back(_CharT()); + } + } + catch(...) + { + delete [] __c; + __throw_exception_again; + } + + delete [] __c; + + return __ret; + } + + template + long + collate<_CharT>:: + do_hash(const _CharT* __lo, const _CharT* __hi) const + { + unsigned long __val = 0; + for (; __lo < __hi; ++__lo) + __val = *__lo + ((__val << 7) | + (__val >> (numeric_limits::digits - 7))); + return static_cast(__val); + } + + // Construct correctly padded string, as per 22.2.2.2.2 + // Assumes + // __newlen > __oldlen + // __news is allocated for __newlen size + // Used by both num_put and ostream inserters: if __num, + // internal-adjusted objects are padded according to the rules below + // concerning 0[xX] and +-, otherwise, exactly as right-adjusted + // ones are. + + // NB: Of the two parameters, _CharT can be deduced from the + // function arguments. The other (_Traits) has to be explicitly specified. + template + void + __pad<_CharT, _Traits>::_S_pad(ios_base& __io, _CharT __fill, + _CharT* __news, const _CharT* __olds, + const streamsize __newlen, + const streamsize __oldlen, const bool __num) + { + const size_t __plen = static_cast(__newlen - __oldlen); + const ios_base::fmtflags __adjust = __io.flags() & ios_base::adjustfield; + + // Padding last. + if (__adjust == ios_base::left) + { + _Traits::copy(__news, const_cast<_CharT*>(__olds), __oldlen); + _Traits::assign(__news + __oldlen, __plen, __fill); + return; + } + + size_t __mod = 0; + if (__adjust == ios_base::internal && __num) + { + // Pad after the sign, if there is one. + // Pad after 0[xX], if there is one. + // Who came up with these rules, anyway? Jeeze. + const locale& __loc = __io._M_getloc(); + const ctype<_CharT>& __ctype = use_facet >(__loc); + + const bool __testsign = (__ctype.widen('-') == __olds[0] + || __ctype.widen('+') == __olds[0]); + const bool __testhex = (__ctype.widen('0') == __olds[0] + && __oldlen > 1 + && (__ctype.widen('x') == __olds[1] + || __ctype.widen('X') == __olds[1])); + if (__testhex) + { + __news[0] = __olds[0]; + __news[1] = __olds[1]; + __mod = 2; + __news += 2; + } + else if (__testsign) + { + __news[0] = __olds[0]; + __mod = 1; + ++__news; + } + // else Padding first. + } + _Traits::assign(__news, __plen, __fill); + _Traits::copy(__news + __plen, const_cast<_CharT*>(__olds + __mod), + __oldlen - __mod); + } + + bool + __verify_grouping(const char* __grouping, size_t __grouping_size, + const string& __grouping_tmp) + { + const size_t __n = __grouping_tmp.size() - 1; + const size_t __min = std::min(__n, size_t(__grouping_size - 1)); + size_t __i = __n; + bool __test = true; + + // Parsed number groupings have to match the + // numpunct::grouping string exactly, starting at the + // right-most point of the parsed sequence of elements ... + for (size_t __j = 0; __j < __min && __test; --__i, ++__j) + __test = __grouping_tmp[__i] == __grouping[__j]; + for (; __i && __test; --__i) + __test = __grouping_tmp[__i] == __grouping[__min]; + // ... but the first parsed grouping can be <= numpunct + // grouping (only do the check if the numpunct char is > 0 + // because <= 0 means any size is ok). + if (static_cast(__grouping[__min]) > 0) + __test &= __grouping_tmp[0] <= __grouping[__min]; + return __test; + } + + template + _CharT* + __add_grouping(_CharT* __s, _CharT __sep, + const char* __gbeg, size_t __gsize, + const _CharT* __first, const _CharT* __last) + { + size_t __idx = 0; + size_t __ctr = 0; + + while (__last - __first > __gbeg[__idx] + && static_cast(__gbeg[__idx]) > 0) + { + __last -= __gbeg[__idx]; + __idx < __gsize - 1 ? ++__idx : ++__ctr; + } + + while (__first != __last) + *__s++ = *__first++; + + while (__ctr--) + { + *__s++ = __sep; + for (char __i = __gbeg[__idx]; __i > 0; --__i) + *__s++ = *__first++; + } + + while (__idx--) + { + *__s++ = __sep; + for (char __i = __gbeg[__idx]; __i > 0; --__i) + *__s++ = *__first++; + } + + return __s; + } + + // Inhibit implicit instantiations for required instantiations, + // which are defined via explicit instantiations elsewhere. + // NB: This syntax is a GNU extension. +#if _GLIBCXX_EXTERN_TEMPLATE + extern template class moneypunct; + extern template class moneypunct; + extern template class moneypunct_byname; + extern template class moneypunct_byname; + extern template class _GLIBCXX_LDBL_NAMESPACE money_get; + extern template class _GLIBCXX_LDBL_NAMESPACE money_put; + extern template class numpunct; + extern template class numpunct_byname; + extern template class _GLIBCXX_LDBL_NAMESPACE num_get; + extern template class _GLIBCXX_LDBL_NAMESPACE num_put; + extern template class __timepunct; + extern template class time_put; + extern template class time_put_byname; + extern template class time_get; + extern template class time_get_byname; + extern template class messages; + extern template class messages_byname; + extern template class ctype_byname; + extern template class codecvt_byname; + extern template class collate; + extern template class collate_byname; + + extern template + const codecvt& + use_facet >(const locale&); + + extern template + const collate& + use_facet >(const locale&); + + extern template + const numpunct& + use_facet >(const locale&); + + extern template + const num_put& + use_facet >(const locale&); + + extern template + const num_get& + use_facet >(const locale&); + + extern template + const moneypunct& + use_facet >(const locale&); + + extern template + const moneypunct& + use_facet >(const locale&); + + extern template + const money_put& + use_facet >(const locale&); + + extern template + const money_get& + use_facet >(const locale&); + + extern template + const __timepunct& + use_facet<__timepunct >(const locale&); + + extern template + const time_put& + use_facet >(const locale&); + + extern template + const time_get& + use_facet >(const locale&); + + extern template + const messages& + use_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet<__timepunct >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + +#ifdef _GLIBCXX_USE_WCHAR_T + extern template class moneypunct; + extern template class moneypunct; + extern template class moneypunct_byname; + extern template class moneypunct_byname; + extern template class _GLIBCXX_LDBL_NAMESPACE money_get; + extern template class _GLIBCXX_LDBL_NAMESPACE money_put; + extern template class numpunct; + extern template class numpunct_byname; + extern template class _GLIBCXX_LDBL_NAMESPACE num_get; + extern template class _GLIBCXX_LDBL_NAMESPACE num_put; + extern template class __timepunct; + extern template class time_put; + extern template class time_put_byname; + extern template class time_get; + extern template class time_get_byname; + extern template class messages; + extern template class messages_byname; + extern template class ctype_byname; + extern template class codecvt_byname; + extern template class collate; + extern template class collate_byname; + + extern template + const codecvt& + use_facet >(locale const&); + + extern template + const collate& + use_facet >(const locale&); + + extern template + const numpunct& + use_facet >(const locale&); + + extern template + const num_put& + use_facet >(const locale&); + + extern template + const num_get& + use_facet >(const locale&); + + extern template + const moneypunct& + use_facet >(const locale&); + + extern template + const moneypunct& + use_facet >(const locale&); + + extern template + const money_put& + use_facet >(const locale&); + + extern template + const money_get& + use_facet >(const locale&); + + extern template + const __timepunct& + use_facet<__timepunct >(const locale&); + + extern template + const time_put& + use_facet >(const locale&); + + extern template + const time_get& + use_facet >(const locale&); + + extern template + const messages& + use_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet<__timepunct >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); +#endif +#endif + +} // namespace std + +#endif diff --git a/cpp_src/localefwd.h b/cpp_src/localefwd.h new file mode 100644 index 0000000..1a6a07b --- /dev/null +++ b/cpp_src/localefwd.h @@ -0,0 +1,197 @@ +// Locale support -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file localefwd.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 22.1 Locales +// + +#ifndef _LOCALE_FWD_H +#define _LOCALE_FWD_H 1 + +#pragma GCC system_header + +#include +#include // Defines __c_locale, config-specific includes +#include // For ostreambuf_iterator, istreambuf_iterator +#include + +namespace std { + + // 22.1.1 Locale + class locale; + + // 22.1.3 Convenience interfaces + template + inline bool + isspace(_CharT, const locale&); + + template + inline bool + isprint(_CharT, const locale&); + + template + inline bool + iscntrl(_CharT, const locale&); + + template + inline bool + isupper(_CharT, const locale&); + + template + inline bool + islower(_CharT, const locale&); + + template + inline bool + isalpha(_CharT, const locale&); + + template + inline bool + isdigit(_CharT, const locale&); + + template + inline bool + ispunct(_CharT, const locale&); + + template + inline bool + isxdigit(_CharT, const locale&); + + template + inline bool + isalnum(_CharT, const locale&); + + template + inline bool + isgraph(_CharT, const locale&); + + template + inline _CharT + toupper(_CharT, const locale&); + + template + inline _CharT + tolower(_CharT, const locale&); + + // 22.2.1 and 22.2.1.3 ctype + class ctype_base; + template + class ctype; + template<> class ctype; +#ifdef _GLIBCXX_USE_WCHAR_T + template<> class ctype; +#endif + template + class ctype_byname; + // NB: Specialized for char and wchar_t in locale_facets.h. + + class codecvt_base; + class __enc_traits; + template + class codecvt; + template<> class codecvt; +#ifdef _GLIBCXX_USE_WCHAR_T + template<> class codecvt; +#endif + template + class codecvt_byname; + + // 22.2.2 and 22.2.3 numeric +_GLIBCXX_BEGIN_LDBL_NAMESPACE + template > + class num_get; + template > + class num_put; +_GLIBCXX_END_LDBL_NAMESPACE + template class numpunct; + template class numpunct_byname; + + // 22.2.4 collation + template + class collate; + template class + collate_byname; + + // 22.2.5 date and time + class time_base; + template > + class time_get; + template > + class time_get_byname; + template > + class time_put; + template > + class time_put_byname; + + // 22.2.6 money + class money_base; +_GLIBCXX_BEGIN_LDBL_NAMESPACE + template > + class money_get; + template > + class money_put; +_GLIBCXX_END_LDBL_NAMESPACE + template + class moneypunct; + template + class moneypunct_byname; + + // 22.2.7 message retrieval + class messages_base; + template + class messages; + template + class messages_byname; + + template + bool + has_facet(const locale& __loc) throw(); + + template + const _Facet& + use_facet(const locale& __loc); + + template + inline const _Facet& + __check_facet(const _Facet* __f) + { + if (!__f) + __throw_bad_cast(); + return *__f; + } + +} // namespace std + +#endif diff --git a/cpp_src/map b/cpp_src/map new file mode 100644 index 0000000..a7e8f9c --- /dev/null +++ b/cpp_src/map @@ -0,0 +1,73 @@ +// -*- C++ -*- + +// Copyright (C) 2001, 2002 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file include/map + * This is a Standard C++ Library header. + */ + +#ifndef _GLIBCXX_MAP +#define _GLIBCXX_MAP 1 + +#pragma GCC system_header + +#include +#include +#include + +#ifdef _GLIBCXX_DEBUG +# include +#endif + +#endif /* _GLIBCXX_MAP */ diff --git a/cpp_src/mask_array.h b/cpp_src/mask_array.h new file mode 100644 index 0000000..0d69084 --- /dev/null +++ b/cpp_src/mask_array.h @@ -0,0 +1,204 @@ +// The template and inlines for the -*- C++ -*- mask_array class. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2004, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file mask_array.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// Written by Gabriel Dos Reis + +#ifndef _MASK_ARRAY_H +#define _MASK_ARRAY_H 1 + +#pragma GCC system_header + +namespace std { + + /** + * @brief Reference to selected subset of an array. + * + * A mask_array is a reference to the actual elements of an array specified + * by a bitmask in the form of an array of bool. The way to get a + * mask_array is to call operator[](valarray) on a valarray. The + * returned mask_array then permits carrying operations out on the + * referenced subset of elements in the original valarray. + * + * For example, if a mask_array is obtained using the array (false, true, + * false, true) as an argument, the mask array has two elements referring + * to array[1] and array[3] in the underlying array. + * + * @param Tp Element type. + */ + template + class mask_array + { + public: + typedef _Tp value_type; + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 253. valarray helper functions are almost entirely useless + + /// Copy constructor. Both slices refer to the same underlying array. + mask_array (const mask_array&); + + /// Assignment operator. Assigns elements to corresponding elements + /// of @a a. + mask_array& operator=(const mask_array&); + + void operator=(const valarray<_Tp>&) const; + /// Multiply slice elements by corresponding elements of @a v. + void operator*=(const valarray<_Tp>&) const; + /// Divide slice elements by corresponding elements of @a v. + void operator/=(const valarray<_Tp>&) const; + /// Modulo slice elements by corresponding elements of @a v. + void operator%=(const valarray<_Tp>&) const; + /// Add corresponding elements of @a v to slice elements. + void operator+=(const valarray<_Tp>&) const; + /// Subtract corresponding elements of @a v from slice elements. + void operator-=(const valarray<_Tp>&) const; + /// Logical xor slice elements with corresponding elements of @a v. + void operator^=(const valarray<_Tp>&) const; + /// Logical and slice elements with corresponding elements of @a v. + void operator&=(const valarray<_Tp>&) const; + /// Logical or slice elements with corresponding elements of @a v. + void operator|=(const valarray<_Tp>&) const; + /// Left shift slice elements by corresponding elements of @a v. + void operator<<=(const valarray<_Tp>&) const; + /// Right shift slice elements by corresponding elements of @a v. + void operator>>=(const valarray<_Tp>&) const; + /// Assign all slice elements to @a t. + void operator=(const _Tp&) const; + + // ~mask_array (); + + template + void operator=(const _Expr<_Dom,_Tp>&) const; + template + void operator*=(const _Expr<_Dom,_Tp>&) const; + template + void operator/=(const _Expr<_Dom,_Tp>&) const; + template + void operator%=(const _Expr<_Dom,_Tp>&) const; + template + void operator+=(const _Expr<_Dom,_Tp>&) const; + template + void operator-=(const _Expr<_Dom,_Tp>&) const; + template + void operator^=(const _Expr<_Dom,_Tp>&) const; + template + void operator&=(const _Expr<_Dom,_Tp>&) const; + template + void operator|=(const _Expr<_Dom,_Tp>&) const; + template + void operator<<=(const _Expr<_Dom,_Tp>&) const; + template + void operator>>=(const _Expr<_Dom,_Tp>&) const; + + private: + mask_array(_Array<_Tp>, size_t, _Array); + friend class valarray<_Tp>; + + const size_t _M_sz; + const _Array _M_mask; + const _Array<_Tp> _M_array; + + // not implemented + mask_array(); + }; + + template + inline mask_array<_Tp>::mask_array(const mask_array<_Tp>& a) + : _M_sz(a._M_sz), _M_mask(a._M_mask), _M_array(a._M_array) {} + + template + inline + mask_array<_Tp>::mask_array(_Array<_Tp> __a, size_t __s, _Array __m) + : _M_sz(__s), _M_mask(__m), _M_array(__a) {} + + template + inline mask_array<_Tp>& + mask_array<_Tp>::operator=(const mask_array<_Tp>& __a) + { + std::__valarray_copy(__a._M_array, __a._M_mask, + _M_sz, _M_array, _M_mask); + return *this; + } + + template + inline void + mask_array<_Tp>::operator=(const _Tp& __t) const + { std::__valarray_fill(_M_array, _M_sz, _M_mask, __t); } + + template + inline void + mask_array<_Tp>::operator=(const valarray<_Tp>& __v) const + { std::__valarray_copy(_Array<_Tp>(__v), __v.size(), _M_array, _M_mask); } + + template + template + inline void + mask_array<_Tp>::operator=(const _Expr<_Ex, _Tp>& __e) const + { std::__valarray_copy(__e, __e.size(), _M_array, _M_mask); } + +#undef _DEFINE_VALARRAY_OPERATOR +#define _DEFINE_VALARRAY_OPERATOR(_Op, _Name) \ + template \ + inline void \ + mask_array<_Tp>::operator _Op##=(const valarray<_Tp>& __v) const \ + { \ + _Array_augmented_##_Name(_M_array, _M_mask, \ + _Array<_Tp>(__v), __v.size()); \ + } \ + \ + template \ + template \ + inline void \ + mask_array<_Tp>::operator _Op##=(const _Expr<_Dom, _Tp>& __e) const\ + { \ + _Array_augmented_##_Name(_M_array, _M_mask, __e, __e.size()); \ + } + +_DEFINE_VALARRAY_OPERATOR(*, __multiplies) +_DEFINE_VALARRAY_OPERATOR(/, __divides) +_DEFINE_VALARRAY_OPERATOR(%, __modulus) +_DEFINE_VALARRAY_OPERATOR(+, __plus) +_DEFINE_VALARRAY_OPERATOR(-, __minus) +_DEFINE_VALARRAY_OPERATOR(^, __bitwise_xor) +_DEFINE_VALARRAY_OPERATOR(&, __bitwise_and) +_DEFINE_VALARRAY_OPERATOR(|, __bitwise_or) +_DEFINE_VALARRAY_OPERATOR(<<, __shift_left) +_DEFINE_VALARRAY_OPERATOR(>>, __shift_right) + +#undef _DEFINE_VALARRAY_OPERATOR + +} // namespace std + +#endif /* _MASK_ARRAY_H */ diff --git a/cpp_src/memory b/cpp_src/memory new file mode 100644 index 0000000..eca53ed --- /dev/null +++ b/cpp_src/memory @@ -0,0 +1,374 @@ +// -*- C++ -*- + +// Copyright (C) 2001, 2002, 2004, 2005 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * Copyright (c) 1997-1999 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + */ + +/** @file include/memory + * This is a Standard C++ Library header. + */ + +#ifndef _GLIBCXX_MEMORY +#define _GLIBCXX_MEMORY 1 + +#pragma GCC system_header + +#include +#include +#include +#include //for iterator_traits +#include +#include +#include +#include + +namespace std { + + /** + * @if maint + * This is a helper function. The unused second parameter exists to + * permit the real get_temporary_buffer to use template parameter deduction. + * + * XXX This should perhaps use the pool. + * @endif + */ + template + pair<_Tp*, ptrdiff_t> + __get_temporary_buffer(ptrdiff_t __len, _Tp*) + { + const ptrdiff_t __max = numeric_limits::max() / sizeof(_Tp); + if (__len > __max) + __len = __max; + + while (__len > 0) + { + _Tp* __tmp = static_cast<_Tp*>(::operator new(__len * sizeof(_Tp), + nothrow)); + if (__tmp != 0) + return pair<_Tp*, ptrdiff_t>(__tmp, __len); + __len /= 2; + } + return pair<_Tp*, ptrdiff_t>(static_cast<_Tp*>(0), 0); + } + + /** + * @brief Allocates a temporary buffer. + * @param len The number of objects of type Tp. + * @return See full description. + * + * Reinventing the wheel, but this time with prettier spokes! + * + * This function tries to obtain storage for @c len adjacent Tp + * objects. The objects themselves are not constructed, of course. + * A pair<> is returned containing "the buffer s address and + * capacity (in the units of sizeof(Tp)), or a pair of 0 values if + * no storage can be obtained." Note that the capacity obtained + * may be less than that requested if the memory is unavailable; + * you should compare len with the .second return value. + * + * Provides the nothrow exception guarantee. + */ + template + inline pair<_Tp*, ptrdiff_t> + get_temporary_buffer(ptrdiff_t __len) + { return std::__get_temporary_buffer(__len, static_cast<_Tp*>(0)); } + + /** + * @brief The companion to get_temporary_buffer(). + * @param p A buffer previously allocated by get_temporary_buffer. + * @return None. + * + * Frees the memory pointed to by p. + */ + template + void + return_temporary_buffer(_Tp* __p) + { ::operator delete(__p, nothrow); } + + /** + * A wrapper class to provide auto_ptr with reference semantics. + * For example, an auto_ptr can be assigned (or constructed from) + * the result of a function which returns an auto_ptr by value. + * + * All the auto_ptr_ref stuff should happen behind the scenes. + */ + template + struct auto_ptr_ref + { + _Tp1* _M_ptr; + + explicit + auto_ptr_ref(_Tp1* __p): _M_ptr(__p) { } + }; + + + /** + * @brief A simple smart pointer providing strict ownership semantics. + * + * The Standard says: + * 
+   *  An @c auto_ptr owns the object it holds a pointer to.  Copying
+   *  an @c auto_ptr copies the pointer and transfers ownership to the
+   *  destination.  If more than one @c auto_ptr owns the same object
+   *  at the same time the behavior of the program is undefined.
+   *
+   *  The uses of @c auto_ptr include providing temporary
+   *  exception-safety for dynamically allocated memory, passing
+   *  ownership of dynamically allocated memory to a function, and
+   *  returning dynamically allocated memory from a function.  @c
+   *  auto_ptr does not meet the CopyConstructible and Assignable
+   *  requirements for Standard Library container elements and thus
+   *  instantiating a Standard Library container with an @c auto_ptr
+   *  results in undefined behavior.
+   *
+ * Quoted from [20.4.5]/3. + * + * Good examples of what can and cannot be done with auto_ptr can + * be found in the libstdc++ testsuite. + * + * @if maint + * _GLIBCXX_RESOLVE_LIB_DEFECTS + * 127. auto_ptr<> conversion issues + * These resolutions have all been incorporated. + * @endif + */ + template + class auto_ptr + { + private: + _Tp* _M_ptr; + + public: + /// The pointed-to type. + typedef _Tp element_type; + + /** + * @brief An %auto_ptr is usually constructed from a raw pointer. + * @param p A pointer (defaults to NULL). + * + * This object now @e owns the object pointed to by @a p. + */ + explicit + auto_ptr(element_type* __p = 0) throw() : _M_ptr(__p) { } + + /** + * @brief An %auto_ptr can be constructed from another %auto_ptr. + * @param a Another %auto_ptr of the same type. + * + * This object now @e owns the object previously owned by @a a, + * which has given up ownsership. + */ + auto_ptr(auto_ptr& __a) throw() : _M_ptr(__a.release()) { } + + /** + * @brief An %auto_ptr can be constructed from another %auto_ptr. + * @param a Another %auto_ptr of a different but related type. + * + * A pointer-to-Tp1 must be convertible to a + * pointer-to-Tp/element_type. + * + * This object now @e owns the object previously owned by @a a, + * which has given up ownsership. + */ + template + auto_ptr(auto_ptr<_Tp1>& __a) throw() : _M_ptr(__a.release()) { } + + /** + * @brief %auto_ptr assignment operator. + * @param a Another %auto_ptr of the same type. + * + * This object now @e owns the object previously owned by @a a, + * which has given up ownsership. The object that this one @e + * used to own and track has been deleted. + */ + auto_ptr& + operator=(auto_ptr& __a) throw() + { + reset(__a.release()); + return *this; + } + + /** + * @brief %auto_ptr assignment operator. + * @param a Another %auto_ptr of a different but related type. + * + * A pointer-to-Tp1 must be convertible to a pointer-to-Tp/element_type. + * + * This object now @e owns the object previously owned by @a a, + * which has given up ownsership. The object that this one @e + * used to own and track has been deleted. + */ + template + auto_ptr& + operator=(auto_ptr<_Tp1>& __a) throw() + { + reset(__a.release()); + return *this; + } + + /** + * When the %auto_ptr goes out of scope, the object it owns is + * deleted. If it no longer owns anything (i.e., @c get() is + * @c NULL), then this has no effect. + * + * @if maint + * The C++ standard says there is supposed to be an empty throw + * specification here, but omitting it is standard conforming. Its + * presence can be detected only if _Tp::~_Tp() throws, but this is + * prohibited. [17.4.3.6]/2 + * @endif + */ + ~auto_ptr() { delete _M_ptr; } + + /** + * @brief Smart pointer dereferencing. + * + * If this %auto_ptr no longer owns anything, then this + * operation will crash. (For a smart pointer, "no longer owns + * anything" is the same as being a null pointer, and you know + * what happens when you dereference one of those...) + */ + element_type& + operator*() const throw() + { + _GLIBCXX_DEBUG_ASSERT(_M_ptr != 0); + return *_M_ptr; + } + + /** + * @brief Smart pointer dereferencing. + * + * This returns the pointer itself, which the language then will + * automatically cause to be dereferenced. + */ + element_type* + operator->() const throw() + { + _GLIBCXX_DEBUG_ASSERT(_M_ptr != 0); + return _M_ptr; + } + + /** + * @brief Bypassing the smart pointer. + * @return The raw pointer being managed. + * + * You can get a copy of the pointer that this object owns, for + * situations such as passing to a function which only accepts + * a raw pointer. + * + * @note This %auto_ptr still owns the memory. + */ + element_type* + get() const throw() { return _M_ptr; } + + /** + * @brief Bypassing the smart pointer. + * @return The raw pointer being managed. + * + * You can get a copy of the pointer that this object owns, for + * situations such as passing to a function which only accepts + * a raw pointer. + * + * @note This %auto_ptr no longer owns the memory. When this object + * goes out of scope, nothing will happen. + */ + element_type* + release() throw() + { + element_type* __tmp = _M_ptr; + _M_ptr = 0; + return __tmp; + } + + /** + * @brief Forcibly deletes the managed object. + * @param p A pointer (defaults to NULL). + * + * This object now @e owns the object pointed to by @a p. The + * previous object has been deleted. + */ + void + reset(element_type* __p = 0) throw() + { + if (__p != _M_ptr) + { + delete _M_ptr; + _M_ptr = __p; + } + } + + /** + * @brief Automatic conversions + * + * These operations convert an %auto_ptr into and from an auto_ptr_ref + * automatically as needed. This allows constructs such as + * @code + * auto_ptr func_returning_auto_ptr(.....); + * ... + * auto_ptr ptr = func_returning_auto_ptr(.....); + * @endcode + */ + auto_ptr(auto_ptr_ref __ref) throw() + : _M_ptr(__ref._M_ptr) { } + + auto_ptr& + operator=(auto_ptr_ref __ref) throw() + { + if (__ref._M_ptr != this->get()) + { + delete _M_ptr; + _M_ptr = __ref._M_ptr; + } + return *this; + } + + template + operator auto_ptr_ref<_Tp1>() throw() + { return auto_ptr_ref<_Tp1>(this->release()); } + + template + operator auto_ptr<_Tp1>() throw() + { return auto_ptr<_Tp1>(this->release()); } + }; + +} // namespace std + +#endif /* _GLIBCXX_MEMORY */ diff --git a/cpp_src/new b/cpp_src/new new file mode 100644 index 0000000..a821783 --- /dev/null +++ b/cpp_src/new @@ -0,0 +1,116 @@ +// The -*- C++ -*- dynamic memory management header. + +// Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, +// 2003, 2004, 2005, 2006, 2007 +// Free Software Foundation + +// This file is part of GCC. +// +// GCC is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation; either version 2, or (at your option) +// any later version. +// +// GCC is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. +// +// You should have received a copy of the GNU General Public License +// along with GCC; see the file COPYING. If not, write to +// the Free Software Foundation, 51 Franklin Street, Fifth Floor, +// Boston, MA 02110-1301, USA. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file new + * This is a Standard C++ Library header. + * + * The header @c new defines several functions to manage dynamic memory and + * handling memory allocation errors; see + * http://gcc.gnu.org/onlinedocs/libstdc++/18_support/howto.html#4 for more. + */ + +#ifndef _NEW +#define _NEW + +#include +#include + +#pragma GCC visibility push(default) + +extern "C++" { + +namespace std +{ + /** + * @brief Exception possibly thrown by @c new. + * + * @c bad_alloc (or classes derived from it) is used to report allocation + * errors from the throwing forms of @c new. */ + class bad_alloc : public exception + { + public: + bad_alloc() throw() { } + + // This declaration is not useless: + // http://gcc.gnu.org/onlinedocs/gcc-3.0.2/gcc_6.html#SEC118 + virtual ~bad_alloc() throw(); + + // See comment in eh_exception.cc. + virtual const char* what() const throw(); + }; + + struct nothrow_t { }; + + extern const nothrow_t nothrow; + + /** If you write your own error handler to be called by @c new, it must + * be of this type. */ + typedef void (*new_handler)(); + + /// Takes a replacement handler as the argument, returns the + /// previous handler. + new_handler set_new_handler(new_handler) throw(); +} // namespace std + +//@{ +/** These are replaceable signatures: + * - normal single new and delete (no arguments, throw @c bad_alloc on error) + * - normal array new and delete (same) + * - @c nothrow single new and delete (take a @c nothrow argument, return + * @c NULL on error) + * - @c nothrow array new and delete (same) + * + * Placement new and delete signatures (take a memory address argument, + * does nothing) may not be replaced by a user's program. +*/ +void* operator new(std::size_t) throw (std::bad_alloc); +void* operator new[](std::size_t) throw (std::bad_alloc); +void operator delete(void*) throw(); +void operator delete[](void*) throw(); +void* operator new(std::size_t, const std::nothrow_t&) throw(); +void* operator new[](std::size_t, const std::nothrow_t&) throw(); +void operator delete(void*, const std::nothrow_t&) throw(); +void operator delete[](void*, const std::nothrow_t&) throw(); + +// Default placement versions of operator new. +inline void* operator new(std::size_t, void* __p) throw() { return __p; } +inline void* operator new[](std::size_t, void* __p) throw() { return __p; } + +// Default placement versions of operator delete. +inline void operator delete (void*, void*) throw() { } +inline void operator delete[](void*, void*) throw() { } +//@} +} // extern "C++" + +#pragma GCC visibility pop + +#endif diff --git a/cpp_src/numeric b/cpp_src/numeric new file mode 100644 index 0000000..03f82dd --- /dev/null +++ b/cpp_src/numeric @@ -0,0 +1,71 @@ +// -*- C++ -*- + +// Copyright (C) 2001, 2002 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file include/numeric + * This is a Standard C++ Library header. + */ + +#ifndef _GLIBCXX_NUMERIC +#define _GLIBCXX_NUMERIC 1 + +#pragma GCC system_header + +#include +#include +#include +#include +#include + +#endif /* _GLIBCXX_NUMERIC */ diff --git a/cpp_src/ostream b/cpp_src/ostream new file mode 100644 index 0000000..8ee0e5c --- /dev/null +++ b/cpp_src/ostream @@ -0,0 +1,575 @@ +// Output streams -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file ostream + * This is a Standard C++ Library header. + */ + +// +// ISO C++ 14882: 27.6.2 Output streams +// + +#ifndef _GLIBCXX_OSTREAM +#define _GLIBCXX_OSTREAM 1 + +#pragma GCC system_header + +#include +#include + +namespace std { + + // [27.6.2.1] Template class basic_ostream + /** + * @brief Controlling output. + * + * This is the base class for all output streams. It provides text + * formatting of all builtin types, and communicates with any class + * derived from basic_streambuf to do the actual output. + */ + template + class basic_ostream : virtual public basic_ios<_CharT, _Traits> + { + public: + // Types (inherited from basic_ios (27.4.4)): + typedef _CharT char_type; + typedef typename _Traits::int_type int_type; + typedef typename _Traits::pos_type pos_type; + typedef typename _Traits::off_type off_type; + typedef _Traits traits_type; + + // Non-standard Types: + typedef basic_streambuf<_CharT, _Traits> __streambuf_type; + typedef basic_ios<_CharT, _Traits> __ios_type; + typedef basic_ostream<_CharT, _Traits> __ostream_type; + typedef num_put<_CharT, ostreambuf_iterator<_CharT, _Traits> > + __num_put_type; + typedef ctype<_CharT> __ctype_type; + + // [27.6.2.2] constructor/destructor + /** + * @brief Base constructor. + * + * This ctor is almost never called by the user directly, rather from + * derived classes' initialization lists, which pass a pointer to + * their own stream buffer. + */ + explicit + basic_ostream(__streambuf_type* __sb) + { this->init(__sb); } + + /** + * @brief Base destructor. + * + * This does very little apart from providing a virtual base dtor. + */ + virtual + ~basic_ostream() { } + + // [27.6.2.3] prefix/suffix + class sentry; + friend class sentry; + + // [27.6.2.5] formatted output + // [27.6.2.5.3] basic_ostream::operator<< + //@{ + /** + * @brief Interface for manipulators. + * + * Manuipulators such as @c std::endl and @c std::hex use these + * functions in constructs like "std::cout << std::endl". For more + * information, see the iomanip header. + */ + __ostream_type& + operator<<(__ostream_type& (*__pf)(__ostream_type&)) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 60. What is a formatted input function? + // The inserters for manipulators are *not* formatted output functions. + return __pf(*this); + } + + __ostream_type& + operator<<(__ios_type& (*__pf)(__ios_type&)) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 60. What is a formatted input function? + // The inserters for manipulators are *not* formatted output functions. + __pf(*this); + return *this; + } + + __ostream_type& + operator<<(ios_base& (*__pf) (ios_base&)) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 60. What is a formatted input function? + // The inserters for manipulators are *not* formatted output functions. + __pf(*this); + return *this; + } + //@} + + // [27.6.2.5.2] arithmetic inserters + /** + * @name Arithmetic Inserters + * + * All the @c operator<< functions (aka formatted output + * functions) have some common behavior. Each starts by + * constructing a temporary object of type std::basic_ostream::sentry. + * This can have several effects, concluding with the setting of a + * status flag; see the sentry documentation for more. + * + * If the sentry status is good, the function tries to generate + * whatever data is appropriate for the type of the argument. + * + * If an exception is thrown during insertion, ios_base::badbit + * will be turned on in the stream's error state without causing an + * ios_base::failure to be thrown. The original exception will then + * be rethrown. + */ + //@{ + /** + * @brief Basic arithmetic inserters + * @param A variable of builtin type. + * @return @c *this if successful + * + * These functions use the stream's current locale (specifically, the + * @c num_get facet) to perform numeric formatting. + */ + __ostream_type& + operator<<(long __n) + { return _M_insert(__n); } + + __ostream_type& + operator<<(unsigned long __n) + { return _M_insert(__n); } + + __ostream_type& + operator<<(bool __n) + { return _M_insert(__n); } + + __ostream_type& + operator<<(short __n); + + __ostream_type& + operator<<(unsigned short __n) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 117. basic_ostream uses nonexistent num_put member functions. + return _M_insert(static_cast(__n)); + } + + __ostream_type& + operator<<(int __n); + + __ostream_type& + operator<<(unsigned int __n) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 117. basic_ostream uses nonexistent num_put member functions. + return _M_insert(static_cast(__n)); + } + +#ifdef _GLIBCXX_USE_LONG_LONG + __ostream_type& + operator<<(long long __n) + { return _M_insert(__n); } + + __ostream_type& + operator<<(unsigned long long __n) + { return _M_insert(__n); } +#endif + + __ostream_type& + operator<<(double __f) + { return _M_insert(__f); } + + __ostream_type& + operator<<(float __f) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 117. basic_ostream uses nonexistent num_put member functions. + return _M_insert(static_cast(__f)); + } + + __ostream_type& + operator<<(long double __f) + { return _M_insert(__f); } + + __ostream_type& + operator<<(const void* __p) + { return _M_insert(__p); } + + /** + * @brief Extracting from another streambuf. + * @param sb A pointer to a streambuf + * + * This function behaves like one of the basic arithmetic extractors, + * in that it also constructs a sentry object and has the same error + * handling behavior. + * + * If @a sb is NULL, the stream will set failbit in its error state. + * + * Characters are extracted from @a sb and inserted into @c *this + * until one of the following occurs: + * + * - the input stream reaches end-of-file, + * - insertion into the output sequence fails (in this case, the + * character that would have been inserted is not extracted), or + * - an exception occurs while getting a character from @a sb, which + * sets failbit in the error state + * + * If the function inserts no characters, failbit is set. + */ + __ostream_type& + operator<<(__streambuf_type* __sb); + //@} + + // [27.6.2.6] unformatted output functions + /** + * @name Unformatted Output Functions + * + * All the unformatted output functions have some common behavior. + * Each starts by constructing a temporary object of type + * std::basic_ostream::sentry. This has several effects, concluding + * with the setting of a status flag; see the sentry documentation + * for more. + * + * If the sentry status is good, the function tries to generate + * whatever data is appropriate for the type of the argument. + * + * If an exception is thrown during insertion, ios_base::badbit + * will be turned on in the stream's error state. If badbit is on in + * the stream's exceptions mask, the exception will be rethrown + * without completing its actions. + */ + //@{ + /** + * @brief Simple insertion. + * @param c The character to insert. + * @return *this + * + * Tries to insert @a c. + * + * @note This function is not overloaded on signed char and + * unsigned char. + */ + __ostream_type& + put(char_type __c); + + // Core write functionality, without sentry. + void + _M_write(const char_type* __s, streamsize __n) + { + const streamsize __put = this->rdbuf()->sputn(__s, __n); + if (__put != __n) + this->setstate(ios_base::badbit); + } + + /** + * @brief Character string insertion. + * @param s The array to insert. + * @param n Maximum number of characters to insert. + * @return *this + * + * Characters are copied from @a s and inserted into the stream until + * one of the following happens: + * + * - @a n characters are inserted + * - inserting into the output sequence fails (in this case, badbit + * will be set in the stream's error state) + * + * @note This function is not overloaded on signed char and + * unsigned char. + */ + __ostream_type& + write(const char_type* __s, streamsize __n); + //@} + + /** + * @brief Synchronizing the stream buffer. + * @return *this + * + * If @c rdbuf() is a null pointer, changes nothing. + * + * Otherwise, calls @c rdbuf()->pubsync(), and if that returns -1, + * sets badbit. + */ + __ostream_type& + flush(); + + // [27.6.2.4] seek members + /** + * @brief Getting the current write position. + * @return A file position object. + * + * If @c fail() is not false, returns @c pos_type(-1) to indicate + * failure. Otherwise returns @c rdbuf()->pubseekoff(0,cur,out). + */ + pos_type + tellp(); + + /** + * @brief Changing the current write position. + * @param pos A file position object. + * @return *this + * + * If @c fail() is not true, calls @c rdbuf()->pubseekpos(pos). If + * that function fails, sets failbit. + */ + __ostream_type& + seekp(pos_type); + + /** + * @brief Changing the current write position. + * @param off A file offset object. + * @param dir The direction in which to seek. + * @return *this + * + * If @c fail() is not true, calls @c rdbuf()->pubseekoff(off,dir). + * If that function fails, sets failbit. + */ + __ostream_type& + seekp(off_type, ios_base::seekdir); + + protected: + explicit + basic_ostream() { } + + template + __ostream_type& + _M_insert(_ValueT __v); + }; + + /** + * @brief Performs setup work for output streams. + * + * Objects of this class are created before all of the standard + * inserters are run. It is responsible for "exception-safe prefix and + * suffix operations." Additional actions may be added by the + * implementation, and we list them in + * http://gcc.gnu.org/onlinedocs/libstdc++/17_intro/howto.html#5 + * under [27.6] notes. + */ + template + class basic_ostream<_CharT, _Traits>::sentry + { + // Data Members: + bool _M_ok; + basic_ostream<_CharT, _Traits>& _M_os; + + public: + /** + * @brief The constructor performs preparatory work. + * @param os The output stream to guard. + * + * If the stream state is good (@a os.good() is true), then if the + * stream is tied to another output stream, @c is.tie()->flush() + * is called to synchronize the output sequences. + * + * If the stream state is still good, then the sentry state becomes + * true ("okay"). + */ + explicit + sentry(basic_ostream<_CharT, _Traits>& __os); + + /** + * @brief Possibly flushes the stream. + * + * If @c ios_base::unitbuf is set in @c os.flags(), and + * @c std::uncaught_exception() is true, the sentry destructor calls + * @c flush() on the output stream. + */ + ~sentry() + { + // XXX MT + if (_M_os.flags() & ios_base::unitbuf && !uncaught_exception()) + { + // Can't call flush directly or else will get into recursive lock. + if (_M_os.rdbuf() && _M_os.rdbuf()->pubsync() == -1) + _M_os.setstate(ios_base::badbit); + } + } + + /** + * @brief Quick status checking. + * @return The sentry state. + * + * For ease of use, sentries may be converted to booleans. The + * return value is that of the sentry state (true == okay). + */ + operator bool() const + { return _M_ok; } + }; + + // [27.6.2.5.4] character insertion templates + //@{ + /** + * @brief Character inserters + * @param out An output stream. + * @param c A character. + * @return out + * + * Behaves like one of the formatted arithmetic inserters described in + * std::basic_ostream. After constructing a sentry object with good + * status, this function inserts a single character and any required + * padding (as determined by [22.2.2.2.2]). @c out.width(0) is then + * called. + * + * If @a c is of type @c char and the character type of the stream is not + * @c char, the character is widened before insertion. + */ + template + inline basic_ostream<_CharT, _Traits>& + operator<<(basic_ostream<_CharT, _Traits>& __out, _CharT __c) + { return __ostream_insert(__out, &__c, 1); } + + template + inline basic_ostream<_CharT, _Traits>& + operator<<(basic_ostream<_CharT, _Traits>& __out, char __c) + { return (__out << __out.widen(__c)); } + + // Specialization + template + inline basic_ostream& + operator<<(basic_ostream& __out, char __c) + { return __ostream_insert(__out, &__c, 1); } + + // Signed and unsigned + template + inline basic_ostream& + operator<<(basic_ostream& __out, signed char __c) + { return (__out << static_cast(__c)); } + + template + inline basic_ostream& + operator<<(basic_ostream& __out, unsigned char __c) + { return (__out << static_cast(__c)); } + //@} + + //@{ + /** + * @brief String inserters + * @param out An output stream. + * @param s A character string. + * @return out + * @pre @a s must be a non-NULL pointer + * + * Behaves like one of the formatted arithmetic inserters described in + * std::basic_ostream. After constructing a sentry object with good + * status, this function inserts @c traits::length(s) characters starting + * at @a s, widened if necessary, followed by any required padding (as + * determined by [22.2.2.2.2]). @c out.width(0) is then called. + */ + template + inline basic_ostream<_CharT, _Traits>& + operator<<(basic_ostream<_CharT, _Traits>& __out, const _CharT* __s) + { + if (!__s) + __out.setstate(ios_base::badbit); + else + __ostream_insert(__out, __s, + static_cast(_Traits::length(__s))); + return __out; + } + + template + basic_ostream<_CharT, _Traits> & + operator<<(basic_ostream<_CharT, _Traits>& __out, const char* __s); + + // Partial specializationss + template + inline basic_ostream& + operator<<(basic_ostream& __out, const char* __s) + { + if (!__s) + __out.setstate(ios_base::badbit); + else + __ostream_insert(__out, __s, + static_cast(_Traits::length(__s))); + return __out; + } + + // Signed and unsigned + template + inline basic_ostream& + operator<<(basic_ostream& __out, const signed char* __s) + { return (__out << reinterpret_cast(__s)); } + + template + inline basic_ostream & + operator<<(basic_ostream& __out, const unsigned char* __s) + { return (__out << reinterpret_cast(__s)); } + //@} + + // [27.6.2.7] standard basic_ostream manipulators + /** + * @brief Write a newline and flush the stream. + * + * This manipulator is often mistakenly used when a simple newline is + * desired, leading to poor buffering performance. See + * http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#2 for more + * on this subject. + */ + template + inline basic_ostream<_CharT, _Traits>& + endl(basic_ostream<_CharT, _Traits>& __os) + { return flush(__os.put(__os.widen('\n'))); } + + /** + * @brief Write a null character into the output sequence. + * + * "Null character" is @c CharT() by definition. For CharT of @c char, + * this correctly writes the ASCII @c NUL character string terminator. + */ + template + inline basic_ostream<_CharT, _Traits>& + ends(basic_ostream<_CharT, _Traits>& __os) + { return __os.put(_CharT()); } + + /** + * @brief Flushes the output stream. + * + * This manipulator simply calls the stream's @c flush() member function. + */ + template + inline basic_ostream<_CharT, _Traits>& + flush(basic_ostream<_CharT, _Traits>& __os) + { return __os.flush(); } + +} // namespace std + +#ifndef _GLIBCXX_EXPORT_TEMPLATE +# include +#endif + +#endif /* _GLIBCXX_OSTREAM */ diff --git a/cpp_src/ostream.tcc b/cpp_src/ostream.tcc new file mode 100644 index 0000000..1053d9d --- /dev/null +++ b/cpp_src/ostream.tcc @@ -0,0 +1,374 @@ +// ostream classes -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file ostream.tcc + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 27.6.2 Output streams +// + +#ifndef _OSTREAM_TCC +#define _OSTREAM_TCC 1 + +#pragma GCC system_header + +#include + +namespace std { + + template + basic_ostream<_CharT, _Traits>::sentry:: + sentry(basic_ostream<_CharT, _Traits>& __os) + : _M_ok(false), _M_os(__os) + { + // XXX MT + if (__os.tie() && __os.good()) + __os.tie()->flush(); + + if (__os.good()) + _M_ok = true; + else + __os.setstate(ios_base::failbit); + } + + template + template + basic_ostream<_CharT, _Traits>& + basic_ostream<_CharT, _Traits>:: + _M_insert(_ValueT __v) + { + sentry __cerb(*this); + if (__cerb) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + try + { + const __num_put_type& __np = __check_facet(this->_M_num_put); + if (__np.put(*this, *this, this->fill(), __v).failed()) + __err |= ios_base::badbit; + } + catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + } + return *this; + } + + template + basic_ostream<_CharT, _Traits>& + basic_ostream<_CharT, _Traits>:: + operator<<(short __n) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 117. basic_ostream uses nonexistent num_put member functions. + const ios_base::fmtflags __fmt = this->flags() & ios_base::basefield; + if (__fmt == ios_base::oct || __fmt == ios_base::hex) + return _M_insert(static_cast(static_cast(__n))); + else + return _M_insert(static_cast(__n)); + } + + template + basic_ostream<_CharT, _Traits>& + basic_ostream<_CharT, _Traits>:: + operator<<(int __n) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 117. basic_ostream uses nonexistent num_put member functions. + const ios_base::fmtflags __fmt = this->flags() & ios_base::basefield; + if (__fmt == ios_base::oct || __fmt == ios_base::hex) + return _M_insert(static_cast(static_cast(__n))); + else + return _M_insert(static_cast(__n)); + } + + template + basic_ostream<_CharT, _Traits>& + basic_ostream<_CharT, _Traits>:: + operator<<(__streambuf_type* __sbin) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + sentry __cerb(*this); + if (__cerb && __sbin) + { + try + { + if (!__copy_streambufs(__sbin, this->rdbuf())) + __err |= ios_base::failbit; + } + catch(...) + { this->_M_setstate(ios_base::failbit); } + } + else if (!__sbin) + __err |= ios_base::badbit; + if (__err) + this->setstate(__err); + return *this; + } + + template + basic_ostream<_CharT, _Traits>& + basic_ostream<_CharT, _Traits>:: + put(char_type __c) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 60. What is a formatted input function? + // basic_ostream::put(char_type) is an unformatted output function. + // DR 63. Exception-handling policy for unformatted output. + // Unformatted output functions should catch exceptions thrown + // from streambuf members. + sentry __cerb(*this); + if (__cerb) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + try + { + const int_type __put = this->rdbuf()->sputc(__c); + if (traits_type::eq_int_type(__put, traits_type::eof())) + __err |= ios_base::badbit; + } + catch (...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + } + return *this; + } + + template + basic_ostream<_CharT, _Traits>& + basic_ostream<_CharT, _Traits>:: + write(const _CharT* __s, streamsize __n) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 60. What is a formatted input function? + // basic_ostream::write(const char_type*, streamsize) is an + // unformatted output function. + // DR 63. Exception-handling policy for unformatted output. + // Unformatted output functions should catch exceptions thrown + // from streambuf members. + sentry __cerb(*this); + if (__cerb) + { + try + { _M_write(__s, __n); } + catch (...) + { this->_M_setstate(ios_base::badbit); } + } + return *this; + } + + template + basic_ostream<_CharT, _Traits>& + basic_ostream<_CharT, _Traits>:: + flush() + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 60. What is a formatted input function? + // basic_ostream::flush() is *not* an unformatted output function. + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + try + { + if (this->rdbuf() && this->rdbuf()->pubsync() == -1) + __err |= ios_base::badbit; + } + catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + return *this; + } + + template + typename basic_ostream<_CharT, _Traits>::pos_type + basic_ostream<_CharT, _Traits>:: + tellp() + { + pos_type __ret = pos_type(-1); + try + { + if (!this->fail()) + __ret = this->rdbuf()->pubseekoff(0, ios_base::cur, ios_base::out); + } + catch(...) + { this->_M_setstate(ios_base::badbit); } + return __ret; + } + + template + basic_ostream<_CharT, _Traits>& + basic_ostream<_CharT, _Traits>:: + seekp(pos_type __pos) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + try + { + if (!this->fail()) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 136. seekp, seekg setting wrong streams? + const pos_type __p = this->rdbuf()->pubseekpos(__pos, + ios_base::out); + + // 129. Need error indication from seekp() and seekg() + if (__p == pos_type(off_type(-1))) + __err |= ios_base::failbit; + } + } + catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + return *this; + } + + template + basic_ostream<_CharT, _Traits>& + basic_ostream<_CharT, _Traits>:: + seekp(off_type __off, ios_base::seekdir __dir) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + try + { + if (!this->fail()) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 136. seekp, seekg setting wrong streams? + const pos_type __p = this->rdbuf()->pubseekoff(__off, __dir, + ios_base::out); + + // 129. Need error indication from seekp() and seekg() + if (__p == pos_type(off_type(-1))) + __err |= ios_base::failbit; + } + } + catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + return *this; + } + + template + basic_ostream<_CharT, _Traits>& + operator<<(basic_ostream<_CharT, _Traits>& __out, const char* __s) + { + if (!__s) + __out.setstate(ios_base::badbit); + else + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 167. Improper use of traits_type::length() + const size_t __clen = char_traits::length(__s); + _CharT* __ws = 0; + try + { + __ws = new _CharT[__clen]; + for (size_t __i = 0; __i < __clen; ++__i) + __ws[__i] = __out.widen(__s[__i]); + } + catch(...) + { + delete [] __ws; + __out._M_setstate(ios_base::badbit); + return __out; + } + + try + { + __ostream_insert(__out, __ws, __clen); + delete [] __ws; + } + catch(...) + { + delete [] __ws; + __throw_exception_again; + } + } + return __out; + } + + // Inhibit implicit instantiations for required instantiations, + // which are defined via explicit instantiations elsewhere. + // NB: This syntax is a GNU extension. +#if _GLIBCXX_EXTERN_TEMPLATE + extern template class basic_ostream; + extern template ostream& endl(ostream&); + extern template ostream& ends(ostream&); + extern template ostream& flush(ostream&); + extern template ostream& operator<<(ostream&, char); + extern template ostream& operator<<(ostream&, unsigned char); + extern template ostream& operator<<(ostream&, signed char); + extern template ostream& operator<<(ostream&, const char*); + extern template ostream& operator<<(ostream&, const unsigned char*); + extern template ostream& operator<<(ostream&, const signed char*); + + extern template ostream& ostream::_M_insert(long); + extern template ostream& ostream::_M_insert(unsigned long); + extern template ostream& ostream::_M_insert(bool); +#ifdef _GLIBCXX_USE_LONG_LONG + extern template ostream& ostream::_M_insert(long long); + extern template ostream& ostream::_M_insert(unsigned long long); +#endif + extern template ostream& ostream::_M_insert(double); + extern template ostream& ostream::_M_insert(long double); + extern template ostream& ostream::_M_insert(const void*); + +#ifdef _GLIBCXX_USE_WCHAR_T + extern template class basic_ostream; + extern template wostream& endl(wostream&); + extern template wostream& ends(wostream&); + extern template wostream& flush(wostream&); + extern template wostream& operator<<(wostream&, wchar_t); + extern template wostream& operator<<(wostream&, char); + extern template wostream& operator<<(wostream&, const wchar_t*); + extern template wostream& operator<<(wostream&, const char*); + + extern template wostream& wostream::_M_insert(long); + extern template wostream& wostream::_M_insert(unsigned long); + extern template wostream& wostream::_M_insert(bool); +#ifdef _GLIBCXX_USE_LONG_LONG + extern template wostream& wostream::_M_insert(long long); + extern template wostream& wostream::_M_insert(unsigned long long); +#endif + extern template wostream& wostream::_M_insert(double); + extern template wostream& wostream::_M_insert(long double); + extern template wostream& wostream::_M_insert(const void*); +#endif +#endif + +} // namespace std + +#endif diff --git a/cpp_src/ostream_insert.h b/cpp_src/ostream_insert.h new file mode 100644 index 0000000..cb3adaa --- /dev/null +++ b/cpp_src/ostream_insert.h @@ -0,0 +1,126 @@ +// Helpers for ostream inserters -*- C++ -*- + +// Copyright (C) 2007 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file ostream_insert.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _OSTREAM_INSERT_H +#define _OSTREAM_INSERT_H 1 + +#pragma GCC system_header + +#include + +namespace std { + + template + inline void + __ostream_write(basic_ostream<_CharT, _Traits>& __out, + const _CharT* __s, streamsize __n) + { + typedef basic_ostream<_CharT, _Traits> __ostream_type; + typedef typename __ostream_type::ios_base __ios_base; + + const streamsize __put = __out.rdbuf()->sputn(__s, __n); + if (__put != __n) + __out.setstate(__ios_base::badbit); + } + + template + inline void + __ostream_fill(basic_ostream<_CharT, _Traits>& __out, streamsize __n) + { + typedef basic_ostream<_CharT, _Traits> __ostream_type; + typedef typename __ostream_type::ios_base __ios_base; + + const _CharT __c = __out.fill(); + for (; __n > 0; --__n) + { + const typename _Traits::int_type __put = __out.rdbuf()->sputc(__c); + if (_Traits::eq_int_type(__put, _Traits::eof())) + { + __out.setstate(__ios_base::badbit); + break; + } + } + } + + template + basic_ostream<_CharT, _Traits>& + __ostream_insert(basic_ostream<_CharT, _Traits>& __out, + const _CharT* __s, streamsize __n) + { + typedef basic_ostream<_CharT, _Traits> __ostream_type; + typedef typename __ostream_type::ios_base __ios_base; + + typename __ostream_type::sentry __cerb(__out); + if (__cerb) + { + try + { + const streamsize __w = __out.width(); + if (__w > __n) + { + const bool __left = ((__out.flags() + & __ios_base::adjustfield) + == __ios_base::left); + if (!__left) + __ostream_fill(__out, __w - __n); + if (__out.good()) + __ostream_write(__out, __s, __n); + if (__left && __out.good()) + __ostream_fill(__out, __w - __n); + } + else + __ostream_write(__out, __s, __n); + __out.width(0); + } + catch(...) + { __out._M_setstate(__ios_base::badbit); } + } + return __out; + } + + // Inhibit implicit instantiations for required instantiations, + // which are defined via explicit instantiations elsewhere. + // NB: This syntax is a GNU extension. +#if _GLIBCXX_EXTERN_TEMPLATE + extern template ostream& __ostream_insert(ostream&, const char*, streamsize); + +#ifdef _GLIBCXX_USE_WCHAR_T + extern template wostream& __ostream_insert(wostream&, const wchar_t*, + streamsize); +#endif +#endif + +} // namespace std + +#endif /* _OSTREAM_INSERT_H */ diff --git a/cpp_src/postypes.h b/cpp_src/postypes.h new file mode 100644 index 0000000..a5a68ec --- /dev/null +++ b/cpp_src/postypes.h @@ -0,0 +1,217 @@ +// Position types -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file postypes.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 27.4.1 - Types +// ISO C++ 14882: 27.4.3 - Template class fpos +// + +#ifndef _GLIBCXX_POSTYPES_H +#define _GLIBCXX_POSTYPES_H 1 + +#pragma GCC system_header + +#include // For mbstate_t + +#ifdef _GLIBCXX_HAVE_STDINT_H +#include // For int64_t +#endif + +namespace std { + + // The types streamoff, streampos and wstreampos and the class + // template fpos<> are described in clauses 21.1.2, 21.1.3, 27.1.2, + // 27.2, 27.4.1, 27.4.3 and D.6. Despite all this verbage, the + // behaviour of these types is mostly implementation defined or + // unspecified. The behaviour in this implementation is as noted + // below. + + /** + * @brief Type used by fpos, char_traits, and char_traits. + * + * @if maint + * In clauses 21.1.3.1 and 27.4.1 streamoff is described as an + * implementation defined type. + * Note: In versions of GCC up to and including GCC 3.3, streamoff + * was typedef long. + * @endif + */ +#ifdef _GLIBCXX_HAVE_INT64_T + typedef int64_t streamoff; +#else + typedef long long streamoff; +#endif + + /// Integral type for I/O operation counts and buffer sizes. + typedef ptrdiff_t streamsize; // Signed integral type + + template + class fpos; + + /** + * @brief Class representing stream positions. + * + * The standard places no requirements upon the template parameter StateT. + * In this implementation StateT must be DefaultConstructible, + * CopyConstructible and Assignable. The standard only requires that fpos + * should contain a member of type StateT. In this implementation it also + * contains an offset stored as a signed integer. + * + * @param StateT Type passed to and returned from state(). + */ + template + class fpos + { + private: + streamoff _M_off; + _StateT _M_state; + + public: + // The standard doesn't require that fpos objects can be default + // constructed. This implementation provides a default + // constructor that initializes the offset to 0 and default + // constructs the state. + fpos() + : _M_off(0), _M_state() { } + + // The standard requires that fpos objects can be constructed + // from streamoff objects using the constructor syntax, and + // fails to give any meaningful semantics. In this + // implementation implicit conversion is also allowed, and this + // constructor stores the streamoff as the offset and default + // constructs the state. + /// Construct position from offset. + fpos(streamoff __off) + : _M_off(__off), _M_state() { } + + /// Convert to streamoff. + operator streamoff() const { return _M_off; } + + /// Remember the value of @a st. + void + state(_StateT __st) + { _M_state = __st; } + + /// Return the last set value of @a st. + _StateT + state() const + { return _M_state; } + + // The standard requires that this operator must be defined, but + // gives no semantics. In this implemenation it just adds it's + // argument to the stored offset and returns *this. + /// Add offset to this position. + fpos& + operator+=(streamoff __off) + { + _M_off += __off; + return *this; + } + + // The standard requires that this operator must be defined, but + // gives no semantics. In this implemenation it just subtracts + // it's argument from the stored offset and returns *this. + /// Subtract offset from this position. + fpos& + operator-=(streamoff __off) + { + _M_off -= __off; + return *this; + } + + // The standard requires that this operator must be defined, but + // defines it's semantics only in terms of operator-. In this + // implementation it constructs a copy of *this, adds the + // argument to that copy using operator+= and then returns the + // copy. + /// Add position and offset. + fpos + operator+(streamoff __off) const + { + fpos __pos(*this); + __pos += __off; + return __pos; + } + + // The standard requires that this operator must be defined, but + // defines it's semantics only in terms of operator+. In this + // implementation it constructs a copy of *this, subtracts the + // argument from that copy using operator-= and then returns the + // copy. + /// Subtract offset from position. + fpos + operator-(streamoff __off) const + { + fpos __pos(*this); + __pos -= __off; + return __pos; + } + + // The standard requires that this operator must be defined, but + // defines it's semantics only in terms of operator+. In this + // implementation it returns the difference between the offset + // stored in *this and in the argument. + /// Subtract position to return offset. + streamoff + operator-(const fpos& __other) const + { return _M_off - __other._M_off; } + }; + + // The standard only requires that operator== must be an + // equivalence relation. In this implementation two fpos + // objects belong to the same equivalence class if the contained + // offsets compare equal. + /// Test if equivalent to another position. + template + inline bool + operator==(const fpos<_StateT>& __lhs, const fpos<_StateT>& __rhs) + { return streamoff(__lhs) == streamoff(__rhs); } + + template + inline bool + operator!=(const fpos<_StateT>& __lhs, const fpos<_StateT>& __rhs) + { return streamoff(__lhs) != streamoff(__rhs); } + + // Clauses 21.1.3.1 and 21.1.3.2 describe streampos and wstreampos + // as implementation defined types, but clause 27.2 requires that + // they must both be typedefs for fpos + /// File position for char streams. + typedef fpos streampos; + /// File position for wchar_t streams. + typedef fpos wstreampos; + +} // namespace std + +#endif diff --git a/cpp_src/queue b/cpp_src/queue new file mode 100644 index 0000000..1242a06 --- /dev/null +++ b/cpp_src/queue @@ -0,0 +1,77 @@ +// -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file include/queue + * This is a Standard C++ Library header. + */ + +#ifndef _GLIBCXX_QUEUE +#define _GLIBCXX_QUEUE 1 + +#pragma GCC system_header + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +#endif /* _GLIBCXX_QUEUE */ diff --git a/cpp_src/set b/cpp_src/set new file mode 100644 index 0000000..65ebe8a --- /dev/null +++ b/cpp_src/set @@ -0,0 +1,73 @@ +// -*- C++ -*- + +// Copyright (C) 2001, 2002 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file include/set + * This is a Standard C++ Library header. + */ + +#ifndef _GLIBCXX_SET +#define _GLIBCXX_SET 1 + +#pragma GCC system_header + +#include +#include +#include + +#ifdef _GLIBCXX_DEBUG +# include +#endif + +#endif /* _GLIBCXX_SET */ diff --git a/cpp_src/slice_array.h b/cpp_src/slice_array.h new file mode 100644 index 0000000..aa70ad3 --- /dev/null +++ b/cpp_src/slice_array.h @@ -0,0 +1,269 @@ +// The template and inlines for the -*- C++ -*- slice_array class. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2004, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file slice_array.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// Written by Gabriel Dos Reis + +#ifndef _SLICE_ARRAY_H +#define _SLICE_ARRAY_H 1 + +#pragma GCC system_header + +namespace std { + + /** + * @brief Class defining one-dimensional subset of an array. + * + * The slice class represents a one-dimensional subset of an array, + * specified by three parameters: start offset, size, and stride. The + * start offset is the index of the first element of the array that is part + * of the subset. The size is the total number of elements in the subset. + * Stride is the distance between each successive array element to include + * in the subset. + * + * For example, with an array of size 10, and a slice with offset 1, size 3 + * and stride 2, the subset consists of array elements 1, 3, and 5. + */ + class slice + { + public: + /// Construct an empty slice. + slice(); + + /** + * @brief Construct a slice. + * + * @param o Offset in array of first element. + * @param d Number of elements in slice. + * @param s Stride between array elements. + */ + slice(size_t, size_t, size_t); + + /// Return array offset of first slice element. + size_t start() const; + /// Return size of slice. + size_t size() const; + /// Return array stride of slice. + size_t stride() const; + + private: + size_t _M_off; // offset + size_t _M_sz; // size + size_t _M_st; // stride unit + }; + + // The default constructor constructor is not required to initialize + // data members with any meaningful values, so we choose to do nothing. + inline + slice::slice() {} + + inline + slice::slice(size_t __o, size_t __d, size_t __s) + : _M_off(__o), _M_sz(__d), _M_st(__s) {} + + inline size_t + slice::start() const + { return _M_off; } + + inline size_t + slice::size() const + { return _M_sz; } + + inline size_t + slice::stride() const + { return _M_st; } + + /** + * @brief Reference to one-dimensional subset of an array. + * + * A slice_array is a reference to the actual elements of an array + * specified by a slice. The way to get a slice_array is to call + * operator[](slice) on a valarray. The returned slice_array then permits + * carrying operations out on the referenced subset of elements in the + * original valarray. For example, operator+=(valarray) will add values + * to the subset of elements in the underlying valarray this slice_array + * refers to. + * + * @param Tp Element type. + */ + template + class slice_array + { + public: + typedef _Tp value_type; + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 253. valarray helper functions are almost entirely useless + + /// Copy constructor. Both slices refer to the same underlying array. + slice_array(const slice_array&); + + /// Assignment operator. Assigns slice elements to corresponding + /// elements of @a a. + slice_array& operator=(const slice_array&); + + /// Assign slice elements to corresponding elements of @a v. + void operator=(const valarray<_Tp>&) const; + /// Multiply slice elements by corresponding elements of @a v. + void operator*=(const valarray<_Tp>&) const; + /// Divide slice elements by corresponding elements of @a v. + void operator/=(const valarray<_Tp>&) const; + /// Modulo slice elements by corresponding elements of @a v. + void operator%=(const valarray<_Tp>&) const; + /// Add corresponding elements of @a v to slice elements. + void operator+=(const valarray<_Tp>&) const; + /// Subtract corresponding elements of @a v from slice elements. + void operator-=(const valarray<_Tp>&) const; + /// Logical xor slice elements with corresponding elements of @a v. + void operator^=(const valarray<_Tp>&) const; + /// Logical and slice elements with corresponding elements of @a v. + void operator&=(const valarray<_Tp>&) const; + /// Logical or slice elements with corresponding elements of @a v. + void operator|=(const valarray<_Tp>&) const; + /// Left shift slice elements by corresponding elements of @a v. + void operator<<=(const valarray<_Tp>&) const; + /// Right shift slice elements by corresponding elements of @a v. + void operator>>=(const valarray<_Tp>&) const; + /// Assign all slice elements to @a t. + void operator=(const _Tp &) const; + // ~slice_array (); + + template + void operator=(const _Expr<_Dom, _Tp>&) const; + template + void operator*=(const _Expr<_Dom, _Tp>&) const; + template + void operator/=(const _Expr<_Dom, _Tp>&) const; + template + void operator%=(const _Expr<_Dom, _Tp>&) const; + template + void operator+=(const _Expr<_Dom, _Tp>&) const; + template + void operator-=(const _Expr<_Dom, _Tp>&) const; + template + void operator^=(const _Expr<_Dom, _Tp>&) const; + template + void operator&=(const _Expr<_Dom, _Tp>&) const; + template + void operator|=(const _Expr<_Dom, _Tp>&) const; + template + void operator<<=(const _Expr<_Dom, _Tp>&) const; + template + void operator>>=(const _Expr<_Dom, _Tp>&) const; + + private: + friend class valarray<_Tp>; + slice_array(_Array<_Tp>, const slice&); + + const size_t _M_sz; + const size_t _M_stride; + const _Array<_Tp> _M_array; + + // not implemented + slice_array(); + }; + + template + inline + slice_array<_Tp>::slice_array(_Array<_Tp> __a, const slice& __s) + : _M_sz(__s.size()), _M_stride(__s.stride()), + _M_array(__a.begin() + __s.start()) {} + + template + inline + slice_array<_Tp>::slice_array(const slice_array<_Tp>& a) + : _M_sz(a._M_sz), _M_stride(a._M_stride), _M_array(a._M_array) {} + + // template + // inline slice_array<_Tp>::~slice_array () {} + + template + inline slice_array<_Tp>& + slice_array<_Tp>::operator=(const slice_array<_Tp>& __a) + { + std::__valarray_copy(__a._M_array, __a._M_sz, __a._M_stride, + _M_array, _M_stride); + return *this; + } + + template + inline void + slice_array<_Tp>::operator=(const _Tp& __t) const + { std::__valarray_fill(_M_array, _M_sz, _M_stride, __t); } + + template + inline void + slice_array<_Tp>::operator=(const valarray<_Tp>& __v) const + { std::__valarray_copy(_Array<_Tp>(__v), _M_array, _M_sz, _M_stride); } + + template + template + inline void + slice_array<_Tp>::operator=(const _Expr<_Dom,_Tp>& __e) const + { std::__valarray_copy(__e, _M_sz, _M_array, _M_stride); } + +#undef _DEFINE_VALARRAY_OPERATOR +#define _DEFINE_VALARRAY_OPERATOR(_Op,_Name) \ + template \ + inline void \ + slice_array<_Tp>::operator _Op##=(const valarray<_Tp>& __v) const \ + { \ + _Array_augmented_##_Name(_M_array, _M_sz, _M_stride, _Array<_Tp>(__v));\ + } \ + \ + template \ + template \ + inline void \ + slice_array<_Tp>::operator _Op##=(const _Expr<_Dom,_Tp>& __e) const\ + { \ + _Array_augmented_##_Name(_M_array, _M_stride, __e, _M_sz); \ + } + + +_DEFINE_VALARRAY_OPERATOR(*, __multiplies) +_DEFINE_VALARRAY_OPERATOR(/, __divides) +_DEFINE_VALARRAY_OPERATOR(%, __modulus) +_DEFINE_VALARRAY_OPERATOR(+, __plus) +_DEFINE_VALARRAY_OPERATOR(-, __minus) +_DEFINE_VALARRAY_OPERATOR(^, __bitwise_xor) +_DEFINE_VALARRAY_OPERATOR(&, __bitwise_and) +_DEFINE_VALARRAY_OPERATOR(|, __bitwise_or) +_DEFINE_VALARRAY_OPERATOR(<<, __shift_left) +_DEFINE_VALARRAY_OPERATOR(>>, __shift_right) + +#undef _DEFINE_VALARRAY_OPERATOR + +} // namespace std + +#endif /* _SLICE_ARRAY_H */ diff --git a/cpp_src/sstream b/cpp_src/sstream new file mode 100644 index 0000000..f695495 --- /dev/null +++ b/cpp_src/sstream @@ -0,0 +1,591 @@ +// String based streams -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file sstream + * This is a Standard C++ Library header. + */ + +// +// ISO C++ 14882: 27.7 String-based streams +// + +#ifndef _GLIBCXX_SSTREAM +#define _GLIBCXX_SSTREAM 1 + +#pragma GCC system_header + +#include +#include + +namespace std { + + // [27.7.1] template class basic_stringbuf + /** + * @brief The actual work of input and output (for std::string). + * + * This class associates either or both of its input and output sequences + * with a sequence of characters, which can be initialized from, or made + * available as, a @c std::basic_string. (Paraphrased from [27.7.1]/1.) + * + * For this class, open modes (of type @c ios_base::openmode) have + * @c in set if the input sequence can be read, and @c out set if the + * output sequence can be written. + */ + template + class basic_stringbuf : public basic_streambuf<_CharT, _Traits> + { + public: + // Types: + typedef _CharT char_type; + typedef _Traits traits_type; + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 251. basic_stringbuf missing allocator_type + typedef _Alloc allocator_type; + typedef typename traits_type::int_type int_type; + typedef typename traits_type::pos_type pos_type; + typedef typename traits_type::off_type off_type; + + typedef basic_streambuf __streambuf_type; + typedef basic_string __string_type; + typedef typename __string_type::size_type __size_type; + + protected: + /** + * @if maint + * Place to stash in || out || in | out settings for current stringbuf. + * @endif + */ + ios_base::openmode _M_mode; + + // Data Members: + __string_type _M_string; + + public: + // Constructors: + /** + * @brief Starts with an empty string buffer. + * @param mode Whether the buffer can read, or write, or both. + * + * The default constructor initializes the parent class using its + * own default ctor. + */ + explicit + basic_stringbuf(ios_base::openmode __mode = ios_base::in | ios_base::out) + : __streambuf_type(), _M_mode(__mode), _M_string() + { } + + /** + * @brief Starts with an existing string buffer. + * @param str A string to copy as a starting buffer. + * @param mode Whether the buffer can read, or write, or both. + * + * This constructor initializes the parent class using its + * own default ctor. + */ + explicit + basic_stringbuf(const __string_type& __str, + ios_base::openmode __mode = ios_base::in | ios_base::out) + : __streambuf_type(), _M_mode(), _M_string(__str.data(), __str.size()) + { _M_stringbuf_init(__mode); } + + // Get and set: + /** + * @brief Copying out the string buffer. + * @return A copy of one of the underlying sequences. + * + * "If the buffer is only created in input mode, the underlying + * character sequence is equal to the input sequence; otherwise, it + * is equal to the output sequence." [27.7.1.2]/1 + */ + __string_type + str() const + { + __string_type __ret; + if (this->pptr()) + { + // The current egptr() may not be the actual string end. + if (this->pptr() > this->egptr()) + __ret = __string_type(this->pbase(), this->pptr()); + else + __ret = __string_type(this->pbase(), this->egptr()); + } + else + __ret = _M_string; + return __ret; + } + + /** + * @brief Setting a new buffer. + * @param s The string to use as a new sequence. + * + * Deallocates any previous stored sequence, then copies @a s to + * use as a new one. + */ + void + str(const __string_type& __s) + { + // Cannot use _M_string = __s, since v3 strings are COW. + _M_string.assign(__s.data(), __s.size()); + _M_stringbuf_init(_M_mode); + } + + protected: + // Common initialization code goes here. + void + _M_stringbuf_init(ios_base::openmode __mode) + { + _M_mode = __mode; + __size_type __len = 0; + if (_M_mode & (ios_base::ate | ios_base::app)) + __len = _M_string.size(); + _M_sync(const_cast(_M_string.data()), 0, __len); + } + + virtual streamsize + showmanyc() + { + streamsize __ret = -1; + if (_M_mode & ios_base::in) + { + _M_update_egptr(); + __ret = this->egptr() - this->gptr(); + } + return __ret; + } + + virtual int_type + underflow(); + + virtual int_type + pbackfail(int_type __c = traits_type::eof()); + + virtual int_type + overflow(int_type __c = traits_type::eof()); + + /** + * @brief Manipulates the buffer. + * @param s Pointer to a buffer area. + * @param n Size of @a s. + * @return @c this + * + * If no buffer has already been created, and both @a s and @a n are + * non-zero, then @c s is used as a buffer; see + * http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#2 + * for more. + */ + virtual __streambuf_type* + setbuf(char_type* __s, streamsize __n) + { + if (__s && __n >= 0) + { + // This is implementation-defined behavior, and assumes + // that an external char_type array of length __n exists + // and has been pre-allocated. If this is not the case, + // things will quickly blow up. + + // Step 1: Destroy the current internal array. + _M_string.clear(); + + // Step 2: Use the external array. + _M_sync(__s, __n, 0); + } + return this; + } + + virtual pos_type + seekoff(off_type __off, ios_base::seekdir __way, + ios_base::openmode __mode = ios_base::in | ios_base::out); + + virtual pos_type + seekpos(pos_type __sp, + ios_base::openmode __mode = ios_base::in | ios_base::out); + + // Internal function for correctly updating the internal buffer + // for a particular _M_string, due to initialization or re-sizing + // of an existing _M_string. + void + _M_sync(char_type* __base, __size_type __i, __size_type __o); + + // Internal function for correctly updating egptr() to the actual + // string end. + void + _M_update_egptr() + { + const bool __testin = _M_mode & ios_base::in; + if (this->pptr() && this->pptr() > this->egptr()) + if (__testin) + this->setg(this->eback(), this->gptr(), this->pptr()); + else + this->setg(this->pptr(), this->pptr(), this->pptr()); + } + }; + + + // [27.7.2] Template class basic_istringstream + /** + * @brief Controlling input for std::string. + * + * This class supports reading from objects of type std::basic_string, + * using the inherited functions from std::basic_istream. To control + * the associated sequence, an instance of std::basic_stringbuf is used, + * which this page refers to as @c sb. + */ + template + class basic_istringstream : public basic_istream<_CharT, _Traits> + { + public: + // Types: + typedef _CharT char_type; + typedef _Traits traits_type; + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 251. basic_stringbuf missing allocator_type + typedef _Alloc allocator_type; + typedef typename traits_type::int_type int_type; + typedef typename traits_type::pos_type pos_type; + typedef typename traits_type::off_type off_type; + + // Non-standard types: + typedef basic_string<_CharT, _Traits, _Alloc> __string_type; + typedef basic_stringbuf<_CharT, _Traits, _Alloc> __stringbuf_type; + typedef basic_istream __istream_type; + + private: + __stringbuf_type _M_stringbuf; + + public: + // Constructors: + /** + * @brief Default constructor starts with an empty string buffer. + * @param mode Whether the buffer can read, or write, or both. + * + * @c ios_base::in is automatically included in @a mode. + * + * Initializes @c sb using @c mode|in, and passes @c &sb to the base + * class initializer. Does not allocate any buffer. + * + * @if maint + * That's a lie. We initialize the base class with NULL, because the + * string class does its own memory management. + * @endif + */ + explicit + basic_istringstream(ios_base::openmode __mode = ios_base::in) + : __istream_type(), _M_stringbuf(__mode | ios_base::in) + { this->init(&_M_stringbuf); } + + /** + * @brief Starts with an existing string buffer. + * @param str A string to copy as a starting buffer. + * @param mode Whether the buffer can read, or write, or both. + * + * @c ios_base::in is automatically included in @a mode. + * + * Initializes @c sb using @a str and @c mode|in, and passes @c &sb + * to the base class initializer. + * + * @if maint + * That's a lie. We initialize the base class with NULL, because the + * string class does its own memory management. + * @endif + */ + explicit + basic_istringstream(const __string_type& __str, + ios_base::openmode __mode = ios_base::in) + : __istream_type(), _M_stringbuf(__str, __mode | ios_base::in) + { this->init(&_M_stringbuf); } + + /** + * @brief The destructor does nothing. + * + * The buffer is deallocated by the stringbuf object, not the + * formatting stream. + */ + ~basic_istringstream() + { } + + // Members: + /** + * @brief Accessing the underlying buffer. + * @return The current basic_stringbuf buffer. + * + * This hides both signatures of std::basic_ios::rdbuf(). + */ + __stringbuf_type* + rdbuf() const + { return const_cast<__stringbuf_type*>(&_M_stringbuf); } + + /** + * @brief Copying out the string buffer. + * @return @c rdbuf()->str() + */ + __string_type + str() const + { return _M_stringbuf.str(); } + + /** + * @brief Setting a new buffer. + * @param s The string to use as a new sequence. + * + * Calls @c rdbuf()->str(s). + */ + void + str(const __string_type& __s) + { _M_stringbuf.str(__s); } + }; + + + // [27.7.3] Template class basic_ostringstream + /** + * @brief Controlling output for std::string. + * + * This class supports writing to objects of type std::basic_string, + * using the inherited functions from std::basic_ostream. To control + * the associated sequence, an instance of std::basic_stringbuf is used, + * which this page refers to as @c sb. + */ + template + class basic_ostringstream : public basic_ostream<_CharT, _Traits> + { + public: + // Types: + typedef _CharT char_type; + typedef _Traits traits_type; + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 251. basic_stringbuf missing allocator_type + typedef _Alloc allocator_type; + typedef typename traits_type::int_type int_type; + typedef typename traits_type::pos_type pos_type; + typedef typename traits_type::off_type off_type; + + // Non-standard types: + typedef basic_string<_CharT, _Traits, _Alloc> __string_type; + typedef basic_stringbuf<_CharT, _Traits, _Alloc> __stringbuf_type; + typedef basic_ostream __ostream_type; + + private: + __stringbuf_type _M_stringbuf; + + public: + // Constructors/destructor: + /** + * @brief Default constructor starts with an empty string buffer. + * @param mode Whether the buffer can read, or write, or both. + * + * @c ios_base::out is automatically included in @a mode. + * + * Initializes @c sb using @c mode|out, and passes @c &sb to the base + * class initializer. Does not allocate any buffer. + * + * @if maint + * That's a lie. We initialize the base class with NULL, because the + * string class does its own memory management. + * @endif + */ + explicit + basic_ostringstream(ios_base::openmode __mode = ios_base::out) + : __ostream_type(), _M_stringbuf(__mode | ios_base::out) + { this->init(&_M_stringbuf); } + + /** + * @brief Starts with an existing string buffer. + * @param str A string to copy as a starting buffer. + * @param mode Whether the buffer can read, or write, or both. + * + * @c ios_base::out is automatically included in @a mode. + * + * Initializes @c sb using @a str and @c mode|out, and passes @c &sb + * to the base class initializer. + * + * @if maint + * That's a lie. We initialize the base class with NULL, because the + * string class does its own memory management. + * @endif + */ + explicit + basic_ostringstream(const __string_type& __str, + ios_base::openmode __mode = ios_base::out) + : __ostream_type(), _M_stringbuf(__str, __mode | ios_base::out) + { this->init(&_M_stringbuf); } + + /** + * @brief The destructor does nothing. + * + * The buffer is deallocated by the stringbuf object, not the + * formatting stream. + */ + ~basic_ostringstream() + { } + + // Members: + /** + * @brief Accessing the underlying buffer. + * @return The current basic_stringbuf buffer. + * + * This hides both signatures of std::basic_ios::rdbuf(). + */ + __stringbuf_type* + rdbuf() const + { return const_cast<__stringbuf_type*>(&_M_stringbuf); } + + /** + * @brief Copying out the string buffer. + * @return @c rdbuf()->str() + */ + __string_type + str() const + { return _M_stringbuf.str(); } + + /** + * @brief Setting a new buffer. + * @param s The string to use as a new sequence. + * + * Calls @c rdbuf()->str(s). + */ + void + str(const __string_type& __s) + { _M_stringbuf.str(__s); } + }; + + + // [27.7.4] Template class basic_stringstream + /** + * @brief Controlling input and output for std::string. + * + * This class supports reading from and writing to objects of type + * std::basic_string, using the inherited functions from + * std::basic_iostream. To control the associated sequence, an instance + * of std::basic_stringbuf is used, which this page refers to as @c sb. + */ + template + class basic_stringstream : public basic_iostream<_CharT, _Traits> + { + public: + // Types: + typedef _CharT char_type; + typedef _Traits traits_type; + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 251. basic_stringbuf missing allocator_type + typedef _Alloc allocator_type; + typedef typename traits_type::int_type int_type; + typedef typename traits_type::pos_type pos_type; + typedef typename traits_type::off_type off_type; + + // Non-standard Types: + typedef basic_string<_CharT, _Traits, _Alloc> __string_type; + typedef basic_stringbuf<_CharT, _Traits, _Alloc> __stringbuf_type; + typedef basic_iostream __iostream_type; + + private: + __stringbuf_type _M_stringbuf; + + public: + // Constructors/destructors + /** + * @brief Default constructor starts with an empty string buffer. + * @param mode Whether the buffer can read, or write, or both. + * + * Initializes @c sb using @c mode, and passes @c &sb to the base + * class initializer. Does not allocate any buffer. + * + * @if maint + * That's a lie. We initialize the base class with NULL, because the + * string class does its own memory management. + * @endif + */ + explicit + basic_stringstream(ios_base::openmode __m = ios_base::out | ios_base::in) + : __iostream_type(), _M_stringbuf(__m) + { this->init(&_M_stringbuf); } + + /** + * @brief Starts with an existing string buffer. + * @param str A string to copy as a starting buffer. + * @param mode Whether the buffer can read, or write, or both. + * + * Initializes @c sb using @a str and @c mode, and passes @c &sb + * to the base class initializer. + * + * @if maint + * That's a lie. We initialize the base class with NULL, because the + * string class does its own memory management. + * @endif + */ + explicit + basic_stringstream(const __string_type& __str, + ios_base::openmode __m = ios_base::out | ios_base::in) + : __iostream_type(), _M_stringbuf(__str, __m) + { this->init(&_M_stringbuf); } + + /** + * @brief The destructor does nothing. + * + * The buffer is deallocated by the stringbuf object, not the + * formatting stream. + */ + ~basic_stringstream() + { } + + // Members: + /** + * @brief Accessing the underlying buffer. + * @return The current basic_stringbuf buffer. + * + * This hides both signatures of std::basic_ios::rdbuf(). + */ + __stringbuf_type* + rdbuf() const + { return const_cast<__stringbuf_type*>(&_M_stringbuf); } + + /** + * @brief Copying out the string buffer. + * @return @c rdbuf()->str() + */ + __string_type + str() const + { return _M_stringbuf.str(); } + + /** + * @brief Setting a new buffer. + * @param s The string to use as a new sequence. + * + * Calls @c rdbuf()->str(s). + */ + void + str(const __string_type& __s) + { _M_stringbuf.str(__s); } + }; + +} // namespace std + +#ifndef _GLIBCXX_EXPORT_TEMPLATE +# include +#endif + +#endif /* _GLIBCXX_SSTREAM */ diff --git a/cpp_src/sstream.tcc b/cpp_src/sstream.tcc new file mode 100644 index 0000000..21053c7 --- /dev/null +++ b/cpp_src/sstream.tcc @@ -0,0 +1,279 @@ +// String based streams -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file sstream.tcc + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 27.7 String-based streams +// + +#ifndef _SSTREAM_TCC +#define _SSTREAM_TCC 1 + +#pragma GCC system_header + +#include + +namespace std { + + template + typename basic_stringbuf<_CharT, _Traits, _Alloc>::int_type + basic_stringbuf<_CharT, _Traits, _Alloc>:: + pbackfail(int_type __c) + { + int_type __ret = traits_type::eof(); + if (this->eback() < this->gptr()) + { + // Try to put back __c into input sequence in one of three ways. + // Order these tests done in is unspecified by the standard. + const bool __testeof = traits_type::eq_int_type(__c, __ret); + if (!__testeof) + { + const bool __testeq = traits_type::eq(traits_type:: + to_char_type(__c), + this->gptr()[-1]); + const bool __testout = this->_M_mode & ios_base::out; + if (__testeq || __testout) + { + this->gbump(-1); + if (!__testeq) + *this->gptr() = traits_type::to_char_type(__c); + __ret = __c; + } + } + else + { + this->gbump(-1); + __ret = traits_type::not_eof(__c); + } + } + return __ret; + } + + template + typename basic_stringbuf<_CharT, _Traits, _Alloc>::int_type + basic_stringbuf<_CharT, _Traits, _Alloc>:: + overflow(int_type __c) + { + const bool __testout = this->_M_mode & ios_base::out; + if (__builtin_expect(!__testout, false)) + return traits_type::eof(); + + const bool __testeof = traits_type::eq_int_type(__c, traits_type::eof()); + if (__builtin_expect(__testeof, false)) + return traits_type::not_eof(__c); + + const __size_type __capacity = _M_string.capacity(); + const __size_type __max_size = _M_string.max_size(); + const bool __testput = this->pptr() < this->epptr(); + if (__builtin_expect(!__testput && __capacity == __max_size, false)) + return traits_type::eof(); + + // Try to append __c into output sequence in one of two ways. + // Order these tests done in is unspecified by the standard. + const char_type __conv = traits_type::to_char_type(__c); + if (!__testput) + { + // NB: Start ostringstream buffers at 512 chars. This is an + // experimental value (pronounced "arbitrary" in some of the + // hipper english-speaking countries), and can be changed to + // suit particular needs. + // + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 169. Bad efficiency of overflow() mandated + // 432. stringbuf::overflow() makes only one write position + // available + const __size_type __opt_len = std::max(__size_type(2 * __capacity), + __size_type(512)); + const __size_type __len = std::min(__opt_len, __max_size); + __string_type __tmp; + __tmp.reserve(__len); + if (this->pbase()) + __tmp.assign(this->pbase(), this->epptr() - this->pbase()); + __tmp.push_back(__conv); + _M_string.swap(__tmp); + _M_sync(const_cast(_M_string.data()), + this->gptr() - this->eback(), this->pptr() - this->pbase()); + } + else + *this->pptr() = __conv; + this->pbump(1); + return __c; + } + + template + typename basic_stringbuf<_CharT, _Traits, _Alloc>::int_type + basic_stringbuf<_CharT, _Traits, _Alloc>:: + underflow() + { + int_type __ret = traits_type::eof(); + const bool __testin = this->_M_mode & ios_base::in; + if (__testin) + { + // Update egptr() to match the actual string end. + _M_update_egptr(); + + if (this->gptr() < this->egptr()) + __ret = traits_type::to_int_type(*this->gptr()); + } + return __ret; + } + + template + typename basic_stringbuf<_CharT, _Traits, _Alloc>::pos_type + basic_stringbuf<_CharT, _Traits, _Alloc>:: + seekoff(off_type __off, ios_base::seekdir __way, ios_base::openmode __mode) + { + pos_type __ret = pos_type(off_type(-1)); + bool __testin = (ios_base::in & this->_M_mode & __mode) != 0; + bool __testout = (ios_base::out & this->_M_mode & __mode) != 0; + const bool __testboth = __testin && __testout && __way != ios_base::cur; + __testin &= !(__mode & ios_base::out); + __testout &= !(__mode & ios_base::in); + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 453. basic_stringbuf::seekoff need not always fail for an empty stream. + const char_type* __beg = __testin ? this->eback() : this->pbase(); + if ((__beg || !__off) && (__testin || __testout || __testboth)) + { + _M_update_egptr(); + + off_type __newoffi = __off; + off_type __newoffo = __newoffi; + if (__way == ios_base::cur) + { + __newoffi += this->gptr() - __beg; + __newoffo += this->pptr() - __beg; + } + else if (__way == ios_base::end) + __newoffo = __newoffi += this->egptr() - __beg; + + if ((__testin || __testboth) + && __newoffi >= 0 + && this->egptr() - __beg >= __newoffi) + { + this->gbump((__beg + __newoffi) - this->gptr()); + __ret = pos_type(__newoffi); + } + if ((__testout || __testboth) + && __newoffo >= 0 + && this->egptr() - __beg >= __newoffo) + { + this->pbump((__beg + __newoffo) - this->pptr()); + __ret = pos_type(__newoffo); + } + } + return __ret; + } + + template + typename basic_stringbuf<_CharT, _Traits, _Alloc>::pos_type + basic_stringbuf<_CharT, _Traits, _Alloc>:: + seekpos(pos_type __sp, ios_base::openmode __mode) + { + pos_type __ret = pos_type(off_type(-1)); + const bool __testin = (ios_base::in & this->_M_mode & __mode) != 0; + const bool __testout = (ios_base::out & this->_M_mode & __mode) != 0; + + const char_type* __beg = __testin ? this->eback() : this->pbase(); + if ((__beg || !off_type(__sp)) && (__testin || __testout)) + { + _M_update_egptr(); + + const off_type __pos(__sp); + const bool __testpos = (0 <= __pos + && __pos <= this->egptr() - __beg); + if (__testpos) + { + if (__testin) + this->gbump((__beg + __pos) - this->gptr()); + if (__testout) + this->pbump((__beg + __pos) - this->pptr()); + __ret = __sp; + } + } + return __ret; + } + + template + void + basic_stringbuf<_CharT, _Traits, _Alloc>:: + _M_sync(char_type* __base, __size_type __i, __size_type __o) + { + const bool __testin = _M_mode & ios_base::in; + const bool __testout = _M_mode & ios_base::out; + char_type* __endg = __base + _M_string.size(); + char_type* __endp = __base + _M_string.capacity(); + + if (__base != _M_string.data()) + { + // setbuf: __i == size of buffer area (_M_string.size() == 0). + __endg += __i; + __i = 0; + __endp = __endg; + } + + if (__testin) + this->setg(__base, __base + __i, __endg); + if (__testout) + { + this->setp(__base, __endp); + this->pbump(__o); + // egptr() always tracks the string end. When !__testin, + // for the correct functioning of the streambuf inlines + // the other get area pointers are identical. + if (!__testin) + this->setg(__endg, __endg, __endg); + } + } + + // Inhibit implicit instantiations for required instantiations, + // which are defined via explicit instantiations elsewhere. + // NB: This syntax is a GNU extension. +#if _GLIBCXX_EXTERN_TEMPLATE + extern template class basic_stringbuf; + extern template class basic_istringstream; + extern template class basic_ostringstream; + extern template class basic_stringstream; + +#ifdef _GLIBCXX_USE_WCHAR_T + extern template class basic_stringbuf; + extern template class basic_istringstream; + extern template class basic_ostringstream; + extern template class basic_stringstream; +#endif +#endif + +} // namespace std + +#endif diff --git a/cpp_src/stack b/cpp_src/stack new file mode 100644 index 0000000..396f62e --- /dev/null +++ b/cpp_src/stack @@ -0,0 +1,72 @@ +// -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file include/stack + * This is a Standard C++ Library header. + */ + +#ifndef _GLIBCXX_STACK +#define _GLIBCXX_STACK 1 + +#pragma GCC system_header + +#include +#include +#include +#include +#include +#include + +#endif /* _GLIBCXX_STACK */ diff --git a/cpp_src/stdexcept b/cpp_src/stdexcept new file mode 100644 index 0000000..397f683 --- /dev/null +++ b/cpp_src/stdexcept @@ -0,0 +1,148 @@ +// Standard exception classes -*- C++ -*- + +// Copyright (C) 2001, 2002, 2005 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file stdexcept + * This is a Standard C++ Library header. + */ + +// +// ISO C++ 19.1 Exception classes +// + +#ifndef _GLIBCXX_STDEXCEPT +#define _GLIBCXX_STDEXCEPT 1 + +#pragma GCC system_header + +#include +#include + +namespace std { + + /** Logic errors represent problems in the internal logic of a program; + * in theory, these are preventable, and even detectable before the + * program runs (e.g., violations of class invariants). + * @brief One of two subclasses of exception. + */ + class logic_error : public exception + { + string _M_msg; + + public: + /** Takes a character string describing the error. */ + explicit + logic_error(const string& __arg); + + virtual + ~logic_error() throw(); + + /** Returns a C-style character string describing the general cause of + * the current error (the same string passed to the ctor). */ + virtual const char* + what() const throw(); + }; + + /** Thrown by the library, or by you, to report domain errors (domain in + * the mathmatical sense). */ + class domain_error : public logic_error + { + public: + explicit domain_error(const string& __arg); + }; + + /** Thrown to report invalid arguments to functions. */ + class invalid_argument : public logic_error + { + public: + explicit invalid_argument(const string& __arg); + }; + + /** Thrown when an object is constructed that would exceed its maximum + * permitted size (e.g., a basic_string instance). */ + class length_error : public logic_error + { + public: + explicit length_error(const string& __arg); + }; + + /** This represents an argument whose value is not within the expected + * range (e.g., boundary checks in basic_string). */ + class out_of_range : public logic_error + { + public: + explicit out_of_range(const string& __arg); + }; + + /** Runtime errors represent problems outside the scope of a program; + * they cannot be easily predicted and can generally only be caught as + * the program executes. + * @brief One of two subclasses of exception. + */ + class runtime_error : public exception + { + string _M_msg; + + public: + /** Takes a character string describing the error. */ + explicit + runtime_error(const string& __arg); + + virtual + ~runtime_error() throw(); + + /** Returns a C-style character string describing the general cause of + * the current error (the same string passed to the ctor). */ + virtual const char* + what() const throw(); + }; + + /** Thrown to indicate range errors in internal computations. */ + class range_error : public runtime_error + { + public: + explicit range_error(const string& __arg); + }; + + /** Thrown to indicate arithmetic overflow. */ + class overflow_error : public runtime_error + { + public: + explicit overflow_error(const string& __arg); + }; + + /** Thrown to indicate arithmetic underflow. */ + class underflow_error : public runtime_error + { + public: + explicit underflow_error(const string& __arg); + }; + +} // namespace std + +#endif /* _GLIBCXX_STDEXCEPT */ diff --git a/cpp_src/stl_algo.h b/cpp_src/stl_algo.h new file mode 100644 index 0000000..63e1a47 --- /dev/null +++ b/cpp_src/stl_algo.h @@ -0,0 +1,5504 @@ +// Algorithm implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_algo.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _ALGO_H +#define _ALGO_H 1 + +#include +#include // for _Temporary_buffer +#include + +// See concept_check.h for the __glibcxx_*_requires macros. + +namespace std { + + /** + * @brief Find the median of three values. + * @param a A value. + * @param b A value. + * @param c A value. + * @return One of @p a, @p b or @p c. + * + * If @c {l,m,n} is some convolution of @p {a,b,c} such that @c l<=m<=n + * then the value returned will be @c m. + * This is an SGI extension. + * @ingroup SGIextensions + */ + template + inline const _Tp& + __median(const _Tp& __a, const _Tp& __b, const _Tp& __c) + { + // concept requirements + __glibcxx_function_requires(_LessThanComparableConcept<_Tp>) + if (__a < __b) + if (__b < __c) + return __b; + else if (__a < __c) + return __c; + else + return __a; + else if (__a < __c) + return __a; + else if (__b < __c) + return __c; + else + return __b; + } + + /** + * @brief Find the median of three values using a predicate for comparison. + * @param a A value. + * @param b A value. + * @param c A value. + * @param comp A binary predicate. + * @return One of @p a, @p b or @p c. + * + * If @c {l,m,n} is some convolution of @p {a,b,c} such that @p comp(l,m) + * and @p comp(m,n) are both true then the value returned will be @c m. + * This is an SGI extension. + * @ingroup SGIextensions + */ + template + inline const _Tp& + __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp) + { + // concept requirements + __glibcxx_function_requires(_BinaryFunctionConcept<_Compare,bool,_Tp,_Tp>) + if (__comp(__a, __b)) + if (__comp(__b, __c)) + return __b; + else if (__comp(__a, __c)) + return __c; + else + return __a; + else if (__comp(__a, __c)) + return __a; + else if (__comp(__b, __c)) + return __c; + else + return __b; + } + + /** + * @brief Apply a function to every element of a sequence. + * @param first An input iterator. + * @param last An input iterator. + * @param f A unary function object. + * @return @p f. + * + * Applies the function object @p f to each element in the range + * @p [first,last). @p f must not modify the order of the sequence. + * If @p f has a return value it is ignored. + */ + template + _Function + for_each(_InputIterator __first, _InputIterator __last, _Function __f) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_requires_valid_range(__first, __last); + for ( ; __first != __last; ++__first) + __f(*__first); + return __f; + } + + /** + * @if maint + * This is an overload used by find() for the Input Iterator case. + * @endif + */ + template + inline _InputIterator + __find(_InputIterator __first, _InputIterator __last, + const _Tp& __val, input_iterator_tag) + { + while (__first != __last && !(*__first == __val)) + ++__first; + return __first; + } + + /** + * @if maint + * This is an overload used by find_if() for the Input Iterator case. + * @endif + */ + template + inline _InputIterator + __find_if(_InputIterator __first, _InputIterator __last, + _Predicate __pred, input_iterator_tag) + { + while (__first != __last && !__pred(*__first)) + ++__first; + return __first; + } + + /** + * @if maint + * This is an overload used by find() for the RAI case. + * @endif + */ + template + _RandomAccessIterator + __find(_RandomAccessIterator __first, _RandomAccessIterator __last, + const _Tp& __val, random_access_iterator_tag) + { + typename iterator_traits<_RandomAccessIterator>::difference_type + __trip_count = (__last - __first) >> 2; + + for ( ; __trip_count > 0 ; --__trip_count) + { + if (*__first == __val) + return __first; + ++__first; + + if (*__first == __val) + return __first; + ++__first; + + if (*__first == __val) + return __first; + ++__first; + + if (*__first == __val) + return __first; + ++__first; + } + + switch (__last - __first) + { + case 3: + if (*__first == __val) + return __first; + ++__first; + case 2: + if (*__first == __val) + return __first; + ++__first; + case 1: + if (*__first == __val) + return __first; + ++__first; + case 0: + default: + return __last; + } + } + + /** + * @if maint + * This is an overload used by find_if() for the RAI case. + * @endif + */ + template + _RandomAccessIterator + __find_if(_RandomAccessIterator __first, _RandomAccessIterator __last, + _Predicate __pred, random_access_iterator_tag) + { + typename iterator_traits<_RandomAccessIterator>::difference_type + __trip_count = (__last - __first) >> 2; + + for ( ; __trip_count > 0 ; --__trip_count) + { + if (__pred(*__first)) + return __first; + ++__first; + + if (__pred(*__first)) + return __first; + ++__first; + + if (__pred(*__first)) + return __first; + ++__first; + + if (__pred(*__first)) + return __first; + ++__first; + } + + switch (__last - __first) + { + case 3: + if (__pred(*__first)) + return __first; + ++__first; + case 2: + if (__pred(*__first)) + return __first; + ++__first; + case 1: + if (__pred(*__first)) + return __first; + ++__first; + case 0: + default: + return __last; + } + } + + /** + * @if maint + * This is an overload of find() for streambuf iterators. + * @endif + */ + template + typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, + istreambuf_iterator<_CharT> >::__type + find(istreambuf_iterator<_CharT>, istreambuf_iterator<_CharT>, + const _CharT&); + + /** + * @brief Find the first occurrence of a value in a sequence. + * @param first An input iterator. + * @param last An input iterator. + * @param val The value to find. + * @return The first iterator @c i in the range @p [first,last) + * such that @c *i == @p val, or @p last if no such iterator exists. + */ + template + inline _InputIterator + find(_InputIterator __first, _InputIterator __last, + const _Tp& __val) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_EqualOpConcept< + typename iterator_traits<_InputIterator>::value_type, _Tp>) + __glibcxx_requires_valid_range(__first, __last); + return std::__find(__first, __last, __val, + std::__iterator_category(__first)); + } + + /** + * @brief Find the first element in a sequence for which a predicate is true. + * @param first An input iterator. + * @param last An input iterator. + * @param pred A predicate. + * @return The first iterator @c i in the range @p [first,last) + * such that @p pred(*i) is true, or @p last if no such iterator exists. + */ + template + inline _InputIterator + find_if(_InputIterator __first, _InputIterator __last, + _Predicate __pred) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, + typename iterator_traits<_InputIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + return std::__find_if(__first, __last, __pred, + std::__iterator_category(__first)); + } + + /** + * @brief Find two adjacent values in a sequence that are equal. + * @param first A forward iterator. + * @param last A forward iterator. + * @return The first iterator @c i such that @c i and @c i+1 are both + * valid iterators in @p [first,last) and such that @c *i == @c *(i+1), + * or @p last if no such iterator exists. + */ + template + _ForwardIterator + adjacent_find(_ForwardIterator __first, _ForwardIterator __last) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_EqualityComparableConcept< + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + if (__first == __last) + return __last; + _ForwardIterator __next = __first; + while(++__next != __last) + { + if (*__first == *__next) + return __first; + __first = __next; + } + return __last; + } + + /** + * @brief Find two adjacent values in a sequence using a predicate. + * @param first A forward iterator. + * @param last A forward iterator. + * @param binary_pred A binary predicate. + * @return The first iterator @c i such that @c i and @c i+1 are both + * valid iterators in @p [first,last) and such that + * @p binary_pred(*i,*(i+1)) is true, or @p last if no such iterator + * exists. + */ + template + _ForwardIterator + adjacent_find(_ForwardIterator __first, _ForwardIterator __last, + _BinaryPredicate __binary_pred) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, + typename iterator_traits<_ForwardIterator>::value_type, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + if (__first == __last) + return __last; + _ForwardIterator __next = __first; + while(++__next != __last) + { + if (__binary_pred(*__first, *__next)) + return __first; + __first = __next; + } + return __last; + } + + /** + * @brief Count the number of copies of a value in a sequence. + * @param first An input iterator. + * @param last An input iterator. + * @param value The value to be counted. + * @return The number of iterators @c i in the range @p [first,last) + * for which @c *i == @p value + */ + template + typename iterator_traits<_InputIterator>::difference_type + count(_InputIterator __first, _InputIterator __last, const _Tp& __value) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_EqualOpConcept< + typename iterator_traits<_InputIterator>::value_type, _Tp>) + __glibcxx_requires_valid_range(__first, __last); + typename iterator_traits<_InputIterator>::difference_type __n = 0; + for ( ; __first != __last; ++__first) + if (*__first == __value) + ++__n; + return __n; + } + + /** + * @brief Count the elements of a sequence for which a predicate is true. + * @param first An input iterator. + * @param last An input iterator. + * @param pred A predicate. + * @return The number of iterators @c i in the range @p [first,last) + * for which @p pred(*i) is true. + */ + template + typename iterator_traits<_InputIterator>::difference_type + count_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, + typename iterator_traits<_InputIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + typename iterator_traits<_InputIterator>::difference_type __n = 0; + for ( ; __first != __last; ++__first) + if (__pred(*__first)) + ++__n; + return __n; + } + + /** + * @brief Search a sequence for a matching sub-sequence. + * @param first1 A forward iterator. + * @param last1 A forward iterator. + * @param first2 A forward iterator. + * @param last2 A forward iterator. + * @return The first iterator @c i in the range + * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N) + * for each @c N in the range @p [0,last2-first2), or @p last1 if no + * such iterator exists. + * + * Searches the range @p [first1,last1) for a sub-sequence that compares + * equal value-by-value with the sequence given by @p [first2,last2) and + * returns an iterator to the first element of the sub-sequence, or + * @p last1 if the sub-sequence is not found. + * + * Because the sub-sequence must lie completely within the range + * @p [first1,last1) it must start at a position less than + * @p last1-(last2-first2) where @p last2-first2 is the length of the + * sub-sequence. + * This means that the returned iterator @c i will be in the range + * @p [first1,last1-(last2-first2)) + */ + template + _ForwardIterator1 + search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, + _ForwardIterator2 __first2, _ForwardIterator2 __last2) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>) + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>) + __glibcxx_function_requires(_EqualOpConcept< + typename iterator_traits<_ForwardIterator1>::value_type, + typename iterator_traits<_ForwardIterator2>::value_type>) + __glibcxx_requires_valid_range(__first1, __last1); + __glibcxx_requires_valid_range(__first2, __last2); + // Test for empty ranges + if (__first1 == __last1 || __first2 == __last2) + return __first1; + + // Test for a pattern of length 1. + _ForwardIterator2 __tmp(__first2); + ++__tmp; + if (__tmp == __last2) + return std::find(__first1, __last1, *__first2); + + // General case. + _ForwardIterator2 __p1, __p; + __p1 = __first2; ++__p1; + _ForwardIterator1 __current = __first1; + + while (__first1 != __last1) + { + __first1 = std::find(__first1, __last1, *__first2); + if (__first1 == __last1) + return __last1; + + __p = __p1; + __current = __first1; + if (++__current == __last1) + return __last1; + + while (*__current == *__p) + { + if (++__p == __last2) + return __first1; + if (++__current == __last1) + return __last1; + } + ++__first1; + } + return __first1; + } + + /** + * @brief Search a sequence for a matching sub-sequence using a predicate. + * @param first1 A forward iterator. + * @param last1 A forward iterator. + * @param first2 A forward iterator. + * @param last2 A forward iterator. + * @param predicate A binary predicate. + * @return The first iterator @c i in the range + * @p [first1,last1-(last2-first2)) such that + * @p predicate(*(i+N),*(first2+N)) is true for each @c N in the range + * @p [0,last2-first2), or @p last1 if no such iterator exists. + * + * Searches the range @p [first1,last1) for a sub-sequence that compares + * equal value-by-value with the sequence given by @p [first2,last2), + * using @p predicate to determine equality, and returns an iterator + * to the first element of the sub-sequence, or @p last1 if no such + * iterator exists. + * + * @see search(_ForwardIter1, _ForwardIter1, _ForwardIter2, _ForwardIter2) + */ + template + _ForwardIterator1 + search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, + _ForwardIterator2 __first2, _ForwardIterator2 __last2, + _BinaryPredicate __predicate) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>) + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>) + __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, + typename iterator_traits<_ForwardIterator1>::value_type, + typename iterator_traits<_ForwardIterator2>::value_type>) + __glibcxx_requires_valid_range(__first1, __last1); + __glibcxx_requires_valid_range(__first2, __last2); + + // Test for empty ranges + if (__first1 == __last1 || __first2 == __last2) + return __first1; + + // Test for a pattern of length 1. + _ForwardIterator2 __tmp(__first2); + ++__tmp; + if (__tmp == __last2) + { + while (__first1 != __last1 && !__predicate(*__first1, *__first2)) + ++__first1; + return __first1; + } + + // General case. + _ForwardIterator2 __p1, __p; + __p1 = __first2; ++__p1; + _ForwardIterator1 __current = __first1; + + while (__first1 != __last1) + { + while (__first1 != __last1) + { + if (__predicate(*__first1, *__first2)) + break; + ++__first1; + } + while (__first1 != __last1 && !__predicate(*__first1, *__first2)) + ++__first1; + if (__first1 == __last1) + return __last1; + + __p = __p1; + __current = __first1; + if (++__current == __last1) + return __last1; + + while (__predicate(*__current, *__p)) + { + if (++__p == __last2) + return __first1; + if (++__current == __last1) + return __last1; + } + ++__first1; + } + return __first1; + } + + /** + * @if maint + * This is an uglified + * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&) + * overloaded for forward iterators. + * @endif + */ + template + _ForwardIterator + __search_n(_ForwardIterator __first, _ForwardIterator __last, + _Integer __count, const _Tp& __val, + std::forward_iterator_tag) + { + __first = std::find(__first, __last, __val); + while (__first != __last) + { + typename iterator_traits<_ForwardIterator>::difference_type + __n = __count; + _ForwardIterator __i = __first; + ++__i; + while (__i != __last && __n != 1 && *__i == __val) + { + ++__i; + --__n; + } + if (__n == 1) + return __first; + if (__i == __last) + return __last; + __first = std::find(++__i, __last, __val); + } + return __last; + } + + /** + * @if maint + * This is an uglified + * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&) + * overloaded for random access iterators. + * @endif + */ + template + _RandomAccessIter + __search_n(_RandomAccessIter __first, _RandomAccessIter __last, + _Integer __count, const _Tp& __val, + std::random_access_iterator_tag) + { + + typedef typename std::iterator_traits<_RandomAccessIter>::difference_type + _DistanceType; + + _DistanceType __tailSize = __last - __first; + const _DistanceType __pattSize = __count; + + if (__tailSize < __pattSize) + return __last; + + const _DistanceType __skipOffset = __pattSize - 1; + _RandomAccessIter __lookAhead = __first + __skipOffset; + __tailSize -= __pattSize; + + while (1) // the main loop... + { + // __lookAhead here is always pointing to the last element of next + // possible match. + while (!(*__lookAhead == __val)) // the skip loop... + { + if (__tailSize < __pattSize) + return __last; // Failure + __lookAhead += __pattSize; + __tailSize -= __pattSize; + } + _DistanceType __remainder = __skipOffset; + for (_RandomAccessIter __backTrack = __lookAhead - 1; + *__backTrack == __val; --__backTrack) + { + if (--__remainder == 0) + return (__lookAhead - __skipOffset); // Success + } + if (__remainder > __tailSize) + return __last; // Failure + __lookAhead += __remainder; + __tailSize -= __remainder; + } + } + + /** + * @brief Search a sequence for a number of consecutive values. + * @param first A forward iterator. + * @param last A forward iterator. + * @param count The number of consecutive values. + * @param val The value to find. + * @return The first iterator @c i in the range @p [first,last-count) + * such that @c *(i+N) == @p val for each @c N in the range @p [0,count), + * or @p last if no such iterator exists. + * + * Searches the range @p [first,last) for @p count consecutive elements + * equal to @p val. + */ + template + _ForwardIterator + search_n(_ForwardIterator __first, _ForwardIterator __last, + _Integer __count, const _Tp& __val) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_EqualOpConcept< + typename iterator_traits<_ForwardIterator>::value_type, _Tp>) + __glibcxx_requires_valid_range(__first, __last); + + if (__count <= 0) + return __first; + if (__count == 1) + return std::find(__first, __last, __val); + return std::__search_n(__first, __last, __count, __val, + std::__iterator_category(__first)); + } + + /** + * @if maint + * This is an uglified + * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&, + * _BinaryPredicate) + * overloaded for forward iterators. + * @endif + */ + template + _ForwardIterator + __search_n(_ForwardIterator __first, _ForwardIterator __last, + _Integer __count, const _Tp& __val, + _BinaryPredicate __binary_pred, std::forward_iterator_tag) + { + while (__first != __last && !__binary_pred(*__first, __val)) + ++__first; + + while (__first != __last) + { + typename iterator_traits<_ForwardIterator>::difference_type + __n = __count; + _ForwardIterator __i = __first; + ++__i; + while (__i != __last && __n != 1 && __binary_pred(*__i, __val)) + { + ++__i; + --__n; + } + if (__n == 1) + return __first; + if (__i == __last) + return __last; + __first = ++__i; + while (__first != __last && !__binary_pred(*__first, __val)) + ++__first; + } + return __last; + } + + /** + * @if maint + * This is an uglified + * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&, + * _BinaryPredicate) + * overloaded for random access iterators. + * @endif + */ + template + _RandomAccessIter + __search_n(_RandomAccessIter __first, _RandomAccessIter __last, + _Integer __count, const _Tp& __val, + _BinaryPredicate __binary_pred, std::random_access_iterator_tag) + { + + typedef typename std::iterator_traits<_RandomAccessIter>::difference_type + _DistanceType; + + _DistanceType __tailSize = __last - __first; + const _DistanceType __pattSize = __count; + + if (__tailSize < __pattSize) + return __last; + + const _DistanceType __skipOffset = __pattSize - 1; + _RandomAccessIter __lookAhead = __first + __skipOffset; + __tailSize -= __pattSize; + + while (1) // the main loop... + { + // __lookAhead here is always pointing to the last element of next + // possible match. + while (!__binary_pred(*__lookAhead, __val)) // the skip loop... + { + if (__tailSize < __pattSize) + return __last; // Failure + __lookAhead += __pattSize; + __tailSize -= __pattSize; + } + _DistanceType __remainder = __skipOffset; + for (_RandomAccessIter __backTrack = __lookAhead - 1; + __binary_pred(*__backTrack, __val); --__backTrack) + { + if (--__remainder == 0) + return (__lookAhead - __skipOffset); // Success + } + if (__remainder > __tailSize) + return __last; // Failure + __lookAhead += __remainder; + __tailSize -= __remainder; + } + } + + /** + * @brief Search a sequence for a number of consecutive values using a + * predicate. + * @param first A forward iterator. + * @param last A forward iterator. + * @param count The number of consecutive values. + * @param val The value to find. + * @param binary_pred A binary predicate. + * @return The first iterator @c i in the range @p [first,last-count) + * such that @p binary_pred(*(i+N),val) is true for each @c N in the + * range @p [0,count), or @p last if no such iterator exists. + * + * Searches the range @p [first,last) for @p count consecutive elements + * for which the predicate returns true. + */ + template + _ForwardIterator + search_n(_ForwardIterator __first, _ForwardIterator __last, + _Integer __count, const _Tp& __val, + _BinaryPredicate __binary_pred) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, + typename iterator_traits<_ForwardIterator>::value_type, _Tp>) + __glibcxx_requires_valid_range(__first, __last); + + if (__count <= 0) + return __first; + if (__count == 1) + { + while (__first != __last && !__binary_pred(*__first, __val)) + ++__first; + return __first; + } + return std::__search_n(__first, __last, __count, __val, __binary_pred, + std::__iterator_category(__first)); + } + + /** + * @brief Swap the elements of two sequences. + * @param first1 A forward iterator. + * @param last1 A forward iterator. + * @param first2 A forward iterator. + * @return An iterator equal to @p first2+(last1-first1). + * + * Swaps each element in the range @p [first1,last1) with the + * corresponding element in the range @p [first2,(last1-first1)). + * The ranges must not overlap. + */ + template + _ForwardIterator2 + swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1, + _ForwardIterator2 __first2) + { + // concept requirements + __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< + _ForwardIterator1>) + __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< + _ForwardIterator2>) + __glibcxx_function_requires(_ConvertibleConcept< + typename iterator_traits<_ForwardIterator1>::value_type, + typename iterator_traits<_ForwardIterator2>::value_type>) + __glibcxx_function_requires(_ConvertibleConcept< + typename iterator_traits<_ForwardIterator2>::value_type, + typename iterator_traits<_ForwardIterator1>::value_type>) + __glibcxx_requires_valid_range(__first1, __last1); + + for ( ; __first1 != __last1; ++__first1, ++__first2) + std::iter_swap(__first1, __first2); + return __first2; + } + + /** + * @brief Perform an operation on a sequence. + * @param first An input iterator. + * @param last An input iterator. + * @param result An output iterator. + * @param unary_op A unary operator. + * @return An output iterator equal to @p result+(last-first). + * + * Applies the operator to each element in the input range and assigns + * the results to successive elements of the output sequence. + * Evaluates @p *(result+N)=unary_op(*(first+N)) for each @c N in the + * range @p [0,last-first). + * + * @p unary_op must not alter its argument. + */ + template + _OutputIterator + transform(_InputIterator __first, _InputIterator __last, + _OutputIterator __result, _UnaryOperation __unary_op) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + // "the type returned by a _UnaryOperation" + __typeof__(__unary_op(*__first))>) + __glibcxx_requires_valid_range(__first, __last); + + for ( ; __first != __last; ++__first, ++__result) + *__result = __unary_op(*__first); + return __result; + } + + /** + * @brief Perform an operation on corresponding elements of two sequences. + * @param first1 An input iterator. + * @param last1 An input iterator. + * @param first2 An input iterator. + * @param result An output iterator. + * @param binary_op A binary operator. + * @return An output iterator equal to @p result+(last-first). + * + * Applies the operator to the corresponding elements in the two + * input ranges and assigns the results to successive elements of the + * output sequence. + * Evaluates @p *(result+N)=binary_op(*(first1+N),*(first2+N)) for each + * @c N in the range @p [0,last1-first1). + * + * @p binary_op must not alter either of its arguments. + */ + template + _OutputIterator + transform(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _OutputIterator __result, + _BinaryOperation __binary_op) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + // "the type returned by a _BinaryOperation" + __typeof__(__binary_op(*__first1,*__first2))>) + __glibcxx_requires_valid_range(__first1, __last1); + + for ( ; __first1 != __last1; ++__first1, ++__first2, ++__result) + *__result = __binary_op(*__first1, *__first2); + return __result; + } + + /** + * @brief Replace each occurrence of one value in a sequence with another + * value. + * @param first A forward iterator. + * @param last A forward iterator. + * @param old_value The value to be replaced. + * @param new_value The replacement value. + * @return replace() returns no value. + * + * For each iterator @c i in the range @p [first,last) if @c *i == + * @p old_value then the assignment @c *i = @p new_value is performed. + */ + template + void + replace(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __old_value, const _Tp& __new_value) + { + // concept requirements + __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< + _ForwardIterator>) + __glibcxx_function_requires(_EqualOpConcept< + typename iterator_traits<_ForwardIterator>::value_type, _Tp>) + __glibcxx_function_requires(_ConvertibleConcept<_Tp, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + for ( ; __first != __last; ++__first) + if (*__first == __old_value) + *__first = __new_value; + } + + /** + * @brief Replace each value in a sequence for which a predicate returns + * true with another value. + * @param first A forward iterator. + * @param last A forward iterator. + * @param pred A predicate. + * @param new_value The replacement value. + * @return replace_if() returns no value. + * + * For each iterator @c i in the range @p [first,last) if @p pred(*i) + * is true then the assignment @c *i = @p new_value is performed. + */ + template + void + replace_if(_ForwardIterator __first, _ForwardIterator __last, + _Predicate __pred, const _Tp& __new_value) + { + // concept requirements + __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< + _ForwardIterator>) + __glibcxx_function_requires(_ConvertibleConcept<_Tp, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + for ( ; __first != __last; ++__first) + if (__pred(*__first)) + *__first = __new_value; + } + + /** + * @brief Copy a sequence, replacing each element of one value with another + * value. + * @param first An input iterator. + * @param last An input iterator. + * @param result An output iterator. + * @param old_value The value to be replaced. + * @param new_value The replacement value. + * @return The end of the output sequence, @p result+(last-first). + * + * Copies each element in the input range @p [first,last) to the + * output range @p [result,result+(last-first)) replacing elements + * equal to @p old_value with @p new_value. + */ + template + _OutputIterator + replace_copy(_InputIterator __first, _InputIterator __last, + _OutputIterator __result, + const _Tp& __old_value, const _Tp& __new_value) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + typename iterator_traits<_InputIterator>::value_type>) + __glibcxx_function_requires(_EqualOpConcept< + typename iterator_traits<_InputIterator>::value_type, _Tp>) + __glibcxx_requires_valid_range(__first, __last); + + for ( ; __first != __last; ++__first, ++__result) + if (*__first == __old_value) + *__result = __new_value; + else + *__result = *__first; + return __result; + } + + /** + * @brief Copy a sequence, replacing each value for which a predicate + * returns true with another value. + * @param first An input iterator. + * @param last An input iterator. + * @param result An output iterator. + * @param pred A predicate. + * @param new_value The replacement value. + * @return The end of the output sequence, @p result+(last-first). + * + * Copies each element in the range @p [first,last) to the range + * @p [result,result+(last-first)) replacing elements for which + * @p pred returns true with @p new_value. + */ + template + _OutputIterator + replace_copy_if(_InputIterator __first, _InputIterator __last, + _OutputIterator __result, + _Predicate __pred, const _Tp& __new_value) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + typename iterator_traits<_InputIterator>::value_type>) + __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, + typename iterator_traits<_InputIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + for ( ; __first != __last; ++__first, ++__result) + if (__pred(*__first)) + *__result = __new_value; + else + *__result = *__first; + return __result; + } + + /** + * @brief Assign the result of a function object to each value in a + * sequence. + * @param first A forward iterator. + * @param last A forward iterator. + * @param gen A function object taking no arguments. + * @return generate() returns no value. + * + * Performs the assignment @c *i = @p gen() for each @c i in the range + * @p [first,last). + */ + template + void + generate(_ForwardIterator __first, _ForwardIterator __last, + _Generator __gen) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_GeneratorConcept<_Generator, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + for ( ; __first != __last; ++__first) + *__first = __gen(); + } + + /** + * @brief Assign the result of a function object to each value in a + * sequence. + * @param first A forward iterator. + * @param n The length of the sequence. + * @param gen A function object taking no arguments. + * @return The end of the sequence, @p first+n + * + * Performs the assignment @c *i = @p gen() for each @c i in the range + * @p [first,first+n). + */ + template + _OutputIterator + generate_n(_OutputIterator __first, _Size __n, _Generator __gen) + { + // concept requirements + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + // "the type returned by a _Generator" + __typeof__(__gen())>) + + for ( ; __n > 0; --__n, ++__first) + *__first = __gen(); + return __first; + } + + /** + * @brief Copy a sequence, removing elements of a given value. + * @param first An input iterator. + * @param last An input iterator. + * @param result An output iterator. + * @param value The value to be removed. + * @return An iterator designating the end of the resulting sequence. + * + * Copies each element in the range @p [first,last) not equal to @p value + * to the range beginning at @p result. + * remove_copy() is stable, so the relative order of elements that are + * copied is unchanged. + */ + template + _OutputIterator + remove_copy(_InputIterator __first, _InputIterator __last, + _OutputIterator __result, const _Tp& __value) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + typename iterator_traits<_InputIterator>::value_type>) + __glibcxx_function_requires(_EqualOpConcept< + typename iterator_traits<_InputIterator>::value_type, _Tp>) + __glibcxx_requires_valid_range(__first, __last); + + for ( ; __first != __last; ++__first) + if (!(*__first == __value)) + { + *__result = *__first; + ++__result; + } + return __result; + } + + /** + * @brief Copy a sequence, removing elements for which a predicate is true. + * @param first An input iterator. + * @param last An input iterator. + * @param result An output iterator. + * @param pred A predicate. + * @return An iterator designating the end of the resulting sequence. + * + * Copies each element in the range @p [first,last) for which + * @p pred returns true to the range beginning at @p result. + * + * remove_copy_if() is stable, so the relative order of elements that are + * copied is unchanged. + */ + template + _OutputIterator + remove_copy_if(_InputIterator __first, _InputIterator __last, + _OutputIterator __result, _Predicate __pred) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + typename iterator_traits<_InputIterator>::value_type>) + __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, + typename iterator_traits<_InputIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + for ( ; __first != __last; ++__first) + if (!__pred(*__first)) + { + *__result = *__first; + ++__result; + } + return __result; + } + + /** + * @brief Remove elements from a sequence. + * @param first An input iterator. + * @param last An input iterator. + * @param value The value to be removed. + * @return An iterator designating the end of the resulting sequence. + * + * All elements equal to @p value are removed from the range + * @p [first,last). + * + * remove() is stable, so the relative order of elements that are + * not removed is unchanged. + * + * Elements between the end of the resulting sequence and @p last + * are still present, but their value is unspecified. + */ + template + _ForwardIterator + remove(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __value) + { + // concept requirements + __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< + _ForwardIterator>) + __glibcxx_function_requires(_EqualOpConcept< + typename iterator_traits<_ForwardIterator>::value_type, _Tp>) + __glibcxx_requires_valid_range(__first, __last); + + __first = std::find(__first, __last, __value); + _ForwardIterator __i = __first; + return __first == __last ? __first + : std::remove_copy(++__i, __last, + __first, __value); + } + + /** + * @brief Remove elements from a sequence using a predicate. + * @param first A forward iterator. + * @param last A forward iterator. + * @param pred A predicate. + * @return An iterator designating the end of the resulting sequence. + * + * All elements for which @p pred returns true are removed from the range + * @p [first,last). + * + * remove_if() is stable, so the relative order of elements that are + * not removed is unchanged. + * + * Elements between the end of the resulting sequence and @p last + * are still present, but their value is unspecified. + */ + template + _ForwardIterator + remove_if(_ForwardIterator __first, _ForwardIterator __last, + _Predicate __pred) + { + // concept requirements + __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< + _ForwardIterator>) + __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + __first = std::find_if(__first, __last, __pred); + _ForwardIterator __i = __first; + return __first == __last ? __first + : std::remove_copy_if(++__i, __last, + __first, __pred); + } + + /** + * @if maint + * This is an uglified unique_copy(_InputIterator, _InputIterator, + * _OutputIterator) + * overloaded for forward iterators and output iterator as result. + * @endif + */ + template + _OutputIterator + __unique_copy(_ForwardIterator __first, _ForwardIterator __last, + _OutputIterator __result, + forward_iterator_tag, output_iterator_tag) + { + // concept requirements -- taken care of in dispatching function + _ForwardIterator __next = __first; + *__result = *__first; + while (++__next != __last) + if (!(*__first == *__next)) + { + __first = __next; + *++__result = *__first; + } + return ++__result; + } + + /** + * @if maint + * This is an uglified unique_copy(_InputIterator, _InputIterator, + * _OutputIterator) + * overloaded for input iterators and output iterator as result. + * @endif + */ + template + _OutputIterator + __unique_copy(_InputIterator __first, _InputIterator __last, + _OutputIterator __result, + input_iterator_tag, output_iterator_tag) + { + // concept requirements -- taken care of in dispatching function + typename iterator_traits<_InputIterator>::value_type __value = *__first; + *__result = __value; + while (++__first != __last) + if (!(__value == *__first)) + { + __value = *__first; + *++__result = __value; + } + return ++__result; + } + + /** + * @if maint + * This is an uglified unique_copy(_InputIterator, _InputIterator, + * _OutputIterator) + * overloaded for input iterators and forward iterator as result. + * @endif + */ + template + _ForwardIterator + __unique_copy(_InputIterator __first, _InputIterator __last, + _ForwardIterator __result, + input_iterator_tag, forward_iterator_tag) + { + // concept requirements -- taken care of in dispatching function + *__result = *__first; + while (++__first != __last) + if (!(*__result == *__first)) + *++__result = *__first; + return ++__result; + } + + /** + * @if maint + * This is an uglified + * unique_copy(_InputIterator, _InputIterator, _OutputIterator, + * _BinaryPredicate) + * overloaded for forward iterators and output iterator as result. + * @endif + */ + template + _OutputIterator + __unique_copy(_ForwardIterator __first, _ForwardIterator __last, + _OutputIterator __result, _BinaryPredicate __binary_pred, + forward_iterator_tag, output_iterator_tag) + { + // concept requirements -- iterators already checked + __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, + typename iterator_traits<_ForwardIterator>::value_type, + typename iterator_traits<_ForwardIterator>::value_type>) + + _ForwardIterator __next = __first; + *__result = *__first; + while (++__next != __last) + if (!__binary_pred(*__first, *__next)) + { + __first = __next; + *++__result = *__first; + } + return ++__result; + } + + /** + * @if maint + * This is an uglified + * unique_copy(_InputIterator, _InputIterator, _OutputIterator, + * _BinaryPredicate) + * overloaded for input iterators and output iterator as result. + * @endif + */ + template + _OutputIterator + __unique_copy(_InputIterator __first, _InputIterator __last, + _OutputIterator __result, _BinaryPredicate __binary_pred, + input_iterator_tag, output_iterator_tag) + { + // concept requirements -- iterators already checked + __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, + typename iterator_traits<_InputIterator>::value_type, + typename iterator_traits<_InputIterator>::value_type>) + + typename iterator_traits<_InputIterator>::value_type __value = *__first; + *__result = __value; + while (++__first != __last) + if (!__binary_pred(__value, *__first)) + { + __value = *__first; + *++__result = __value; + } + return ++__result; + } + + /** + * @if maint + * This is an uglified + * unique_copy(_InputIterator, _InputIterator, _OutputIterator, + * _BinaryPredicate) + * overloaded for input iterators and forward iterator as result. + * @endif + */ + template + _ForwardIterator + __unique_copy(_InputIterator __first, _InputIterator __last, + _ForwardIterator __result, _BinaryPredicate __binary_pred, + input_iterator_tag, forward_iterator_tag) + { + // concept requirements -- iterators already checked + __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, + typename iterator_traits<_ForwardIterator>::value_type, + typename iterator_traits<_InputIterator>::value_type>) + + *__result = *__first; + while (++__first != __last) + if (!__binary_pred(*__result, *__first)) + *++__result = *__first; + return ++__result; + } + + /** + * @brief Copy a sequence, removing consecutive duplicate values. + * @param first An input iterator. + * @param last An input iterator. + * @param result An output iterator. + * @return An iterator designating the end of the resulting sequence. + * + * Copies each element in the range @p [first,last) to the range + * beginning at @p result, except that only the first element is copied + * from groups of consecutive elements that compare equal. + * unique_copy() is stable, so the relative order of elements that are + * copied is unchanged. + * + * @if maint + * _GLIBCXX_RESOLVE_LIB_DEFECTS + * DR 241. Does unique_copy() require CopyConstructible and Assignable? + * + * _GLIBCXX_RESOLVE_LIB_DEFECTS + * DR 538. 241 again: Does unique_copy() require CopyConstructible and + * Assignable? + * @endif + */ + template + inline _OutputIterator + unique_copy(_InputIterator __first, _InputIterator __last, + _OutputIterator __result) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + typename iterator_traits<_InputIterator>::value_type>) + __glibcxx_function_requires(_EqualityComparableConcept< + typename iterator_traits<_InputIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return __result; + return std::__unique_copy(__first, __last, __result, + std::__iterator_category(__first), + std::__iterator_category(__result)); + } + + /** + * @brief Copy a sequence, removing consecutive values using a predicate. + * @param first An input iterator. + * @param last An input iterator. + * @param result An output iterator. + * @param binary_pred A binary predicate. + * @return An iterator designating the end of the resulting sequence. + * + * Copies each element in the range @p [first,last) to the range + * beginning at @p result, except that only the first element is copied + * from groups of consecutive elements for which @p binary_pred returns + * true. + * unique_copy() is stable, so the relative order of elements that are + * copied is unchanged. + * + * @if maint + * _GLIBCXX_RESOLVE_LIB_DEFECTS + * DR 241. Does unique_copy() require CopyConstructible and Assignable? + * @endif + */ + template + inline _OutputIterator + unique_copy(_InputIterator __first, _InputIterator __last, + _OutputIterator __result, + _BinaryPredicate __binary_pred) + { + // concept requirements -- predicates checked later + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + typename iterator_traits<_InputIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return __result; + return std::__unique_copy(__first, __last, __result, __binary_pred, + std::__iterator_category(__first), + std::__iterator_category(__result)); + } + + /** + * @brief Remove consecutive duplicate values from a sequence. + * @param first A forward iterator. + * @param last A forward iterator. + * @return An iterator designating the end of the resulting sequence. + * + * Removes all but the first element from each group of consecutive + * values that compare equal. + * unique() is stable, so the relative order of elements that are + * not removed is unchanged. + * Elements between the end of the resulting sequence and @p last + * are still present, but their value is unspecified. + */ + template + _ForwardIterator + unique(_ForwardIterator __first, _ForwardIterator __last) + { + // concept requirements + __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< + _ForwardIterator>) + __glibcxx_function_requires(_EqualityComparableConcept< + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + // Skip the beginning, if already unique. + __first = std::adjacent_find(__first, __last); + if (__first == __last) + return __last; + + // Do the real copy work. + _ForwardIterator __dest = __first; + ++__first; + while (++__first != __last) + if (!(*__dest == *__first)) + *++__dest = *__first; + return ++__dest; + } + + /** + * @brief Remove consecutive values from a sequence using a predicate. + * @param first A forward iterator. + * @param last A forward iterator. + * @param binary_pred A binary predicate. + * @return An iterator designating the end of the resulting sequence. + * + * Removes all but the first element from each group of consecutive + * values for which @p binary_pred returns true. + * unique() is stable, so the relative order of elements that are + * not removed is unchanged. + * Elements between the end of the resulting sequence and @p last + * are still present, but their value is unspecified. + */ + template + _ForwardIterator + unique(_ForwardIterator __first, _ForwardIterator __last, + _BinaryPredicate __binary_pred) + { + // concept requirements + __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< + _ForwardIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, + typename iterator_traits<_ForwardIterator>::value_type, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + // Skip the beginning, if already unique. + __first = std::adjacent_find(__first, __last, __binary_pred); + if (__first == __last) + return __last; + + // Do the real copy work. + _ForwardIterator __dest = __first; + ++__first; + while (++__first != __last) + if (!__binary_pred(*__dest, *__first)) + *++__dest = *__first; + return ++__dest; + } + + /** + * @if maint + * This is an uglified reverse(_BidirectionalIterator, + * _BidirectionalIterator) + * overloaded for bidirectional iterators. + * @endif + */ + template + void + __reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, + bidirectional_iterator_tag) + { + while (true) + if (__first == __last || __first == --__last) + return; + else + { + std::iter_swap(__first, __last); + ++__first; + } + } + + /** + * @if maint + * This is an uglified reverse(_BidirectionalIterator, + * _BidirectionalIterator) + * overloaded for random access iterators. + * @endif + */ + template + void + __reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, + random_access_iterator_tag) + { + if (__first == __last) + return; + --__last; + while (__first < __last) + { + std::iter_swap(__first, __last); + ++__first; + --__last; + } + } + + /** + * @brief Reverse a sequence. + * @param first A bidirectional iterator. + * @param last A bidirectional iterator. + * @return reverse() returns no value. + * + * Reverses the order of the elements in the range @p [first,last), + * so that the first element becomes the last etc. + * For every @c i such that @p 0<=i<=(last-first)/2), @p reverse() + * swaps @p *(first+i) and @p *(last-(i+1)) + */ + template + inline void + reverse(_BidirectionalIterator __first, _BidirectionalIterator __last) + { + // concept requirements + __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept< + _BidirectionalIterator>) + __glibcxx_requires_valid_range(__first, __last); + std::__reverse(__first, __last, std::__iterator_category(__first)); + } + + /** + * @brief Copy a sequence, reversing its elements. + * @param first A bidirectional iterator. + * @param last A bidirectional iterator. + * @param result An output iterator. + * @return An iterator designating the end of the resulting sequence. + * + * Copies the elements in the range @p [first,last) to the range + * @p [result,result+(last-first)) such that the order of the + * elements is reversed. + * For every @c i such that @p 0<=i<=(last-first), @p reverse_copy() + * performs the assignment @p *(result+(last-first)-i) = *(first+i). + * The ranges @p [first,last) and @p [result,result+(last-first)) + * must not overlap. + */ + template + _OutputIterator + reverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, + _OutputIterator __result) + { + // concept requirements + __glibcxx_function_requires(_BidirectionalIteratorConcept< + _BidirectionalIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + typename iterator_traits<_BidirectionalIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + while (__first != __last) + { + --__last; + *__result = *__last; + ++__result; + } + return __result; + } + + + /** + * @if maint + * This is a helper function for the rotate algorithm specialized on RAIs. + * It returns the greatest common divisor of two integer values. + * @endif + */ + template + _EuclideanRingElement + __gcd(_EuclideanRingElement __m, _EuclideanRingElement __n) + { + while (__n != 0) + { + _EuclideanRingElement __t = __m % __n; + __m = __n; + __n = __t; + } + return __m; + } + + /** + * @if maint + * This is a helper function for the rotate algorithm. + * @endif + */ + template + void + __rotate(_ForwardIterator __first, + _ForwardIterator __middle, + _ForwardIterator __last, + forward_iterator_tag) + { + if (__first == __middle || __last == __middle) + return; + + _ForwardIterator __first2 = __middle; + do + { + swap(*__first, *__first2); + ++__first; + ++__first2; + if (__first == __middle) + __middle = __first2; + } + while (__first2 != __last); + + __first2 = __middle; + + while (__first2 != __last) + { + swap(*__first, *__first2); + ++__first; + ++__first2; + if (__first == __middle) + __middle = __first2; + else if (__first2 == __last) + __first2 = __middle; + } + } + + /** + * @if maint + * This is a helper function for the rotate algorithm. + * @endif + */ + template + void + __rotate(_BidirectionalIterator __first, + _BidirectionalIterator __middle, + _BidirectionalIterator __last, + bidirectional_iterator_tag) + { + // concept requirements + __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept< + _BidirectionalIterator>) + + if (__first == __middle || __last == __middle) + return; + + std::__reverse(__first, __middle, bidirectional_iterator_tag()); + std::__reverse(__middle, __last, bidirectional_iterator_tag()); + + while (__first != __middle && __middle != __last) + { + swap(*__first, *--__last); + ++__first; + } + + if (__first == __middle) + std::__reverse(__middle, __last, bidirectional_iterator_tag()); + else + std::__reverse(__first, __middle, bidirectional_iterator_tag()); + } + + /** + * @if maint + * This is a helper function for the rotate algorithm. + * @endif + */ + template + void + __rotate(_RandomAccessIterator __first, + _RandomAccessIterator __middle, + _RandomAccessIterator __last, + random_access_iterator_tag) + { + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + + if (__first == __middle || __last == __middle) + return; + + typedef typename iterator_traits<_RandomAccessIterator>::difference_type + _Distance; + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + + const _Distance __n = __last - __first; + const _Distance __k = __middle - __first; + const _Distance __l = __n - __k; + + if (__k == __l) + { + std::swap_ranges(__first, __middle, __middle); + return; + } + + const _Distance __d = __gcd(__n, __k); + + for (_Distance __i = 0; __i < __d; __i++) + { + _ValueType __tmp = *__first; + _RandomAccessIterator __p = __first; + + if (__k < __l) + { + for (_Distance __j = 0; __j < __l / __d; __j++) + { + if (__p > __first + __l) + { + *__p = *(__p - __l); + __p -= __l; + } + + *__p = *(__p + __k); + __p += __k; + } + } + else + { + for (_Distance __j = 0; __j < __k / __d - 1; __j ++) + { + if (__p < __last - __k) + { + *__p = *(__p + __k); + __p += __k; + } + *__p = * (__p - __l); + __p -= __l; + } + } + + *__p = __tmp; + ++__first; + } + } + + /** + * @brief Rotate the elements of a sequence. + * @param first A forward iterator. + * @param middle A forward iterator. + * @param last A forward iterator. + * @return Nothing. + * + * Rotates the elements of the range @p [first,last) by @p (middle-first) + * positions so that the element at @p middle is moved to @p first, the + * element at @p middle+1 is moved to @first+1 and so on for each element + * in the range @p [first,last). + * + * This effectively swaps the ranges @p [first,middle) and + * @p [middle,last). + * + * Performs @p *(first+(n+(last-middle))%(last-first))=*(first+n) for + * each @p n in the range @p [0,last-first). + */ + template + inline void + rotate(_ForwardIterator __first, _ForwardIterator __middle, + _ForwardIterator __last) + { + // concept requirements + __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< + _ForwardIterator>) + __glibcxx_requires_valid_range(__first, __middle); + __glibcxx_requires_valid_range(__middle, __last); + + typedef typename iterator_traits<_ForwardIterator>::iterator_category + _IterType; + std::__rotate(__first, __middle, __last, _IterType()); + } + + /** + * @brief Copy a sequence, rotating its elements. + * @param first A forward iterator. + * @param middle A forward iterator. + * @param last A forward iterator. + * @param result An output iterator. + * @return An iterator designating the end of the resulting sequence. + * + * Copies the elements of the range @p [first,last) to the range + * beginning at @result, rotating the copied elements by @p (middle-first) + * positions so that the element at @p middle is moved to @p result, the + * element at @p middle+1 is moved to @result+1 and so on for each element + * in the range @p [first,last). + * + * Performs @p *(result+(n+(last-middle))%(last-first))=*(first+n) for + * each @p n in the range @p [0,last-first). + */ + template + _OutputIterator + rotate_copy(_ForwardIterator __first, _ForwardIterator __middle, + _ForwardIterator __last, _OutputIterator __result) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __middle); + __glibcxx_requires_valid_range(__middle, __last); + + return std::copy(__first, __middle, + std::copy(__middle, __last, __result)); + } + + /** + * @brief Randomly shuffle the elements of a sequence. + * @param first A forward iterator. + * @param last A forward iterator. + * @return Nothing. + * + * Reorder the elements in the range @p [first,last) using a random + * distribution, so that every possible ordering of the sequence is + * equally likely. + */ + template + inline void + random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) + { + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first != __last) + for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i) + std::iter_swap(__i, __first + (std::rand() % ((__i - __first) + 1))); + } + + /** + * @brief Shuffle the elements of a sequence using a random number + * generator. + * @param first A forward iterator. + * @param last A forward iterator. + * @param rand The RNG functor or function. + * @return Nothing. + * + * Reorders the elements in the range @p [first,last) using @p rand to + * provide a random distribution. Calling @p rand(N) for a positive + * integer @p N should return a randomly chosen integer from the + * range [0,N). + */ + template + void + random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, + _RandomNumberGenerator& __rand) + { + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return; + for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i) + std::iter_swap(__i, __first + __rand((__i - __first) + 1)); + } + + + /** + * @if maint + * This is a helper function... + * @endif + */ + template + _ForwardIterator + __partition(_ForwardIterator __first, _ForwardIterator __last, + _Predicate __pred, + forward_iterator_tag) + { + if (__first == __last) + return __first; + + while (__pred(*__first)) + if (++__first == __last) + return __first; + + _ForwardIterator __next = __first; + + while (++__next != __last) + if (__pred(*__next)) + { + swap(*__first, *__next); + ++__first; + } + + return __first; + } + + /** + * @if maint + * This is a helper function... + * @endif + */ + template + _BidirectionalIterator + __partition(_BidirectionalIterator __first, _BidirectionalIterator __last, + _Predicate __pred, + bidirectional_iterator_tag) + { + while (true) + { + while (true) + if (__first == __last) + return __first; + else if (__pred(*__first)) + ++__first; + else + break; + --__last; + while (true) + if (__first == __last) + return __first; + else if (!__pred(*__last)) + --__last; + else + break; + std::iter_swap(__first, __last); + ++__first; + } + } + + /** + * @brief Move elements for which a predicate is true to the beginning + * of a sequence. + * @param first A forward iterator. + * @param last A forward iterator. + * @param pred A predicate functor. + * @return An iterator @p middle such that @p pred(i) is true for each + * iterator @p i in the range @p [first,middle) and false for each @p i + * in the range @p [middle,last). + * + * @p pred must not modify its operand. @p partition() does not preserve + * the relative ordering of elements in each group, use + * @p stable_partition() if this is needed. + */ + template + inline _ForwardIterator + partition(_ForwardIterator __first, _ForwardIterator __last, + _Predicate __pred) + { + // concept requirements + __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< + _ForwardIterator>) + __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + return std::__partition(__first, __last, __pred, + std::__iterator_category(__first)); + } + + + /** + * @if maint + * This is a helper function... + * @endif + */ + template + _ForwardIterator + __inplace_stable_partition(_ForwardIterator __first, + _ForwardIterator __last, + _Predicate __pred, _Distance __len) + { + if (__len == 1) + return __pred(*__first) ? __last : __first; + _ForwardIterator __middle = __first; + std::advance(__middle, __len / 2); + _ForwardIterator __begin = std::__inplace_stable_partition(__first, + __middle, + __pred, + __len / 2); + _ForwardIterator __end = std::__inplace_stable_partition(__middle, __last, + __pred, + __len + - __len / 2); + std::rotate(__begin, __middle, __end); + std::advance(__begin, std::distance(__middle, __end)); + return __begin; + } + + /** + * @if maint + * This is a helper function... + * @endif + */ + template + _ForwardIterator + __stable_partition_adaptive(_ForwardIterator __first, + _ForwardIterator __last, + _Predicate __pred, _Distance __len, + _Pointer __buffer, + _Distance __buffer_size) + { + if (__len <= __buffer_size) + { + _ForwardIterator __result1 = __first; + _Pointer __result2 = __buffer; + for ( ; __first != __last ; ++__first) + if (__pred(*__first)) + { + *__result1 = *__first; + ++__result1; + } + else + { + *__result2 = *__first; + ++__result2; + } + std::copy(__buffer, __result2, __result1); + return __result1; + } + else + { + _ForwardIterator __middle = __first; + std::advance(__middle, __len / 2); + _ForwardIterator __begin = + std::__stable_partition_adaptive(__first, __middle, __pred, + __len / 2, __buffer, + __buffer_size); + _ForwardIterator __end = + std::__stable_partition_adaptive(__middle, __last, __pred, + __len - __len / 2, + __buffer, __buffer_size); + std::rotate(__begin, __middle, __end); + std::advance(__begin, std::distance(__middle, __end)); + return __begin; + } + } + + /** + * @brief Move elements for which a predicate is true to the beginning + * of a sequence, preserving relative ordering. + * @param first A forward iterator. + * @param last A forward iterator. + * @param pred A predicate functor. + * @return An iterator @p middle such that @p pred(i) is true for each + * iterator @p i in the range @p [first,middle) and false for each @p i + * in the range @p [middle,last). + * + * Performs the same function as @p partition() with the additional + * guarantee that the relative ordering of elements in each group is + * preserved, so any two elements @p x and @p y in the range + * @p [first,last) such that @p pred(x)==pred(y) will have the same + * relative ordering after calling @p stable_partition(). + */ + template + _ForwardIterator + stable_partition(_ForwardIterator __first, _ForwardIterator __last, + _Predicate __pred) + { + // concept requirements + __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< + _ForwardIterator>) + __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return __first; + else + { + typedef typename iterator_traits<_ForwardIterator>::value_type + _ValueType; + typedef typename iterator_traits<_ForwardIterator>::difference_type + _DistanceType; + + _Temporary_buffer<_ForwardIterator, _ValueType> __buf(__first, + __last); + if (__buf.size() > 0) + return + std::__stable_partition_adaptive(__first, __last, __pred, + _DistanceType(__buf.requested_size()), + __buf.begin(), __buf.size()); + else + return + std::__inplace_stable_partition(__first, __last, __pred, + _DistanceType(__buf.requested_size())); + } + } + + /** + * @if maint + * This is a helper function... + * @endif + */ + template + _RandomAccessIterator + __unguarded_partition(_RandomAccessIterator __first, + _RandomAccessIterator __last, _Tp __pivot) + { + while (true) + { + while (*__first < __pivot) + ++__first; + --__last; + while (__pivot < *__last) + --__last; + if (!(__first < __last)) + return __first; + std::iter_swap(__first, __last); + ++__first; + } + } + + /** + * @if maint + * This is a helper function... + * @endif + */ + template + _RandomAccessIterator + __unguarded_partition(_RandomAccessIterator __first, + _RandomAccessIterator __last, + _Tp __pivot, _Compare __comp) + { + while (true) + { + while (__comp(*__first, __pivot)) + ++__first; + --__last; + while (__comp(__pivot, *__last)) + --__last; + if (!(__first < __last)) + return __first; + std::iter_swap(__first, __last); + ++__first; + } + } + + /** + * @if maint + * @doctodo + * This controls some aspect of the sort routines. + * @endif + */ + enum { _S_threshold = 16 }; + + /** + * @if maint + * This is a helper function for the sort routine. + * @endif + */ + template + void + __unguarded_linear_insert(_RandomAccessIterator __last, _Tp __val) + { + _RandomAccessIterator __next = __last; + --__next; + while (__val < *__next) + { + *__last = *__next; + __last = __next; + --__next; + } + *__last = __val; + } + + /** + * @if maint + * This is a helper function for the sort routine. + * @endif + */ + template + void + __unguarded_linear_insert(_RandomAccessIterator __last, _Tp __val, + _Compare __comp) + { + _RandomAccessIterator __next = __last; + --__next; + while (__comp(__val, *__next)) + { + *__last = *__next; + __last = __next; + --__next; + } + *__last = __val; + } + + /** + * @if maint + * This is a helper function for the sort routine. + * @endif + */ + template + void + __insertion_sort(_RandomAccessIterator __first, + _RandomAccessIterator __last) + { + if (__first == __last) + return; + + for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i) + { + typename iterator_traits<_RandomAccessIterator>::value_type + __val = *__i; + if (__val < *__first) + { + std::copy_backward(__first, __i, __i + 1); + *__first = __val; + } + else + std::__unguarded_linear_insert(__i, __val); + } + } + + /** + * @if maint + * This is a helper function for the sort routine. + * @endif + */ + template + void + __insertion_sort(_RandomAccessIterator __first, + _RandomAccessIterator __last, _Compare __comp) + { + if (__first == __last) return; + + for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i) + { + typename iterator_traits<_RandomAccessIterator>::value_type + __val = *__i; + if (__comp(__val, *__first)) + { + std::copy_backward(__first, __i, __i + 1); + *__first = __val; + } + else + std::__unguarded_linear_insert(__i, __val, __comp); + } + } + + /** + * @if maint + * This is a helper function for the sort routine. + * @endif + */ + template + inline void + __unguarded_insertion_sort(_RandomAccessIterator __first, + _RandomAccessIterator __last) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + + for (_RandomAccessIterator __i = __first; __i != __last; ++__i) + std::__unguarded_linear_insert(__i, _ValueType(*__i)); + } + + /** + * @if maint + * This is a helper function for the sort routine. + * @endif + */ + template + inline void + __unguarded_insertion_sort(_RandomAccessIterator __first, + _RandomAccessIterator __last, _Compare __comp) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + + for (_RandomAccessIterator __i = __first; __i != __last; ++__i) + std::__unguarded_linear_insert(__i, _ValueType(*__i), __comp); + } + + /** + * @if maint + * This is a helper function for the sort routine. + * @endif + */ + template + void + __final_insertion_sort(_RandomAccessIterator __first, + _RandomAccessIterator __last) + { + if (__last - __first > int(_S_threshold)) + { + std::__insertion_sort(__first, __first + int(_S_threshold)); + std::__unguarded_insertion_sort(__first + int(_S_threshold), __last); + } + else + std::__insertion_sort(__first, __last); + } + + /** + * @if maint + * This is a helper function for the sort routine. + * @endif + */ + template + void + __final_insertion_sort(_RandomAccessIterator __first, + _RandomAccessIterator __last, _Compare __comp) + { + if (__last - __first > int(_S_threshold)) + { + std::__insertion_sort(__first, __first + int(_S_threshold), __comp); + std::__unguarded_insertion_sort(__first + int(_S_threshold), __last, + __comp); + } + else + std::__insertion_sort(__first, __last, __comp); + } + + /** + * @if maint + * This is a helper function for the sort routines. + * @endif + */ + template + void + __heap_select(_RandomAccessIterator __first, + _RandomAccessIterator __middle, + _RandomAccessIterator __last) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + + std::make_heap(__first, __middle); + for (_RandomAccessIterator __i = __middle; __i < __last; ++__i) + if (*__i < *__first) + std::__pop_heap(__first, __middle, __i, _ValueType(*__i)); + } + + /** + * @if maint + * This is a helper function for the sort routines. + * @endif + */ + template + void + __heap_select(_RandomAccessIterator __first, + _RandomAccessIterator __middle, + _RandomAccessIterator __last, _Compare __comp) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + + std::make_heap(__first, __middle, __comp); + for (_RandomAccessIterator __i = __middle; __i < __last; ++__i) + if (__comp(*__i, *__first)) + std::__pop_heap(__first, __middle, __i, _ValueType(*__i), __comp); + } + + /** + * @if maint + * This is a helper function for the sort routines. + * @endif + */ + template + inline _Size + __lg(_Size __n) + { + _Size __k; + for (__k = 0; __n != 1; __n >>= 1) + ++__k; + return __k; + } + + /** + * @brief Sort the smallest elements of a sequence. + * @param first An iterator. + * @param middle Another iterator. + * @param last Another iterator. + * @return Nothing. + * + * Sorts the smallest @p (middle-first) elements in the range + * @p [first,last) and moves them to the range @p [first,middle). The + * order of the remaining elements in the range @p [middle,last) is + * undefined. + * After the sort if @p i and @j are iterators in the range + * @p [first,middle) such that @i precedes @j and @k is an iterator in + * the range @p [middle,last) then @p *j<*i and @p *k<*i are both false. + */ + template + inline void + partial_sort(_RandomAccessIterator __first, + _RandomAccessIterator __middle, + _RandomAccessIterator __last) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) + __glibcxx_requires_valid_range(__first, __middle); + __glibcxx_requires_valid_range(__middle, __last); + + std::__heap_select(__first, __middle, __last); + std::sort_heap(__first, __middle); + } + + /** + * @brief Sort the smallest elements of a sequence using a predicate + * for comparison. + * @param first An iterator. + * @param middle Another iterator. + * @param last Another iterator. + * @param comp A comparison functor. + * @return Nothing. + * + * Sorts the smallest @p (middle-first) elements in the range + * @p [first,last) and moves them to the range @p [first,middle). The + * order of the remaining elements in the range @p [middle,last) is + * undefined. + * After the sort if @p i and @j are iterators in the range + * @p [first,middle) such that @i precedes @j and @k is an iterator in + * the range @p [middle,last) then @p *comp(j,*i) and @p comp(*k,*i) + * are both false. + */ + template + inline void + partial_sort(_RandomAccessIterator __first, + _RandomAccessIterator __middle, + _RandomAccessIterator __last, + _Compare __comp) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType, _ValueType>) + __glibcxx_requires_valid_range(__first, __middle); + __glibcxx_requires_valid_range(__middle, __last); + + std::__heap_select(__first, __middle, __last, __comp); + std::sort_heap(__first, __middle, __comp); + } + + /** + * @brief Copy the smallest elements of a sequence. + * @param first An iterator. + * @param last Another iterator. + * @param result_first A random-access iterator. + * @param result_last Another random-access iterator. + * @return An iterator indicating the end of the resulting sequence. + * + * Copies and sorts the smallest N values from the range @p [first,last) + * to the range beginning at @p result_first, where the number of + * elements to be copied, @p N, is the smaller of @p (last-first) and + * @p (result_last-result_first). + * After the sort if @p i and @j are iterators in the range + * @p [result_first,result_first+N) such that @i precedes @j then + * @p *j<*i is false. + * The value returned is @p result_first+N. + */ + template + _RandomAccessIterator + partial_sort_copy(_InputIterator __first, _InputIterator __last, + _RandomAccessIterator __result_first, + _RandomAccessIterator __result_last) + { + typedef typename iterator_traits<_InputIterator>::value_type + _InputValueType; + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _OutputValueType; + typedef typename iterator_traits<_RandomAccessIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_ConvertibleConcept<_InputValueType, + _OutputValueType>) + __glibcxx_function_requires(_LessThanOpConcept<_InputValueType, + _OutputValueType>) + __glibcxx_function_requires(_LessThanComparableConcept<_OutputValueType>) + __glibcxx_requires_valid_range(__first, __last); + __glibcxx_requires_valid_range(__result_first, __result_last); + + if (__result_first == __result_last) + return __result_last; + _RandomAccessIterator __result_real_last = __result_first; + while(__first != __last && __result_real_last != __result_last) + { + *__result_real_last = *__first; + ++__result_real_last; + ++__first; + } + std::make_heap(__result_first, __result_real_last); + while (__first != __last) + { + if (*__first < *__result_first) + std::__adjust_heap(__result_first, _DistanceType(0), + _DistanceType(__result_real_last + - __result_first), + _InputValueType(*__first)); + ++__first; + } + std::sort_heap(__result_first, __result_real_last); + return __result_real_last; + } + + /** + * @brief Copy the smallest elements of a sequence using a predicate for + * comparison. + * @param first An input iterator. + * @param last Another input iterator. + * @param result_first A random-access iterator. + * @param result_last Another random-access iterator. + * @param comp A comparison functor. + * @return An iterator indicating the end of the resulting sequence. + * + * Copies and sorts the smallest N values from the range @p [first,last) + * to the range beginning at @p result_first, where the number of + * elements to be copied, @p N, is the smaller of @p (last-first) and + * @p (result_last-result_first). + * After the sort if @p i and @j are iterators in the range + * @p [result_first,result_first+N) such that @i precedes @j then + * @p comp(*j,*i) is false. + * The value returned is @p result_first+N. + */ + template + _RandomAccessIterator + partial_sort_copy(_InputIterator __first, _InputIterator __last, + _RandomAccessIterator __result_first, + _RandomAccessIterator __result_last, + _Compare __comp) + { + typedef typename iterator_traits<_InputIterator>::value_type + _InputValueType; + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _OutputValueType; + typedef typename iterator_traits<_RandomAccessIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_function_requires(_ConvertibleConcept<_InputValueType, + _OutputValueType>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _InputValueType, _OutputValueType>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _OutputValueType, _OutputValueType>) + __glibcxx_requires_valid_range(__first, __last); + __glibcxx_requires_valid_range(__result_first, __result_last); + + if (__result_first == __result_last) + return __result_last; + _RandomAccessIterator __result_real_last = __result_first; + while(__first != __last && __result_real_last != __result_last) + { + *__result_real_last = *__first; + ++__result_real_last; + ++__first; + } + std::make_heap(__result_first, __result_real_last, __comp); + while (__first != __last) + { + if (__comp(*__first, *__result_first)) + std::__adjust_heap(__result_first, _DistanceType(0), + _DistanceType(__result_real_last + - __result_first), + _InputValueType(*__first), + __comp); + ++__first; + } + std::sort_heap(__result_first, __result_real_last, __comp); + return __result_real_last; + } + + /** + * @if maint + * This is a helper function for the sort routine. + * @endif + */ + template + void + __introsort_loop(_RandomAccessIterator __first, + _RandomAccessIterator __last, + _Size __depth_limit) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + + while (__last - __first > int(_S_threshold)) + { + if (__depth_limit == 0) + { + std::partial_sort(__first, __last, __last); + return; + } + --__depth_limit; + _RandomAccessIterator __cut = + std::__unguarded_partition(__first, __last, + _ValueType(std::__median(*__first, + *(__first + + (__last + - __first) + / 2), + *(__last + - 1)))); + std::__introsort_loop(__cut, __last, __depth_limit); + __last = __cut; + } + } + + /** + * @if maint + * This is a helper function for the sort routine. + * @endif + */ + template + void + __introsort_loop(_RandomAccessIterator __first, + _RandomAccessIterator __last, + _Size __depth_limit, _Compare __comp) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + + while (__last - __first > int(_S_threshold)) + { + if (__depth_limit == 0) + { + std::partial_sort(__first, __last, __last, __comp); + return; + } + --__depth_limit; + _RandomAccessIterator __cut = + std::__unguarded_partition(__first, __last, + _ValueType(std::__median(*__first, + *(__first + + (__last + - __first) + / 2), + *(__last - 1), + __comp)), + __comp); + std::__introsort_loop(__cut, __last, __depth_limit, __comp); + __last = __cut; + } + } + + /** + * @brief Sort the elements of a sequence. + * @param first An iterator. + * @param last Another iterator. + * @return Nothing. + * + * Sorts the elements in the range @p [first,last) in ascending order, + * such that @p *(i+1)<*i is false for each iterator @p i in the range + * @p [first,last-1). + * + * The relative ordering of equivalent elements is not preserved, use + * @p stable_sort() if this is needed. + */ + template + inline void + sort(_RandomAccessIterator __first, _RandomAccessIterator __last) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first != __last) + { + std::__introsort_loop(__first, __last, + std::__lg(__last - __first) * 2); + std::__final_insertion_sort(__first, __last); + } + } + + /** + * @brief Sort the elements of a sequence using a predicate for comparison. + * @param first An iterator. + * @param last Another iterator. + * @param comp A comparison functor. + * @return Nothing. + * + * Sorts the elements in the range @p [first,last) in ascending order, + * such that @p comp(*(i+1),*i) is false for every iterator @p i in the + * range @p [first,last-1). + * + * The relative ordering of equivalent elements is not preserved, use + * @p stable_sort() if this is needed. + */ + template + inline void + sort(_RandomAccessIterator __first, _RandomAccessIterator __last, + _Compare __comp) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, _ValueType, + _ValueType>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first != __last) + { + std::__introsort_loop(__first, __last, + std::__lg(__last - __first) * 2, __comp); + std::__final_insertion_sort(__first, __last, __comp); + } + } + + /** + * @brief Finds the first position in which @a val could be inserted + * without changing the ordering. + * @param first An iterator. + * @param last Another iterator. + * @param val The search term. + * @return An iterator pointing to the first element "not less than" @a val, + * or end() if every element is less than @a val. + * @ingroup binarysearch + */ + template + _ForwardIterator + lower_bound(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __val) + { + typedef typename iterator_traits<_ForwardIterator>::value_type + _ValueType; + typedef typename iterator_traits<_ForwardIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_LessThanOpConcept<_ValueType, _Tp>) + __glibcxx_requires_partitioned(__first, __last, __val); + + _DistanceType __len = std::distance(__first, __last); + _DistanceType __half; + _ForwardIterator __middle; + + while (__len > 0) + { + __half = __len >> 1; + __middle = __first; + std::advance(__middle, __half); + if (*__middle < __val) + { + __first = __middle; + ++__first; + __len = __len - __half - 1; + } + else + __len = __half; + } + return __first; + } + + /** + * @brief Finds the first position in which @a val could be inserted + * without changing the ordering. + * @param first An iterator. + * @param last Another iterator. + * @param val The search term. + * @param comp A functor to use for comparisons. + * @return An iterator pointing to the first element "not less than" @a val, + * or end() if every element is less than @a val. + * @ingroup binarysearch + * + * The comparison function should have the same effects on ordering as + * the function used for the initial sort. + */ + template + _ForwardIterator + lower_bound(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __val, _Compare __comp) + { + typedef typename iterator_traits<_ForwardIterator>::value_type + _ValueType; + typedef typename iterator_traits<_ForwardIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType, _Tp>) + __glibcxx_requires_partitioned_pred(__first, __last, __val, __comp); + + _DistanceType __len = std::distance(__first, __last); + _DistanceType __half; + _ForwardIterator __middle; + + while (__len > 0) + { + __half = __len >> 1; + __middle = __first; + std::advance(__middle, __half); + if (__comp(*__middle, __val)) + { + __first = __middle; + ++__first; + __len = __len - __half - 1; + } + else + __len = __half; + } + return __first; + } + + /** + * @brief Finds the last position in which @a val could be inserted + * without changing the ordering. + * @param first An iterator. + * @param last Another iterator. + * @param val The search term. + * @return An iterator pointing to the first element greater than @a val, + * or end() if no elements are greater than @a val. + * @ingroup binarysearch + */ + template + _ForwardIterator + upper_bound(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __val) + { + typedef typename iterator_traits<_ForwardIterator>::value_type + _ValueType; + typedef typename iterator_traits<_ForwardIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_LessThanOpConcept<_Tp, _ValueType>) + __glibcxx_requires_partitioned(__first, __last, __val); + + _DistanceType __len = std::distance(__first, __last); + _DistanceType __half; + _ForwardIterator __middle; + + while (__len > 0) + { + __half = __len >> 1; + __middle = __first; + std::advance(__middle, __half); + if (__val < *__middle) + __len = __half; + else + { + __first = __middle; + ++__first; + __len = __len - __half - 1; + } + } + return __first; + } + + /** + * @brief Finds the last position in which @a val could be inserted + * without changing the ordering. + * @param first An iterator. + * @param last Another iterator. + * @param val The search term. + * @param comp A functor to use for comparisons. + * @return An iterator pointing to the first element greater than @a val, + * or end() if no elements are greater than @a val. + * @ingroup binarysearch + * + * The comparison function should have the same effects on ordering as + * the function used for the initial sort. + */ + template + _ForwardIterator + upper_bound(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __val, _Compare __comp) + { + typedef typename iterator_traits<_ForwardIterator>::value_type + _ValueType; + typedef typename iterator_traits<_ForwardIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _Tp, _ValueType>) + __glibcxx_requires_partitioned_pred(__first, __last, __val, __comp); + + _DistanceType __len = std::distance(__first, __last); + _DistanceType __half; + _ForwardIterator __middle; + + while (__len > 0) + { + __half = __len >> 1; + __middle = __first; + std::advance(__middle, __half); + if (__comp(__val, *__middle)) + __len = __half; + else + { + __first = __middle; + ++__first; + __len = __len - __half - 1; + } + } + return __first; + } + + /** + * @if maint + * This is a helper function for the merge routines. + * @endif + */ + template + void + __merge_without_buffer(_BidirectionalIterator __first, + _BidirectionalIterator __middle, + _BidirectionalIterator __last, + _Distance __len1, _Distance __len2) + { + if (__len1 == 0 || __len2 == 0) + return; + if (__len1 + __len2 == 2) + { + if (*__middle < *__first) + std::iter_swap(__first, __middle); + return; + } + _BidirectionalIterator __first_cut = __first; + _BidirectionalIterator __second_cut = __middle; + _Distance __len11 = 0; + _Distance __len22 = 0; + if (__len1 > __len2) + { + __len11 = __len1 / 2; + std::advance(__first_cut, __len11); + __second_cut = std::lower_bound(__middle, __last, *__first_cut); + __len22 = std::distance(__middle, __second_cut); + } + else + { + __len22 = __len2 / 2; + std::advance(__second_cut, __len22); + __first_cut = std::upper_bound(__first, __middle, *__second_cut); + __len11 = std::distance(__first, __first_cut); + } + std::rotate(__first_cut, __middle, __second_cut); + _BidirectionalIterator __new_middle = __first_cut; + std::advance(__new_middle, std::distance(__middle, __second_cut)); + std::__merge_without_buffer(__first, __first_cut, __new_middle, + __len11, __len22); + std::__merge_without_buffer(__new_middle, __second_cut, __last, + __len1 - __len11, __len2 - __len22); + } + + /** + * @if maint + * This is a helper function for the merge routines. + * @endif + */ + template + void + __merge_without_buffer(_BidirectionalIterator __first, + _BidirectionalIterator __middle, + _BidirectionalIterator __last, + _Distance __len1, _Distance __len2, + _Compare __comp) + { + if (__len1 == 0 || __len2 == 0) + return; + if (__len1 + __len2 == 2) + { + if (__comp(*__middle, *__first)) + std::iter_swap(__first, __middle); + return; + } + _BidirectionalIterator __first_cut = __first; + _BidirectionalIterator __second_cut = __middle; + _Distance __len11 = 0; + _Distance __len22 = 0; + if (__len1 > __len2) + { + __len11 = __len1 / 2; + std::advance(__first_cut, __len11); + __second_cut = std::lower_bound(__middle, __last, *__first_cut, + __comp); + __len22 = std::distance(__middle, __second_cut); + } + else + { + __len22 = __len2 / 2; + std::advance(__second_cut, __len22); + __first_cut = std::upper_bound(__first, __middle, *__second_cut, + __comp); + __len11 = std::distance(__first, __first_cut); + } + std::rotate(__first_cut, __middle, __second_cut); + _BidirectionalIterator __new_middle = __first_cut; + std::advance(__new_middle, std::distance(__middle, __second_cut)); + std::__merge_without_buffer(__first, __first_cut, __new_middle, + __len11, __len22, __comp); + std::__merge_without_buffer(__new_middle, __second_cut, __last, + __len1 - __len11, __len2 - __len22, __comp); + } + + /** + * @if maint + * This is a helper function for the stable sorting routines. + * @endif + */ + template + void + __inplace_stable_sort(_RandomAccessIterator __first, + _RandomAccessIterator __last) + { + if (__last - __first < 15) + { + std::__insertion_sort(__first, __last); + return; + } + _RandomAccessIterator __middle = __first + (__last - __first) / 2; + std::__inplace_stable_sort(__first, __middle); + std::__inplace_stable_sort(__middle, __last); + std::__merge_without_buffer(__first, __middle, __last, + __middle - __first, + __last - __middle); + } + + /** + * @if maint + * This is a helper function for the stable sorting routines. + * @endif + */ + template + void + __inplace_stable_sort(_RandomAccessIterator __first, + _RandomAccessIterator __last, _Compare __comp) + { + if (__last - __first < 15) + { + std::__insertion_sort(__first, __last, __comp); + return; + } + _RandomAccessIterator __middle = __first + (__last - __first) / 2; + std::__inplace_stable_sort(__first, __middle, __comp); + std::__inplace_stable_sort(__middle, __last, __comp); + std::__merge_without_buffer(__first, __middle, __last, + __middle - __first, + __last - __middle, + __comp); + } + + /** + * @brief Merges two sorted ranges. + * @param first1 An iterator. + * @param first2 Another iterator. + * @param last1 Another iterator. + * @param last2 Another iterator. + * @param result An iterator pointing to the end of the merged range. + * @return An iterator pointing to the first element "not less than" @a val. + * + * Merges the ranges [first1,last1) and [first2,last2) into the sorted range + * [result, result + (last1-first1) + (last2-first2)). Both input ranges + * must be sorted, and the output range must not overlap with either of + * the input ranges. The sort is @e stable, that is, for equivalent + * elements in the two ranges, elements from the first range will always + * come before elements from the second. + */ + template + _OutputIterator + merge(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _InputIterator2 __last2, + _OutputIterator __result) + { + typedef typename iterator_traits<_InputIterator1>::value_type + _ValueType1; + typedef typename iterator_traits<_InputIterator2>::value_type + _ValueType2; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType1>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType2>) + __glibcxx_function_requires(_LessThanOpConcept<_ValueType2, _ValueType1>) + __glibcxx_requires_sorted(__first1, __last1); + __glibcxx_requires_sorted(__first2, __last2); + + while (__first1 != __last1 && __first2 != __last2) + { + if (*__first2 < *__first1) + { + *__result = *__first2; + ++__first2; + } + else + { + *__result = *__first1; + ++__first1; + } + ++__result; + } + return std::copy(__first2, __last2, std::copy(__first1, __last1, + __result)); + } + + /** + * @brief Merges two sorted ranges. + * @param first1 An iterator. + * @param first2 Another iterator. + * @param last1 Another iterator. + * @param last2 Another iterator. + * @param result An iterator pointing to the end of the merged range. + * @param comp A functor to use for comparisons. + * @return An iterator pointing to the first element "not less than" @a val. + * + * Merges the ranges [first1,last1) and [first2,last2) into the sorted range + * [result, result + (last1-first1) + (last2-first2)). Both input ranges + * must be sorted, and the output range must not overlap with either of + * the input ranges. The sort is @e stable, that is, for equivalent + * elements in the two ranges, elements from the first range will always + * come before elements from the second. + * + * The comparison function should have the same effects on ordering as + * the function used for the initial sort. + */ + template + _OutputIterator + merge(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _InputIterator2 __last2, + _OutputIterator __result, _Compare __comp) + { + typedef typename iterator_traits<_InputIterator1>::value_type + _ValueType1; + typedef typename iterator_traits<_InputIterator2>::value_type + _ValueType2; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType1>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType2>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType2, _ValueType1>) + __glibcxx_requires_sorted_pred(__first1, __last1, __comp); + __glibcxx_requires_sorted_pred(__first2, __last2, __comp); + + while (__first1 != __last1 && __first2 != __last2) + { + if (__comp(*__first2, *__first1)) + { + *__result = *__first2; + ++__first2; + } + else + { + *__result = *__first1; + ++__first1; + } + ++__result; + } + return std::copy(__first2, __last2, std::copy(__first1, __last1, + __result)); + } + + template + void + __merge_sort_loop(_RandomAccessIterator1 __first, + _RandomAccessIterator1 __last, + _RandomAccessIterator2 __result, + _Distance __step_size) + { + const _Distance __two_step = 2 * __step_size; + + while (__last - __first >= __two_step) + { + __result = std::merge(__first, __first + __step_size, + __first + __step_size, __first + __two_step, + __result); + __first += __two_step; + } + + __step_size = std::min(_Distance(__last - __first), __step_size); + std::merge(__first, __first + __step_size, __first + __step_size, __last, + __result); + } + + template + void + __merge_sort_loop(_RandomAccessIterator1 __first, + _RandomAccessIterator1 __last, + _RandomAccessIterator2 __result, _Distance __step_size, + _Compare __comp) + { + const _Distance __two_step = 2 * __step_size; + + while (__last - __first >= __two_step) + { + __result = std::merge(__first, __first + __step_size, + __first + __step_size, __first + __two_step, + __result, + __comp); + __first += __two_step; + } + __step_size = std::min(_Distance(__last - __first), __step_size); + + std::merge(__first, __first + __step_size, + __first + __step_size, __last, + __result, + __comp); + } + + enum { _S_chunk_size = 7 }; + + template + void + __chunk_insertion_sort(_RandomAccessIterator __first, + _RandomAccessIterator __last, + _Distance __chunk_size) + { + while (__last - __first >= __chunk_size) + { + std::__insertion_sort(__first, __first + __chunk_size); + __first += __chunk_size; + } + std::__insertion_sort(__first, __last); + } + + template + void + __chunk_insertion_sort(_RandomAccessIterator __first, + _RandomAccessIterator __last, + _Distance __chunk_size, _Compare __comp) + { + while (__last - __first >= __chunk_size) + { + std::__insertion_sort(__first, __first + __chunk_size, __comp); + __first += __chunk_size; + } + std::__insertion_sort(__first, __last, __comp); + } + + template + void + __merge_sort_with_buffer(_RandomAccessIterator __first, + _RandomAccessIterator __last, + _Pointer __buffer) + { + typedef typename iterator_traits<_RandomAccessIterator>::difference_type + _Distance; + + const _Distance __len = __last - __first; + const _Pointer __buffer_last = __buffer + __len; + + _Distance __step_size = _S_chunk_size; + std::__chunk_insertion_sort(__first, __last, __step_size); + + while (__step_size < __len) + { + std::__merge_sort_loop(__first, __last, __buffer, __step_size); + __step_size *= 2; + std::__merge_sort_loop(__buffer, __buffer_last, __first, __step_size); + __step_size *= 2; + } + } + + template + void + __merge_sort_with_buffer(_RandomAccessIterator __first, + _RandomAccessIterator __last, + _Pointer __buffer, _Compare __comp) + { + typedef typename iterator_traits<_RandomAccessIterator>::difference_type + _Distance; + + const _Distance __len = __last - __first; + const _Pointer __buffer_last = __buffer + __len; + + _Distance __step_size = _S_chunk_size; + std::__chunk_insertion_sort(__first, __last, __step_size, __comp); + + while (__step_size < __len) + { + std::__merge_sort_loop(__first, __last, __buffer, + __step_size, __comp); + __step_size *= 2; + std::__merge_sort_loop(__buffer, __buffer_last, __first, + __step_size, __comp); + __step_size *= 2; + } + } + + /** + * @if maint + * This is a helper function for the merge routines. + * @endif + */ + template + _BidirectionalIterator3 + __merge_backward(_BidirectionalIterator1 __first1, + _BidirectionalIterator1 __last1, + _BidirectionalIterator2 __first2, + _BidirectionalIterator2 __last2, + _BidirectionalIterator3 __result) + { + if (__first1 == __last1) + return std::copy_backward(__first2, __last2, __result); + if (__first2 == __last2) + return std::copy_backward(__first1, __last1, __result); + --__last1; + --__last2; + while (true) + { + if (*__last2 < *__last1) + { + *--__result = *__last1; + if (__first1 == __last1) + return std::copy_backward(__first2, ++__last2, __result); + --__last1; + } + else + { + *--__result = *__last2; + if (__first2 == __last2) + return std::copy_backward(__first1, ++__last1, __result); + --__last2; + } + } + } + + /** + * @if maint + * This is a helper function for the merge routines. + * @endif + */ + template + _BidirectionalIterator3 + __merge_backward(_BidirectionalIterator1 __first1, + _BidirectionalIterator1 __last1, + _BidirectionalIterator2 __first2, + _BidirectionalIterator2 __last2, + _BidirectionalIterator3 __result, + _Compare __comp) + { + if (__first1 == __last1) + return std::copy_backward(__first2, __last2, __result); + if (__first2 == __last2) + return std::copy_backward(__first1, __last1, __result); + --__last1; + --__last2; + while (true) + { + if (__comp(*__last2, *__last1)) + { + *--__result = *__last1; + if (__first1 == __last1) + return std::copy_backward(__first2, ++__last2, __result); + --__last1; + } + else + { + *--__result = *__last2; + if (__first2 == __last2) + return std::copy_backward(__first1, ++__last1, __result); + --__last2; + } + } + } + + /** + * @if maint + * This is a helper function for the merge routines. + * @endif + */ + template + _BidirectionalIterator1 + __rotate_adaptive(_BidirectionalIterator1 __first, + _BidirectionalIterator1 __middle, + _BidirectionalIterator1 __last, + _Distance __len1, _Distance __len2, + _BidirectionalIterator2 __buffer, + _Distance __buffer_size) + { + _BidirectionalIterator2 __buffer_end; + if (__len1 > __len2 && __len2 <= __buffer_size) + { + __buffer_end = std::copy(__middle, __last, __buffer); + std::copy_backward(__first, __middle, __last); + return std::copy(__buffer, __buffer_end, __first); + } + else if (__len1 <= __buffer_size) + { + __buffer_end = std::copy(__first, __middle, __buffer); + std::copy(__middle, __last, __first); + return std::copy_backward(__buffer, __buffer_end, __last); + } + else + { + std::rotate(__first, __middle, __last); + std::advance(__first, std::distance(__middle, __last)); + return __first; + } + } + + /** + * @if maint + * This is a helper function for the merge routines. + * @endif + */ + template + void + __merge_adaptive(_BidirectionalIterator __first, + _BidirectionalIterator __middle, + _BidirectionalIterator __last, + _Distance __len1, _Distance __len2, + _Pointer __buffer, _Distance __buffer_size) + { + if (__len1 <= __len2 && __len1 <= __buffer_size) + { + _Pointer __buffer_end = std::copy(__first, __middle, __buffer); + std::merge(__buffer, __buffer_end, __middle, __last, __first); + } + else if (__len2 <= __buffer_size) + { + _Pointer __buffer_end = std::copy(__middle, __last, __buffer); + std::__merge_backward(__first, __middle, __buffer, + __buffer_end, __last); + } + else + { + _BidirectionalIterator __first_cut = __first; + _BidirectionalIterator __second_cut = __middle; + _Distance __len11 = 0; + _Distance __len22 = 0; + if (__len1 > __len2) + { + __len11 = __len1 / 2; + std::advance(__first_cut, __len11); + __second_cut = std::lower_bound(__middle, __last, + *__first_cut); + __len22 = std::distance(__middle, __second_cut); + } + else + { + __len22 = __len2 / 2; + std::advance(__second_cut, __len22); + __first_cut = std::upper_bound(__first, __middle, + *__second_cut); + __len11 = std::distance(__first, __first_cut); + } + _BidirectionalIterator __new_middle = + std::__rotate_adaptive(__first_cut, __middle, __second_cut, + __len1 - __len11, __len22, __buffer, + __buffer_size); + std::__merge_adaptive(__first, __first_cut, __new_middle, __len11, + __len22, __buffer, __buffer_size); + std::__merge_adaptive(__new_middle, __second_cut, __last, + __len1 - __len11, + __len2 - __len22, __buffer, __buffer_size); + } + } + + /** + * @if maint + * This is a helper function for the merge routines. + * @endif + */ + template + void + __merge_adaptive(_BidirectionalIterator __first, + _BidirectionalIterator __middle, + _BidirectionalIterator __last, + _Distance __len1, _Distance __len2, + _Pointer __buffer, _Distance __buffer_size, + _Compare __comp) + { + if (__len1 <= __len2 && __len1 <= __buffer_size) + { + _Pointer __buffer_end = std::copy(__first, __middle, __buffer); + std::merge(__buffer, __buffer_end, __middle, __last, __first, __comp); + } + else if (__len2 <= __buffer_size) + { + _Pointer __buffer_end = std::copy(__middle, __last, __buffer); + std::__merge_backward(__first, __middle, __buffer, __buffer_end, + __last, __comp); + } + else + { + _BidirectionalIterator __first_cut = __first; + _BidirectionalIterator __second_cut = __middle; + _Distance __len11 = 0; + _Distance __len22 = 0; + if (__len1 > __len2) + { + __len11 = __len1 / 2; + std::advance(__first_cut, __len11); + __second_cut = std::lower_bound(__middle, __last, *__first_cut, + __comp); + __len22 = std::distance(__middle, __second_cut); + } + else + { + __len22 = __len2 / 2; + std::advance(__second_cut, __len22); + __first_cut = std::upper_bound(__first, __middle, *__second_cut, + __comp); + __len11 = std::distance(__first, __first_cut); + } + _BidirectionalIterator __new_middle = + std::__rotate_adaptive(__first_cut, __middle, __second_cut, + __len1 - __len11, __len22, __buffer, + __buffer_size); + std::__merge_adaptive(__first, __first_cut, __new_middle, __len11, + __len22, __buffer, __buffer_size, __comp); + std::__merge_adaptive(__new_middle, __second_cut, __last, + __len1 - __len11, + __len2 - __len22, __buffer, + __buffer_size, __comp); + } + } + + /** + * @brief Merges two sorted ranges in place. + * @param first An iterator. + * @param middle Another iterator. + * @param last Another iterator. + * @return Nothing. + * + * Merges two sorted and consecutive ranges, [first,middle) and + * [middle,last), and puts the result in [first,last). The output will + * be sorted. The sort is @e stable, that is, for equivalent + * elements in the two ranges, elements from the first range will always + * come before elements from the second. + * + * If enough additional memory is available, this takes (last-first)-1 + * comparisons. Otherwise an NlogN algorithm is used, where N is + * distance(first,last). + */ + template + void + inplace_merge(_BidirectionalIterator __first, + _BidirectionalIterator __middle, + _BidirectionalIterator __last) + { + typedef typename iterator_traits<_BidirectionalIterator>::value_type + _ValueType; + typedef typename iterator_traits<_BidirectionalIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept< + _BidirectionalIterator>) + __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) + __glibcxx_requires_sorted(__first, __middle); + __glibcxx_requires_sorted(__middle, __last); + + if (__first == __middle || __middle == __last) + return; + + _DistanceType __len1 = std::distance(__first, __middle); + _DistanceType __len2 = std::distance(__middle, __last); + + _Temporary_buffer<_BidirectionalIterator, _ValueType> __buf(__first, + __last); + if (__buf.begin() == 0) + std::__merge_without_buffer(__first, __middle, __last, __len1, __len2); + else + std::__merge_adaptive(__first, __middle, __last, __len1, __len2, + __buf.begin(), _DistanceType(__buf.size())); + } + + /** + * @brief Merges two sorted ranges in place. + * @param first An iterator. + * @param middle Another iterator. + * @param last Another iterator. + * @param comp A functor to use for comparisons. + * @return Nothing. + * + * Merges two sorted and consecutive ranges, [first,middle) and + * [middle,last), and puts the result in [first,last). The output will + * be sorted. The sort is @e stable, that is, for equivalent + * elements in the two ranges, elements from the first range will always + * come before elements from the second. + * + * If enough additional memory is available, this takes (last-first)-1 + * comparisons. Otherwise an NlogN algorithm is used, where N is + * distance(first,last). + * + * The comparison function should have the same effects on ordering as + * the function used for the initial sort. + */ + template + void + inplace_merge(_BidirectionalIterator __first, + _BidirectionalIterator __middle, + _BidirectionalIterator __last, + _Compare __comp) + { + typedef typename iterator_traits<_BidirectionalIterator>::value_type + _ValueType; + typedef typename iterator_traits<_BidirectionalIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept< + _BidirectionalIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType, _ValueType>) + __glibcxx_requires_sorted_pred(__first, __middle, __comp); + __glibcxx_requires_sorted_pred(__middle, __last, __comp); + + if (__first == __middle || __middle == __last) + return; + + const _DistanceType __len1 = std::distance(__first, __middle); + const _DistanceType __len2 = std::distance(__middle, __last); + + _Temporary_buffer<_BidirectionalIterator, _ValueType> __buf(__first, + __last); + if (__buf.begin() == 0) + std::__merge_without_buffer(__first, __middle, __last, __len1, + __len2, __comp); + else + std::__merge_adaptive(__first, __middle, __last, __len1, __len2, + __buf.begin(), _DistanceType(__buf.size()), + __comp); + } + + template + void + __stable_sort_adaptive(_RandomAccessIterator __first, + _RandomAccessIterator __last, + _Pointer __buffer, _Distance __buffer_size) + { + const _Distance __len = (__last - __first + 1) / 2; + const _RandomAccessIterator __middle = __first + __len; + if (__len > __buffer_size) + { + std::__stable_sort_adaptive(__first, __middle, + __buffer, __buffer_size); + std::__stable_sort_adaptive(__middle, __last, + __buffer, __buffer_size); + } + else + { + std::__merge_sort_with_buffer(__first, __middle, __buffer); + std::__merge_sort_with_buffer(__middle, __last, __buffer); + } + std::__merge_adaptive(__first, __middle, __last, + _Distance(__middle - __first), + _Distance(__last - __middle), + __buffer, __buffer_size); + } + + template + void + __stable_sort_adaptive(_RandomAccessIterator __first, + _RandomAccessIterator __last, + _Pointer __buffer, _Distance __buffer_size, + _Compare __comp) + { + const _Distance __len = (__last - __first + 1) / 2; + const _RandomAccessIterator __middle = __first + __len; + if (__len > __buffer_size) + { + std::__stable_sort_adaptive(__first, __middle, __buffer, + __buffer_size, __comp); + std::__stable_sort_adaptive(__middle, __last, __buffer, + __buffer_size, __comp); + } + else + { + std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp); + std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp); + } + std::__merge_adaptive(__first, __middle, __last, + _Distance(__middle - __first), + _Distance(__last - __middle), + __buffer, __buffer_size, + __comp); + } + + /** + * @brief Sort the elements of a sequence, preserving the relative order + * of equivalent elements. + * @param first An iterator. + * @param last Another iterator. + * @return Nothing. + * + * Sorts the elements in the range @p [first,last) in ascending order, + * such that @p *(i+1)<*i is false for each iterator @p i in the range + * @p [first,last-1). + * + * The relative ordering of equivalent elements is preserved, so any two + * elements @p x and @p y in the range @p [first,last) such that + * @p x + inline void + stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + typedef typename iterator_traits<_RandomAccessIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) + __glibcxx_requires_valid_range(__first, __last); + + _Temporary_buffer<_RandomAccessIterator, _ValueType> __buf(__first, + __last); + if (__buf.begin() == 0) + std::__inplace_stable_sort(__first, __last); + else + std::__stable_sort_adaptive(__first, __last, __buf.begin(), + _DistanceType(__buf.size())); + } + + /** + * @brief Sort the elements of a sequence using a predicate for comparison, + * preserving the relative order of equivalent elements. + * @param first An iterator. + * @param last Another iterator. + * @param comp A comparison functor. + * @return Nothing. + * + * Sorts the elements in the range @p [first,last) in ascending order, + * such that @p comp(*(i+1),*i) is false for each iterator @p i in the + * range @p [first,last-1). + * + * The relative ordering of equivalent elements is preserved, so any two + * elements @p x and @p y in the range @p [first,last) such that + * @p comp(x,y) is false and @p comp(y,x) is false will have the same + * relative ordering after calling @p stable_sort(). + */ + template + inline void + stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, + _Compare __comp) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + typedef typename iterator_traits<_RandomAccessIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType, + _ValueType>) + __glibcxx_requires_valid_range(__first, __last); + + _Temporary_buffer<_RandomAccessIterator, _ValueType> __buf(__first, + __last); + if (__buf.begin() == 0) + std::__inplace_stable_sort(__first, __last, __comp); + else + std::__stable_sort_adaptive(__first, __last, __buf.begin(), + _DistanceType(__buf.size()), __comp); + } + + + template + void + __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth, + _RandomAccessIterator __last, _Size __depth_limit) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + + while (__last - __first > 3) + { + if (__depth_limit == 0) + { + std::__heap_select(__first, __nth + 1, __last); + // Place the nth largest element in its final position. + std::iter_swap(__first, __nth); + return; + } + --__depth_limit; + _RandomAccessIterator __cut = + std::__unguarded_partition(__first, __last, + _ValueType(std::__median(*__first, + *(__first + + (__last + - __first) + / 2), + *(__last + - 1)))); + if (__cut <= __nth) + __first = __cut; + else + __last = __cut; + } + std::__insertion_sort(__first, __last); + } + + template + void + __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth, + _RandomAccessIterator __last, _Size __depth_limit, + _Compare __comp) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + + while (__last - __first > 3) + { + if (__depth_limit == 0) + { + std::__heap_select(__first, __nth + 1, __last, __comp); + // Place the nth largest element in its final position. + std::iter_swap(__first, __nth); + return; + } + --__depth_limit; + _RandomAccessIterator __cut = + std::__unguarded_partition(__first, __last, + _ValueType(std::__median(*__first, + *(__first + + (__last + - __first) + / 2), + *(__last - 1), + __comp)), + __comp); + if (__cut <= __nth) + __first = __cut; + else + __last = __cut; + } + std::__insertion_sort(__first, __last, __comp); + } + + /** + * @brief Sort a sequence just enough to find a particular position. + * @param first An iterator. + * @param nth Another iterator. + * @param last Another iterator. + * @return Nothing. + * + * Rearranges the elements in the range @p [first,last) so that @p *nth + * is the same element that would have been in that position had the + * whole sequence been sorted. + * whole sequence been sorted. The elements either side of @p *nth are + * not completely sorted, but for any iterator @i in the range + * @p [first,nth) and any iterator @j in the range @p [nth,last) it + * holds that @p *j<*i is false. + */ + template + inline void + nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, + _RandomAccessIterator __last) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) + __glibcxx_requires_valid_range(__first, __nth); + __glibcxx_requires_valid_range(__nth, __last); + + if (__first == __last || __nth == __last) + return; + + std::__introselect(__first, __nth, __last, + std::__lg(__last - __first) * 2); + } + + /** + * @brief Sort a sequence just enough to find a particular position + * using a predicate for comparison. + * @param first An iterator. + * @param nth Another iterator. + * @param last Another iterator. + * @param comp A comparison functor. + * @return Nothing. + * + * Rearranges the elements in the range @p [first,last) so that @p *nth + * is the same element that would have been in that position had the + * whole sequence been sorted. The elements either side of @p *nth are + * not completely sorted, but for any iterator @i in the range + * @p [first,nth) and any iterator @j in the range @p [nth,last) it + * holds that @p comp(*j,*i) is false. + */ + template + inline void + nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, + _RandomAccessIterator __last, _Compare __comp) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType, _ValueType>) + __glibcxx_requires_valid_range(__first, __nth); + __glibcxx_requires_valid_range(__nth, __last); + + if (__first == __last || __nth == __last) + return; + + std::__introselect(__first, __nth, __last, + std::__lg(__last - __first) * 2, __comp); + } + + /** + * @brief Finds the largest subrange in which @a val could be inserted + * at any place in it without changing the ordering. + * @param first An iterator. + * @param last Another iterator. + * @param val The search term. + * @return An pair of iterators defining the subrange. + * @ingroup binarysearch + * + * This is equivalent to + * @code + * std::make_pair(lower_bound(first, last, val), + * upper_bound(first, last, val)) + * @endcode + * but does not actually call those functions. + */ + template + pair<_ForwardIterator, _ForwardIterator> + equal_range(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __val) + { + typedef typename iterator_traits<_ForwardIterator>::value_type + _ValueType; + typedef typename iterator_traits<_ForwardIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_LessThanOpConcept<_ValueType, _Tp>) + __glibcxx_function_requires(_LessThanOpConcept<_Tp, _ValueType>) + __glibcxx_requires_partitioned(__first, __last, __val); + + _DistanceType __len = std::distance(__first, __last); + _DistanceType __half; + _ForwardIterator __middle, __left, __right; + + while (__len > 0) + { + __half = __len >> 1; + __middle = __first; + std::advance(__middle, __half); + if (*__middle < __val) + { + __first = __middle; + ++__first; + __len = __len - __half - 1; + } + else if (__val < *__middle) + __len = __half; + else + { + __left = std::lower_bound(__first, __middle, __val); + std::advance(__first, __len); + __right = std::upper_bound(++__middle, __first, __val); + return pair<_ForwardIterator, _ForwardIterator>(__left, __right); + } + } + return pair<_ForwardIterator, _ForwardIterator>(__first, __first); + } + + /** + * @brief Finds the largest subrange in which @a val could be inserted + * at any place in it without changing the ordering. + * @param first An iterator. + * @param last Another iterator. + * @param val The search term. + * @param comp A functor to use for comparisons. + * @return An pair of iterators defining the subrange. + * @ingroup binarysearch + * + * This is equivalent to + * @code + * std::make_pair(lower_bound(first, last, val, comp), + * upper_bound(first, last, val, comp)) + * @endcode + * but does not actually call those functions. + */ + template + pair<_ForwardIterator, _ForwardIterator> + equal_range(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __val, + _Compare __comp) + { + typedef typename iterator_traits<_ForwardIterator>::value_type + _ValueType; + typedef typename iterator_traits<_ForwardIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType, _Tp>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _Tp, _ValueType>) + __glibcxx_requires_partitioned_pred(__first, __last, __val, __comp); + + _DistanceType __len = std::distance(__first, __last); + _DistanceType __half; + _ForwardIterator __middle, __left, __right; + + while (__len > 0) + { + __half = __len >> 1; + __middle = __first; + std::advance(__middle, __half); + if (__comp(*__middle, __val)) + { + __first = __middle; + ++__first; + __len = __len - __half - 1; + } + else if (__comp(__val, *__middle)) + __len = __half; + else + { + __left = std::lower_bound(__first, __middle, __val, __comp); + std::advance(__first, __len); + __right = std::upper_bound(++__middle, __first, __val, __comp); + return pair<_ForwardIterator, _ForwardIterator>(__left, __right); + } + } + return pair<_ForwardIterator, _ForwardIterator>(__first, __first); + } + + /** + * @brief Determines whether an element exists in a range. + * @param first An iterator. + * @param last Another iterator. + * @param val The search term. + * @return True if @a val (or its equivelent) is in [@a first,@a last ]. + * @ingroup binarysearch + * + * Note that this does not actually return an iterator to @a val. For + * that, use std::find or a container's specialized find member functions. + */ + template + bool + binary_search(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __val) + { + typedef typename iterator_traits<_ForwardIterator>::value_type + _ValueType; + + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_LessThanOpConcept<_Tp, _ValueType>) + __glibcxx_requires_partitioned(__first, __last, __val); + + _ForwardIterator __i = std::lower_bound(__first, __last, __val); + return __i != __last && !(__val < *__i); + } + + /** + * @brief Determines whether an element exists in a range. + * @param first An iterator. + * @param last Another iterator. + * @param val The search term. + * @param comp A functor to use for comparisons. + * @return True if @a val (or its equivelent) is in [@a first,@a last ]. + * @ingroup binarysearch + * + * Note that this does not actually return an iterator to @a val. For + * that, use std::find or a container's specialized find member functions. + * + * The comparison function should have the same effects on ordering as + * the function used for the initial sort. + */ + template + bool + binary_search(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __val, _Compare __comp) + { + typedef typename iterator_traits<_ForwardIterator>::value_type + _ValueType; + + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _Tp, _ValueType>) + __glibcxx_requires_partitioned_pred(__first, __last, __val, __comp); + + _ForwardIterator __i = std::lower_bound(__first, __last, __val, __comp); + return __i != __last && !__comp(__val, *__i); + } + + // Set algorithms: includes, set_union, set_intersection, set_difference, + // set_symmetric_difference. All of these algorithms have the precondition + // that their input ranges are sorted and the postcondition that their output + // ranges are sorted. + + /** + * @brief Determines whether all elements of a sequence exists in a range. + * @param first1 Start of search range. + * @param last1 End of search range. + * @param first2 Start of sequence + * @param last2 End of sequence. + * @return True if each element in [first2,last2) is contained in order + * within [first1,last1). False otherwise. + * @ingroup setoperations + * + * This operation expects both [first1,last1) and [first2,last2) to be + * sorted. Searches for the presence of each element in [first2,last2) + * within [first1,last1). The iterators over each range only move forward, + * so this is a linear algorithm. If an element in [first2,last2) is not + * found before the search iterator reaches @a last2, false is returned. + */ + template + bool + includes(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _InputIterator2 __last2) + { + typedef typename iterator_traits<_InputIterator1>::value_type + _ValueType1; + typedef typename iterator_traits<_InputIterator2>::value_type + _ValueType2; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_LessThanOpConcept<_ValueType1, _ValueType2>) + __glibcxx_function_requires(_LessThanOpConcept<_ValueType2, _ValueType1>) + __glibcxx_requires_sorted(__first1, __last1); + __glibcxx_requires_sorted(__first2, __last2); + + while (__first1 != __last1 && __first2 != __last2) + if (*__first2 < *__first1) + return false; + else if(*__first1 < *__first2) + ++__first1; + else + ++__first1, ++__first2; + + return __first2 == __last2; + } + + /** + * @brief Determines whether all elements of a sequence exists in a range + * using comparison. + * @param first1 Start of search range. + * @param last1 End of search range. + * @param first2 Start of sequence + * @param last2 End of sequence. + * @param comp Comparison function to use. + * @return True if each element in [first2,last2) is contained in order + * within [first1,last1) according to comp. False otherwise. + * @ingroup setoperations + * + * This operation expects both [first1,last1) and [first2,last2) to be + * sorted. Searches for the presence of each element in [first2,last2) + * within [first1,last1), using comp to decide. The iterators over each + * range only move forward, so this is a linear algorithm. If an element + * in [first2,last2) is not found before the search iterator reaches @a + * last2, false is returned. + */ + template + bool + includes(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) + { + typedef typename iterator_traits<_InputIterator1>::value_type + _ValueType1; + typedef typename iterator_traits<_InputIterator2>::value_type + _ValueType2; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType1, _ValueType2>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType2, _ValueType1>) + __glibcxx_requires_sorted_pred(__first1, __last1, __comp); + __glibcxx_requires_sorted_pred(__first2, __last2, __comp); + + while (__first1 != __last1 && __first2 != __last2) + if (__comp(*__first2, *__first1)) + return false; + else if(__comp(*__first1, *__first2)) + ++__first1; + else + ++__first1, ++__first2; + + return __first2 == __last2; + } + + /** + * @brief Return the union of two sorted ranges. + * @param first1 Start of first range. + * @param last1 End of first range. + * @param first2 Start of second range. + * @param last2 End of second range. + * @return End of the output range. + * @ingroup setoperations + * + * This operation iterates over both ranges, copying elements present in + * each range in order to the output range. Iterators increment for each + * range. When the current element of one range is less than the other, + * that element is copied and the iterator advanced. If an element is + * contained in both ranges, the element from the first range is copied and + * both ranges advance. The output range may not overlap either input + * range. + */ + template + _OutputIterator + set_union(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _InputIterator2 __last2, + _OutputIterator __result) + { + typedef typename iterator_traits<_InputIterator1>::value_type + _ValueType1; + typedef typename iterator_traits<_InputIterator2>::value_type + _ValueType2; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType1>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType2>) + __glibcxx_function_requires(_LessThanOpConcept<_ValueType1, _ValueType2>) + __glibcxx_function_requires(_LessThanOpConcept<_ValueType2, _ValueType1>) + __glibcxx_requires_sorted(__first1, __last1); + __glibcxx_requires_sorted(__first2, __last2); + + while (__first1 != __last1 && __first2 != __last2) + { + if (*__first1 < *__first2) + { + *__result = *__first1; + ++__first1; + } + else if (*__first2 < *__first1) + { + *__result = *__first2; + ++__first2; + } + else + { + *__result = *__first1; + ++__first1; + ++__first2; + } + ++__result; + } + return std::copy(__first2, __last2, std::copy(__first1, __last1, + __result)); + } + + /** + * @brief Return the union of two sorted ranges using a comparison functor. + * @param first1 Start of first range. + * @param last1 End of first range. + * @param first2 Start of second range. + * @param last2 End of second range. + * @param comp The comparison functor. + * @return End of the output range. + * @ingroup setoperations + * + * This operation iterates over both ranges, copying elements present in + * each range in order to the output range. Iterators increment for each + * range. When the current element of one range is less than the other + * according to @a comp, that element is copied and the iterator advanced. + * If an equivalent element according to @a comp is contained in both + * ranges, the element from the first range is copied and both ranges + * advance. The output range may not overlap either input range. + */ + template + _OutputIterator + set_union(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _InputIterator2 __last2, + _OutputIterator __result, _Compare __comp) + { + typedef typename iterator_traits<_InputIterator1>::value_type + _ValueType1; + typedef typename iterator_traits<_InputIterator2>::value_type + _ValueType2; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType1>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType2>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType1, _ValueType2>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType2, _ValueType1>) + __glibcxx_requires_sorted_pred(__first1, __last1, __comp); + __glibcxx_requires_sorted_pred(__first2, __last2, __comp); + + while (__first1 != __last1 && __first2 != __last2) + { + if (__comp(*__first1, *__first2)) + { + *__result = *__first1; + ++__first1; + } + else if (__comp(*__first2, *__first1)) + { + *__result = *__first2; + ++__first2; + } + else + { + *__result = *__first1; + ++__first1; + ++__first2; + } + ++__result; + } + return std::copy(__first2, __last2, std::copy(__first1, __last1, + __result)); + } + + /** + * @brief Return the intersection of two sorted ranges. + * @param first1 Start of first range. + * @param last1 End of first range. + * @param first2 Start of second range. + * @param last2 End of second range. + * @return End of the output range. + * @ingroup setoperations + * + * This operation iterates over both ranges, copying elements present in + * both ranges in order to the output range. Iterators increment for each + * range. When the current element of one range is less than the other, + * that iterator advances. If an element is contained in both ranges, the + * element from the first range is copied and both ranges advance. The + * output range may not overlap either input range. + */ + template + _OutputIterator + set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _InputIterator2 __last2, + _OutputIterator __result) + { + typedef typename iterator_traits<_InputIterator1>::value_type + _ValueType1; + typedef typename iterator_traits<_InputIterator2>::value_type + _ValueType2; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType1>) + __glibcxx_function_requires(_LessThanOpConcept<_ValueType1, _ValueType2>) + __glibcxx_function_requires(_LessThanOpConcept<_ValueType2, _ValueType1>) + __glibcxx_requires_sorted(__first1, __last1); + __glibcxx_requires_sorted(__first2, __last2); + + while (__first1 != __last1 && __first2 != __last2) + if (*__first1 < *__first2) + ++__first1; + else if (*__first2 < *__first1) + ++__first2; + else + { + *__result = *__first1; + ++__first1; + ++__first2; + ++__result; + } + return __result; + } + + /** + * @brief Return the intersection of two sorted ranges using comparison + * functor. + * @param first1 Start of first range. + * @param last1 End of first range. + * @param first2 Start of second range. + * @param last2 End of second range. + * @param comp The comparison functor. + * @return End of the output range. + * @ingroup setoperations + * + * This operation iterates over both ranges, copying elements present in + * both ranges in order to the output range. Iterators increment for each + * range. When the current element of one range is less than the other + * according to @a comp, that iterator advances. If an element is + * contained in both ranges according to @a comp, the element from the + * first range is copied and both ranges advance. The output range may not + * overlap either input range. + */ + template + _OutputIterator + set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _InputIterator2 __last2, + _OutputIterator __result, _Compare __comp) + { + typedef typename iterator_traits<_InputIterator1>::value_type + _ValueType1; + typedef typename iterator_traits<_InputIterator2>::value_type + _ValueType2; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType1>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType1, _ValueType2>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType2, _ValueType1>) + __glibcxx_requires_sorted_pred(__first1, __last1, __comp); + __glibcxx_requires_sorted_pred(__first2, __last2, __comp); + + while (__first1 != __last1 && __first2 != __last2) + if (__comp(*__first1, *__first2)) + ++__first1; + else if (__comp(*__first2, *__first1)) + ++__first2; + else + { + *__result = *__first1; + ++__first1; + ++__first2; + ++__result; + } + return __result; + } + + /** + * @brief Return the difference of two sorted ranges. + * @param first1 Start of first range. + * @param last1 End of first range. + * @param first2 Start of second range. + * @param last2 End of second range. + * @return End of the output range. + * @ingroup setoperations + * + * This operation iterates over both ranges, copying elements present in + * the first range but not the second in order to the output range. + * Iterators increment for each range. When the current element of the + * first range is less than the second, that element is copied and the + * iterator advances. If the current element of the second range is less, + * the iterator advances, but no element is copied. If an element is + * contained in both ranges, no elements are copied and both ranges + * advance. The output range may not overlap either input range. + */ + template + _OutputIterator + set_difference(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _InputIterator2 __last2, + _OutputIterator __result) + { + typedef typename iterator_traits<_InputIterator1>::value_type + _ValueType1; + typedef typename iterator_traits<_InputIterator2>::value_type + _ValueType2; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType1>) + __glibcxx_function_requires(_LessThanOpConcept<_ValueType1, _ValueType2>) + __glibcxx_function_requires(_LessThanOpConcept<_ValueType2, _ValueType1>) + __glibcxx_requires_sorted(__first1, __last1); + __glibcxx_requires_sorted(__first2, __last2); + + while (__first1 != __last1 && __first2 != __last2) + if (*__first1 < *__first2) + { + *__result = *__first1; + ++__first1; + ++__result; + } + else if (*__first2 < *__first1) + ++__first2; + else + { + ++__first1; + ++__first2; + } + return std::copy(__first1, __last1, __result); + } + + /** + * @brief Return the difference of two sorted ranges using comparison + * functor. + * @param first1 Start of first range. + * @param last1 End of first range. + * @param first2 Start of second range. + * @param last2 End of second range. + * @param comp The comparison functor. + * @return End of the output range. + * @ingroup setoperations + * + * This operation iterates over both ranges, copying elements present in + * the first range but not the second in order to the output range. + * Iterators increment for each range. When the current element of the + * first range is less than the second according to @a comp, that element + * is copied and the iterator advances. If the current element of the + * second range is less, no element is copied and the iterator advances. + * If an element is contained in both ranges according to @a comp, no + * elements are copied and both ranges advance. The output range may not + * overlap either input range. + */ + template + _OutputIterator + set_difference(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _InputIterator2 __last2, + _OutputIterator __result, _Compare __comp) + { + typedef typename iterator_traits<_InputIterator1>::value_type + _ValueType1; + typedef typename iterator_traits<_InputIterator2>::value_type + _ValueType2; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType1>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType1, _ValueType2>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType2, _ValueType1>) + __glibcxx_requires_sorted_pred(__first1, __last1, __comp); + __glibcxx_requires_sorted_pred(__first2, __last2, __comp); + + while (__first1 != __last1 && __first2 != __last2) + if (__comp(*__first1, *__first2)) + { + *__result = *__first1; + ++__first1; + ++__result; + } + else if (__comp(*__first2, *__first1)) + ++__first2; + else + { + ++__first1; + ++__first2; + } + return std::copy(__first1, __last1, __result); + } + + /** + * @brief Return the symmetric difference of two sorted ranges. + * @param first1 Start of first range. + * @param last1 End of first range. + * @param first2 Start of second range. + * @param last2 End of second range. + * @return End of the output range. + * @ingroup setoperations + * + * This operation iterates over both ranges, copying elements present in + * one range but not the other in order to the output range. Iterators + * increment for each range. When the current element of one range is less + * than the other, that element is copied and the iterator advances. If an + * element is contained in both ranges, no elements are copied and both + * ranges advance. The output range may not overlap either input range. + */ + template + _OutputIterator + set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _InputIterator2 __last2, + _OutputIterator __result) + { + typedef typename iterator_traits<_InputIterator1>::value_type + _ValueType1; + typedef typename iterator_traits<_InputIterator2>::value_type + _ValueType2; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType1>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType2>) + __glibcxx_function_requires(_LessThanOpConcept<_ValueType1, _ValueType2>) + __glibcxx_function_requires(_LessThanOpConcept<_ValueType2, _ValueType1>) + __glibcxx_requires_sorted(__first1, __last1); + __glibcxx_requires_sorted(__first2, __last2); + + while (__first1 != __last1 && __first2 != __last2) + if (*__first1 < *__first2) + { + *__result = *__first1; + ++__first1; + ++__result; + } + else if (*__first2 < *__first1) + { + *__result = *__first2; + ++__first2; + ++__result; + } + else + { + ++__first1; + ++__first2; + } + return std::copy(__first2, __last2, std::copy(__first1, + __last1, __result)); + } + + /** + * @brief Return the symmetric difference of two sorted ranges using + * comparison functor. + * @param first1 Start of first range. + * @param last1 End of first range. + * @param first2 Start of second range. + * @param last2 End of second range. + * @param comp The comparison functor. + * @return End of the output range. + * @ingroup setoperations + * + * This operation iterates over both ranges, copying elements present in + * one range but not the other in order to the output range. Iterators + * increment for each range. When the current element of one range is less + * than the other according to @a comp, that element is copied and the + * iterator advances. If an element is contained in both ranges according + * to @a comp, no elements are copied and both ranges advance. The output + * range may not overlap either input range. + */ + template + _OutputIterator + set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _InputIterator2 __last2, + _OutputIterator __result, + _Compare __comp) + { + typedef typename iterator_traits<_InputIterator1>::value_type + _ValueType1; + typedef typename iterator_traits<_InputIterator2>::value_type + _ValueType2; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType1>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType2>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType1, _ValueType2>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType2, _ValueType1>) + __glibcxx_requires_sorted_pred(__first1, __last1, __comp); + __glibcxx_requires_sorted_pred(__first2, __last2, __comp); + + while (__first1 != __last1 && __first2 != __last2) + if (__comp(*__first1, *__first2)) + { + *__result = *__first1; + ++__first1; + ++__result; + } + else if (__comp(*__first2, *__first1)) + { + *__result = *__first2; + ++__first2; + ++__result; + } + else + { + ++__first1; + ++__first2; + } + return std::copy(__first2, __last2, std::copy(__first1, + __last1, __result)); + } + + // min_element and max_element, with and without an explicitly supplied + // comparison function. + + /** + * @brief Return the maximum element in a range. + * @param first Start of range. + * @param last End of range. + * @return Iterator referencing the first instance of the largest value. + */ + template + _ForwardIterator + max_element(_ForwardIterator __first, _ForwardIterator __last) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_LessThanComparableConcept< + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return __first; + _ForwardIterator __result = __first; + while (++__first != __last) + if (*__result < *__first) + __result = __first; + return __result; + } + + /** + * @brief Return the maximum element in a range using comparison functor. + * @param first Start of range. + * @param last End of range. + * @param comp Comparison functor. + * @return Iterator referencing the first instance of the largest value + * according to comp. + */ + template + _ForwardIterator + max_element(_ForwardIterator __first, _ForwardIterator __last, + _Compare __comp) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + typename iterator_traits<_ForwardIterator>::value_type, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) return __first; + _ForwardIterator __result = __first; + while (++__first != __last) + if (__comp(*__result, *__first)) __result = __first; + return __result; + } + + /** + * @brief Return the minimum element in a range. + * @param first Start of range. + * @param last End of range. + * @return Iterator referencing the first instance of the smallest value. + */ + template + _ForwardIterator + min_element(_ForwardIterator __first, _ForwardIterator __last) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_LessThanComparableConcept< + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return __first; + _ForwardIterator __result = __first; + while (++__first != __last) + if (*__first < *__result) + __result = __first; + return __result; + } + + /** + * @brief Return the minimum element in a range using comparison functor. + * @param first Start of range. + * @param last End of range. + * @param comp Comparison functor. + * @return Iterator referencing the first instance of the smallest value + * according to comp. + */ + template + _ForwardIterator + min_element(_ForwardIterator __first, _ForwardIterator __last, + _Compare __comp) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + typename iterator_traits<_ForwardIterator>::value_type, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return __first; + _ForwardIterator __result = __first; + while (++__first != __last) + if (__comp(*__first, *__result)) + __result = __first; + return __result; + } + + // next_permutation and prev_permutation, with and without an explicitly + // supplied comparison function. + + /** + * @brief Permute range into the next "dictionary" ordering. + * @param first Start of range. + * @param last End of range. + * @return False if wrapped to first permutation, true otherwise. + * + * Treats all permutations of the range as a set of "dictionary" sorted + * sequences. Permutes the current sequence into the next one of this set. + * Returns true if there are more sequences to generate. If the sequence + * is the largest of the set, the smallest is generated and false returned. + */ + template + bool + next_permutation(_BidirectionalIterator __first, + _BidirectionalIterator __last) + { + // concept requirements + __glibcxx_function_requires(_BidirectionalIteratorConcept< + _BidirectionalIterator>) + __glibcxx_function_requires(_LessThanComparableConcept< + typename iterator_traits<_BidirectionalIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return false; + _BidirectionalIterator __i = __first; + ++__i; + if (__i == __last) + return false; + __i = __last; + --__i; + + for(;;) + { + _BidirectionalIterator __ii = __i; + --__i; + if (*__i < *__ii) + { + _BidirectionalIterator __j = __last; + while (!(*__i < *--__j)) + {} + std::iter_swap(__i, __j); + std::reverse(__ii, __last); + return true; + } + if (__i == __first) + { + std::reverse(__first, __last); + return false; + } + } + } + + /** + * @brief Permute range into the next "dictionary" ordering using + * comparison functor. + * @param first Start of range. + * @param last End of range. + * @param comp + * @return False if wrapped to first permutation, true otherwise. + * + * Treats all permutations of the range [first,last) as a set of + * "dictionary" sorted sequences ordered by @a comp. Permutes the current + * sequence into the next one of this set. Returns true if there are more + * sequences to generate. If the sequence is the largest of the set, the + * smallest is generated and false returned. + */ + template + bool + next_permutation(_BidirectionalIterator __first, + _BidirectionalIterator __last, _Compare __comp) + { + // concept requirements + __glibcxx_function_requires(_BidirectionalIteratorConcept< + _BidirectionalIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + typename iterator_traits<_BidirectionalIterator>::value_type, + typename iterator_traits<_BidirectionalIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return false; + _BidirectionalIterator __i = __first; + ++__i; + if (__i == __last) + return false; + __i = __last; + --__i; + + for(;;) + { + _BidirectionalIterator __ii = __i; + --__i; + if (__comp(*__i, *__ii)) + { + _BidirectionalIterator __j = __last; + while (!__comp(*__i, *--__j)) + {} + std::iter_swap(__i, __j); + std::reverse(__ii, __last); + return true; + } + if (__i == __first) + { + std::reverse(__first, __last); + return false; + } + } + } + + /** + * @brief Permute range into the previous "dictionary" ordering. + * @param first Start of range. + * @param last End of range. + * @return False if wrapped to last permutation, true otherwise. + * + * Treats all permutations of the range as a set of "dictionary" sorted + * sequences. Permutes the current sequence into the previous one of this + * set. Returns true if there are more sequences to generate. If the + * sequence is the smallest of the set, the largest is generated and false + * returned. + */ + template + bool + prev_permutation(_BidirectionalIterator __first, + _BidirectionalIterator __last) + { + // concept requirements + __glibcxx_function_requires(_BidirectionalIteratorConcept< + _BidirectionalIterator>) + __glibcxx_function_requires(_LessThanComparableConcept< + typename iterator_traits<_BidirectionalIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return false; + _BidirectionalIterator __i = __first; + ++__i; + if (__i == __last) + return false; + __i = __last; + --__i; + + for(;;) + { + _BidirectionalIterator __ii = __i; + --__i; + if (*__ii < *__i) + { + _BidirectionalIterator __j = __last; + while (!(*--__j < *__i)) + {} + std::iter_swap(__i, __j); + std::reverse(__ii, __last); + return true; + } + if (__i == __first) + { + std::reverse(__first, __last); + return false; + } + } + } + + /** + * @brief Permute range into the previous "dictionary" ordering using + * comparison functor. + * @param first Start of range. + * @param last End of range. + * @param comp + * @return False if wrapped to last permutation, true otherwise. + * + * Treats all permutations of the range [first,last) as a set of + * "dictionary" sorted sequences ordered by @a comp. Permutes the current + * sequence into the previous one of this set. Returns true if there are + * more sequences to generate. If the sequence is the smallest of the set, + * the largest is generated and false returned. + */ + template + bool + prev_permutation(_BidirectionalIterator __first, + _BidirectionalIterator __last, _Compare __comp) + { + // concept requirements + __glibcxx_function_requires(_BidirectionalIteratorConcept< + _BidirectionalIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + typename iterator_traits<_BidirectionalIterator>::value_type, + typename iterator_traits<_BidirectionalIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return false; + _BidirectionalIterator __i = __first; + ++__i; + if (__i == __last) + return false; + __i = __last; + --__i; + + for(;;) + { + _BidirectionalIterator __ii = __i; + --__i; + if (__comp(*__ii, *__i)) + { + _BidirectionalIterator __j = __last; + while (!__comp(*--__j, *__i)) + {} + std::iter_swap(__i, __j); + std::reverse(__ii, __last); + return true; + } + if (__i == __first) + { + std::reverse(__first, __last); + return false; + } + } + } + + // find_first_of, with and without an explicitly supplied comparison function. + + /** + * @brief Find element from a set in a sequence. + * @param first1 Start of range to search. + * @param last1 End of range to search. + * @param first2 Start of match candidates. + * @param last2 End of match candidates. + * @return The first iterator @c i in the range + * @p [first1,last1) such that @c *i == @p *(i2) such that i2 is an + * interator in [first2,last2), or @p last1 if no such iterator exists. + * + * Searches the range @p [first1,last1) for an element that is equal to + * some element in the range [first2,last2). If found, returns an iterator + * in the range [first1,last1), otherwise returns @p last1. + */ + template + _InputIterator + find_first_of(_InputIterator __first1, _InputIterator __last1, + _ForwardIterator __first2, _ForwardIterator __last2) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_EqualOpConcept< + typename iterator_traits<_InputIterator>::value_type, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first1, __last1); + __glibcxx_requires_valid_range(__first2, __last2); + + for ( ; __first1 != __last1; ++__first1) + for (_ForwardIterator __iter = __first2; __iter != __last2; ++__iter) + if (*__first1 == *__iter) + return __first1; + return __last1; + } + + /** + * @brief Find element from a set in a sequence using a predicate. + * @param first1 Start of range to search. + * @param last1 End of range to search. + * @param first2 Start of match candidates. + * @param last2 End of match candidates. + * @param comp Predicate to use. + * @return The first iterator @c i in the range + * @p [first1,last1) such that @c comp(*i, @p *(i2)) is true and i2 is an + * interator in [first2,last2), or @p last1 if no such iterator exists. + * + * Searches the range @p [first1,last1) for an element that is equal to + * some element in the range [first2,last2). If found, returns an iterator in + * the range [first1,last1), otherwise returns @p last1. + */ + template + _InputIterator + find_first_of(_InputIterator __first1, _InputIterator __last1, + _ForwardIterator __first2, _ForwardIterator __last2, + _BinaryPredicate __comp) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, + typename iterator_traits<_InputIterator>::value_type, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first1, __last1); + __glibcxx_requires_valid_range(__first2, __last2); + + for ( ; __first1 != __last1; ++__first1) + for (_ForwardIterator __iter = __first2; __iter != __last2; ++__iter) + if (__comp(*__first1, *__iter)) + return __first1; + return __last1; + } + + + // find_end, with and without an explicitly supplied comparison function. + // Search [first2, last2) as a subsequence in [first1, last1), and return + // the *last* possible match. Note that find_end for bidirectional iterators + // is much faster than for forward iterators. + + // find_end for forward iterators. + template + _ForwardIterator1 + __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, + _ForwardIterator2 __first2, _ForwardIterator2 __last2, + forward_iterator_tag, forward_iterator_tag) + { + if (__first2 == __last2) + return __last1; + else + { + _ForwardIterator1 __result = __last1; + while (1) + { + _ForwardIterator1 __new_result + = std::search(__first1, __last1, __first2, __last2); + if (__new_result == __last1) + return __result; + else + { + __result = __new_result; + __first1 = __new_result; + ++__first1; + } + } + } + } + + template + _ForwardIterator1 + __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, + _ForwardIterator2 __first2, _ForwardIterator2 __last2, + forward_iterator_tag, forward_iterator_tag, + _BinaryPredicate __comp) + { + if (__first2 == __last2) + return __last1; + else + { + _ForwardIterator1 __result = __last1; + while (1) + { + _ForwardIterator1 __new_result + = std::search(__first1, __last1, __first2, __last2, __comp); + if (__new_result == __last1) + return __result; + else + { + __result = __new_result; + __first1 = __new_result; + ++__first1; + } + } + } + } + + // find_end for bidirectional iterators. Requires partial specialization. + template + _BidirectionalIterator1 + __find_end(_BidirectionalIterator1 __first1, + _BidirectionalIterator1 __last1, + _BidirectionalIterator2 __first2, + _BidirectionalIterator2 __last2, + bidirectional_iterator_tag, bidirectional_iterator_tag) + { + // concept requirements + __glibcxx_function_requires(_BidirectionalIteratorConcept< + _BidirectionalIterator1>) + __glibcxx_function_requires(_BidirectionalIteratorConcept< + _BidirectionalIterator2>) + + typedef reverse_iterator<_BidirectionalIterator1> _RevIterator1; + typedef reverse_iterator<_BidirectionalIterator2> _RevIterator2; + + _RevIterator1 __rlast1(__first1); + _RevIterator2 __rlast2(__first2); + _RevIterator1 __rresult = std::search(_RevIterator1(__last1), __rlast1, + _RevIterator2(__last2), __rlast2); + + if (__rresult == __rlast1) + return __last1; + else + { + _BidirectionalIterator1 __result = __rresult.base(); + std::advance(__result, -std::distance(__first2, __last2)); + return __result; + } + } + + template + _BidirectionalIterator1 + __find_end(_BidirectionalIterator1 __first1, + _BidirectionalIterator1 __last1, + _BidirectionalIterator2 __first2, + _BidirectionalIterator2 __last2, + bidirectional_iterator_tag, bidirectional_iterator_tag, + _BinaryPredicate __comp) + { + // concept requirements + __glibcxx_function_requires(_BidirectionalIteratorConcept< + _BidirectionalIterator1>) + __glibcxx_function_requires(_BidirectionalIteratorConcept< + _BidirectionalIterator2>) + + typedef reverse_iterator<_BidirectionalIterator1> _RevIterator1; + typedef reverse_iterator<_BidirectionalIterator2> _RevIterator2; + + _RevIterator1 __rlast1(__first1); + _RevIterator2 __rlast2(__first2); + _RevIterator1 __rresult = std::search(_RevIterator1(__last1), __rlast1, + _RevIterator2(__last2), __rlast2, + __comp); + + if (__rresult == __rlast1) + return __last1; + else + { + _BidirectionalIterator1 __result = __rresult.base(); + std::advance(__result, -std::distance(__first2, __last2)); + return __result; + } + } + + // Dispatching functions for find_end. + + /** + * @brief Find last matching subsequence in a sequence. + * @param first1 Start of range to search. + * @param last1 End of range to search. + * @param first2 Start of sequence to match. + * @param last2 End of sequence to match. + * @return The last iterator @c i in the range + * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N) + * for each @c N in the range @p [0,last2-first2), or @p last1 if no + * such iterator exists. + * + * Searches the range @p [first1,last1) for a sub-sequence that compares + * equal value-by-value with the sequence given by @p [first2,last2) and + * returns an iterator to the first element of the sub-sequence, or + * @p last1 if the sub-sequence is not found. The sub-sequence will be the + * last such subsequence contained in [first,last1). + * + * Because the sub-sequence must lie completely within the range + * @p [first1,last1) it must start at a position less than + * @p last1-(last2-first2) where @p last2-first2 is the length of the + * sub-sequence. + * This means that the returned iterator @c i will be in the range + * @p [first1,last1-(last2-first2)) + */ + template + inline _ForwardIterator1 + find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, + _ForwardIterator2 __first2, _ForwardIterator2 __last2) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>) + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>) + __glibcxx_function_requires(_EqualOpConcept< + typename iterator_traits<_ForwardIterator1>::value_type, + typename iterator_traits<_ForwardIterator2>::value_type>) + __glibcxx_requires_valid_range(__first1, __last1); + __glibcxx_requires_valid_range(__first2, __last2); + + return std::__find_end(__first1, __last1, __first2, __last2, + std::__iterator_category(__first1), + std::__iterator_category(__first2)); + } + + /** + * @brief Find last matching subsequence in a sequence using a predicate. + * @param first1 Start of range to search. + * @param last1 End of range to search. + * @param first2 Start of sequence to match. + * @param last2 End of sequence to match. + * @param comp The predicate to use. + * @return The last iterator @c i in the range + * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @p + * (first2+N)) is true for each @c N in the range @p [0,last2-first2), or + * @p last1 if no such iterator exists. + * + * Searches the range @p [first1,last1) for a sub-sequence that compares + * equal value-by-value with the sequence given by @p [first2,last2) using + * comp as a predicate and returns an iterator to the first element of the + * sub-sequence, or @p last1 if the sub-sequence is not found. The + * sub-sequence will be the last such subsequence contained in + * [first,last1). + * + * Because the sub-sequence must lie completely within the range + * @p [first1,last1) it must start at a position less than + * @p last1-(last2-first2) where @p last2-first2 is the length of the + * sub-sequence. + * This means that the returned iterator @c i will be in the range + * @p [first1,last1-(last2-first2)) + */ + template + inline _ForwardIterator1 + find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, + _ForwardIterator2 __first2, _ForwardIterator2 __last2, + _BinaryPredicate __comp) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>) + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>) + __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, + typename iterator_traits<_ForwardIterator1>::value_type, + typename iterator_traits<_ForwardIterator2>::value_type>) + __glibcxx_requires_valid_range(__first1, __last1); + __glibcxx_requires_valid_range(__first2, __last2); + + return std::__find_end(__first1, __last1, __first2, __last2, + std::__iterator_category(__first1), + std::__iterator_category(__first2), + __comp); + } + +} // namespace std + +#endif /* _ALGO_H */ diff --git a/cpp_src/stl_algobase.h b/cpp_src/stl_algobase.h new file mode 100644 index 0000000..00d9b42 --- /dev/null +++ b/cpp_src/stl_algobase.h @@ -0,0 +1,935 @@ +// Bits and pieces used in algorithms -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996-1998 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_algobase.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _ALGOBASE_H +#define _ALGOBASE_H 1 + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +namespace std { + + /** + * @brief Swaps two values. + * @param a A thing of arbitrary type. + * @param b Another thing of arbitrary type. + * @return Nothing. + * + * This is the simple classic generic implementation. It will work on + * any type which has a copy constructor and an assignment operator. + */ + template + inline void + swap(_Tp& __a, _Tp& __b) + { + // concept requirements + __glibcxx_function_requires(_SGIAssignableConcept<_Tp>) + + _Tp __tmp = __a; + __a = __b; + __b = __tmp; + } + + // See http://gcc.gnu.org/ml/libstdc++/2004-08/msg00167.html: in a + // nutshell, we are partially implementing the resolution of DR 187, + // when it's safe, i.e., the value_types are equal. + template + struct __iter_swap + { + template + static void + iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b) + { + typedef typename iterator_traits<_ForwardIterator1>::value_type + _ValueType1; + _ValueType1 __tmp = *__a; + *__a = *__b; + *__b = __tmp; + } + }; + + template<> + struct __iter_swap + { + template + static void + iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b) + { + swap(*__a, *__b); + } + }; + + /** + * @brief Swaps the contents of two iterators. + * @param a An iterator. + * @param b Another iterator. + * @return Nothing. + * + * This function swaps the values pointed to by two iterators, not the + * iterators themselves. + */ + template + inline void + iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b) + { + typedef typename iterator_traits<_ForwardIterator1>::value_type + _ValueType1; + typedef typename iterator_traits<_ForwardIterator2>::value_type + _ValueType2; + + // concept requirements + __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< + _ForwardIterator1>) + __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< + _ForwardIterator2>) + __glibcxx_function_requires(_ConvertibleConcept<_ValueType1, + _ValueType2>) + __glibcxx_function_requires(_ConvertibleConcept<_ValueType2, + _ValueType1>) + + typedef typename iterator_traits<_ForwardIterator1>::reference + _ReferenceType1; + typedef typename iterator_traits<_ForwardIterator2>::reference + _ReferenceType2; + std::__iter_swap<__are_same<_ValueType1, _ValueType2>::__value && + __are_same<_ValueType1 &, _ReferenceType1>::__value && + __are_same<_ValueType2 &, _ReferenceType2>::__value>:: + iter_swap(__a, __b); + } + + /** + * @brief This does what you think it does. + * @param a A thing of arbitrary type. + * @param b Another thing of arbitrary type. + * @return The lesser of the parameters. + * + * This is the simple classic generic implementation. It will work on + * temporary expressions, since they are only evaluated once, unlike a + * preprocessor macro. + */ + template + inline const _Tp& + min(const _Tp& __a, const _Tp& __b) + { + // concept requirements + __glibcxx_function_requires(_LessThanComparableConcept<_Tp>) + //return __b < __a ? __b : __a; + if (__b < __a) + return __b; + return __a; + } + + /** + * @brief This does what you think it does. + * @param a A thing of arbitrary type. + * @param b Another thing of arbitrary type. + * @return The greater of the parameters. + * + * This is the simple classic generic implementation. It will work on + * temporary expressions, since they are only evaluated once, unlike a + * preprocessor macro. + */ + template + inline const _Tp& + max(const _Tp& __a, const _Tp& __b) + { + // concept requirements + __glibcxx_function_requires(_LessThanComparableConcept<_Tp>) + //return __a < __b ? __b : __a; + if (__a < __b) + return __b; + return __a; + } + + /** + * @brief This does what you think it does. + * @param a A thing of arbitrary type. + * @param b Another thing of arbitrary type. + * @param comp A @link s20_3_3_comparisons comparison functor@endlink. + * @return The lesser of the parameters. + * + * This will work on temporary expressions, since they are only evaluated + * once, unlike a preprocessor macro. + */ + template + inline const _Tp& + min(const _Tp& __a, const _Tp& __b, _Compare __comp) + { + //return __comp(__b, __a) ? __b : __a; + if (__comp(__b, __a)) + return __b; + return __a; + } + + /** + * @brief This does what you think it does. + * @param a A thing of arbitrary type. + * @param b Another thing of arbitrary type. + * @param comp A @link s20_3_3_comparisons comparison functor@endlink. + * @return The greater of the parameters. + * + * This will work on temporary expressions, since they are only evaluated + * once, unlike a preprocessor macro. + */ + template + inline const _Tp& + max(const _Tp& __a, const _Tp& __b, _Compare __comp) + { + //return __comp(__a, __b) ? __b : __a; + if (__comp(__a, __b)) + return __b; + return __a; + } + + // All of these auxiliary structs serve two purposes. (1) Replace + // calls to copy with memmove whenever possible. (Memmove, not memcpy, + // because the input and output ranges are permitted to overlap.) + // (2) If we're using random access iterators, then write the loop as + // a for loop with an explicit count. + + template + struct __copy + { + template + static _OI + copy(_II __first, _II __last, _OI __result) + { + for (; __first != __last; ++__result, ++__first) + *__result = *__first; + return __result; + } + }; + + template + struct __copy<_BoolType, random_access_iterator_tag> + { + template + static _OI + copy(_II __first, _II __last, _OI __result) + { + typedef typename iterator_traits<_II>::difference_type _Distance; + for(_Distance __n = __last - __first; __n > 0; --__n) + { + *__result = *__first; + ++__first; + ++__result; + } + return __result; + } + }; + + template<> + struct __copy + { + template + static _Tp* + copy(const _Tp* __first, const _Tp* __last, _Tp* __result) + { + std::memmove(__result, __first, sizeof(_Tp) * (__last - __first)); + return __result + (__last - __first); + } + }; + + template + inline _OI + __copy_aux(_II __first, _II __last, _OI __result) + { + typedef typename iterator_traits<_II>::value_type _ValueTypeI; + typedef typename iterator_traits<_OI>::value_type _ValueTypeO; + typedef typename iterator_traits<_II>::iterator_category _Category; + const bool __simple = (__is_scalar<_ValueTypeI>::__value + && __is_pointer<_II>::__value + && __is_pointer<_OI>::__value + && __are_same<_ValueTypeI, _ValueTypeO>::__value); + + return std::__copy<__simple, _Category>::copy(__first, __last, __result); + } + + // Helpers for streambuf iterators (either istream or ostream). + template + typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, + ostreambuf_iterator<_CharT> >::__type + __copy_aux(_CharT*, _CharT*, ostreambuf_iterator<_CharT>); + + template + typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, + ostreambuf_iterator<_CharT> >::__type + __copy_aux(const _CharT*, const _CharT*, ostreambuf_iterator<_CharT>); + + template + typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, _CharT*>::__type + __copy_aux(istreambuf_iterator<_CharT>, istreambuf_iterator<_CharT>, + _CharT*); + + template + struct __copy_normal + { + template + static _OI + __copy_n(_II __first, _II __last, _OI __result) + { return std::__copy_aux(__first, __last, __result); } + }; + + template<> + struct __copy_normal + { + template + static _OI + __copy_n(_II __first, _II __last, _OI __result) + { return std::__copy_aux(__first.base(), __last.base(), __result); } + }; + + template<> + struct __copy_normal + { + template + static _OI + __copy_n(_II __first, _II __last, _OI __result) + { return _OI(std::__copy_aux(__first, __last, __result.base())); } + }; + + template<> + struct __copy_normal + { + template + static _OI + __copy_n(_II __first, _II __last, _OI __result) + { return _OI(std::__copy_aux(__first.base(), __last.base(), + __result.base())); } + }; + + /** + * @brief Copies the range [first,last) into result. + * @param first An input iterator. + * @param last An input iterator. + * @param result An output iterator. + * @return result + (first - last) + * + * This inline function will boil down to a call to @c memmove whenever + * possible. Failing that, if random access iterators are passed, then the + * loop count will be known (and therefore a candidate for compiler + * optimizations such as unrolling). Result may not be contained within + * [first,last); the copy_backward function should be used instead. + * + * Note that the end of the output range is permitted to be contained + * within [first,last). + */ + template + inline _OutputIterator + copy(_InputIterator __first, _InputIterator __last, + _OutputIterator __result) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + typename iterator_traits<_InputIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + const bool __in = __is_normal_iterator<_InputIterator>::__value; + const bool __out = __is_normal_iterator<_OutputIterator>::__value; + return std::__copy_normal<__in, __out>::__copy_n(__first, __last, + __result); + } + + // Overload for streambuf iterators. + template + typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, + ostreambuf_iterator<_CharT> >::__type + copy(istreambuf_iterator<_CharT>, istreambuf_iterator<_CharT>, + ostreambuf_iterator<_CharT>); + + template + struct __copy_backward + { + template + static _BI2 + __copy_b(_BI1 __first, _BI1 __last, _BI2 __result) + { + while (__first != __last) + *--__result = *--__last; + return __result; + } + }; + + template + struct __copy_backward<_BoolType, random_access_iterator_tag> + { + template + static _BI2 + __copy_b(_BI1 __first, _BI1 __last, _BI2 __result) + { + typename iterator_traits<_BI1>::difference_type __n; + for (__n = __last - __first; __n > 0; --__n) + *--__result = *--__last; + return __result; + } + }; + + template<> + struct __copy_backward + { + template + static _Tp* + __copy_b(const _Tp* __first, const _Tp* __last, _Tp* __result) + { + const ptrdiff_t _Num = __last - __first; + std::memmove(__result - _Num, __first, sizeof(_Tp) * _Num); + return __result - _Num; + } + }; + + template + inline _BI2 + __copy_backward_aux(_BI1 __first, _BI1 __last, _BI2 __result) + { + typedef typename iterator_traits<_BI1>::value_type _ValueType1; + typedef typename iterator_traits<_BI2>::value_type _ValueType2; + typedef typename iterator_traits<_BI1>::iterator_category _Category; + const bool __simple = (__is_scalar<_ValueType1>::__value + && __is_pointer<_BI1>::__value + && __is_pointer<_BI2>::__value + && __are_same<_ValueType1, _ValueType2>::__value); + + return std::__copy_backward<__simple, _Category>::__copy_b(__first, + __last, + __result); + } + + template + struct __copy_backward_normal + { + template + static _BI2 + __copy_b_n(_BI1 __first, _BI1 __last, _BI2 __result) + { return std::__copy_backward_aux(__first, __last, __result); } + }; + + template<> + struct __copy_backward_normal + { + template + static _BI2 + __copy_b_n(_BI1 __first, _BI1 __last, _BI2 __result) + { return std::__copy_backward_aux(__first.base(), __last.base(), + __result); } + }; + + template<> + struct __copy_backward_normal + { + template + static _BI2 + __copy_b_n(_BI1 __first, _BI1 __last, _BI2 __result) + { return _BI2(std::__copy_backward_aux(__first, __last, + __result.base())); } + }; + + template<> + struct __copy_backward_normal + { + template + static _BI2 + __copy_b_n(_BI1 __first, _BI1 __last, _BI2 __result) + { return _BI2(std::__copy_backward_aux(__first.base(), __last.base(), + __result.base())); } + }; + + /** + * @brief Copies the range [first,last) into result. + * @param first A bidirectional iterator. + * @param last A bidirectional iterator. + * @param result A bidirectional iterator. + * @return result - (first - last) + * + * The function has the same effect as copy, but starts at the end of the + * range and works its way to the start, returning the start of the result. + * This inline function will boil down to a call to @c memmove whenever + * possible. Failing that, if random access iterators are passed, then the + * loop count will be known (and therefore a candidate for compiler + * optimizations such as unrolling). + * + * Result may not be in the range [first,last). Use copy instead. Note + * that the start of the output range may overlap [first,last). + */ + template + inline _BI2 + copy_backward(_BI1 __first, _BI1 __last, _BI2 __result) + { + // concept requirements + __glibcxx_function_requires(_BidirectionalIteratorConcept<_BI1>) + __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept<_BI2>) + __glibcxx_function_requires(_ConvertibleConcept< + typename iterator_traits<_BI1>::value_type, + typename iterator_traits<_BI2>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + const bool __bi1 = __is_normal_iterator<_BI1>::__value; + const bool __bi2 = __is_normal_iterator<_BI2>::__value; + return std::__copy_backward_normal<__bi1, __bi2>::__copy_b_n(__first, + __last, + __result); + } + + template + struct __fill + { + template + static void + fill(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __value) + { + for (; __first != __last; ++__first) + *__first = __value; + } + }; + + template<> + struct __fill + { + template + static void + fill(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __value) + { + const _Tp __tmp = __value; + for (; __first != __last; ++__first) + *__first = __tmp; + } + }; + + /** + * @brief Fills the range [first,last) with copies of value. + * @param first A forward iterator. + * @param last A forward iterator. + * @param value A reference-to-const of arbitrary type. + * @return Nothing. + * + * This function fills a range with copies of the same value. For one-byte + * types filling contiguous areas of memory, this becomes an inline call to + * @c memset. + */ + template + void + fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) + { + // concept requirements + __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< + _ForwardIterator>) + __glibcxx_requires_valid_range(__first, __last); + + const bool __scalar = __is_scalar<_Tp>::__value; + std::__fill<__scalar>::fill(__first, __last, __value); + } + + // Specialization: for one-byte types we can use memset. + inline void + fill(unsigned char* __first, unsigned char* __last, const unsigned char& __c) + { + __glibcxx_requires_valid_range(__first, __last); + const unsigned char __tmp = __c; + std::memset(__first, __tmp, __last - __first); + } + + inline void + fill(signed char* __first, signed char* __last, const signed char& __c) + { + __glibcxx_requires_valid_range(__first, __last); + const signed char __tmp = __c; + std::memset(__first, static_cast(__tmp), __last - __first); + } + + inline void + fill(char* __first, char* __last, const char& __c) + { + __glibcxx_requires_valid_range(__first, __last); + const char __tmp = __c; + std::memset(__first, static_cast(__tmp), __last - __first); + } + + template + struct __fill_n + { + template + static _OutputIterator + fill_n(_OutputIterator __first, _Size __n, const _Tp& __value) + { + for (; __n > 0; --__n, ++__first) + *__first = __value; + return __first; + } + }; + + template<> + struct __fill_n + { + template + static _OutputIterator + fill_n(_OutputIterator __first, _Size __n, const _Tp& __value) + { + const _Tp __tmp = __value; + for (; __n > 0; --__n, ++__first) + *__first = __tmp; + return __first; + } + }; + + /** + * @brief Fills the range [first,first+n) with copies of value. + * @param first An output iterator. + * @param n The count of copies to perform. + * @param value A reference-to-const of arbitrary type. + * @return The iterator at first+n. + * + * This function fills a range with copies of the same value. For one-byte + * types filling contiguous areas of memory, this becomes an inline call to + * @c memset. + */ + template + _OutputIterator + fill_n(_OutputIterator __first, _Size __n, const _Tp& __value) + { + // concept requirements + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, _Tp>) + + const bool __scalar = __is_scalar<_Tp>::__value; + return std::__fill_n<__scalar>::fill_n(__first, __n, __value); + } + + template + inline unsigned char* + fill_n(unsigned char* __first, _Size __n, const unsigned char& __c) + { + std::fill(__first, __first + __n, __c); + return __first + __n; + } + + template + inline signed char* + fill_n(signed char* __first, _Size __n, const signed char& __c) + { + std::fill(__first, __first + __n, __c); + return __first + __n; + } + + template + inline char* + fill_n(char* __first, _Size __n, const char& __c) + { + std::fill(__first, __first + __n, __c); + return __first + __n; + } + + /** + * @brief Finds the places in ranges which don't match. + * @param first1 An input iterator. + * @param last1 An input iterator. + * @param first2 An input iterator. + * @return A pair of iterators pointing to the first mismatch. + * + * This compares the elements of two ranges using @c == and returns a pair + * of iterators. The first iterator points into the first range, the + * second iterator points into the second range, and the elements pointed + * to by the iterators are not equal. + */ + template + pair<_InputIterator1, _InputIterator2> + mismatch(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_EqualOpConcept< + typename iterator_traits<_InputIterator1>::value_type, + typename iterator_traits<_InputIterator2>::value_type>) + __glibcxx_requires_valid_range(__first1, __last1); + + while (__first1 != __last1 && *__first1 == *__first2) + { + ++__first1; + ++__first2; + } + return pair<_InputIterator1, _InputIterator2>(__first1, __first2); + } + + /** + * @brief Finds the places in ranges which don't match. + * @param first1 An input iterator. + * @param last1 An input iterator. + * @param first2 An input iterator. + * @param binary_pred A binary predicate @link s20_3_1_base functor@endlink. + * @return A pair of iterators pointing to the first mismatch. + * + * This compares the elements of two ranges using the binary_pred + * parameter, and returns a pair + * of iterators. The first iterator points into the first range, the + * second iterator points into the second range, and the elements pointed + * to by the iterators are not equal. + */ + template + pair<_InputIterator1, _InputIterator2> + mismatch(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _BinaryPredicate __binary_pred) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_requires_valid_range(__first1, __last1); + + while (__first1 != __last1 && __binary_pred(*__first1, *__first2)) + { + ++__first1; + ++__first2; + } + return pair<_InputIterator1, _InputIterator2>(__first1, __first2); + } + + /** + * @brief Tests a range for element-wise equality. + * @param first1 An input iterator. + * @param last1 An input iterator. + * @param first2 An input iterator. + * @return A boolean true or false. + * + * This compares the elements of two ranges using @c == and returns true or + * false depending on whether all of the corresponding elements of the + * ranges are equal. + */ + template + inline bool + equal(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_EqualOpConcept< + typename iterator_traits<_InputIterator1>::value_type, + typename iterator_traits<_InputIterator2>::value_type>) + __glibcxx_requires_valid_range(__first1, __last1); + + for (; __first1 != __last1; ++__first1, ++__first2) + if (!(*__first1 == *__first2)) + return false; + return true; + } + + /** + * @brief Tests a range for element-wise equality. + * @param first1 An input iterator. + * @param last1 An input iterator. + * @param first2 An input iterator. + * @param binary_pred A binary predicate @link s20_3_1_base functor@endlink. + * @return A boolean true or false. + * + * This compares the elements of two ranges using the binary_pred + * parameter, and returns true or + * false depending on whether all of the corresponding elements of the + * ranges are equal. + */ + template + inline bool + equal(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, + _BinaryPredicate __binary_pred) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_requires_valid_range(__first1, __last1); + + for (; __first1 != __last1; ++__first1, ++__first2) + if (!__binary_pred(*__first1, *__first2)) + return false; + return true; + } + + /** + * @brief Performs "dictionary" comparison on ranges. + * @param first1 An input iterator. + * @param last1 An input iterator. + * @param first2 An input iterator. + * @param last2 An input iterator. + * @return A boolean true or false. + * + * "Returns true if the sequence of elements defined by the range + * [first1,last1) is lexicographically less than the sequence of elements + * defined by the range [first2,last2). Returns false otherwise." + * (Quoted from [25.3.8]/1.) If the iterators are all character pointers, + * then this is an inline call to @c memcmp. + */ + template + bool + lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _InputIterator2 __last2) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_LessThanOpConcept< + typename iterator_traits<_InputIterator1>::value_type, + typename iterator_traits<_InputIterator2>::value_type>) + __glibcxx_function_requires(_LessThanOpConcept< + typename iterator_traits<_InputIterator2>::value_type, + typename iterator_traits<_InputIterator1>::value_type>) + __glibcxx_requires_valid_range(__first1, __last1); + __glibcxx_requires_valid_range(__first2, __last2); + + for (; __first1 != __last1 && __first2 != __last2; + ++__first1, ++__first2) + { + if (*__first1 < *__first2) + return true; + if (*__first2 < *__first1) + return false; + } + return __first1 == __last1 && __first2 != __last2; + } + + /** + * @brief Performs "dictionary" comparison on ranges. + * @param first1 An input iterator. + * @param last1 An input iterator. + * @param first2 An input iterator. + * @param last2 An input iterator. + * @param comp A @link s20_3_3_comparisons comparison functor@endlink. + * @return A boolean true or false. + * + * The same as the four-parameter @c lexigraphical_compare, but uses the + * comp parameter instead of @c <. + */ + template + bool + lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _InputIterator2 __last2, + _Compare __comp) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_requires_valid_range(__first1, __last1); + __glibcxx_requires_valid_range(__first2, __last2); + + for (; __first1 != __last1 && __first2 != __last2; + ++__first1, ++__first2) + { + if (__comp(*__first1, *__first2)) + return true; + if (__comp(*__first2, *__first1)) + return false; + } + return __first1 == __last1 && __first2 != __last2; + } + + inline bool + lexicographical_compare(const unsigned char* __first1, + const unsigned char* __last1, + const unsigned char* __first2, + const unsigned char* __last2) + { + __glibcxx_requires_valid_range(__first1, __last1); + __glibcxx_requires_valid_range(__first2, __last2); + + const size_t __len1 = __last1 - __first1; + const size_t __len2 = __last2 - __first2; + const int __result = std::memcmp(__first1, __first2, + std::min(__len1, __len2)); + return __result != 0 ? __result < 0 : __len1 < __len2; + } + + inline bool + lexicographical_compare(const char* __first1, const char* __last1, + const char* __first2, const char* __last2) + { + __glibcxx_requires_valid_range(__first1, __last1); + __glibcxx_requires_valid_range(__first2, __last2); + +#if CHAR_MAX == SCHAR_MAX + return std::lexicographical_compare((const signed char*) __first1, + (const signed char*) __last1, + (const signed char*) __first2, + (const signed char*) __last2); +#else /* CHAR_MAX == SCHAR_MAX */ + return std::lexicographical_compare((const unsigned char*) __first1, + (const unsigned char*) __last1, + (const unsigned char*) __first2, + (const unsigned char*) __last2); +#endif /* CHAR_MAX == SCHAR_MAX */ + } + +} // namespace std + +#endif diff --git a/cpp_src/stl_bvector.h b/cpp_src/stl_bvector.h new file mode 100644 index 0000000..e330943 --- /dev/null +++ b/cpp_src/stl_bvector.h @@ -0,0 +1,1011 @@ +// vector specialization -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996-1999 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_bvector.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _BVECTOR_H +#define _BVECTOR_H 1 + +namespace std { + + typedef unsigned long _Bit_type; + enum { _S_word_bit = int(CHAR_BIT * sizeof(_Bit_type)) }; + + struct _Bit_reference + { + _Bit_type * _M_p; + _Bit_type _M_mask; + + _Bit_reference(_Bit_type * __x, _Bit_type __y) + : _M_p(__x), _M_mask(__y) { } + + _Bit_reference() : _M_p(0), _M_mask(0) { } + + operator bool() const + { return !!(*_M_p & _M_mask); } + + _Bit_reference& + operator=(bool __x) + { + if (__x) + *_M_p |= _M_mask; + else + *_M_p &= ~_M_mask; + return *this; + } + + _Bit_reference& + operator=(const _Bit_reference& __x) + { return *this = bool(__x); } + + bool + operator==(const _Bit_reference& __x) const + { return bool(*this) == bool(__x); } + + bool + operator<(const _Bit_reference& __x) const + { return !bool(*this) && bool(__x); } + + void + flip() + { *_M_p ^= _M_mask; } + }; + + struct _Bit_iterator_base + : public std::iterator + { + _Bit_type * _M_p; + unsigned int _M_offset; + + _Bit_iterator_base(_Bit_type * __x, unsigned int __y) + : _M_p(__x), _M_offset(__y) { } + + void + _M_bump_up() + { + if (_M_offset++ == int(_S_word_bit) - 1) + { + _M_offset = 0; + ++_M_p; + } + } + + void + _M_bump_down() + { + if (_M_offset-- == 0) + { + _M_offset = int(_S_word_bit) - 1; + --_M_p; + } + } + + void + _M_incr(ptrdiff_t __i) + { + difference_type __n = __i + _M_offset; + _M_p += __n / int(_S_word_bit); + __n = __n % int(_S_word_bit); + if (__n < 0) + { + __n += int(_S_word_bit); + --_M_p; + } + _M_offset = static_cast(__n); + } + + bool + operator==(const _Bit_iterator_base& __i) const + { return _M_p == __i._M_p && _M_offset == __i._M_offset; } + + bool + operator<(const _Bit_iterator_base& __i) const + { + return _M_p < __i._M_p + || (_M_p == __i._M_p && _M_offset < __i._M_offset); + } + + bool + operator!=(const _Bit_iterator_base& __i) const + { return !(*this == __i); } + + bool + operator>(const _Bit_iterator_base& __i) const + { return __i < *this; } + + bool + operator<=(const _Bit_iterator_base& __i) const + { return !(__i < *this); } + + bool + operator>=(const _Bit_iterator_base& __i) const + { return !(*this < __i); } + }; + + inline ptrdiff_t + operator-(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y) + { + return (int(_S_word_bit) * (__x._M_p - __y._M_p) + + __x._M_offset - __y._M_offset); + } + + struct _Bit_iterator : public _Bit_iterator_base + { + typedef _Bit_reference reference; + typedef _Bit_reference* pointer; + typedef _Bit_iterator iterator; + + _Bit_iterator() : _Bit_iterator_base(0, 0) { } + + _Bit_iterator(_Bit_type * __x, unsigned int __y) + : _Bit_iterator_base(__x, __y) { } + + reference + operator*() const + { return reference(_M_p, 1UL << _M_offset); } + + iterator& + operator++() + { + _M_bump_up(); + return *this; + } + + iterator + operator++(int) + { + iterator __tmp = *this; + _M_bump_up(); + return __tmp; + } + + iterator& + operator--() + { + _M_bump_down(); + return *this; + } + + iterator + operator--(int) + { + iterator __tmp = *this; + _M_bump_down(); + return __tmp; + } + + iterator& + operator+=(difference_type __i) + { + _M_incr(__i); + return *this; + } + + iterator& + operator-=(difference_type __i) + { + *this += -__i; + return *this; + } + + iterator + operator+(difference_type __i) const + { + iterator __tmp = *this; + return __tmp += __i; + } + + iterator + operator-(difference_type __i) const + { + iterator __tmp = *this; + return __tmp -= __i; + } + + reference + operator[](difference_type __i) const + { return *(*this + __i); } + }; + + inline _Bit_iterator + operator+(ptrdiff_t __n, const _Bit_iterator& __x) + { return __x + __n; } + + struct _Bit_const_iterator : public _Bit_iterator_base + { + typedef bool reference; + typedef bool const_reference; + typedef const bool* pointer; + typedef _Bit_const_iterator const_iterator; + + _Bit_const_iterator() : _Bit_iterator_base(0, 0) { } + + _Bit_const_iterator(_Bit_type * __x, unsigned int __y) + : _Bit_iterator_base(__x, __y) { } + + _Bit_const_iterator(const _Bit_iterator& __x) + : _Bit_iterator_base(__x._M_p, __x._M_offset) { } + + const_reference + operator*() const + { return _Bit_reference(_M_p, 1UL << _M_offset); } + + const_iterator& + operator++() + { + _M_bump_up(); + return *this; + } + + const_iterator + operator++(int) + { + const_iterator __tmp = *this; + _M_bump_up(); + return __tmp; + } + + const_iterator& + operator--() + { + _M_bump_down(); + return *this; + } + + const_iterator + operator--(int) + { + const_iterator __tmp = *this; + _M_bump_down(); + return __tmp; + } + + const_iterator& + operator+=(difference_type __i) + { + _M_incr(__i); + return *this; + } + + const_iterator& + operator-=(difference_type __i) + { + *this += -__i; + return *this; + } + + const_iterator + operator+(difference_type __i) const + { + const_iterator __tmp = *this; + return __tmp += __i; + } + + const_iterator + operator-(difference_type __i) const + { + const_iterator __tmp = *this; + return __tmp -= __i; + } + + const_reference + operator[](difference_type __i) const + { return *(*this + __i); } + }; + + inline _Bit_const_iterator + operator+(ptrdiff_t __n, const _Bit_const_iterator& __x) + { return __x + __n; } + + inline void + __fill_bvector(_Bit_iterator __first, _Bit_iterator __last, bool __x) + { + for (; __first != __last; ++__first) + *__first = __x; + } + + inline void + fill(_Bit_iterator __first, _Bit_iterator __last, const bool& __x) + { + if (__first._M_p != __last._M_p) + { + std::fill(__first._M_p + 1, __last._M_p, __x ? ~0 : 0); + __fill_bvector(__first, _Bit_iterator(__first._M_p + 1, 0), __x); + __fill_bvector(_Bit_iterator(__last._M_p, 0), __last, __x); + } + else + __fill_bvector(__first, __last, __x); + } + + template + struct _Bvector_base + { + typedef typename _Alloc::template rebind<_Bit_type>::other + _Bit_alloc_type; + + struct _Bvector_impl + : public _Bit_alloc_type + { + _Bit_iterator _M_start; + _Bit_iterator _M_finish; + _Bit_type* _M_end_of_storage; + _Bvector_impl(const _Bit_alloc_type& __a) + : _Bit_alloc_type(__a), _M_start(), _M_finish(), _M_end_of_storage(0) + { } + }; + + public: + typedef _Alloc allocator_type; + + _Bit_alloc_type& + _M_get_Bit_allocator() + { return *static_cast<_Bit_alloc_type*>(&this->_M_impl); } + + const _Bit_alloc_type& + _M_get_Bit_allocator() const + { return *static_cast(&this->_M_impl); } + + allocator_type + get_allocator() const + { return allocator_type(_M_get_Bit_allocator()); } + + _Bvector_base(const allocator_type& __a) : _M_impl(__a) { } + + ~_Bvector_base() + { this->_M_deallocate(); } + + protected: + _Bvector_impl _M_impl; + + _Bit_type* + _M_allocate(size_t __n) + { return _M_impl.allocate((__n + int(_S_word_bit) - 1) + / int(_S_word_bit)); } + + void + _M_deallocate() + { + if (_M_impl._M_start._M_p) + _M_impl.deallocate(_M_impl._M_start._M_p, + _M_impl._M_end_of_storage - _M_impl._M_start._M_p); + } + }; + +} // namespace std + +// Declare a partial specialization of vector. +#include + +namespace std { + + /** + * @brief A specialization of vector for booleans which offers fixed time + * access to individual elements in any order. + * + * Note that vector does not actually meet the requirements for being + * a container. This is because the reference and pointer types are not + * really references and pointers to bool. See DR96 for details. @see + * vector for function documentation. + * + * @ingroup Containers + * @ingroup Sequences + * + * In some terminology a %vector can be described as a dynamic + * C-style array, it offers fast and efficient access to individual + * elements in any order and saves the user from worrying about + * memory and size allocation. Subscripting ( @c [] ) access is + * also provided as with C-style arrays. + */ +template + class vector : protected _Bvector_base<_Alloc> + { + typedef _Bvector_base<_Alloc> _Base; + + public: + typedef bool value_type; + typedef size_t size_type; + typedef ptrdiff_t difference_type; + typedef _Bit_reference reference; + typedef bool const_reference; + typedef _Bit_reference* pointer; + typedef const bool* const_pointer; + typedef _Bit_iterator iterator; + typedef _Bit_const_iterator const_iterator; + typedef std::reverse_iterator const_reverse_iterator; + typedef std::reverse_iterator reverse_iterator; + typedef _Alloc allocator_type; + + allocator_type get_allocator() const + { return _Base::get_allocator(); } + + protected: + using _Base::_M_allocate; + using _Base::_M_deallocate; + using _Base::_M_get_Bit_allocator; + + public: + explicit + vector(const allocator_type& __a = allocator_type()) + : _Base(__a) { } + + explicit + vector(size_type __n, const bool& __value = bool(), + const allocator_type& __a = allocator_type()) + : _Base(__a) + { + _M_initialize(__n); + std::fill(this->_M_impl._M_start._M_p, this->_M_impl._M_end_of_storage, + __value ? ~0 : 0); + } + + vector(const vector& __x) + : _Base(__x._M_get_Bit_allocator()) + { + _M_initialize(__x.size()); + _M_copy_aligned(__x.begin(), __x.end(), this->_M_impl._M_start); + } + + template + vector(_InputIterator __first, _InputIterator __last, + const allocator_type& __a = allocator_type()) + : _Base(__a) + { + typedef typename std::__is_integer<_InputIterator>::__type _Integral; + _M_initialize_dispatch(__first, __last, _Integral()); + } + + ~vector() { } + + vector& + operator=(const vector& __x) + { + if (&__x == this) + return *this; + if (__x.size() > capacity()) + { + this->_M_deallocate(); + _M_initialize(__x.size()); + } + this->_M_impl._M_finish = _M_copy_aligned(__x.begin(), __x.end(), + begin()); + return *this; + } + + // assign(), a generalized assignment member function. Two + // versions: one that takes a count, and one that takes a range. + // The range version is a member template, so we dispatch on whether + // or not the type is an integer. + void + assign(size_type __n, const bool& __x) + { _M_fill_assign(__n, __x); } + + template + void + assign(_InputIterator __first, _InputIterator __last) + { + typedef typename std::__is_integer<_InputIterator>::__type _Integral; + _M_assign_dispatch(__first, __last, _Integral()); + } + + iterator + begin() + { return this->_M_impl._M_start; } + + const_iterator + begin() const + { return this->_M_impl._M_start; } + + iterator + end() + { return this->_M_impl._M_finish; } + + const_iterator + end() const + { return this->_M_impl._M_finish; } + + reverse_iterator + rbegin() + { return reverse_iterator(end()); } + + const_reverse_iterator + rbegin() const + { return const_reverse_iterator(end()); } + + reverse_iterator + rend() + { return reverse_iterator(begin()); } + + const_reverse_iterator + rend() const + { return const_reverse_iterator(begin()); } + + size_type + size() const + { return size_type(end() - begin()); } + + size_type + max_size() const + { + const size_type __asize = _M_get_Bit_allocator().max_size(); + return (__asize <= size_type(-1) / int(_S_word_bit) ? + __asize * int(_S_word_bit) : size_type(-1)); + } + + size_type + capacity() const + { return size_type(const_iterator(this->_M_impl._M_end_of_storage, 0) + - begin()); } + + bool + empty() const + { return begin() == end(); } + + reference + operator[](size_type __n) + { + return *iterator(this->_M_impl._M_start._M_p + + __n / int(_S_word_bit), __n % int(_S_word_bit)); + } + + const_reference + operator[](size_type __n) const + { + return *const_iterator(this->_M_impl._M_start._M_p + + __n / int(_S_word_bit), __n % int(_S_word_bit)); + } + + protected: + void + _M_range_check(size_type __n) const + { + if (__n >= this->size()) + __throw_out_of_range(__N("vector::_M_range_check")); + } + + public: + reference + at(size_type __n) + { _M_range_check(__n); return (*this)[__n]; } + + const_reference + at(size_type __n) const + { _M_range_check(__n); return (*this)[__n]; } + + void + reserve(size_type __n) + { + if (__n > this->max_size()) + __throw_length_error(__N("vector::reserve")); + if (this->capacity() < __n) + { + _Bit_type* __q = this->_M_allocate(__n); + this->_M_impl._M_finish = _M_copy_aligned(begin(), end(), + iterator(__q, 0)); + this->_M_deallocate(); + this->_M_impl._M_start = iterator(__q, 0); + this->_M_impl._M_end_of_storage = (__q + (__n + int(_S_word_bit) - 1) + / int(_S_word_bit)); + } + } + + reference + front() + { return *begin(); } + + const_reference + front() const + { return *begin(); } + + reference + back() + { return *(end() - 1); } + + const_reference + back() const + { return *(end() - 1); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 464. Suggestion for new member functions in standard containers. + // N.B. DR 464 says nothing about vector but we need something + // here due to the way we are implementing DR 464 in the debug-mode + // vector class. + void + data() { } + + void + push_back(bool __x) + { + if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_of_storage) + *this->_M_impl._M_finish++ = __x; + else + _M_insert_aux(end(), __x); + } + + void + swap(vector& __x) + { + std::swap(this->_M_impl._M_start, __x._M_impl._M_start); + std::swap(this->_M_impl._M_finish, __x._M_impl._M_finish); + std::swap(this->_M_impl._M_end_of_storage, + __x._M_impl._M_end_of_storage); + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 431. Swapping containers with unequal allocators. + std::__alloc_swap:: + _S_do_it(_M_get_Bit_allocator(), __x._M_get_Bit_allocator()); + } + + // [23.2.5]/1, third-to-last entry in synopsis listing + static void + swap(reference __x, reference __y) + { + bool __tmp = __x; + __x = __y; + __y = __tmp; + } + + iterator + insert(iterator __position, const bool& __x = bool()) + { + const difference_type __n = __position - begin(); + if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_of_storage + && __position == end()) + *this->_M_impl._M_finish++ = __x; + else + _M_insert_aux(__position, __x); + return begin() + __n; + } + + template + void + insert(iterator __position, + _InputIterator __first, _InputIterator __last) + { + typedef typename std::__is_integer<_InputIterator>::__type _Integral; + _M_insert_dispatch(__position, __first, __last, _Integral()); + } + + void + insert(iterator __position, size_type __n, const bool& __x) + { _M_fill_insert(__position, __n, __x); } + + void + pop_back() + { --this->_M_impl._M_finish; } + + iterator + erase(iterator __position) + { + if (__position + 1 != end()) + std::copy(__position + 1, end(), __position); + --this->_M_impl._M_finish; + return __position; + } + + iterator + erase(iterator __first, iterator __last) + { + _M_erase_at_end(std::copy(__last, end(), __first)); + return __first; + } + + void + resize(size_type __new_size, bool __x = bool()) + { + if (__new_size < size()) + _M_erase_at_end(begin() + difference_type(__new_size)); + else + insert(end(), __new_size - size(), __x); + } + + void + flip() + { + for (_Bit_type * __p = this->_M_impl._M_start._M_p; + __p != this->_M_impl._M_end_of_storage; ++__p) + *__p = ~*__p; + } + + void + clear() + { _M_erase_at_end(begin()); } + + + protected: + // Precondition: __first._M_offset == 0 && __result._M_offset == 0. + iterator + _M_copy_aligned(const_iterator __first, const_iterator __last, + iterator __result) + { + _Bit_type* __q = std::copy(__first._M_p, __last._M_p, __result._M_p); + return std::copy(const_iterator(__last._M_p, 0), __last, + iterator(__q, 0)); + } + + void + _M_initialize(size_type __n) + { + _Bit_type* __q = this->_M_allocate(__n); + this->_M_impl._M_end_of_storage = (__q + + ((__n + int(_S_word_bit) - 1) + / int(_S_word_bit))); + this->_M_impl._M_start = iterator(__q, 0); + this->_M_impl._M_finish = this->_M_impl._M_start + difference_type(__n); + } + + // Check whether it's an integral type. If so, it's not an iterator. + template + void + _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) + { + _M_initialize(__n); + std::fill(this->_M_impl._M_start._M_p, + this->_M_impl._M_end_of_storage, __x ? ~0 : 0); + } + + template + void + _M_initialize_dispatch(_InputIterator __first, _InputIterator __last, + __false_type) + { _M_initialize_range(__first, __last, + std::__iterator_category(__first)); } + + template + void + _M_initialize_range(_InputIterator __first, _InputIterator __last, + std::input_iterator_tag) + { + for (; __first != __last; ++__first) + push_back(*__first); + } + + template + void + _M_initialize_range(_ForwardIterator __first, _ForwardIterator __last, + std::forward_iterator_tag) + { + const size_type __n = std::distance(__first, __last); + _M_initialize(__n); + std::copy(__first, __last, this->_M_impl._M_start); + } + + template + void + _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) + { _M_fill_assign((size_t) __n, (bool) __val); } + + template + void + _M_assign_dispatch(_InputIterator __first, _InputIterator __last, + __false_type) + { _M_assign_aux(__first, __last, std::__iterator_category(__first)); } + + void + _M_fill_assign(size_t __n, bool __x) + { + if (__n > size()) + { + std::fill(this->_M_impl._M_start._M_p, + this->_M_impl._M_end_of_storage, __x ? ~0 : 0); + insert(end(), __n - size(), __x); + } + else + { + _M_erase_at_end(begin() + __n); + std::fill(this->_M_impl._M_start._M_p, + this->_M_impl._M_end_of_storage, __x ? ~0 : 0); + } + } + + template + void + _M_assign_aux(_InputIterator __first, _InputIterator __last, + std::input_iterator_tag) + { + iterator __cur = begin(); + for (; __first != __last && __cur != end(); ++__cur, ++__first) + *__cur = *__first; + if (__first == __last) + _M_erase_at_end(__cur); + else + insert(end(), __first, __last); + } + + template + void + _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last, + std::forward_iterator_tag) + { + const size_type __len = std::distance(__first, __last); + if (__len < size()) + _M_erase_at_end(std::copy(__first, __last, begin())); + else + { + _ForwardIterator __mid = __first; + std::advance(__mid, size()); + std::copy(__first, __mid, begin()); + insert(end(), __mid, __last); + } + } + + // Check whether it's an integral type. If so, it's not an iterator. + template + void + _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x, + __true_type) + { _M_fill_insert(__pos, __n, __x); } + + template + void + _M_insert_dispatch(iterator __pos, + _InputIterator __first, _InputIterator __last, + __false_type) + { _M_insert_range(__pos, __first, __last, + std::__iterator_category(__first)); } + + void + _M_fill_insert(iterator __position, size_type __n, bool __x) + { + if (__n == 0) + return; + if (capacity() - size() >= __n) + { + std::copy_backward(__position, end(), + this->_M_impl._M_finish + difference_type(__n)); + std::fill(__position, __position + difference_type(__n), __x); + this->_M_impl._M_finish += difference_type(__n); + } + else + { + const size_type __len = size() + std::max(size(), __n); + _Bit_type * __q = this->_M_allocate(__len); + iterator __i = _M_copy_aligned(begin(), __position, + iterator(__q, 0)); + std::fill(__i, __i + difference_type(__n), __x); + this->_M_impl._M_finish = std::copy(__position, end(), + __i + difference_type(__n)); + this->_M_deallocate(); + this->_M_impl._M_end_of_storage = (__q + ((__len + + int(_S_word_bit) - 1) + / int(_S_word_bit))); + this->_M_impl._M_start = iterator(__q, 0); + } + } + + template + void + _M_insert_range(iterator __pos, _InputIterator __first, + _InputIterator __last, std::input_iterator_tag) + { + for (; __first != __last; ++__first) + { + __pos = insert(__pos, *__first); + ++__pos; + } + } + + template + void + _M_insert_range(iterator __position, _ForwardIterator __first, + _ForwardIterator __last, std::forward_iterator_tag) + { + if (__first != __last) + { + size_type __n = std::distance(__first, __last); + if (capacity() - size() >= __n) + { + std::copy_backward(__position, end(), + this->_M_impl._M_finish + + difference_type(__n)); + std::copy(__first, __last, __position); + this->_M_impl._M_finish += difference_type(__n); + } + else + { + const size_type __len = size() + std::max(size(), __n); + _Bit_type * __q = this->_M_allocate(__len); + iterator __i = _M_copy_aligned(begin(), __position, + iterator(__q, 0)); + __i = std::copy(__first, __last, __i); + this->_M_impl._M_finish = std::copy(__position, end(), __i); + this->_M_deallocate(); + this->_M_impl._M_end_of_storage = (__q + + ((__len + + int(_S_word_bit) - 1) + / int(_S_word_bit))); + this->_M_impl._M_start = iterator(__q, 0); + } + } + } + + void + _M_insert_aux(iterator __position, bool __x) + { + if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_of_storage) + { + std::copy_backward(__position, this->_M_impl._M_finish, + this->_M_impl._M_finish + 1); + *__position = __x; + ++this->_M_impl._M_finish; + } + else + { + const size_type __len = size() ? 2 * size() + : static_cast(_S_word_bit); + _Bit_type * __q = this->_M_allocate(__len); + iterator __i = _M_copy_aligned(begin(), __position, + iterator(__q, 0)); + *__i++ = __x; + this->_M_impl._M_finish = std::copy(__position, end(), __i); + this->_M_deallocate(); + this->_M_impl._M_end_of_storage = (__q + ((__len + + int(_S_word_bit) - 1) + / int(_S_word_bit))); + this->_M_impl._M_start = iterator(__q, 0); + } + } + + void + _M_erase_at_end(iterator __pos) + { this->_M_impl._M_finish = __pos; } + }; + +} // namespace std + +#endif diff --git a/cpp_src/stl_construct.h b/cpp_src/stl_construct.h new file mode 100644 index 0000000..8f4ac75 --- /dev/null +++ b/cpp_src/stl_construct.h @@ -0,0 +1,188 @@ +// nonstandard construct and destroy functions -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_construct.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STL_CONSTRUCT_H +#define _STL_CONSTRUCT_H 1 + +#include +#include + +namespace std { + + /** + * @if maint + * Constructs an object in existing memory by invoking an allocated + * object's constructor with an initializer. + * @endif + */ + template + inline void + _Construct(_T1* __p, const _T2& __value) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 402. wrong new expression in [some_]allocator::construct + ::new(static_cast(__p)) _T1(__value); + } + + /** + * @if maint + * Constructs an object in existing memory by invoking an allocated + * object's default constructor (no initializers). + * @endif + */ + template + inline void + _Construct(_T1* __p) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 402. wrong new expression in [some_]allocator::construct + ::new(static_cast(__p)) _T1(); + } + + /** + * @if maint + * Destroy the object pointed to by a pointer type. + * @endif + */ + template + inline void + _Destroy(_Tp* __pointer) + { __pointer->~_Tp(); } + + /** + * @if maint + * Destroy a range of objects with nontrivial destructors. + * + * This is a helper function used only by _Destroy(). + * @endif + */ + template + inline void + __destroy_aux(_ForwardIterator __first, _ForwardIterator __last, + __false_type) + { + for (; __first != __last; ++__first) + std::_Destroy(&*__first); + } + + /** + * @if maint + * Destroy a range of objects with trivial destructors. Since the destructors + * are trivial, there's nothing to do and hopefully this function will be + * entirely optimized away. + * + * This is a helper function used only by _Destroy(). + * @endif + */ + template + inline void + __destroy_aux(_ForwardIterator, _ForwardIterator, __true_type) + { } + + /** + * @if maint + * Destroy a range of objects. If the value_type of the object has + * a trivial destructor, the compiler should optimize all of this + * away, otherwise the objects' destructors must be invoked. + * @endif + */ + template + inline void + _Destroy(_ForwardIterator __first, _ForwardIterator __last) + { + typedef typename iterator_traits<_ForwardIterator>::value_type + _Value_type; + typedef typename std::__is_scalar<_Value_type>::__type + _Has_trivial_destructor; + + std::__destroy_aux(__first, __last, _Has_trivial_destructor()); + } + + /** + * @if maint + * Destroy a range of objects using the supplied allocator. For + * nondefault allocators we do not optimize away invocation of + * destroy() even if _Tp has a trivial destructor. + * @endif + */ + + template class allocator; + + template + void + _Destroy(_ForwardIterator __first, _ForwardIterator __last, + _Allocator __alloc) + { + for (; __first != __last; ++__first) + __alloc.destroy(&*__first); + } + + template + inline void + _Destroy(_ForwardIterator __first, _ForwardIterator __last, + allocator<_Tp>) + { + _Destroy(__first, __last); + } + +} // namespace std + +#endif /* _STL_CONSTRUCT_H */ + diff --git a/cpp_src/stl_deque.h b/cpp_src/stl_deque.h new file mode 100644 index 0000000..cea1dbd --- /dev/null +++ b/cpp_src/stl_deque.h @@ -0,0 +1,1608 @@ +// Deque implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_deque.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _DEQUE_H +#define _DEQUE_H 1 + +#include +#include +#include + +namespace std { + + /** + * @if maint + * @brief This function controls the size of memory nodes. + * @param size The size of an element. + * @return The number (not byte size) of elements per node. + * + * This function started off as a compiler kludge from SGI, but seems to + * be a useful wrapper around a repeated constant expression. The '512' is + * tuneable (and no other code needs to change), but no investigation has + * been done since inheriting the SGI code. + * @endif + */ + inline size_t + __deque_buf_size(size_t __size) + { return __size < 512 ? size_t(512 / __size) : size_t(1); } + + + /** + * @brief A deque::iterator. + * + * Quite a bit of intelligence here. Much of the functionality of + * deque is actually passed off to this class. A deque holds two + * of these internally, marking its valid range. Access to + * elements is done as offsets of either of those two, relying on + * operator overloading in this class. + * + * @if maint + * All the functions are op overloads except for _M_set_node. + * @endif + */ + template + struct _Deque_iterator + { + typedef _Deque_iterator<_Tp, _Tp&, _Tp*> iterator; + typedef _Deque_iterator<_Tp, const _Tp&, const _Tp*> const_iterator; + + static size_t _S_buffer_size() + { return __deque_buf_size(sizeof(_Tp)); } + + typedef std::random_access_iterator_tag iterator_category; + typedef _Tp value_type; + typedef _Ptr pointer; + typedef _Ref reference; + typedef size_t size_type; + typedef ptrdiff_t difference_type; + typedef _Tp** _Map_pointer; + typedef _Deque_iterator _Self; + + _Tp* _M_cur; + _Tp* _M_first; + _Tp* _M_last; + _Map_pointer _M_node; + + _Deque_iterator(_Tp* __x, _Map_pointer __y) + : _M_cur(__x), _M_first(*__y), + _M_last(*__y + _S_buffer_size()), _M_node(__y) {} + + _Deque_iterator() : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) {} + + _Deque_iterator(const iterator& __x) + : _M_cur(__x._M_cur), _M_first(__x._M_first), + _M_last(__x._M_last), _M_node(__x._M_node) {} + + reference + operator*() const + { return *_M_cur; } + + pointer + operator->() const + { return _M_cur; } + + _Self& + operator++() + { + ++_M_cur; + if (_M_cur == _M_last) + { + _M_set_node(_M_node + 1); + _M_cur = _M_first; + } + return *this; + } + + _Self + operator++(int) + { + _Self __tmp = *this; + ++*this; + return __tmp; + } + + _Self& + operator--() + { + if (_M_cur == _M_first) + { + _M_set_node(_M_node - 1); + _M_cur = _M_last; + } + --_M_cur; + return *this; + } + + _Self + operator--(int) + { + _Self __tmp = *this; + --*this; + return __tmp; + } + + _Self& + operator+=(difference_type __n) + { + const difference_type __offset = __n + (_M_cur - _M_first); + if (__offset >= 0 && __offset < difference_type(_S_buffer_size())) + _M_cur += __n; + else + { + const difference_type __node_offset = + __offset > 0 ? __offset / difference_type(_S_buffer_size()) + : -difference_type((-__offset - 1) + / _S_buffer_size()) - 1; + _M_set_node(_M_node + __node_offset); + _M_cur = _M_first + (__offset - __node_offset + * difference_type(_S_buffer_size())); + } + return *this; + } + + _Self + operator+(difference_type __n) const + { + _Self __tmp = *this; + return __tmp += __n; + } + + _Self& + operator-=(difference_type __n) + { return *this += -__n; } + + _Self + operator-(difference_type __n) const + { + _Self __tmp = *this; + return __tmp -= __n; + } + + reference + operator[](difference_type __n) const + { return *(*this + __n); } + + /** @if maint + * Prepares to traverse new_node. Sets everything except + * _M_cur, which should therefore be set by the caller + * immediately afterwards, based on _M_first and _M_last. + * @endif + */ + void + _M_set_node(_Map_pointer __new_node) + { + _M_node = __new_node; + _M_first = *__new_node; + _M_last = _M_first + difference_type(_S_buffer_size()); + } + }; + + // Note: we also provide overloads whose operands are of the same type in + // order to avoid ambiguous overload resolution when std::rel_ops operators + // are in scope (for additional details, see libstdc++/3628) + template + inline bool + operator==(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, + const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) + { return __x._M_cur == __y._M_cur; } + + template + inline bool + operator==(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, + const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) + { return __x._M_cur == __y._M_cur; } + + template + inline bool + operator!=(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, + const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) + { return !(__x == __y); } + + template + inline bool + operator!=(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, + const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) + { return !(__x == __y); } + + template + inline bool + operator<(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, + const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) + { return (__x._M_node == __y._M_node) ? (__x._M_cur < __y._M_cur) + : (__x._M_node < __y._M_node); } + + template + inline bool + operator<(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, + const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) + { return (__x._M_node == __y._M_node) ? (__x._M_cur < __y._M_cur) + : (__x._M_node < __y._M_node); } + + template + inline bool + operator>(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, + const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) + { return __y < __x; } + + template + inline bool + operator>(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, + const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) + { return __y < __x; } + + template + inline bool + operator<=(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, + const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) + { return !(__y < __x); } + + template + inline bool + operator<=(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, + const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) + { return !(__y < __x); } + + template + inline bool + operator>=(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, + const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) + { return !(__x < __y); } + + template + inline bool + operator>=(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, + const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) + { return !(__x < __y); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // According to the resolution of DR179 not only the various comparison + // operators but also operator- must accept mixed iterator/const_iterator + // parameters. + template + inline typename _Deque_iterator<_Tp, _Ref, _Ptr>::difference_type + operator-(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, + const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) + { + return typename _Deque_iterator<_Tp, _Ref, _Ptr>::difference_type + (_Deque_iterator<_Tp, _Ref, _Ptr>::_S_buffer_size()) + * (__x._M_node - __y._M_node - 1) + (__x._M_cur - __x._M_first) + + (__y._M_last - __y._M_cur); + } + + template + inline typename _Deque_iterator<_Tp, _RefL, _PtrL>::difference_type + operator-(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, + const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) + { + return typename _Deque_iterator<_Tp, _RefL, _PtrL>::difference_type + (_Deque_iterator<_Tp, _RefL, _PtrL>::_S_buffer_size()) + * (__x._M_node - __y._M_node - 1) + (__x._M_cur - __x._M_first) + + (__y._M_last - __y._M_cur); + } + + template + inline _Deque_iterator<_Tp, _Ref, _Ptr> + operator+(ptrdiff_t __n, const _Deque_iterator<_Tp, _Ref, _Ptr>& __x) + { return __x + __n; } + + template + void + fill(const _Deque_iterator<_Tp, _Tp&, _Tp*>& __first, + const _Deque_iterator<_Tp, _Tp&, _Tp*>& __last, const _Tp& __value); + + /** + * @if maint + * Deque base class. This class provides the unified face for %deque's + * allocation. This class's constructor and destructor allocate and + * deallocate (but do not initialize) storage. This makes %exception + * safety easier. + * + * Nothing in this class ever constructs or destroys an actual Tp element. + * (Deque handles that itself.) Only/All memory management is performed + * here. + * @endif + */ + template + class _Deque_base + { + public: + typedef _Alloc allocator_type; + + allocator_type + get_allocator() const + { return allocator_type(_M_get_Tp_allocator()); } + + typedef _Deque_iterator<_Tp, _Tp&, _Tp*> iterator; + typedef _Deque_iterator<_Tp, const _Tp&, const _Tp*> const_iterator; + + _Deque_base(const allocator_type& __a, size_t __num_elements) + : _M_impl(__a) + { _M_initialize_map(__num_elements); } + + _Deque_base(const allocator_type& __a) + : _M_impl(__a) + { } + + ~_Deque_base(); + + protected: + //This struct encapsulates the implementation of the std::deque + //standard container and at the same time makes use of the EBO + //for empty allocators. + typedef typename _Alloc::template rebind<_Tp*>::other _Map_alloc_type; + + typedef typename _Alloc::template rebind<_Tp>::other _Tp_alloc_type; + + struct _Deque_impl + : public _Tp_alloc_type + { + _Tp** _M_map; + size_t _M_map_size; + iterator _M_start; + iterator _M_finish; + + _Deque_impl(const _Tp_alloc_type& __a) + : _Tp_alloc_type(__a), _M_map(0), _M_map_size(0), + _M_start(), _M_finish() + { } + }; + + _Tp_alloc_type& + _M_get_Tp_allocator() + { return *static_cast<_Tp_alloc_type*>(&this->_M_impl); } + + const _Tp_alloc_type& + _M_get_Tp_allocator() const + { return *static_cast(&this->_M_impl); } + + _Map_alloc_type + _M_get_map_allocator() const + { return _Map_alloc_type(_M_get_Tp_allocator()); } + + _Tp* + _M_allocate_node() + { + return _M_impl._Tp_alloc_type::allocate(__deque_buf_size(sizeof(_Tp))); + } + + void + _M_deallocate_node(_Tp* __p) + { + _M_impl._Tp_alloc_type::deallocate(__p, __deque_buf_size(sizeof(_Tp))); + } + + _Tp** + _M_allocate_map(size_t __n) + { return _M_get_map_allocator().allocate(__n); } + + void + _M_deallocate_map(_Tp** __p, size_t __n) + { _M_get_map_allocator().deallocate(__p, __n); } + + protected: + void _M_initialize_map(size_t); + void _M_create_nodes(_Tp** __nstart, _Tp** __nfinish); + void _M_destroy_nodes(_Tp** __nstart, _Tp** __nfinish); + enum { _S_initial_map_size = 8 }; + + _Deque_impl _M_impl; + }; + + template + _Deque_base<_Tp, _Alloc>:: + ~_Deque_base() + { + if (this->_M_impl._M_map) + { + _M_destroy_nodes(this->_M_impl._M_start._M_node, + this->_M_impl._M_finish._M_node + 1); + _M_deallocate_map(this->_M_impl._M_map, this->_M_impl._M_map_size); + } + } + + /** + * @if maint + * @brief Layout storage. + * @param num_elements The count of T's for which to allocate space + * at first. + * @return Nothing. + * + * The initial underlying memory layout is a bit complicated... + * @endif + */ + template + void + _Deque_base<_Tp, _Alloc>:: + _M_initialize_map(size_t __num_elements) + { + const size_t __num_nodes = (__num_elements/ __deque_buf_size(sizeof(_Tp)) + + 1); + + this->_M_impl._M_map_size = std::max((size_t) _S_initial_map_size, + size_t(__num_nodes + 2)); + this->_M_impl._M_map = _M_allocate_map(this->_M_impl._M_map_size); + + // For "small" maps (needing less than _M_map_size nodes), allocation + // starts in the middle elements and grows outwards. So nstart may be + // the beginning of _M_map, but for small maps it may be as far in as + // _M_map+3. + + _Tp** __nstart = (this->_M_impl._M_map + + (this->_M_impl._M_map_size - __num_nodes) / 2); + _Tp** __nfinish = __nstart + __num_nodes; + + try + { _M_create_nodes(__nstart, __nfinish); } + catch(...) + { + _M_deallocate_map(this->_M_impl._M_map, this->_M_impl._M_map_size); + this->_M_impl._M_map = 0; + this->_M_impl._M_map_size = 0; + __throw_exception_again; + } + + this->_M_impl._M_start._M_set_node(__nstart); + this->_M_impl._M_finish._M_set_node(__nfinish - 1); + this->_M_impl._M_start._M_cur = _M_impl._M_start._M_first; + this->_M_impl._M_finish._M_cur = (this->_M_impl._M_finish._M_first + + __num_elements + % __deque_buf_size(sizeof(_Tp))); + } + + template + void + _Deque_base<_Tp, _Alloc>:: + _M_create_nodes(_Tp** __nstart, _Tp** __nfinish) + { + _Tp** __cur; + try + { + for (__cur = __nstart; __cur < __nfinish; ++__cur) + *__cur = this->_M_allocate_node(); + } + catch(...) + { + _M_destroy_nodes(__nstart, __cur); + __throw_exception_again; + } + } + + template + void + _Deque_base<_Tp, _Alloc>:: + _M_destroy_nodes(_Tp** __nstart, _Tp** __nfinish) + { + for (_Tp** __n = __nstart; __n < __nfinish; ++__n) + _M_deallocate_node(*__n); + } + + /** + * @brief A standard container using fixed-size memory allocation and + * constant-time manipulation of elements at either end. + * + * @ingroup Containers + * @ingroup Sequences + * + * Meets the requirements of a container, a + * reversible container, and a + * sequence, including the + * optional sequence requirements. + * + * In previous HP/SGI versions of deque, there was an extra template + * parameter so users could control the node size. This extension turned + * out to violate the C++ standard (it can be detected using template + * template parameters), and it was removed. + * + * @if maint + * Here's how a deque manages memory. Each deque has 4 members: + * + * - Tp** _M_map + * - size_t _M_map_size + * - iterator _M_start, _M_finish + * + * map_size is at least 8. %map is an array of map_size + * pointers-to-"nodes". (The name %map has nothing to do with the + * std::map class, and "nodes" should not be confused with + * std::list's usage of "node".) + * + * A "node" has no specific type name as such, but it is referred + * to as "node" in this file. It is a simple array-of-Tp. If Tp + * is very large, there will be one Tp element per node (i.e., an + * "array" of one). For non-huge Tp's, node size is inversely + * related to Tp size: the larger the Tp, the fewer Tp's will fit + * in a node. The goal here is to keep the total size of a node + * relatively small and constant over different Tp's, to improve + * allocator efficiency. + * + * Not every pointer in the %map array will point to a node. If + * the initial number of elements in the deque is small, the + * /middle/ %map pointers will be valid, and the ones at the edges + * will be unused. This same situation will arise as the %map + * grows: available %map pointers, if any, will be on the ends. As + * new nodes are created, only a subset of the %map's pointers need + * to be copied "outward". + * + * Class invariants: + * - For any nonsingular iterator i: + * - i.node points to a member of the %map array. (Yes, you read that + * correctly: i.node does not actually point to a node.) The member of + * the %map array is what actually points to the node. + * - i.first == *(i.node) (This points to the node (first Tp element).) + * - i.last == i.first + node_size + * - i.cur is a pointer in the range [i.first, i.last). NOTE: + * the implication of this is that i.cur is always a dereferenceable + * pointer, even if i is a past-the-end iterator. + * - Start and Finish are always nonsingular iterators. NOTE: this + * means that an empty deque must have one node, a deque with > + class deque : protected _Deque_base<_Tp, _Alloc> + { + // concept requirements + typedef typename _Alloc::value_type _Alloc_value_type; + __glibcxx_class_requires(_Tp, _SGIAssignableConcept) + __glibcxx_class_requires2(_Tp, _Alloc_value_type, _SameTypeConcept) + + typedef _Deque_base<_Tp, _Alloc> _Base; + typedef typename _Base::_Tp_alloc_type _Tp_alloc_type; + + public: + typedef _Tp value_type; + typedef typename _Tp_alloc_type::pointer pointer; + typedef typename _Tp_alloc_type::const_pointer const_pointer; + typedef typename _Tp_alloc_type::reference reference; + typedef typename _Tp_alloc_type::const_reference const_reference; + typedef typename _Base::iterator iterator; + typedef typename _Base::const_iterator const_iterator; + typedef std::reverse_iterator const_reverse_iterator; + typedef std::reverse_iterator reverse_iterator; + typedef size_t size_type; + typedef ptrdiff_t difference_type; + typedef _Alloc allocator_type; + + protected: + typedef pointer* _Map_pointer; + + static size_t _S_buffer_size() + { return __deque_buf_size(sizeof(_Tp)); } + + // Functions controlling memory layout, and nothing else. + using _Base::_M_initialize_map; + using _Base::_M_create_nodes; + using _Base::_M_destroy_nodes; + using _Base::_M_allocate_node; + using _Base::_M_deallocate_node; + using _Base::_M_allocate_map; + using _Base::_M_deallocate_map; + using _Base::_M_get_Tp_allocator; + + /** @if maint + * A total of four data members accumulated down the heirarchy. + * May be accessed via _M_impl.* + * @endif + */ + using _Base::_M_impl; + + public: + // [23.2.1.1] construct/copy/destroy + // (assign() and get_allocator() are also listed in this section) + /** + * @brief Default constructor creates no elements. + */ + explicit + deque(const allocator_type& __a = allocator_type()) + : _Base(__a, 0) {} + + /** + * @brief Create a %deque with copies of an exemplar element. + * @param n The number of elements to initially create. + * @param value An element to copy. + * + * This constructor fills the %deque with @a n copies of @a value. + */ + explicit + deque(size_type __n, const value_type& __value = value_type(), + const allocator_type& __a = allocator_type()) + : _Base(__a, __n) + { _M_fill_initialize(__value); } + + /** + * @brief %Deque copy constructor. + * @param x A %deque of identical element and allocator types. + * + * The newly-created %deque uses a copy of the allocation object used + * by @a x. + */ + deque(const deque& __x) + : _Base(__x._M_get_Tp_allocator(), __x.size()) + { std::__uninitialized_copy_a(__x.begin(), __x.end(), + this->_M_impl._M_start, + _M_get_Tp_allocator()); } + + /** + * @brief Builds a %deque from a range. + * @param first An input iterator. + * @param last An input iterator. + * + * Create a %deque consisting of copies of the elements from [first, + * last). + * + * If the iterators are forward, bidirectional, or random-access, then + * this will call the elements' copy constructor N times (where N is + * distance(first,last)) and do no memory reallocation. But if only + * input iterators are used, then this will do at most 2N calls to the + * copy constructor, and logN memory reallocations. + */ + template + deque(_InputIterator __first, _InputIterator __last, + const allocator_type& __a = allocator_type()) + : _Base(__a) + { + // Check whether it's an integral type. If so, it's not an iterator. + typedef typename std::__is_integer<_InputIterator>::__type _Integral; + _M_initialize_dispatch(__first, __last, _Integral()); + } + + /** + * The dtor only erases the elements, and note that if the elements + * themselves are pointers, the pointed-to memory is not touched in any + * way. Managing the pointer is the user's responsibilty. + */ + ~deque() + { _M_destroy_data(begin(), end(), _M_get_Tp_allocator()); } + + /** + * @brief %Deque assignment operator. + * @param x A %deque of identical element and allocator types. + * + * All the elements of @a x are copied, but unlike the copy constructor, + * the allocator object is not copied. + */ + deque& + operator=(const deque& __x); + + /** + * @brief Assigns a given value to a %deque. + * @param n Number of elements to be assigned. + * @param val Value to be assigned. + * + * This function fills a %deque with @a n copies of the given + * value. Note that the assignment completely changes the + * %deque and that the resulting %deque's size is the same as + * the number of elements assigned. Old data may be lost. + */ + void + assign(size_type __n, const value_type& __val) + { _M_fill_assign(__n, __val); } + + /** + * @brief Assigns a range to a %deque. + * @param first An input iterator. + * @param last An input iterator. + * + * This function fills a %deque with copies of the elements in the + * range [first,last). + * + * Note that the assignment completely changes the %deque and that the + * resulting %deque's size is the same as the number of elements + * assigned. Old data may be lost. + */ + template + void + assign(_InputIterator __first, _InputIterator __last) + { + typedef typename std::__is_integer<_InputIterator>::__type _Integral; + _M_assign_dispatch(__first, __last, _Integral()); + } + + /// Get a copy of the memory allocation object. + allocator_type + get_allocator() const + { return _Base::get_allocator(); } + + // iterators + /** + * Returns a read/write iterator that points to the first element in the + * %deque. Iteration is done in ordinary element order. + */ + iterator + begin() + { return this->_M_impl._M_start; } + + /** + * Returns a read-only (constant) iterator that points to the first + * element in the %deque. Iteration is done in ordinary element order. + */ + const_iterator + begin() const + { return this->_M_impl._M_start; } + + /** + * Returns a read/write iterator that points one past the last + * element in the %deque. Iteration is done in ordinary + * element order. + */ + iterator + end() + { return this->_M_impl._M_finish; } + + /** + * Returns a read-only (constant) iterator that points one past + * the last element in the %deque. Iteration is done in + * ordinary element order. + */ + const_iterator + end() const + { return this->_M_impl._M_finish; } + + /** + * Returns a read/write reverse iterator that points to the + * last element in the %deque. Iteration is done in reverse + * element order. + */ + reverse_iterator + rbegin() + { return reverse_iterator(this->_M_impl._M_finish); } + + /** + * Returns a read-only (constant) reverse iterator that points + * to the last element in the %deque. Iteration is done in + * reverse element order. + */ + const_reverse_iterator + rbegin() const + { return const_reverse_iterator(this->_M_impl._M_finish); } + + /** + * Returns a read/write reverse iterator that points to one + * before the first element in the %deque. Iteration is done + * in reverse element order. + */ + reverse_iterator + rend() + { return reverse_iterator(this->_M_impl._M_start); } + + /** + * Returns a read-only (constant) reverse iterator that points + * to one before the first element in the %deque. Iteration is + * done in reverse element order. + */ + const_reverse_iterator + rend() const + { return const_reverse_iterator(this->_M_impl._M_start); } + + // [23.2.1.2] capacity + /** Returns the number of elements in the %deque. */ + size_type + size() const + { return this->_M_impl._M_finish - this->_M_impl._M_start; } + + /** Returns the size() of the largest possible %deque. */ + size_type + max_size() const + { return _M_get_Tp_allocator().max_size(); } + + /** + * @brief Resizes the %deque to the specified number of elements. + * @param new_size Number of elements the %deque should contain. + * @param x Data with which new elements should be populated. + * + * This function will %resize the %deque to the specified + * number of elements. If the number is smaller than the + * %deque's current size the %deque is truncated, otherwise the + * %deque is extended and new elements are populated with given + * data. + */ + void + resize(size_type __new_size, value_type __x = value_type()) + { + const size_type __len = size(); + if (__new_size < __len) + _M_erase_at_end(this->_M_impl._M_start + difference_type(__new_size)); + else + insert(this->_M_impl._M_finish, __new_size - __len, __x); + } + + /** + * Returns true if the %deque is empty. (Thus begin() would + * equal end().) + */ + bool + empty() const + { return this->_M_impl._M_finish == this->_M_impl._M_start; } + + // element access + /** + * @brief Subscript access to the data contained in the %deque. + * @param n The index of the element for which data should be + * accessed. + * @return Read/write reference to data. + * + * This operator allows for easy, array-style, data access. + * Note that data access with this operator is unchecked and + * out_of_range lookups are not defined. (For checked lookups + * see at().) + */ + reference + operator[](size_type __n) + { return this->_M_impl._M_start[difference_type(__n)]; } + + /** + * @brief Subscript access to the data contained in the %deque. + * @param n The index of the element for which data should be + * accessed. + * @return Read-only (constant) reference to data. + * + * This operator allows for easy, array-style, data access. + * Note that data access with this operator is unchecked and + * out_of_range lookups are not defined. (For checked lookups + * see at().) + */ + const_reference + operator[](size_type __n) const + { return this->_M_impl._M_start[difference_type(__n)]; } + + protected: + /// @if maint Safety check used only from at(). @endif + void + _M_range_check(size_type __n) const + { + if (__n >= this->size()) + __throw_out_of_range(__N("deque::_M_range_check")); + } + + public: + /** + * @brief Provides access to the data contained in the %deque. + * @param n The index of the element for which data should be + * accessed. + * @return Read/write reference to data. + * @throw std::out_of_range If @a n is an invalid index. + * + * This function provides for safer data access. The parameter + * is first checked that it is in the range of the deque. The + * function throws out_of_range if the check fails. + */ + reference + at(size_type __n) + { + _M_range_check(__n); + return (*this)[__n]; + } + + /** + * @brief Provides access to the data contained in the %deque. + * @param n The index of the element for which data should be + * accessed. + * @return Read-only (constant) reference to data. + * @throw std::out_of_range If @a n is an invalid index. + * + * This function provides for safer data access. The parameter is first + * checked that it is in the range of the deque. The function throws + * out_of_range if the check fails. + */ + const_reference + at(size_type __n) const + { + _M_range_check(__n); + return (*this)[__n]; + } + + /** + * Returns a read/write reference to the data at the first + * element of the %deque. + */ + reference + front() + { return *begin(); } + + /** + * Returns a read-only (constant) reference to the data at the first + * element of the %deque. + */ + const_reference + front() const + { return *begin(); } + + /** + * Returns a read/write reference to the data at the last element of the + * %deque. + */ + reference + back() + { + iterator __tmp = end(); + --__tmp; + return *__tmp; + } + + /** + * Returns a read-only (constant) reference to the data at the last + * element of the %deque. + */ + const_reference + back() const + { + const_iterator __tmp = end(); + --__tmp; + return *__tmp; + } + + // [23.2.1.2] modifiers + /** + * @brief Add data to the front of the %deque. + * @param x Data to be added. + * + * This is a typical stack operation. The function creates an + * element at the front of the %deque and assigns the given + * data to it. Due to the nature of a %deque this operation + * can be done in constant time. + */ + void + push_front(const value_type& __x) + { + if (this->_M_impl._M_start._M_cur != this->_M_impl._M_start._M_first) + { + this->_M_impl.construct(this->_M_impl._M_start._M_cur - 1, __x); + --this->_M_impl._M_start._M_cur; + } + else + _M_push_front_aux(__x); + } + + /** + * @brief Add data to the end of the %deque. + * @param x Data to be added. + * + * This is a typical stack operation. The function creates an + * element at the end of the %deque and assigns the given data + * to it. Due to the nature of a %deque this operation can be + * done in constant time. + */ + void + push_back(const value_type& __x) + { + if (this->_M_impl._M_finish._M_cur + != this->_M_impl._M_finish._M_last - 1) + { + this->_M_impl.construct(this->_M_impl._M_finish._M_cur, __x); + ++this->_M_impl._M_finish._M_cur; + } + else + _M_push_back_aux(__x); + } + + /** + * @brief Removes first element. + * + * This is a typical stack operation. It shrinks the %deque by one. + * + * Note that no data is returned, and if the first element's data is + * needed, it should be retrieved before pop_front() is called. + */ + void + pop_front() + { + if (this->_M_impl._M_start._M_cur + != this->_M_impl._M_start._M_last - 1) + { + this->_M_impl.destroy(this->_M_impl._M_start._M_cur); + ++this->_M_impl._M_start._M_cur; + } + else + _M_pop_front_aux(); + } + + /** + * @brief Removes last element. + * + * This is a typical stack operation. It shrinks the %deque by one. + * + * Note that no data is returned, and if the last element's data is + * needed, it should be retrieved before pop_back() is called. + */ + void + pop_back() + { + if (this->_M_impl._M_finish._M_cur + != this->_M_impl._M_finish._M_first) + { + --this->_M_impl._M_finish._M_cur; + this->_M_impl.destroy(this->_M_impl._M_finish._M_cur); + } + else + _M_pop_back_aux(); + } + + /** + * @brief Inserts given value into %deque before specified iterator. + * @param position An iterator into the %deque. + * @param x Data to be inserted. + * @return An iterator that points to the inserted data. + * + * This function will insert a copy of the given value before the + * specified location. + */ + iterator + insert(iterator __position, const value_type& __x); + + /** + * @brief Inserts a number of copies of given data into the %deque. + * @param position An iterator into the %deque. + * @param n Number of elements to be inserted. + * @param x Data to be inserted. + * + * This function will insert a specified number of copies of the given + * data before the location specified by @a position. + */ + void + insert(iterator __position, size_type __n, const value_type& __x) + { _M_fill_insert(__position, __n, __x); } + + /** + * @brief Inserts a range into the %deque. + * @param position An iterator into the %deque. + * @param first An input iterator. + * @param last An input iterator. + * + * This function will insert copies of the data in the range + * [first,last) into the %deque before the location specified + * by @a pos. This is known as "range insert." + */ + template + void + insert(iterator __position, _InputIterator __first, + _InputIterator __last) + { + // Check whether it's an integral type. If so, it's not an iterator. + typedef typename std::__is_integer<_InputIterator>::__type _Integral; + _M_insert_dispatch(__position, __first, __last, _Integral()); + } + + /** + * @brief Remove element at given position. + * @param position Iterator pointing to element to be erased. + * @return An iterator pointing to the next element (or end()). + * + * This function will erase the element at the given position and thus + * shorten the %deque by one. + * + * The user is cautioned that + * this function only erases the element, and that if the element is + * itself a pointer, the pointed-to memory is not touched in any way. + * Managing the pointer is the user's responsibilty. + */ + iterator + erase(iterator __position); + + /** + * @brief Remove a range of elements. + * @param first Iterator pointing to the first element to be erased. + * @param last Iterator pointing to one past the last element to be + * erased. + * @return An iterator pointing to the element pointed to by @a last + * prior to erasing (or end()). + * + * This function will erase the elements in the range [first,last) and + * shorten the %deque accordingly. + * + * The user is cautioned that + * this function only erases the elements, and that if the elements + * themselves are pointers, the pointed-to memory is not touched in any + * way. Managing the pointer is the user's responsibilty. + */ + iterator + erase(iterator __first, iterator __last); + + /** + * @brief Swaps data with another %deque. + * @param x A %deque of the same element and allocator types. + * + * This exchanges the elements between two deques in constant time. + * (Four pointers, so it should be quite fast.) + * Note that the global std::swap() function is specialized such that + * std::swap(d1,d2) will feed to this function. + */ + void + swap(deque& __x) + { + std::swap(this->_M_impl._M_start, __x._M_impl._M_start); + std::swap(this->_M_impl._M_finish, __x._M_impl._M_finish); + std::swap(this->_M_impl._M_map, __x._M_impl._M_map); + std::swap(this->_M_impl._M_map_size, __x._M_impl._M_map_size); + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 431. Swapping containers with unequal allocators. + std::__alloc_swap<_Tp_alloc_type>::_S_do_it(_M_get_Tp_allocator(), + __x._M_get_Tp_allocator()); + } + + /** + * Erases all the elements. Note that this function only erases the + * elements, and that if the elements themselves are pointers, the + * pointed-to memory is not touched in any way. Managing the pointer is + * the user's responsibilty. + */ + void + clear() + { _M_erase_at_end(begin()); } + + protected: + // Internal constructor functions follow. + + // called by the range constructor to implement [23.1.1]/9 + template + void + _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) + { + _M_initialize_map(__n); + _M_fill_initialize(__x); + } + + // called by the range constructor to implement [23.1.1]/9 + template + void + _M_initialize_dispatch(_InputIterator __first, _InputIterator __last, + __false_type) + { + typedef typename std::iterator_traits<_InputIterator>:: + iterator_category _IterCategory; + _M_range_initialize(__first, __last, _IterCategory()); + } + + // called by the second initialize_dispatch above + //@{ + /** + * @if maint + * @brief Fills the deque with whatever is in [first,last). + * @param first An input iterator. + * @param last An input iterator. + * @return Nothing. + * + * If the iterators are actually forward iterators (or better), then the + * memory layout can be done all at once. Else we move forward using + * push_back on each value from the iterator. + * @endif + */ + template + void + _M_range_initialize(_InputIterator __first, _InputIterator __last, + std::input_iterator_tag); + + // called by the second initialize_dispatch above + template + void + _M_range_initialize(_ForwardIterator __first, _ForwardIterator __last, + std::forward_iterator_tag); + //@} + + /** + * @if maint + * @brief Fills the %deque with copies of value. + * @param value Initial value. + * @return Nothing. + * @pre _M_start and _M_finish have already been initialized, + * but none of the %deque's elements have yet been constructed. + * + * This function is called only when the user provides an explicit size + * (with or without an explicit exemplar value). + * @endif + */ + void + _M_fill_initialize(const value_type& __value); + + // Internal assign functions follow. The *_aux functions do the actual + // assignment work for the range versions. + + // called by the range assign to implement [23.1.1]/9 + template + void + _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) + { + _M_fill_assign(static_cast(__n), + static_cast(__val)); + } + + // called by the range assign to implement [23.1.1]/9 + template + void + _M_assign_dispatch(_InputIterator __first, _InputIterator __last, + __false_type) + { + typedef typename std::iterator_traits<_InputIterator>:: + iterator_category _IterCategory; + _M_assign_aux(__first, __last, _IterCategory()); + } + + // called by the second assign_dispatch above + template + void + _M_assign_aux(_InputIterator __first, _InputIterator __last, + std::input_iterator_tag); + + // called by the second assign_dispatch above + template + void + _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last, + std::forward_iterator_tag) + { + const size_type __len = std::distance(__first, __last); + if (__len > size()) + { + _ForwardIterator __mid = __first; + std::advance(__mid, size()); + std::copy(__first, __mid, begin()); + insert(end(), __mid, __last); + } + else + _M_erase_at_end(std::copy(__first, __last, begin())); + } + + // Called by assign(n,t), and the range assign when it turns out + // to be the same thing. + void + _M_fill_assign(size_type __n, const value_type& __val) + { + if (__n > size()) + { + std::fill(begin(), end(), __val); + insert(end(), __n - size(), __val); + } + else + { + _M_erase_at_end(begin() + difference_type(__n)); + std::fill(begin(), end(), __val); + } + } + + //@{ + /** + * @if maint + * @brief Helper functions for push_* and pop_*. + * @endif + */ + void _M_push_back_aux(const value_type&); + + void _M_push_front_aux(const value_type&); + + void _M_pop_back_aux(); + + void _M_pop_front_aux(); + //@} + + // Internal insert functions follow. The *_aux functions do the actual + // insertion work when all shortcuts fail. + + // called by the range insert to implement [23.1.1]/9 + template + void + _M_insert_dispatch(iterator __pos, + _Integer __n, _Integer __x, __true_type) + { + _M_fill_insert(__pos, static_cast(__n), + static_cast(__x)); + } + + // called by the range insert to implement [23.1.1]/9 + template + void + _M_insert_dispatch(iterator __pos, + _InputIterator __first, _InputIterator __last, + __false_type) + { + typedef typename std::iterator_traits<_InputIterator>:: + iterator_category _IterCategory; + _M_range_insert_aux(__pos, __first, __last, _IterCategory()); + } + + // called by the second insert_dispatch above + template + void + _M_range_insert_aux(iterator __pos, _InputIterator __first, + _InputIterator __last, std::input_iterator_tag); + + // called by the second insert_dispatch above + template + void + _M_range_insert_aux(iterator __pos, _ForwardIterator __first, + _ForwardIterator __last, std::forward_iterator_tag); + + // Called by insert(p,n,x), and the range insert when it turns out to be + // the same thing. Can use fill functions in optimal situations, + // otherwise passes off to insert_aux(p,n,x). + void + _M_fill_insert(iterator __pos, size_type __n, const value_type& __x); + + // called by insert(p,x) + iterator + _M_insert_aux(iterator __pos, const value_type& __x); + + // called by insert(p,n,x) via fill_insert + void + _M_insert_aux(iterator __pos, size_type __n, const value_type& __x); + + // called by range_insert_aux for forward iterators + template + void + _M_insert_aux(iterator __pos, + _ForwardIterator __first, _ForwardIterator __last, + size_type __n); + + + // Internal erase functions follow. + + void + _M_destroy_data_aux(iterator __first, iterator __last); + + void + _M_destroy_data_dispatch(iterator, iterator, __true_type) { } + + void + _M_destroy_data_dispatch(iterator __first, iterator __last, __false_type) + { _M_destroy_data_aux(__first, __last); } + + // Called by ~deque(). + // NB: Doesn't deallocate the nodes. + template + void + _M_destroy_data(iterator __first, iterator __last, const _Alloc1&) + { _M_destroy_data_aux(__first, __last); } + + void + _M_destroy_data(iterator __first, iterator __last, + const std::allocator<_Tp>&) + { + typedef typename std::__is_scalar::__type + _Has_trivial_destructor; + _M_destroy_data_dispatch(__first, __last, _Has_trivial_destructor()); + } + + // Called by erase(q1, q2). + void + _M_erase_at_begin(iterator __pos) + { + _M_destroy_data(begin(), __pos, _M_get_Tp_allocator()); + _M_destroy_nodes(this->_M_impl._M_start._M_node, __pos._M_node); + this->_M_impl._M_start = __pos; + } + + // Called by erase(q1, q2), resize(), clear(), _M_assign_aux, + // _M_fill_assign, operator=. + void + _M_erase_at_end(iterator __pos) + { + _M_destroy_data(__pos, end(), _M_get_Tp_allocator()); + _M_destroy_nodes(__pos._M_node + 1, + this->_M_impl._M_finish._M_node + 1); + this->_M_impl._M_finish = __pos; + } + + //@{ + /** + * @if maint + * @brief Memory-handling helpers for the previous internal insert + * functions. + * @endif + */ + iterator + _M_reserve_elements_at_front(size_type __n) + { + const size_type __vacancies = this->_M_impl._M_start._M_cur + - this->_M_impl._M_start._M_first; + if (__n > __vacancies) + _M_new_elements_at_front(__n - __vacancies); + return this->_M_impl._M_start - difference_type(__n); + } + + iterator + _M_reserve_elements_at_back(size_type __n) + { + const size_type __vacancies = (this->_M_impl._M_finish._M_last + - this->_M_impl._M_finish._M_cur) - 1; + if (__n > __vacancies) + _M_new_elements_at_back(__n - __vacancies); + return this->_M_impl._M_finish + difference_type(__n); + } + + void + _M_new_elements_at_front(size_type __new_elements); + + void + _M_new_elements_at_back(size_type __new_elements); + //@} + + + //@{ + /** + * @if maint + * @brief Memory-handling helpers for the major %map. + * + * Makes sure the _M_map has space for new nodes. Does not + * actually add the nodes. Can invalidate _M_map pointers. + * (And consequently, %deque iterators.) + * @endif + */ + void + _M_reserve_map_at_back(size_type __nodes_to_add = 1) + { + if (__nodes_to_add + 1 > this->_M_impl._M_map_size + - (this->_M_impl._M_finish._M_node - this->_M_impl._M_map)) + _M_reallocate_map(__nodes_to_add, false); + } + + void + _M_reserve_map_at_front(size_type __nodes_to_add = 1) + { + if (__nodes_to_add > size_type(this->_M_impl._M_start._M_node + - this->_M_impl._M_map)) + _M_reallocate_map(__nodes_to_add, true); + } + + void + _M_reallocate_map(size_type __nodes_to_add, bool __add_at_front); + //@} + }; + + + /** + * @brief Deque equality comparison. + * @param x A %deque. + * @param y A %deque of the same type as @a x. + * @return True iff the size and elements of the deques are equal. + * + * This is an equivalence relation. It is linear in the size of the + * deques. Deques are considered equivalent if their sizes are equal, + * and if corresponding elements compare equal. + */ + template + inline bool + operator==(const deque<_Tp, _Alloc>& __x, + const deque<_Tp, _Alloc>& __y) + { return __x.size() == __y.size() + && std::equal(__x.begin(), __x.end(), __y.begin()); } + + /** + * @brief Deque ordering relation. + * @param x A %deque. + * @param y A %deque of the same type as @a x. + * @return True iff @a x is lexicographically less than @a y. + * + * This is a total ordering relation. It is linear in the size of the + * deques. The elements must be comparable with @c <. + * + * See std::lexicographical_compare() for how the determination is made. + */ + template + inline bool + operator<(const deque<_Tp, _Alloc>& __x, + const deque<_Tp, _Alloc>& __y) + { return std::lexicographical_compare(__x.begin(), __x.end(), + __y.begin(), __y.end()); } + + /// Based on operator== + template + inline bool + operator!=(const deque<_Tp, _Alloc>& __x, + const deque<_Tp, _Alloc>& __y) + { return !(__x == __y); } + + /// Based on operator< + template + inline bool + operator>(const deque<_Tp, _Alloc>& __x, + const deque<_Tp, _Alloc>& __y) + { return __y < __x; } + + /// Based on operator< + template + inline bool + operator<=(const deque<_Tp, _Alloc>& __x, + const deque<_Tp, _Alloc>& __y) + { return !(__y < __x); } + + /// Based on operator< + template + inline bool + operator>=(const deque<_Tp, _Alloc>& __x, + const deque<_Tp, _Alloc>& __y) + { return !(__x < __y); } + + /// See std::deque::swap(). + template + inline void + swap(deque<_Tp,_Alloc>& __x, deque<_Tp,_Alloc>& __y) + { __x.swap(__y); } + +} // namespace std + +#endif /* _DEQUE_H */ diff --git a/cpp_src/stl_function.h b/cpp_src/stl_function.h new file mode 100644 index 0000000..52ee36b --- /dev/null +++ b/cpp_src/stl_function.h @@ -0,0 +1,755 @@ +// Functor implementations -*- C++ -*- + +// Copyright (C) 2001, 2002, 2004, 2005 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996-1998 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_function.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _FUNCTION_H +#define _FUNCTION_H 1 + +namespace std { + + // 20.3.1 base classes + /** @defgroup s20_3_1_base Functor Base Classes + * Function objects, or @e functors, are objects with an @c operator() + * defined and accessible. They can be passed as arguments to algorithm + * templates and used in place of a function pointer. Not only is the + * resulting expressiveness of the library increased, but the generated + * code can be more efficient than what you might write by hand. When we + * refer to "functors," then, generally we include function pointers in + * the description as well. + * + * Often, functors are only created as temporaries passed to algorithm + * calls, rather than being created as named variables. + * + * Two examples taken from the standard itself follow. To perform a + * by-element addition of two vectors @c a and @c b containing @c double, + * and put the result in @c a, use + * \code + * transform (a.begin(), a.end(), b.begin(), a.begin(), plus()); + * \endcode + * To negate every element in @c a, use + * \code + * transform(a.begin(), a.end(), a.begin(), negate()); + * \endcode + * The addition and negation functions will be inlined directly. + * + * The standard functors are derived from structs named @c unary_function + * and @c binary_function. These two classes contain nothing but typedefs, + * to aid in generic (template) programming. If you write your own + * functors, you might consider doing the same. + * + * @{ + */ + /** + * This is one of the @link s20_3_1_base functor base classes@endlink. + */ + template + struct unary_function + { + typedef _Arg argument_type; ///< @c argument_type is the type of the + /// argument (no surprises here) + + typedef _Result result_type; ///< @c result_type is the return type + }; + + /** + * This is one of the @link s20_3_1_base functor base classes@endlink. + */ + template + struct binary_function + { + typedef _Arg1 first_argument_type; ///< the type of the first argument + /// (no surprises here) + + typedef _Arg2 second_argument_type; ///< the type of the second argument + typedef _Result result_type; ///< type of the return type + }; + /** @} */ + + // 20.3.2 arithmetic + /** @defgroup s20_3_2_arithmetic Arithmetic Classes + * Because basic math often needs to be done during an algorithm, the library + * provides functors for those operations. See the documentation for + * @link s20_3_1_base the base classes@endlink for examples of their use. + * + * @{ + */ + /// One of the @link s20_3_2_arithmetic math functors@endlink. + template + struct plus : public binary_function<_Tp, _Tp, _Tp> + { + _Tp + operator()(const _Tp& __x, const _Tp& __y) const + { return __x + __y; } + }; + + /// One of the @link s20_3_2_arithmetic math functors@endlink. + template + struct minus : public binary_function<_Tp, _Tp, _Tp> + { + _Tp + operator()(const _Tp& __x, const _Tp& __y) const + { return __x - __y; } + }; + + /// One of the @link s20_3_2_arithmetic math functors@endlink. + template + struct multiplies : public binary_function<_Tp, _Tp, _Tp> + { + _Tp + operator()(const _Tp& __x, const _Tp& __y) const + { return __x * __y; } + }; + + /// One of the @link s20_3_2_arithmetic math functors@endlink. + template + struct divides : public binary_function<_Tp, _Tp, _Tp> + { + _Tp + operator()(const _Tp& __x, const _Tp& __y) const + { return __x / __y; } + }; + + /// One of the @link s20_3_2_arithmetic math functors@endlink. + template + struct modulus : public binary_function<_Tp, _Tp, _Tp> + { + _Tp + operator()(const _Tp& __x, const _Tp& __y) const + { return __x % __y; } + }; + + /// One of the @link s20_3_2_arithmetic math functors@endlink. + template + struct negate : public unary_function<_Tp, _Tp> + { + _Tp + operator()(const _Tp& __x) const + { return -__x; } + }; + /** @} */ + + // 20.3.3 comparisons + /** @defgroup s20_3_3_comparisons Comparison Classes + * The library provides six wrapper functors for all the basic comparisons + * in C++, like @c <. + * + * @{ + */ + /// One of the @link s20_3_3_comparisons comparison functors@endlink. + template + struct equal_to : public binary_function<_Tp, _Tp, bool> + { + bool + operator()(const _Tp& __x, const _Tp& __y) const + { return __x == __y; } + }; + + /// One of the @link s20_3_3_comparisons comparison functors@endlink. + template + struct not_equal_to : public binary_function<_Tp, _Tp, bool> + { + bool + operator()(const _Tp& __x, const _Tp& __y) const + { return __x != __y; } + }; + + /// One of the @link s20_3_3_comparisons comparison functors@endlink. + template + struct greater : public binary_function<_Tp, _Tp, bool> + { + bool + operator()(const _Tp& __x, const _Tp& __y) const + { return __x > __y; } + }; + + /// One of the @link s20_3_3_comparisons comparison functors@endlink. + template + struct less : public binary_function<_Tp, _Tp, bool> + { + bool + operator()(const _Tp& __x, const _Tp& __y) const + { return __x < __y; } + }; + + /// One of the @link s20_3_3_comparisons comparison functors@endlink. + template + struct greater_equal : public binary_function<_Tp, _Tp, bool> + { + bool + operator()(const _Tp& __x, const _Tp& __y) const + { return __x >= __y; } + }; + + /// One of the @link s20_3_3_comparisons comparison functors@endlink. + template + struct less_equal : public binary_function<_Tp, _Tp, bool> + { + bool + operator()(const _Tp& __x, const _Tp& __y) const + { return __x <= __y; } + }; + /** @} */ + + // 20.3.4 logical operations + /** @defgroup s20_3_4_logical Boolean Operations Classes + * Here are wrapper functors for Boolean operations: @c &&, @c ||, and @c !. + * + * @{ + */ + /// One of the @link s20_3_4_logical Boolean operations functors@endlink. + template + struct logical_and : public binary_function<_Tp, _Tp, bool> + { + bool + operator()(const _Tp& __x, const _Tp& __y) const + { return __x && __y; } + }; + + /// One of the @link s20_3_4_logical Boolean operations functors@endlink. + template + struct logical_or : public binary_function<_Tp, _Tp, bool> + { + bool + operator()(const _Tp& __x, const _Tp& __y) const + { return __x || __y; } + }; + + /// One of the @link s20_3_4_logical Boolean operations functors@endlink. + template + struct logical_not : public unary_function<_Tp, bool> + { + bool + operator()(const _Tp& __x) const + { return !__x; } + }; + /** @} */ + + // 20.3.5 negators + /** @defgroup s20_3_5_negators Negators + * The functions @c not1 and @c not2 each take a predicate functor + * and return an instance of @c unary_negate or + * @c binary_negate, respectively. These classes are functors whose + * @c operator() performs the stored predicate function and then returns + * the negation of the result. + * + * For example, given a vector of integers and a trivial predicate, + * \code + * struct IntGreaterThanThree + * : public std::unary_function + * { + * bool operator() (int x) { return x > 3; } + * }; + * + * std::find_if (v.begin(), v.end(), not1(IntGreaterThanThree())); + * \endcode + * The call to @c find_if will locate the first index (i) of @c v for which + * "!(v[i] > 3)" is true. + * + * The not1/unary_negate combination works on predicates taking a single + * argument. The not2/binary_negate combination works on predicates which + * take two arguments. + * + * @{ + */ + /// One of the @link s20_3_5_negators negation functors@endlink. + template + class unary_negate + : public unary_function + { + protected: + _Predicate _M_pred; + public: + explicit + unary_negate(const _Predicate& __x) : _M_pred(__x) {} + + bool + operator()(const typename _Predicate::argument_type& __x) const + { return !_M_pred(__x); } + }; + + /// One of the @link s20_3_5_negators negation functors@endlink. + template + inline unary_negate<_Predicate> + not1(const _Predicate& __pred) + { return unary_negate<_Predicate>(__pred); } + + /// One of the @link s20_3_5_negators negation functors@endlink. + template + class binary_negate + : public binary_function + { + protected: + _Predicate _M_pred; + public: + explicit + binary_negate(const _Predicate& __x) + : _M_pred(__x) { } + + bool + operator()(const typename _Predicate::first_argument_type& __x, + const typename _Predicate::second_argument_type& __y) const + { return !_M_pred(__x, __y); } + }; + + /// One of the @link s20_3_5_negators negation functors@endlink. + template + inline binary_negate<_Predicate> + not2(const _Predicate& __pred) + { return binary_negate<_Predicate>(__pred); } + /** @} */ + + // 20.3.6 binders + /** @defgroup s20_3_6_binder Binder Classes + * Binders turn functions/functors with two arguments into functors with + * a single argument, storing an argument to be applied later. For + * example, a variable @c B of type @c binder1st is constructed from a + * functor @c f and an argument @c x. Later, B's @c operator() is called + * with a single argument @c y. The return value is the value of @c f(x,y). + * @c B can be "called" with various arguments (y1, y2, ...) and will in + * turn call @c f(x,y1), @c f(x,y2), ... + * + * The function @c bind1st is provided to save some typing. It takes the + * function and an argument as parameters, and returns an instance of + * @c binder1st. + * + * The type @c binder2nd and its creator function @c bind2nd do the same + * thing, but the stored argument is passed as the second parameter instead + * of the first, e.g., @c bind2nd(std::minus,1.3) will create a + * functor whose @c operator() accepts a floating-point number, subtracts + * 1.3 from it, and returns the result. (If @c bind1st had been used, + * the functor would perform "1.3 - x" instead. + * + * Creator-wrapper functions like @c bind1st are intended to be used in + * calling algorithms. Their return values will be temporary objects. + * (The goal is to not require you to type names like + * @c std::binder1st> for declaring a variable to hold the + * return value from @c bind1st(std::plus,5). + * + * These become more useful when combined with the composition functions. + * + * @{ + */ + /// One of the @link s20_3_6_binder binder functors@endlink. + template + class binder1st + : public unary_function + { + protected: + _Operation op; + typename _Operation::first_argument_type value; + public: + binder1st(const _Operation& __x, + const typename _Operation::first_argument_type& __y) + : op(__x), value(__y) {} + + typename _Operation::result_type + operator()(const typename _Operation::second_argument_type& __x) const + { return op(value, __x); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 109. Missing binders for non-const sequence elements + typename _Operation::result_type + operator()(typename _Operation::second_argument_type& __x) const + { return op(value, __x); } + }; + + /// One of the @link s20_3_6_binder binder functors@endlink. + template + inline binder1st<_Operation> + bind1st(const _Operation& __fn, const _Tp& __x) + { + typedef typename _Operation::first_argument_type _Arg1_type; + return binder1st<_Operation>(__fn, _Arg1_type(__x)); + } + + /// One of the @link s20_3_6_binder binder functors@endlink. + template + class binder2nd + : public unary_function + { + protected: + _Operation op; + typename _Operation::second_argument_type value; + public: + binder2nd(const _Operation& __x, + const typename _Operation::second_argument_type& __y) + : op(__x), value(__y) {} + + typename _Operation::result_type + operator()(const typename _Operation::first_argument_type& __x) const + { return op(__x, value); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 109. Missing binders for non-const sequence elements + typename _Operation::result_type + operator()(typename _Operation::first_argument_type& __x) const + { return op(__x, value); } + }; + + /// One of the @link s20_3_6_binder binder functors@endlink. + template + inline binder2nd<_Operation> + bind2nd(const _Operation& __fn, const _Tp& __x) + { + typedef typename _Operation::second_argument_type _Arg2_type; + return binder2nd<_Operation>(__fn, _Arg2_type(__x)); + } + /** @} */ + + // 20.3.7 adaptors pointers functions + /** @defgroup s20_3_7_adaptors Adaptors for pointers to functions + * The advantage of function objects over pointers to functions is that + * the objects in the standard library declare nested typedefs describing + * their argument and result types with uniform names (e.g., @c result_type + * from the base classes @c unary_function and @c binary_function). + * Sometimes those typedefs are required, not just optional. + * + * Adaptors are provided to turn pointers to unary (single-argument) and + * binary (double-argument) functions into function objects. The + * long-winded functor @c pointer_to_unary_function is constructed with a + * function pointer @c f, and its @c operator() called with argument @c x + * returns @c f(x). The functor @c pointer_to_binary_function does the same + * thing, but with a double-argument @c f and @c operator(). + * + * The function @c ptr_fun takes a pointer-to-function @c f and constructs + * an instance of the appropriate functor. + * + * @{ + */ + /// One of the @link s20_3_7_adaptors adaptors for function pointers@endlink. + template + class pointer_to_unary_function : public unary_function<_Arg, _Result> + { + protected: + _Result (*_M_ptr)(_Arg); + public: + pointer_to_unary_function() {} + + explicit + pointer_to_unary_function(_Result (*__x)(_Arg)) + : _M_ptr(__x) {} + + _Result + operator()(_Arg __x) const + { return _M_ptr(__x); } + }; + + /// One of the @link s20_3_7_adaptors adaptors for function pointers@endlink. + template + inline pointer_to_unary_function<_Arg, _Result> + ptr_fun(_Result (*__x)(_Arg)) + { return pointer_to_unary_function<_Arg, _Result>(__x); } + + /// One of the @link s20_3_7_adaptors adaptors for function pointers@endlink. + template + class pointer_to_binary_function + : public binary_function<_Arg1, _Arg2, _Result> + { + protected: + _Result (*_M_ptr)(_Arg1, _Arg2); + public: + pointer_to_binary_function() {} + + explicit + pointer_to_binary_function(_Result (*__x)(_Arg1, _Arg2)) + : _M_ptr(__x) {} + + _Result + operator()(_Arg1 __x, _Arg2 __y) const + { return _M_ptr(__x, __y); } + }; + + /// One of the @link s20_3_7_adaptors adaptors for function pointers@endlink. + template + inline pointer_to_binary_function<_Arg1, _Arg2, _Result> + ptr_fun(_Result (*__x)(_Arg1, _Arg2)) + { return pointer_to_binary_function<_Arg1, _Arg2, _Result>(__x); } + /** @} */ + + template + struct _Identity : public unary_function<_Tp,_Tp> + { + _Tp& + operator()(_Tp& __x) const + { return __x; } + + const _Tp& + operator()(const _Tp& __x) const + { return __x; } + }; + + template + struct _Select1st : public unary_function<_Pair, + typename _Pair::first_type> + { + typename _Pair::first_type& + operator()(_Pair& __x) const + { return __x.first; } + + const typename _Pair::first_type& + operator()(const _Pair& __x) const + { return __x.first; } + }; + + template + struct _Select2nd : public unary_function<_Pair, + typename _Pair::second_type> + { + typename _Pair::second_type& + operator()(_Pair& __x) const + { return __x.second; } + + const typename _Pair::second_type& + operator()(const _Pair& __x) const + { return __x.second; } + }; + + // 20.3.8 adaptors pointers members + /** @defgroup s20_3_8_memadaptors Adaptors for pointers to members + * There are a total of 8 = 2^3 function objects in this family. + * (1) Member functions taking no arguments vs member functions taking + * one argument. + * (2) Call through pointer vs call through reference. + * (3) Const vs non-const member function. + * + * All of this complexity is in the function objects themselves. You can + * ignore it by using the helper function mem_fun and mem_fun_ref, + * which create whichever type of adaptor is appropriate. + * + * @{ + */ + /// One of the @link s20_3_8_memadaptors adaptors for member pointers@endlink. + template + class mem_fun_t : public unary_function<_Tp*, _Ret> + { + public: + explicit + mem_fun_t(_Ret (_Tp::*__pf)()) + : _M_f(__pf) {} + + _Ret + operator()(_Tp* __p) const + { return (__p->*_M_f)(); } + private: + _Ret (_Tp::*_M_f)(); + }; + + /// One of the @link s20_3_8_memadaptors adaptors for member pointers@endlink. + template + class const_mem_fun_t : public unary_function + { + public: + explicit + const_mem_fun_t(_Ret (_Tp::*__pf)() const) + : _M_f(__pf) {} + + _Ret + operator()(const _Tp* __p) const + { return (__p->*_M_f)(); } + private: + _Ret (_Tp::*_M_f)() const; + }; + + /// One of the @link s20_3_8_memadaptors adaptors for member pointers@endlink. + template + class mem_fun_ref_t : public unary_function<_Tp, _Ret> + { + public: + explicit + mem_fun_ref_t(_Ret (_Tp::*__pf)()) + : _M_f(__pf) {} + + _Ret + operator()(_Tp& __r) const + { return (__r.*_M_f)(); } + private: + _Ret (_Tp::*_M_f)(); + }; + + /// One of the @link s20_3_8_memadaptors adaptors for member pointers@endlink. + template + class const_mem_fun_ref_t : public unary_function<_Tp, _Ret> + { + public: + explicit + const_mem_fun_ref_t(_Ret (_Tp::*__pf)() const) + : _M_f(__pf) {} + + _Ret + operator()(const _Tp& __r) const + { return (__r.*_M_f)(); } + private: + _Ret (_Tp::*_M_f)() const; + }; + + /// One of the @link s20_3_8_memadaptors adaptors for member pointers@endlink. + template + class mem_fun1_t : public binary_function<_Tp*, _Arg, _Ret> + { + public: + explicit + mem_fun1_t(_Ret (_Tp::*__pf)(_Arg)) + : _M_f(__pf) {} + + _Ret + operator()(_Tp* __p, _Arg __x) const + { return (__p->*_M_f)(__x); } + private: + _Ret (_Tp::*_M_f)(_Arg); + }; + + /// One of the @link s20_3_8_memadaptors adaptors for member pointers@endlink. + template + class const_mem_fun1_t : public binary_function + { + public: + explicit + const_mem_fun1_t(_Ret (_Tp::*__pf)(_Arg) const) + : _M_f(__pf) {} + + _Ret + operator()(const _Tp* __p, _Arg __x) const + { return (__p->*_M_f)(__x); } + private: + _Ret (_Tp::*_M_f)(_Arg) const; + }; + + /// One of the @link s20_3_8_memadaptors adaptors for member pointers@endlink. + template + class mem_fun1_ref_t : public binary_function<_Tp, _Arg, _Ret> + { + public: + explicit + mem_fun1_ref_t(_Ret (_Tp::*__pf)(_Arg)) + : _M_f(__pf) {} + + _Ret + operator()(_Tp& __r, _Arg __x) const + { return (__r.*_M_f)(__x); } + private: + _Ret (_Tp::*_M_f)(_Arg); + }; + + /// One of the @link s20_3_8_memadaptors adaptors for member pointers@endlink. + template + class const_mem_fun1_ref_t : public binary_function<_Tp, _Arg, _Ret> + { + public: + explicit + const_mem_fun1_ref_t(_Ret (_Tp::*__pf)(_Arg) const) + : _M_f(__pf) {} + + _Ret + operator()(const _Tp& __r, _Arg __x) const + { return (__r.*_M_f)(__x); } + private: + _Ret (_Tp::*_M_f)(_Arg) const; + }; + + // Mem_fun adaptor helper functions. There are only two: + // mem_fun and mem_fun_ref. + template + inline mem_fun_t<_Ret, _Tp> + mem_fun(_Ret (_Tp::*__f)()) + { return mem_fun_t<_Ret, _Tp>(__f); } + + template + inline const_mem_fun_t<_Ret, _Tp> + mem_fun(_Ret (_Tp::*__f)() const) + { return const_mem_fun_t<_Ret, _Tp>(__f); } + + template + inline mem_fun_ref_t<_Ret, _Tp> + mem_fun_ref(_Ret (_Tp::*__f)()) + { return mem_fun_ref_t<_Ret, _Tp>(__f); } + + template + inline const_mem_fun_ref_t<_Ret, _Tp> + mem_fun_ref(_Ret (_Tp::*__f)() const) + { return const_mem_fun_ref_t<_Ret, _Tp>(__f); } + + template + inline mem_fun1_t<_Ret, _Tp, _Arg> + mem_fun(_Ret (_Tp::*__f)(_Arg)) + { return mem_fun1_t<_Ret, _Tp, _Arg>(__f); } + + template + inline const_mem_fun1_t<_Ret, _Tp, _Arg> + mem_fun(_Ret (_Tp::*__f)(_Arg) const) + { return const_mem_fun1_t<_Ret, _Tp, _Arg>(__f); } + + template + inline mem_fun1_ref_t<_Ret, _Tp, _Arg> + mem_fun_ref(_Ret (_Tp::*__f)(_Arg)) + { return mem_fun1_ref_t<_Ret, _Tp, _Arg>(__f); } + + template + inline const_mem_fun1_ref_t<_Ret, _Tp, _Arg> + mem_fun_ref(_Ret (_Tp::*__f)(_Arg) const) + { return const_mem_fun1_ref_t<_Ret, _Tp, _Arg>(__f); } + + /** @} */ + +} // namespace std + +#endif /* _FUNCTION_H */ diff --git a/cpp_src/stl_heap.h b/cpp_src/stl_heap.h new file mode 100644 index 0000000..9382a4f --- /dev/null +++ b/cpp_src/stl_heap.h @@ -0,0 +1,463 @@ +// Heap implementation -*- C++ -*- + +// Copyright (C) 2001, 2004, 2005, 2006 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * Copyright (c) 1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_heap.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STL_HEAP_H +#define _STL_HEAP_H 1 + +#include + +namespace std { + + // is_heap, a predicate testing whether or not a range is + // a heap. This function is an extension, not part of the C++ + // standard. + template + bool + __is_heap(_RandomAccessIterator __first, _Distance __n) + { + _Distance __parent = 0; + for (_Distance __child = 1; __child < __n; ++__child) + { + if (__first[__parent] < __first[__child]) + return false; + if ((__child & 1) == 0) + ++__parent; + } + return true; + } + + template + bool + __is_heap(_RandomAccessIterator __first, _StrictWeakOrdering __comp, + _Distance __n) + { + _Distance __parent = 0; + for (_Distance __child = 1; __child < __n; ++__child) + { + if (__comp(__first[__parent], __first[__child])) + return false; + if ((__child & 1) == 0) + ++__parent; + } + return true; + } + + template + bool + __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) + { return std::__is_heap(__first, std::distance(__first, __last)); } + + template + bool + __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, + _StrictWeakOrdering __comp) + { return std::__is_heap(__first, __comp, std::distance(__first, __last)); } + + // Heap-manipulation functions: push_heap, pop_heap, make_heap, sort_heap. + + template + void + __push_heap(_RandomAccessIterator __first, + _Distance __holeIndex, _Distance __topIndex, _Tp __value) + { + _Distance __parent = (__holeIndex - 1) / 2; + while (__holeIndex > __topIndex && *(__first + __parent) < __value) + { + *(__first + __holeIndex) = *(__first + __parent); + __holeIndex = __parent; + __parent = (__holeIndex - 1) / 2; + } + *(__first + __holeIndex) = __value; + } + + /** + * @brief Push an element onto a heap. + * @param first Start of heap. + * @param last End of heap + element. + * @ingroup heap + * + * This operation pushes the element at last-1 onto the valid heap over the + * range [first,last-1). After completion, [first,last) is a valid heap. + */ + template + inline void + push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + typedef typename iterator_traits<_RandomAccessIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) + __glibcxx_requires_valid_range(__first, __last); + // __glibcxx_requires_heap(__first, __last - 1); + + std::__push_heap(__first, _DistanceType((__last - __first) - 1), + _DistanceType(0), _ValueType(*(__last - 1))); + } + + template + void + __push_heap(_RandomAccessIterator __first, _Distance __holeIndex, + _Distance __topIndex, _Tp __value, _Compare __comp) + { + _Distance __parent = (__holeIndex - 1) / 2; + while (__holeIndex > __topIndex + && __comp(*(__first + __parent), __value)) + { + *(__first + __holeIndex) = *(__first + __parent); + __holeIndex = __parent; + __parent = (__holeIndex - 1) / 2; + } + *(__first + __holeIndex) = __value; + } + + /** + * @brief Push an element onto a heap using comparison functor. + * @param first Start of heap. + * @param last End of heap + element. + * @param comp Comparison functor. + * @ingroup heap + * + * This operation pushes the element at last-1 onto the valid heap over the + * range [first,last-1). After completion, [first,last) is a valid heap. + * Compare operations are performed using comp. + */ + template + inline void + push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, + _Compare __comp) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + typedef typename iterator_traits<_RandomAccessIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_requires_valid_range(__first, __last); + __glibcxx_requires_heap_pred(__first, __last - 1, __comp); + + std::__push_heap(__first, _DistanceType((__last - __first) - 1), + _DistanceType(0), _ValueType(*(__last - 1)), __comp); + } + + template + void + __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, + _Distance __len, _Tp __value) + { + const _Distance __topIndex = __holeIndex; + _Distance __secondChild = 2 * __holeIndex + 2; + while (__secondChild < __len) + { + if (*(__first + __secondChild) < *(__first + (__secondChild - 1))) + __secondChild--; + *(__first + __holeIndex) = *(__first + __secondChild); + __holeIndex = __secondChild; + __secondChild = 2 * (__secondChild + 1); + } + if (__secondChild == __len) + { + *(__first + __holeIndex) = *(__first + (__secondChild - 1)); + __holeIndex = __secondChild - 1; + } + std::__push_heap(__first, __holeIndex, __topIndex, __value); + } + + template + inline void + __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, + _RandomAccessIterator __result, _Tp __value) + { + typedef typename iterator_traits<_RandomAccessIterator>::difference_type + _Distance; + *__result = *__first; + std::__adjust_heap(__first, _Distance(0), _Distance(__last - __first), + __value); + } + + /** + * @brief Pop an element off a heap. + * @param first Start of heap. + * @param last End of heap. + * @ingroup heap + * + * This operation pops the top of the heap. The elements first and last-1 + * are swapped and [first,last-1) is made into a heap. + */ + template + inline void + pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) + __glibcxx_requires_valid_range(__first, __last); + __glibcxx_requires_heap(__first, __last); + + std::__pop_heap(__first, __last - 1, __last - 1, + _ValueType(*(__last - 1))); + } + + template + void + __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, + _Distance __len, _Tp __value, _Compare __comp) + { + const _Distance __topIndex = __holeIndex; + _Distance __secondChild = 2 * __holeIndex + 2; + while (__secondChild < __len) + { + if (__comp(*(__first + __secondChild), + *(__first + (__secondChild - 1)))) + __secondChild--; + *(__first + __holeIndex) = *(__first + __secondChild); + __holeIndex = __secondChild; + __secondChild = 2 * (__secondChild + 1); + } + if (__secondChild == __len) + { + *(__first + __holeIndex) = *(__first + (__secondChild - 1)); + __holeIndex = __secondChild - 1; + } + std::__push_heap(__first, __holeIndex, __topIndex, __value, __comp); + } + + template + inline void + __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, + _RandomAccessIterator __result, _Tp __value, _Compare __comp) + { + typedef typename iterator_traits<_RandomAccessIterator>::difference_type + _Distance; + *__result = *__first; + std::__adjust_heap(__first, _Distance(0), _Distance(__last - __first), + __value, __comp); + } + + /** + * @brief Pop an element off a heap using comparison functor. + * @param first Start of heap. + * @param last End of heap. + * @param comp Comparison functor to use. + * @ingroup heap + * + * This operation pops the top of the heap. The elements first and last-1 + * are swapped and [first,last-1) is made into a heap. Comparisons are + * made using comp. + */ + template + inline void + pop_heap(_RandomAccessIterator __first, + _RandomAccessIterator __last, _Compare __comp) + { + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_requires_valid_range(__first, __last); + __glibcxx_requires_heap_pred(__first, __last, __comp); + + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + std::__pop_heap(__first, __last - 1, __last - 1, + _ValueType(*(__last - 1)), __comp); + } + + /** + * @brief Construct a heap over a range. + * @param first Start of heap. + * @param last End of heap. + * @ingroup heap + * + * This operation makes the elements in [first,last) into a heap. + */ + template + void + make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + typedef typename iterator_traits<_RandomAccessIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) + __glibcxx_requires_valid_range(__first, __last); + + if (__last - __first < 2) + return; + + const _DistanceType __len = __last - __first; + _DistanceType __parent = (__len - 2) / 2; + while (true) + { + std::__adjust_heap(__first, __parent, __len, + _ValueType(*(__first + __parent))); + if (__parent == 0) + return; + __parent--; + } + } + + /** + * @brief Construct a heap over a range using comparison functor. + * @param first Start of heap. + * @param last End of heap. + * @param comp Comparison functor to use. + * @ingroup heap + * + * This operation makes the elements in [first,last) into a heap. + * Comparisons are made using comp. + */ + template + inline void + make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, + _Compare __comp) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + typedef typename iterator_traits<_RandomAccessIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_requires_valid_range(__first, __last); + + if (__last - __first < 2) + return; + + const _DistanceType __len = __last - __first; + _DistanceType __parent = (__len - 2) / 2; + while (true) + { + std::__adjust_heap(__first, __parent, __len, + _ValueType(*(__first + __parent)), __comp); + if (__parent == 0) + return; + __parent--; + } + } + + /** + * @brief Sort a heap. + * @param first Start of heap. + * @param last End of heap. + * @ingroup heap + * + * This operation sorts the valid heap in the range [first,last). + */ + template + void + sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) + { + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_function_requires(_LessThanComparableConcept< + typename iterator_traits<_RandomAccessIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + // __glibcxx_requires_heap(__first, __last); + + while (__last - __first > 1) + std::pop_heap(__first, _RandomAccessIterator(__last--)); + } + + /** + * @brief Sort a heap using comparison functor. + * @param first Start of heap. + * @param last End of heap. + * @param comp Comparison functor to use. + * @ingroup heap + * + * This operation sorts the valid heap in the range [first,last). + * Comparisons are made using comp. + */ + template + void + sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, + _Compare __comp) + { + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_requires_valid_range(__first, __last); + __glibcxx_requires_heap_pred(__first, __last, __comp); + + while (__last - __first > 1) + std::pop_heap(__first, _RandomAccessIterator(__last--), __comp); + } + +} // namespace std + +#endif /* _STL_HEAP_H */ diff --git a/cpp_src/stl_iterator.h b/cpp_src/stl_iterator.h new file mode 100644 index 0000000..1336354 --- /dev/null +++ b/cpp_src/stl_iterator.h @@ -0,0 +1,827 @@ +// Iterators -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996-1998 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_iterator.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + * + * This file implements reverse_iterator, back_insert_iterator, + * front_insert_iterator, insert_iterator, __normal_iterator, and their + * supporting functions and overloaded operators. + */ + +#ifndef _ITERATOR_H +#define _ITERATOR_H 1 + +#include +#include + +namespace std { + + // 24.4.1 Reverse iterators + /** + * "Bidirectional and random access iterators have corresponding reverse + * %iterator adaptors that iterate through the data structure in the + * opposite direction. They have the same signatures as the corresponding + * iterators. The fundamental relation between a reverse %iterator and its + * corresponding %iterator @c i is established by the identity: + * @code + * &*(reverse_iterator(i)) == &*(i - 1) + * @endcode + * + * This mapping is dictated by the fact that while there is always a + * pointer past the end of an array, there might not be a valid pointer + * before the beginning of an array." [24.4.1]/1,2 + * + * Reverse iterators can be tricky and surprising at first. Their + * semantics make sense, however, and the trickiness is a side effect of + * the requirement that the iterators must be safe. + */ + template + class reverse_iterator + : public iterator::iterator_category, + typename iterator_traits<_Iterator>::value_type, + typename iterator_traits<_Iterator>::difference_type, + typename iterator_traits<_Iterator>::pointer, + typename iterator_traits<_Iterator>::reference> + { + protected: + _Iterator current; + + public: + typedef _Iterator iterator_type; + typedef typename iterator_traits<_Iterator>::difference_type + difference_type; + typedef typename iterator_traits<_Iterator>::reference reference; + typedef typename iterator_traits<_Iterator>::pointer pointer; + + public: + /** + * The default constructor default-initializes member @p current. + * If it is a pointer, that means it is zero-initialized. + */ + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 235 No specification of default ctor for reverse_iterator + reverse_iterator() : current() { } + + /** + * This %iterator will move in the opposite direction that @p x does. + */ + explicit + reverse_iterator(iterator_type __x) : current(__x) { } + + /** + * The copy constructor is normal. + */ + reverse_iterator(const reverse_iterator& __x) + : current(__x.current) { } + + /** + * A reverse_iterator across other types can be copied in the normal + * fashion. + */ + template + reverse_iterator(const reverse_iterator<_Iter>& __x) + : current(__x.base()) { } + + /** + * @return @c current, the %iterator used for underlying work. + */ + iterator_type + base() const + { return current; } + + /** + * @return TODO + * + * @doctodo + */ + reference + operator*() const + { + _Iterator __tmp = current; + return *--__tmp; + } + + /** + * @return TODO + * + * @doctodo + */ + pointer + operator->() const + { return &(operator*()); } + + /** + * @return TODO + * + * @doctodo + */ + reverse_iterator& + operator++() + { + --current; + return *this; + } + + /** + * @return TODO + * + * @doctodo + */ + reverse_iterator + operator++(int) + { + reverse_iterator __tmp = *this; + --current; + return __tmp; + } + + /** + * @return TODO + * + * @doctodo + */ + reverse_iterator& + operator--() + { + ++current; + return *this; + } + + /** + * @return TODO + * + * @doctodo + */ + reverse_iterator + operator--(int) + { + reverse_iterator __tmp = *this; + ++current; + return __tmp; + } + + /** + * @return TODO + * + * @doctodo + */ + reverse_iterator + operator+(difference_type __n) const + { return reverse_iterator(current - __n); } + + /** + * @return TODO + * + * @doctodo + */ + reverse_iterator& + operator+=(difference_type __n) + { + current -= __n; + return *this; + } + + /** + * @return TODO + * + * @doctodo + */ + reverse_iterator + operator-(difference_type __n) const + { return reverse_iterator(current + __n); } + + /** + * @return TODO + * + * @doctodo + */ + reverse_iterator& + operator-=(difference_type __n) + { + current += __n; + return *this; + } + + /** + * @return TODO + * + * @doctodo + */ + reference + operator[](difference_type __n) const + { return *(*this + __n); } + }; + + //@{ + /** + * @param x A %reverse_iterator. + * @param y A %reverse_iterator. + * @return A simple bool. + * + * Reverse iterators forward many operations to their underlying base() + * iterators. Others are implemented in terms of one another. + * + */ + template + inline bool + operator==(const reverse_iterator<_Iterator>& __x, + const reverse_iterator<_Iterator>& __y) + { return __x.base() == __y.base(); } + + template + inline bool + operator<(const reverse_iterator<_Iterator>& __x, + const reverse_iterator<_Iterator>& __y) + { return __y.base() < __x.base(); } + + template + inline bool + operator!=(const reverse_iterator<_Iterator>& __x, + const reverse_iterator<_Iterator>& __y) + { return !(__x == __y); } + + template + inline bool + operator>(const reverse_iterator<_Iterator>& __x, + const reverse_iterator<_Iterator>& __y) + { return __y < __x; } + + template + inline bool + operator<=(const reverse_iterator<_Iterator>& __x, + const reverse_iterator<_Iterator>& __y) + { return !(__y < __x); } + + template + inline bool + operator>=(const reverse_iterator<_Iterator>& __x, + const reverse_iterator<_Iterator>& __y) + { return !(__x < __y); } + + template + inline typename reverse_iterator<_Iterator>::difference_type + operator-(const reverse_iterator<_Iterator>& __x, + const reverse_iterator<_Iterator>& __y) + { return __y.base() - __x.base(); } + + template + inline reverse_iterator<_Iterator> + operator+(typename reverse_iterator<_Iterator>::difference_type __n, + const reverse_iterator<_Iterator>& __x) + { return reverse_iterator<_Iterator>(__x.base() - __n); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 280. Comparison of reverse_iterator to const reverse_iterator. + template + inline bool + operator==(const reverse_iterator<_IteratorL>& __x, + const reverse_iterator<_IteratorR>& __y) + { return __x.base() == __y.base(); } + + template + inline bool + operator<(const reverse_iterator<_IteratorL>& __x, + const reverse_iterator<_IteratorR>& __y) + { return __y.base() < __x.base(); } + + template + inline bool + operator!=(const reverse_iterator<_IteratorL>& __x, + const reverse_iterator<_IteratorR>& __y) + { return !(__x == __y); } + + template + inline bool + operator>(const reverse_iterator<_IteratorL>& __x, + const reverse_iterator<_IteratorR>& __y) + { return __y < __x; } + + template + inline bool + operator<=(const reverse_iterator<_IteratorL>& __x, + const reverse_iterator<_IteratorR>& __y) + { return !(__y < __x); } + + template + inline bool + operator>=(const reverse_iterator<_IteratorL>& __x, + const reverse_iterator<_IteratorR>& __y) + { return !(__x < __y); } + + template + inline typename reverse_iterator<_IteratorL>::difference_type + operator-(const reverse_iterator<_IteratorL>& __x, + const reverse_iterator<_IteratorR>& __y) + { return __y.base() - __x.base(); } + //@} + + // 24.4.2.2.1 back_insert_iterator + /** + * @brief Turns assignment into insertion. + * + * These are output iterators, constructed from a container-of-T. + * Assigning a T to the iterator appends it to the container using + * push_back. + * + * Tip: Using the back_inserter function to create these iterators can + * save typing. + */ + template + class back_insert_iterator + : public iterator + { + protected: + _Container* container; + + public: + /// A nested typedef for the type of whatever container you used. + typedef _Container container_type; + + /// The only way to create this %iterator is with a container. + explicit + back_insert_iterator(_Container& __x) : container(&__x) { } + + /** + * @param value An instance of whatever type + * container_type::const_reference is; presumably a + * reference-to-const T for container. + * @return This %iterator, for chained operations. + * + * This kind of %iterator doesn't really have a "position" in the + * container (you can think of the position as being permanently at + * the end, if you like). Assigning a value to the %iterator will + * always append the value to the end of the container. + */ + back_insert_iterator& + operator=(typename _Container::const_reference __value) + { + container->push_back(__value); + return *this; + } + + /// Simply returns *this. + back_insert_iterator& + operator*() + { return *this; } + + /// Simply returns *this. (This %iterator does not "move".) + back_insert_iterator& + operator++() + { return *this; } + + /// Simply returns *this. (This %iterator does not "move".) + back_insert_iterator + operator++(int) + { return *this; } + }; + + /** + * @param x A container of arbitrary type. + * @return An instance of back_insert_iterator working on @p x. + * + * This wrapper function helps in creating back_insert_iterator instances. + * Typing the name of the %iterator requires knowing the precise full + * type of the container, which can be tedious and impedes generic + * programming. Using this function lets you take advantage of automatic + * template parameter deduction, making the compiler match the correct + * types for you. + */ + template + inline back_insert_iterator<_Container> + back_inserter(_Container& __x) + { return back_insert_iterator<_Container>(__x); } + + /** + * @brief Turns assignment into insertion. + * + * These are output iterators, constructed from a container-of-T. + * Assigning a T to the iterator prepends it to the container using + * push_front. + * + * Tip: Using the front_inserter function to create these iterators can + * save typing. + */ + template + class front_insert_iterator + : public iterator + { + protected: + _Container* container; + + public: + /// A nested typedef for the type of whatever container you used. + typedef _Container container_type; + + /// The only way to create this %iterator is with a container. + explicit front_insert_iterator(_Container& __x) : container(&__x) { } + + /** + * @param value An instance of whatever type + * container_type::const_reference is; presumably a + * reference-to-const T for container. + * @return This %iterator, for chained operations. + * + * This kind of %iterator doesn't really have a "position" in the + * container (you can think of the position as being permanently at + * the front, if you like). Assigning a value to the %iterator will + * always prepend the value to the front of the container. + */ + front_insert_iterator& + operator=(typename _Container::const_reference __value) + { + container->push_front(__value); + return *this; + } + + /// Simply returns *this. + front_insert_iterator& + operator*() + { return *this; } + + /// Simply returns *this. (This %iterator does not "move".) + front_insert_iterator& + operator++() + { return *this; } + + /// Simply returns *this. (This %iterator does not "move".) + front_insert_iterator + operator++(int) + { return *this; } + }; + + /** + * @param x A container of arbitrary type. + * @return An instance of front_insert_iterator working on @p x. + * + * This wrapper function helps in creating front_insert_iterator instances. + * Typing the name of the %iterator requires knowing the precise full + * type of the container, which can be tedious and impedes generic + * programming. Using this function lets you take advantage of automatic + * template parameter deduction, making the compiler match the correct + * types for you. + */ + template + inline front_insert_iterator<_Container> + front_inserter(_Container& __x) + { return front_insert_iterator<_Container>(__x); } + + /** + * @brief Turns assignment into insertion. + * + * These are output iterators, constructed from a container-of-T. + * Assigning a T to the iterator inserts it in the container at the + * %iterator's position, rather than overwriting the value at that + * position. + * + * (Sequences will actually insert a @e copy of the value before the + * %iterator's position.) + * + * Tip: Using the inserter function to create these iterators can + * save typing. + */ + template + class insert_iterator + : public iterator + { + protected: + _Container* container; + typename _Container::iterator iter; + + public: + /// A nested typedef for the type of whatever container you used. + typedef _Container container_type; + + /** + * The only way to create this %iterator is with a container and an + * initial position (a normal %iterator into the container). + */ + insert_iterator(_Container& __x, typename _Container::iterator __i) + : container(&__x), iter(__i) {} + + /** + * @param value An instance of whatever type + * container_type::const_reference is; presumably a + * reference-to-const T for container. + * @return This %iterator, for chained operations. + * + * This kind of %iterator maintains its own position in the + * container. Assigning a value to the %iterator will insert the + * value into the container at the place before the %iterator. + * + * The position is maintained such that subsequent assignments will + * insert values immediately after one another. For example, + * @code + * // vector v contains A and Z + * + * insert_iterator i (v, ++v.begin()); + * i = 1; + * i = 2; + * i = 3; + * + * // vector v contains A, 1, 2, 3, and Z + * @endcode + */ + insert_iterator& + operator=(const typename _Container::const_reference __value) + { + iter = container->insert(iter, __value); + ++iter; + return *this; + } + + /// Simply returns *this. + insert_iterator& + operator*() + { return *this; } + + /// Simply returns *this. (This %iterator does not "move".) + insert_iterator& + operator++() + { return *this; } + + /// Simply returns *this. (This %iterator does not "move".) + insert_iterator& + operator++(int) + { return *this; } + }; + + /** + * @param x A container of arbitrary type. + * @return An instance of insert_iterator working on @p x. + * + * This wrapper function helps in creating insert_iterator instances. + * Typing the name of the %iterator requires knowing the precise full + * type of the container, which can be tedious and impedes generic + * programming. Using this function lets you take advantage of automatic + * template parameter deduction, making the compiler match the correct + * types for you. + */ + template + inline insert_iterator<_Container> + inserter(_Container& __x, _Iterator __i) + { + return insert_iterator<_Container>(__x, + typename _Container::iterator(__i)); + } + +} // namespace std + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + + // This iterator adapter is 'normal' in the sense that it does not + // change the semantics of any of the operators of its iterator + // parameter. Its primary purpose is to convert an iterator that is + // not a class, e.g. a pointer, into an iterator that is a class. + // The _Container parameter exists solely so that different containers + // using this template can instantiate different types, even if the + // _Iterator parameter is the same. + using std::iterator_traits; + using std::iterator; + template + class __normal_iterator + { + protected: + _Iterator _M_current; + + public: + typedef typename iterator_traits<_Iterator>::iterator_category + iterator_category; + typedef typename iterator_traits<_Iterator>::value_type value_type; + typedef typename iterator_traits<_Iterator>::difference_type + difference_type; + typedef typename iterator_traits<_Iterator>::reference reference; + typedef typename iterator_traits<_Iterator>::pointer pointer; + + __normal_iterator() : _M_current(_Iterator()) { } + + explicit + __normal_iterator(const _Iterator& __i) : _M_current(__i) { } + + // Allow iterator to const_iterator conversion + template + __normal_iterator(const __normal_iterator<_Iter, + typename __enable_if< + (std::__are_same<_Iter, typename _Container::pointer>::__value), + _Container>::__type>& __i) + : _M_current(__i.base()) { } + + // Forward iterator requirements + reference + operator*() const + { return *_M_current; } + + pointer + operator->() const + { return _M_current; } + + __normal_iterator& + operator++() + { + ++_M_current; + return *this; + } + + __normal_iterator + operator++(int) + { return __normal_iterator(_M_current++); } + + // Bidirectional iterator requirements + __normal_iterator& + operator--() + { + --_M_current; + return *this; + } + + __normal_iterator + operator--(int) + { return __normal_iterator(_M_current--); } + + // Random access iterator requirements + reference + operator[](const difference_type& __n) const + { return _M_current[__n]; } + + __normal_iterator& + operator+=(const difference_type& __n) + { _M_current += __n; return *this; } + + __normal_iterator + operator+(const difference_type& __n) const + { return __normal_iterator(_M_current + __n); } + + __normal_iterator& + operator-=(const difference_type& __n) + { _M_current -= __n; return *this; } + + __normal_iterator + operator-(const difference_type& __n) const + { return __normal_iterator(_M_current - __n); } + + const _Iterator& + base() const + { return _M_current; } + }; + + // Note: In what follows, the left- and right-hand-side iterators are + // allowed to vary in types (conceptually in cv-qualification) so that + // comparaison between cv-qualified and non-cv-qualified iterators be + // valid. However, the greedy and unfriendly operators in std::rel_ops + // will make overload resolution ambiguous (when in scope) if we don't + // provide overloads whose operands are of the same type. Can someone + // remind me what generic programming is about? -- Gaby + + // Forward iterator requirements + template + inline bool + operator==(const __normal_iterator<_IteratorL, _Container>& __lhs, + const __normal_iterator<_IteratorR, _Container>& __rhs) + { return __lhs.base() == __rhs.base(); } + + template + inline bool + operator==(const __normal_iterator<_Iterator, _Container>& __lhs, + const __normal_iterator<_Iterator, _Container>& __rhs) + { return __lhs.base() == __rhs.base(); } + + template + inline bool + operator!=(const __normal_iterator<_IteratorL, _Container>& __lhs, + const __normal_iterator<_IteratorR, _Container>& __rhs) + { return __lhs.base() != __rhs.base(); } + + template + inline bool + operator!=(const __normal_iterator<_Iterator, _Container>& __lhs, + const __normal_iterator<_Iterator, _Container>& __rhs) + { return __lhs.base() != __rhs.base(); } + + // Random access iterator requirements + template + inline bool + operator<(const __normal_iterator<_IteratorL, _Container>& __lhs, + const __normal_iterator<_IteratorR, _Container>& __rhs) + { return __lhs.base() < __rhs.base(); } + + template + inline bool + operator<(const __normal_iterator<_Iterator, _Container>& __lhs, + const __normal_iterator<_Iterator, _Container>& __rhs) + { return __lhs.base() < __rhs.base(); } + + template + inline bool + operator>(const __normal_iterator<_IteratorL, _Container>& __lhs, + const __normal_iterator<_IteratorR, _Container>& __rhs) + { return __lhs.base() > __rhs.base(); } + + template + inline bool + operator>(const __normal_iterator<_Iterator, _Container>& __lhs, + const __normal_iterator<_Iterator, _Container>& __rhs) + { return __lhs.base() > __rhs.base(); } + + template + inline bool + operator<=(const __normal_iterator<_IteratorL, _Container>& __lhs, + const __normal_iterator<_IteratorR, _Container>& __rhs) + { return __lhs.base() <= __rhs.base(); } + + template + inline bool + operator<=(const __normal_iterator<_Iterator, _Container>& __lhs, + const __normal_iterator<_Iterator, _Container>& __rhs) + { return __lhs.base() <= __rhs.base(); } + + template + inline bool + operator>=(const __normal_iterator<_IteratorL, _Container>& __lhs, + const __normal_iterator<_IteratorR, _Container>& __rhs) + { return __lhs.base() >= __rhs.base(); } + + template + inline bool + operator>=(const __normal_iterator<_Iterator, _Container>& __lhs, + const __normal_iterator<_Iterator, _Container>& __rhs) + { return __lhs.base() >= __rhs.base(); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // According to the resolution of DR179 not only the various comparison + // operators but also operator- must accept mixed iterator/const_iterator + // parameters. + template + inline typename __normal_iterator<_IteratorL, _Container>::difference_type + operator-(const __normal_iterator<_IteratorL, _Container>& __lhs, + const __normal_iterator<_IteratorR, _Container>& __rhs) + { return __lhs.base() - __rhs.base(); } + + template + inline typename __normal_iterator<_Iterator, _Container>::difference_type + operator-(const __normal_iterator<_Iterator, _Container>& __lhs, + const __normal_iterator<_Iterator, _Container>& __rhs) + { return __lhs.base() - __rhs.base(); } + + template + inline __normal_iterator<_Iterator, _Container> + operator+(typename __normal_iterator<_Iterator, _Container>::difference_type + __n, const __normal_iterator<_Iterator, _Container>& __i) + { return __normal_iterator<_Iterator, _Container>(__i.base() + __n); } + +} // namespace std + +#endif diff --git a/cpp_src/stl_iterator_base_funcs.h b/cpp_src/stl_iterator_base_funcs.h new file mode 100644 index 0000000..769b931 --- /dev/null +++ b/cpp_src/stl_iterator_base_funcs.h @@ -0,0 +1,182 @@ +// Functions used by iterators -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996-1998 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_iterator_base_funcs.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + * + * This file contains all of the general iterator-related utility + * functions, such as distance() and advance(). + */ + +#ifndef _ITERATOR_BASE_FUNCS_H +#define _ITERATOR_BASE_FUNCS_H 1 + +#pragma GCC system_header +#include + +namespace std { + + template + inline typename iterator_traits<_InputIterator>::difference_type + __distance(_InputIterator __first, _InputIterator __last, + input_iterator_tag) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + + typename iterator_traits<_InputIterator>::difference_type __n = 0; + while (__first != __last) + { + ++__first; + ++__n; + } + return __n; + } + + template + inline typename iterator_traits<_RandomAccessIterator>::difference_type + __distance(_RandomAccessIterator __first, _RandomAccessIterator __last, + random_access_iterator_tag) + { + // concept requirements + __glibcxx_function_requires(_RandomAccessIteratorConcept< + _RandomAccessIterator>) + return __last - __first; + } + + /** + * @brief A generalization of pointer arithmetic. + * @param first An input iterator. + * @param last An input iterator. + * @return The distance between them. + * + * Returns @c n such that first + n == last. This requires that @p last + * must be reachable from @p first. Note that @c n may be negative. + * + * For random access iterators, this uses their @c + and @c - operations + * and are constant time. For other %iterator classes they are linear time. + */ + template + inline typename iterator_traits<_InputIterator>::difference_type + distance(_InputIterator __first, _InputIterator __last) + { + // concept requirements -- taken care of in __distance + return std::__distance(__first, __last, + std::__iterator_category(__first)); + } + + template + inline void + __advance(_InputIterator& __i, _Distance __n, input_iterator_tag) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + while (__n--) + ++__i; + } + + template + inline void + __advance(_BidirectionalIterator& __i, _Distance __n, + bidirectional_iterator_tag) + { + // concept requirements + __glibcxx_function_requires(_BidirectionalIteratorConcept< + _BidirectionalIterator>) + if (__n > 0) + while (__n--) + ++__i; + else + while (__n++) + --__i; + } + + template + inline void + __advance(_RandomAccessIterator& __i, _Distance __n, + random_access_iterator_tag) + { + // concept requirements + __glibcxx_function_requires(_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __i += __n; + } + + /** + * @brief A generalization of pointer arithmetic. + * @param i An input iterator. + * @param n The "delta" by which to change @p i. + * @return Nothing. + * + * This increments @p i by @p n. For bidirectional and random access + * iterators, @p n may be negative, in which case @p i is decremented. + * + * For random access iterators, this uses their @c + and @c - operations + * and are constant time. For other %iterator classes they are linear time. + */ + template + inline void + advance(_InputIterator& __i, _Distance __n) + { + // concept requirements -- taken care of in __advance + typename iterator_traits<_InputIterator>::difference_type __d = __n; + std::__advance(__i, __d, std::__iterator_category(__i)); + } + +} // namespace std + +#endif /* _ITERATOR_BASE_FUNCS_H */ diff --git a/cpp_src/stl_iterator_base_types.h b/cpp_src/stl_iterator_base_types.h new file mode 100644 index 0000000..316508f --- /dev/null +++ b/cpp_src/stl_iterator_base_types.h @@ -0,0 +1,170 @@ +// Types used in iterator implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2004, 2005 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996-1998 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_iterator_base_types.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + * + * This file contains all of the general iterator-related utility types, + * such as iterator_traits and struct iterator. + */ + +#ifndef _ITERATOR_BASE_TYPES_H +#define _ITERATOR_BASE_TYPES_H 1 + +#pragma GCC system_header + +namespace std { + + //@{ + /** + * @defgroup iterator_tags Iterator Tags + * These are empty types, used to distinguish different iterators. The + * distinction is not made by what they contain, but simply by what they + * are. Different underlying algorithms can then be used based on the + * different operations supporetd by different iterator types. + */ + /// Marking input iterators. + struct input_iterator_tag {}; + /// Marking output iterators. + struct output_iterator_tag {}; + /// Forward iterators support a superset of input iterator operations. + struct forward_iterator_tag : public input_iterator_tag {}; + /// Bidirectional iterators support a superset of forward iterator + /// operations. + struct bidirectional_iterator_tag : public forward_iterator_tag {}; + /// Random-access iterators support a superset of bidirectional iterator + /// operations. + struct random_access_iterator_tag : public bidirectional_iterator_tag {}; + //@} + + + /** + * @brief Common %iterator class. + * + * This class does nothing but define nested typedefs. %Iterator classes + * can inherit from this class to save some work. The typedefs are then + * used in specializations and overloading. + * + * In particular, there are no default implementations of requirements + * such as @c operator++ and the like. (How could there be?) + */ + template + struct iterator + { + /// One of the @link iterator_tags tag types@endlink. + typedef _Category iterator_category; + /// The type "pointed to" by the iterator. + typedef _Tp value_type; + /// Distance between iterators is represented as this type. + typedef _Distance difference_type; + /// This type represents a pointer-to-value_type. + typedef _Pointer pointer; + /// This type represents a reference-to-value_type. + typedef _Reference reference; + }; + + /** + * This class does nothing but define nested typedefs. The general + * version simply "forwards" the nested typedefs from the Iterator + * argument. Specialized versions for pointers and pointers-to-const + * provide tighter, more correct semantics. + */ + template + struct iterator_traits + { + typedef typename _Iterator::iterator_category iterator_category; + typedef typename _Iterator::value_type value_type; + typedef typename _Iterator::difference_type difference_type; + typedef typename _Iterator::pointer pointer; + typedef typename _Iterator::reference reference; + }; + + template + struct iterator_traits<_Tp*> + { + typedef random_access_iterator_tag iterator_category; + typedef _Tp value_type; + typedef ptrdiff_t difference_type; + typedef _Tp* pointer; + typedef _Tp& reference; + }; + + template + struct iterator_traits + { + typedef random_access_iterator_tag iterator_category; + typedef _Tp value_type; + typedef ptrdiff_t difference_type; + typedef const _Tp* pointer; + typedef const _Tp& reference; + }; + + /** + * @if maint + * This function is not a part of the C++ standard but is syntactic + * sugar for internal library use only. + * @endif + */ + template + inline typename iterator_traits<_Iter>::iterator_category + __iterator_category(const _Iter&) + { return typename iterator_traits<_Iter>::iterator_category(); } + +} // namespace std + +#endif /* _ITERATOR_BASE_TYPES_H */ + diff --git a/cpp_src/stl_list.h b/cpp_src/stl_list.h new file mode 100644 index 0000000..d498aa1 --- /dev/null +++ b/cpp_src/stl_list.h @@ -0,0 +1,1262 @@ +// List implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_list.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _LIST_H +#define _LIST_H 1 + +#include + +namespace std { + + // Supporting structures are split into common and templated types; the + // latter publicly inherits from the former in an effort to reduce code + // duplication. This results in some "needless" static_cast'ing later on, + // but it's all safe downcasting. + + /// @if maint Common part of a node in the %list. @endif + struct _List_node_base + { + _List_node_base* _M_next; ///< Self-explanatory + _List_node_base* _M_prev; ///< Self-explanatory + + static void + swap(_List_node_base& __x, _List_node_base& __y); + + void + transfer(_List_node_base * const __first, + _List_node_base * const __last); + + void + reverse(); + + void + hook(_List_node_base * const __position); + + void + unhook(); + }; + + /// @if maint An actual node in the %list. @endif + template + struct _List_node : public _List_node_base + { + _Tp _M_data; ///< User's data. + }; + + /** + * @brief A list::iterator. + * + * @if maint + * All the functions are op overloads. + * @endif + */ + template + struct _List_iterator + { + typedef _List_iterator<_Tp> _Self; + typedef _List_node<_Tp> _Node; + + typedef ptrdiff_t difference_type; + typedef std::bidirectional_iterator_tag iterator_category; + typedef _Tp value_type; + typedef _Tp* pointer; + typedef _Tp& reference; + + _List_iterator() + : _M_node() { } + + explicit + _List_iterator(_List_node_base* __x) + : _M_node(__x) { } + + // Must downcast from List_node_base to _List_node to get to _M_data. + reference + operator*() const + { return static_cast<_Node*>(_M_node)->_M_data; } + + pointer + operator->() const + { return &static_cast<_Node*>(_M_node)->_M_data; } + + _Self& + operator++() + { + _M_node = _M_node->_M_next; + return *this; + } + + _Self + operator++(int) + { + _Self __tmp = *this; + _M_node = _M_node->_M_next; + return __tmp; + } + + _Self& + operator--() + { + _M_node = _M_node->_M_prev; + return *this; + } + + _Self + operator--(int) + { + _Self __tmp = *this; + _M_node = _M_node->_M_prev; + return __tmp; + } + + bool + operator==(const _Self& __x) const + { return _M_node == __x._M_node; } + + bool + operator!=(const _Self& __x) const + { return _M_node != __x._M_node; } + + // The only member points to the %list element. + _List_node_base* _M_node; + }; + + /** + * @brief A list::const_iterator. + * + * @if maint + * All the functions are op overloads. + * @endif + */ + template + struct _List_const_iterator + { + typedef _List_const_iterator<_Tp> _Self; + typedef const _List_node<_Tp> _Node; + typedef _List_iterator<_Tp> iterator; + + typedef ptrdiff_t difference_type; + typedef std::bidirectional_iterator_tag iterator_category; + typedef _Tp value_type; + typedef const _Tp* pointer; + typedef const _Tp& reference; + + _List_const_iterator() + : _M_node() { } + + explicit + _List_const_iterator(const _List_node_base* __x) + : _M_node(__x) { } + + _List_const_iterator(const iterator& __x) + : _M_node(__x._M_node) { } + + // Must downcast from List_node_base to _List_node to get to + // _M_data. + reference + operator*() const + { return static_cast<_Node*>(_M_node)->_M_data; } + + pointer + operator->() const + { return &static_cast<_Node*>(_M_node)->_M_data; } + + _Self& + operator++() + { + _M_node = _M_node->_M_next; + return *this; + } + + _Self + operator++(int) + { + _Self __tmp = *this; + _M_node = _M_node->_M_next; + return __tmp; + } + + _Self& + operator--() + { + _M_node = _M_node->_M_prev; + return *this; + } + + _Self + operator--(int) + { + _Self __tmp = *this; + _M_node = _M_node->_M_prev; + return __tmp; + } + + bool + operator==(const _Self& __x) const + { return _M_node == __x._M_node; } + + bool + operator!=(const _Self& __x) const + { return _M_node != __x._M_node; } + + // The only member points to the %list element. + const _List_node_base* _M_node; + }; + + template + inline bool + operator==(const _List_iterator<_Val>& __x, + const _List_const_iterator<_Val>& __y) + { return __x._M_node == __y._M_node; } + + template + inline bool + operator!=(const _List_iterator<_Val>& __x, + const _List_const_iterator<_Val>& __y) + { return __x._M_node != __y._M_node; } + + + /** + * @if maint + * See bits/stl_deque.h's _Deque_base for an explanation. + * @endif + */ + template + class _List_base + { + protected: + // NOTA BENE + // The stored instance is not actually of "allocator_type"'s + // type. Instead we rebind the type to + // Allocator>, which according to [20.1.5]/4 + // should probably be the same. List_node is not the same + // size as Tp (it's two pointers larger), and specializations on + // Tp may go unused because List_node is being bound + // instead. + // + // We put this to the test in the constructors and in + // get_allocator, where we use conversions between + // allocator_type and _Node_alloc_type. The conversion is + // required by table 32 in [20.1.5]. + typedef typename _Alloc::template rebind<_List_node<_Tp> >::other + _Node_alloc_type; + + typedef typename _Alloc::template rebind<_Tp>::other _Tp_alloc_type; + + struct _List_impl + : public _Node_alloc_type + { + _List_node_base _M_node; + + _List_impl(const _Node_alloc_type& __a) + : _Node_alloc_type(__a), _M_node() + { } + }; + + _List_impl _M_impl; + + _List_node<_Tp>* + _M_get_node() + { return _M_impl._Node_alloc_type::allocate(1); } + + void + _M_put_node(_List_node<_Tp>* __p) + { _M_impl._Node_alloc_type::deallocate(__p, 1); } + + public: + typedef _Alloc allocator_type; + + _Node_alloc_type& + _M_get_Node_allocator() + { return *static_cast<_Node_alloc_type*>(&this->_M_impl); } + + const _Node_alloc_type& + _M_get_Node_allocator() const + { return *static_cast(&this->_M_impl); } + + _Tp_alloc_type + _M_get_Tp_allocator() const + { return _Tp_alloc_type(_M_get_Node_allocator()); } + + allocator_type + get_allocator() const + { return allocator_type(_M_get_Node_allocator()); } + + _List_base(const allocator_type& __a) + : _M_impl(__a) + { _M_init(); } + + // This is what actually destroys the list. + ~_List_base() + { _M_clear(); } + + void + _M_clear(); + + void + _M_init() + { + this->_M_impl._M_node._M_next = &this->_M_impl._M_node; + this->_M_impl._M_node._M_prev = &this->_M_impl._M_node; + } + }; + + /** + * @brief A standard container with linear time access to elements, + * and fixed time insertion/deletion at any point in the sequence. + * + * @ingroup Containers + * @ingroup Sequences + * + * Meets the requirements of a container, a + * reversible container, and a + * sequence, including the + * optional sequence requirements with the + * %exception of @c at and @c operator[]. + * + * This is a @e doubly @e linked %list. Traversal up and down the + * %list requires linear time, but adding and removing elements (or + * @e nodes) is done in constant time, regardless of where the + * change takes place. Unlike std::vector and std::deque, + * random-access iterators are not provided, so subscripting ( @c + * [] ) access is not allowed. For algorithms which only need + * sequential access, this lack makes no difference. + * + * Also unlike the other standard containers, std::list provides + * specialized algorithms %unique to linked lists, such as + * splicing, sorting, and in-place reversal. + * + * @if maint + * A couple points on memory allocation for list: + * + * First, we never actually allocate a Tp, we allocate + * List_node's and trust [20.1.5]/4 to DTRT. This is to ensure + * that after elements from %list are spliced into + * %list, destroying the memory of the second %list is a + * valid operation, i.e., Alloc1 giveth and Alloc2 taketh away. + * + * Second, a %list conceptually represented as + * @code + * A <---> B <---> C <---> D + * @endcode + * is actually circular; a link exists between A and D. The %list + * class holds (as its only data member) a private list::iterator + * pointing to @e D, not to @e A! To get to the head of the %list, + * we start at the tail and move forward by one. When this member + * iterator's next/previous pointers refer to itself, the %list is + * %empty. @endif + */ + template > + class list : protected _List_base<_Tp, _Alloc> + { + // concept requirements + typedef typename _Alloc::value_type _Alloc_value_type; + __glibcxx_class_requires(_Tp, _SGIAssignableConcept) + __glibcxx_class_requires2(_Tp, _Alloc_value_type, _SameTypeConcept) + + typedef _List_base<_Tp, _Alloc> _Base; + typedef typename _Base::_Tp_alloc_type _Tp_alloc_type; + + public: + typedef _Tp value_type; + typedef typename _Tp_alloc_type::pointer pointer; + typedef typename _Tp_alloc_type::const_pointer const_pointer; + typedef typename _Tp_alloc_type::reference reference; + typedef typename _Tp_alloc_type::const_reference const_reference; + typedef _List_iterator<_Tp> iterator; + typedef _List_const_iterator<_Tp> const_iterator; + typedef std::reverse_iterator const_reverse_iterator; + typedef std::reverse_iterator reverse_iterator; + typedef size_t size_type; + typedef ptrdiff_t difference_type; + typedef _Alloc allocator_type; + + protected: + // Note that pointers-to-_Node's can be ctor-converted to + // iterator types. + typedef _List_node<_Tp> _Node; + + using _Base::_M_impl; + using _Base::_M_put_node; + using _Base::_M_get_node; + using _Base::_M_get_Tp_allocator; + using _Base::_M_get_Node_allocator; + + /** + * @if maint + * @param x An instance of user data. + * + * Allocates space for a new node and constructs a copy of @a x in it. + * @endif + */ + _Node* + _M_create_node(const value_type& __x) + { + _Node* __p = this->_M_get_node(); + try + { + _M_get_Tp_allocator().construct(&__p->_M_data, __x); + } + catch(...) + { + _M_put_node(__p); + __throw_exception_again; + } + return __p; + } + + public: + // [23.2.2.1] construct/copy/destroy + // (assign() and get_allocator() are also listed in this section) + /** + * @brief Default constructor creates no elements. + */ + explicit + list(const allocator_type& __a = allocator_type()) + : _Base(__a) { } + + /** + * @brief Create a %list with copies of an exemplar element. + * @param n The number of elements to initially create. + * @param value An element to copy. + * + * This constructor fills the %list with @a n copies of @a value. + */ + explicit + list(size_type __n, const value_type& __value = value_type(), + const allocator_type& __a = allocator_type()) + : _Base(__a) + { _M_fill_initialize(__n, __value); } + + /** + * @brief %List copy constructor. + * @param x A %list of identical element and allocator types. + * + * The newly-created %list uses a copy of the allocation object used + * by @a x. + */ + list(const list& __x) + : _Base(__x._M_get_Node_allocator()) + { _M_initialize_dispatch(__x.begin(), __x.end(), __false_type()); } + + /** + * @brief Builds a %list from a range. + * @param first An input iterator. + * @param last An input iterator. + * + * Create a %list consisting of copies of the elements from + * [@a first,@a last). This is linear in N (where N is + * distance(@a first,@a last)). + */ + template + list(_InputIterator __first, _InputIterator __last, + const allocator_type& __a = allocator_type()) + : _Base(__a) + { + // Check whether it's an integral type. If so, it's not an iterator. + typedef typename std::__is_integer<_InputIterator>::__type _Integral; + _M_initialize_dispatch(__first, __last, _Integral()); + } + + /** + * No explicit dtor needed as the _Base dtor takes care of + * things. The _Base dtor only erases the elements, and note + * that if the elements themselves are pointers, the pointed-to + * memory is not touched in any way. Managing the pointer is + * the user's responsibilty. + */ + + /** + * @brief %List assignment operator. + * @param x A %list of identical element and allocator types. + * + * All the elements of @a x are copied, but unlike the copy + * constructor, the allocator object is not copied. + */ + list& + operator=(const list& __x); + + /** + * @brief Assigns a given value to a %list. + * @param n Number of elements to be assigned. + * @param val Value to be assigned. + * + * This function fills a %list with @a n copies of the given + * value. Note that the assignment completely changes the %list + * and that the resulting %list's size is the same as the number + * of elements assigned. Old data may be lost. + */ + void + assign(size_type __n, const value_type& __val) + { _M_fill_assign(__n, __val); } + + /** + * @brief Assigns a range to a %list. + * @param first An input iterator. + * @param last An input iterator. + * + * This function fills a %list with copies of the elements in the + * range [@a first,@a last). + * + * Note that the assignment completely changes the %list and + * that the resulting %list's size is the same as the number of + * elements assigned. Old data may be lost. + */ + template + void + assign(_InputIterator __first, _InputIterator __last) + { + // Check whether it's an integral type. If so, it's not an iterator. + typedef typename std::__is_integer<_InputIterator>::__type _Integral; + _M_assign_dispatch(__first, __last, _Integral()); + } + + /// Get a copy of the memory allocation object. + allocator_type + get_allocator() const + { return _Base::get_allocator(); } + + // iterators + /** + * Returns a read/write iterator that points to the first element in the + * %list. Iteration is done in ordinary element order. + */ + iterator + begin() + { return iterator(this->_M_impl._M_node._M_next); } + + /** + * Returns a read-only (constant) iterator that points to the + * first element in the %list. Iteration is done in ordinary + * element order. + */ + const_iterator + begin() const + { return const_iterator(this->_M_impl._M_node._M_next); } + + /** + * Returns a read/write iterator that points one past the last + * element in the %list. Iteration is done in ordinary element + * order. + */ + iterator + end() + { return iterator(&this->_M_impl._M_node); } + + /** + * Returns a read-only (constant) iterator that points one past + * the last element in the %list. Iteration is done in ordinary + * element order. + */ + const_iterator + end() const + { return const_iterator(&this->_M_impl._M_node); } + + /** + * Returns a read/write reverse iterator that points to the last + * element in the %list. Iteration is done in reverse element + * order. + */ + reverse_iterator + rbegin() + { return reverse_iterator(end()); } + + /** + * Returns a read-only (constant) reverse iterator that points to + * the last element in the %list. Iteration is done in reverse + * element order. + */ + const_reverse_iterator + rbegin() const + { return const_reverse_iterator(end()); } + + /** + * Returns a read/write reverse iterator that points to one + * before the first element in the %list. Iteration is done in + * reverse element order. + */ + reverse_iterator + rend() + { return reverse_iterator(begin()); } + + /** + * Returns a read-only (constant) reverse iterator that points to one + * before the first element in the %list. Iteration is done in reverse + * element order. + */ + const_reverse_iterator + rend() const + { return const_reverse_iterator(begin()); } + + // [23.2.2.2] capacity + /** + * Returns true if the %list is empty. (Thus begin() would equal + * end().) + */ + bool + empty() const + { return this->_M_impl._M_node._M_next == &this->_M_impl._M_node; } + + /** Returns the number of elements in the %list. */ + size_type + size() const + { return std::distance(begin(), end()); } + + /** Returns the size() of the largest possible %list. */ + size_type + max_size() const + { return _M_get_Tp_allocator().max_size(); } + + /** + * @brief Resizes the %list to the specified number of elements. + * @param new_size Number of elements the %list should contain. + * @param x Data with which new elements should be populated. + * + * This function will %resize the %list to the specified number + * of elements. If the number is smaller than the %list's + * current size the %list is truncated, otherwise the %list is + * extended and new elements are populated with given data. + */ + void + resize(size_type __new_size, value_type __x = value_type()); + + // element access + /** + * Returns a read/write reference to the data at the first + * element of the %list. + */ + reference + front() + { return *begin(); } + + /** + * Returns a read-only (constant) reference to the data at the first + * element of the %list. + */ + const_reference + front() const + { return *begin(); } + + /** + * Returns a read/write reference to the data at the last element + * of the %list. + */ + reference + back() + { + iterator __tmp = end(); + --__tmp; + return *__tmp; + } + + /** + * Returns a read-only (constant) reference to the data at the last + * element of the %list. + */ + const_reference + back() const + { + const_iterator __tmp = end(); + --__tmp; + return *__tmp; + } + + // [23.2.2.3] modifiers + /** + * @brief Add data to the front of the %list. + * @param x Data to be added. + * + * This is a typical stack operation. The function creates an + * element at the front of the %list and assigns the given data + * to it. Due to the nature of a %list this operation can be + * done in constant time, and does not invalidate iterators and + * references. + */ + void + push_front(const value_type& __x) + { this->_M_insert(begin(), __x); } + + /** + * @brief Removes first element. + * + * This is a typical stack operation. It shrinks the %list by + * one. Due to the nature of a %list this operation can be done + * in constant time, and only invalidates iterators/references to + * the element being removed. + * + * Note that no data is returned, and if the first element's data + * is needed, it should be retrieved before pop_front() is + * called. + */ + void + pop_front() + { this->_M_erase(begin()); } + + /** + * @brief Add data to the end of the %list. + * @param x Data to be added. + * + * This is a typical stack operation. The function creates an + * element at the end of the %list and assigns the given data to + * it. Due to the nature of a %list this operation can be done + * in constant time, and does not invalidate iterators and + * references. + */ + void + push_back(const value_type& __x) + { this->_M_insert(end(), __x); } + + /** + * @brief Removes last element. + * + * This is a typical stack operation. It shrinks the %list by + * one. Due to the nature of a %list this operation can be done + * in constant time, and only invalidates iterators/references to + * the element being removed. + * + * Note that no data is returned, and if the last element's data + * is needed, it should be retrieved before pop_back() is called. + */ + void + pop_back() + { this->_M_erase(iterator(this->_M_impl._M_node._M_prev)); } + + /** + * @brief Inserts given value into %list before specified iterator. + * @param position An iterator into the %list. + * @param x Data to be inserted. + * @return An iterator that points to the inserted data. + * + * This function will insert a copy of the given value before + * the specified location. Due to the nature of a %list this + * operation can be done in constant time, and does not + * invalidate iterators and references. + */ + iterator + insert(iterator __position, const value_type& __x); + + /** + * @brief Inserts a number of copies of given data into the %list. + * @param position An iterator into the %list. + * @param n Number of elements to be inserted. + * @param x Data to be inserted. + * + * This function will insert a specified number of copies of the + * given data before the location specified by @a position. + * + * This operation is linear in the number of elements inserted and + * does not invalidate iterators and references. + */ + void + insert(iterator __position, size_type __n, const value_type& __x) + { + list __tmp(__n, __x, _M_get_Node_allocator()); + splice(__position, __tmp); + } + + /** + * @brief Inserts a range into the %list. + * @param position An iterator into the %list. + * @param first An input iterator. + * @param last An input iterator. + * + * This function will insert copies of the data in the range [@a + * first,@a last) into the %list before the location specified by + * @a position. + * + * This operation is linear in the number of elements inserted and + * does not invalidate iterators and references. + */ + template + void + insert(iterator __position, _InputIterator __first, + _InputIterator __last) + { + list __tmp(__first, __last, _M_get_Node_allocator()); + splice(__position, __tmp); + } + + /** + * @brief Remove element at given position. + * @param position Iterator pointing to element to be erased. + * @return An iterator pointing to the next element (or end()). + * + * This function will erase the element at the given position and thus + * shorten the %list by one. + * + * Due to the nature of a %list this operation can be done in + * constant time, and only invalidates iterators/references to + * the element being removed. The user is also cautioned that + * this function only erases the element, and that if the element + * is itself a pointer, the pointed-to memory is not touched in + * any way. Managing the pointer is the user's responsibilty. + */ + iterator + erase(iterator __position); + + /** + * @brief Remove a range of elements. + * @param first Iterator pointing to the first element to be erased. + * @param last Iterator pointing to one past the last element to be + * erased. + * @return An iterator pointing to the element pointed to by @a last + * prior to erasing (or end()). + * + * This function will erase the elements in the range @a + * [first,last) and shorten the %list accordingly. + * + * This operation is linear time in the size of the range and only + * invalidates iterators/references to the element being removed. + * The user is also cautioned that this function only erases the + * elements, and that if the elements themselves are pointers, the + * pointed-to memory is not touched in any way. Managing the pointer + * is the user's responsibilty. + */ + iterator + erase(iterator __first, iterator __last) + { + while (__first != __last) + __first = erase(__first); + return __last; + } + + /** + * @brief Swaps data with another %list. + * @param x A %list of the same element and allocator types. + * + * This exchanges the elements between two lists in constant + * time. Note that the global std::swap() function is + * specialized such that std::swap(l1,l2) will feed to this + * function. + */ + void + swap(list& __x) + { + _List_node_base::swap(this->_M_impl._M_node, __x._M_impl._M_node); + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 431. Swapping containers with unequal allocators. + std::__alloc_swap:: + _S_do_it(_M_get_Node_allocator(), __x._M_get_Node_allocator()); + } + + /** + * Erases all the elements. Note that this function only erases + * the elements, and that if the elements themselves are + * pointers, the pointed-to memory is not touched in any way. + * Managing the pointer is the user's responsibilty. + */ + void + clear() + { + _Base::_M_clear(); + _Base::_M_init(); + } + + // [23.2.2.4] list operations + /** + * @brief Insert contents of another %list. + * @param position Iterator referencing the element to insert before. + * @param x Source list. + * + * The elements of @a x are inserted in constant time in front of + * the element referenced by @a position. @a x becomes an empty + * list. + * + * Requires this != @a x. + */ + void + splice(iterator __position, list& __x) + { + if (!__x.empty()) + { + _M_check_equal_allocators(__x); + + this->_M_transfer(__position, __x.begin(), __x.end()); + } + } + + /** + * @brief Insert element from another %list. + * @param position Iterator referencing the element to insert before. + * @param x Source list. + * @param i Iterator referencing the element to move. + * + * Removes the element in list @a x referenced by @a i and + * inserts it into the current list before @a position. + */ + void + splice(iterator __position, list& __x, iterator __i) + { + iterator __j = __i; + ++__j; + if (__position == __i || __position == __j) + return; + + if (this != &__x) + _M_check_equal_allocators(__x); + + this->_M_transfer(__position, __i, __j); + } + + /** + * @brief Insert range from another %list. + * @param position Iterator referencing the element to insert before. + * @param x Source list. + * @param first Iterator referencing the start of range in x. + * @param last Iterator referencing the end of range in x. + * + * Removes elements in the range [first,last) and inserts them + * before @a position in constant time. + * + * Undefined if @a position is in [first,last). + */ + void + splice(iterator __position, list& __x, iterator __first, iterator __last) + { + if (__first != __last) + { + if (this != &__x) + _M_check_equal_allocators(__x); + + this->_M_transfer(__position, __first, __last); + } + } + + /** + * @brief Remove all elements equal to value. + * @param value The value to remove. + * + * Removes every element in the list equal to @a value. + * Remaining elements stay in list order. Note that this + * function only erases the elements, and that if the elements + * themselves are pointers, the pointed-to memory is not + * touched in any way. Managing the pointer is the user's + * responsibilty. + */ + void + remove(const _Tp& __value); + + /** + * @brief Remove all elements satisfying a predicate. + * @param Predicate Unary predicate function or object. + * + * Removes every element in the list for which the predicate + * returns true. Remaining elements stay in list order. Note + * that this function only erases the elements, and that if the + * elements themselves are pointers, the pointed-to memory is + * not touched in any way. Managing the pointer is the user's + * responsibilty. + */ + template + void + remove_if(_Predicate); + + /** + * @brief Remove consecutive duplicate elements. + * + * For each consecutive set of elements with the same value, + * remove all but the first one. Remaining elements stay in + * list order. Note that this function only erases the + * elements, and that if the elements themselves are pointers, + * the pointed-to memory is not touched in any way. Managing + * the pointer is the user's responsibilty. + */ + void + unique(); + + /** + * @brief Remove consecutive elements satisfying a predicate. + * @param BinaryPredicate Binary predicate function or object. + * + * For each consecutive set of elements [first,last) that + * satisfy predicate(first,i) where i is an iterator in + * [first,last), remove all but the first one. Remaining + * elements stay in list order. Note that this function only + * erases the elements, and that if the elements themselves are + * pointers, the pointed-to memory is not touched in any way. + * Managing the pointer is the user's responsibilty. + */ + template + void + unique(_BinaryPredicate); + + /** + * @brief Merge sorted lists. + * @param x Sorted list to merge. + * + * Assumes that both @a x and this list are sorted according to + * operator<(). Merges elements of @a x into this list in + * sorted order, leaving @a x empty when complete. Elements in + * this list precede elements in @a x that are equal. + */ + void + merge(list& __x); + + /** + * @brief Merge sorted lists according to comparison function. + * @param x Sorted list to merge. + * @param StrictWeakOrdering Comparison function definining + * sort order. + * + * Assumes that both @a x and this list are sorted according to + * StrictWeakOrdering. Merges elements of @a x into this list + * in sorted order, leaving @a x empty when complete. Elements + * in this list precede elements in @a x that are equivalent + * according to StrictWeakOrdering(). + */ + template + void + merge(list&, _StrictWeakOrdering); + + /** + * @brief Reverse the elements in list. + * + * Reverse the order of elements in the list in linear time. + */ + void + reverse() + { this->_M_impl._M_node.reverse(); } + + /** + * @brief Sort the elements. + * + * Sorts the elements of this list in NlogN time. Equivalent + * elements remain in list order. + */ + void + sort(); + + /** + * @brief Sort the elements according to comparison function. + * + * Sorts the elements of this list in NlogN time. Equivalent + * elements remain in list order. + */ + template + void + sort(_StrictWeakOrdering); + + protected: + // Internal constructor functions follow. + + // Called by the range constructor to implement [23.1.1]/9 + template + void + _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) + { + _M_fill_initialize(static_cast(__n), + static_cast(__x)); + } + + // Called by the range constructor to implement [23.1.1]/9 + template + void + _M_initialize_dispatch(_InputIterator __first, _InputIterator __last, + __false_type) + { + for (; __first != __last; ++__first) + push_back(*__first); + } + + // Called by list(n,v,a), and the range constructor when it turns out + // to be the same thing. + void + _M_fill_initialize(size_type __n, const value_type& __x) + { + for (; __n > 0; --__n) + push_back(__x); + } + + + // Internal assign functions follow. + + // Called by the range assign to implement [23.1.1]/9 + template + void + _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) + { + _M_fill_assign(static_cast(__n), + static_cast(__val)); + } + + // Called by the range assign to implement [23.1.1]/9 + template + void + _M_assign_dispatch(_InputIterator __first, _InputIterator __last, + __false_type); + + // Called by assign(n,t), and the range assign when it turns out + // to be the same thing. + void + _M_fill_assign(size_type __n, const value_type& __val); + + + // Moves the elements from [first,last) before position. + void + _M_transfer(iterator __position, iterator __first, iterator __last) + { __position._M_node->transfer(__first._M_node, __last._M_node); } + + // Inserts new element at position given and with value given. + void + _M_insert(iterator __position, const value_type& __x) + { + _Node* __tmp = _M_create_node(__x); + __tmp->hook(__position._M_node); + } + + // Erases element at position given. + void + _M_erase(iterator __position) + { + __position._M_node->unhook(); + _Node* __n = static_cast<_Node*>(__position._M_node); + _M_get_Tp_allocator().destroy(&__n->_M_data); + _M_put_node(__n); + } + + // To implement the splice (and merge) bits of N1599. + void + _M_check_equal_allocators(list& __x) + { + if (_M_get_Node_allocator() != __x._M_get_Node_allocator()) + __throw_runtime_error(__N("list::_M_check_equal_allocators")); + } + }; + + /** + * @brief List equality comparison. + * @param x A %list. + * @param y A %list of the same type as @a x. + * @return True iff the size and elements of the lists are equal. + * + * This is an equivalence relation. It is linear in the size of + * the lists. Lists are considered equivalent if their sizes are + * equal, and if corresponding elements compare equal. + */ + template + inline bool + operator==(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) + { + typedef typename list<_Tp, _Alloc>::const_iterator const_iterator; + const_iterator __end1 = __x.end(); + const_iterator __end2 = __y.end(); + + const_iterator __i1 = __x.begin(); + const_iterator __i2 = __y.begin(); + while (__i1 != __end1 && __i2 != __end2 && *__i1 == *__i2) + { + ++__i1; + ++__i2; + } + return __i1 == __end1 && __i2 == __end2; + } + + /** + * @brief List ordering relation. + * @param x A %list. + * @param y A %list of the same type as @a x. + * @return True iff @a x is lexicographically less than @a y. + * + * This is a total ordering relation. It is linear in the size of the + * lists. The elements must be comparable with @c <. + * + * See std::lexicographical_compare() for how the determination is made. + */ + template + inline bool + operator<(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) + { return std::lexicographical_compare(__x.begin(), __x.end(), + __y.begin(), __y.end()); } + + /// Based on operator== + template + inline bool + operator!=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) + { return !(__x == __y); } + + /// Based on operator< + template + inline bool + operator>(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) + { return __y < __x; } + + /// Based on operator< + template + inline bool + operator<=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) + { return !(__y < __x); } + + /// Based on operator< + template + inline bool + operator>=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) + { return !(__x < __y); } + + /// See std::list::swap(). + template + inline void + swap(list<_Tp, _Alloc>& __x, list<_Tp, _Alloc>& __y) + { __x.swap(__y); } + +} // namespace std + +#endif /* _LIST_H */ + diff --git a/cpp_src/stl_map.h b/cpp_src/stl_map.h new file mode 100644 index 0000000..c63cf7a --- /dev/null +++ b/cpp_src/stl_map.h @@ -0,0 +1,740 @@ +// Map implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_map.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _MAP_H +#define _MAP_H 1 + +#include +#include + +namespace std { + + /** + * @brief A standard container made up of (key,value) pairs, which can be + * retrieved based on a key, in logarithmic time. + * + * @ingroup Containers + * @ingroup Assoc_containers + * + * Meets the requirements of a container, a + * reversible container, and an + * associative container (using unique keys). + * For a @c map the key_type is Key, the mapped_type is T, and the + * value_type is std::pair. + * + * Maps support bidirectional iterators. + * + * @if maint + * The private tree data is declared exactly the same way for map and + * multimap; the distinction is made entirely in how the tree functions are + * called (*_unique versus *_equal, same as the standard). + * @endif + */ + template , + typename _Alloc = std::allocator > > + class map + { + public: + typedef _Key key_type; + typedef _Tp mapped_type; + typedef std::pair value_type; + typedef _Compare key_compare; + typedef _Alloc allocator_type; + + private: + // concept requirements + typedef typename _Alloc::value_type _Alloc_value_type; + __glibcxx_class_requires(_Tp, _SGIAssignableConcept) + __glibcxx_class_requires4(_Compare, bool, _Key, _Key, + _BinaryFunctionConcept) + __glibcxx_class_requires2(value_type, _Alloc_value_type, _SameTypeConcept) + + public: + class value_compare + : public std::binary_function + { + friend class map<_Key, _Tp, _Compare, _Alloc>; + protected: + _Compare comp; + + value_compare(_Compare __c) + : comp(__c) { } + + public: + bool operator()(const value_type& __x, const value_type& __y) const + { return comp(__x.first, __y.first); } + }; + + private: + /// @if maint This turns a red-black tree into a [multi]map. @endif + typedef typename _Alloc::template rebind::other + _Pair_alloc_type; + + typedef _Rb_tree, + key_compare, _Pair_alloc_type> _Rep_type; + + /// @if maint The actual tree structure. @endif + _Rep_type _M_t; + + public: + // many of these are specified differently in ISO, but the following are + // "functionally equivalent" + typedef typename _Pair_alloc_type::pointer pointer; + typedef typename _Pair_alloc_type::const_pointer const_pointer; + typedef typename _Pair_alloc_type::reference reference; + typedef typename _Pair_alloc_type::const_reference const_reference; + typedef typename _Rep_type::iterator iterator; + typedef typename _Rep_type::const_iterator const_iterator; + typedef typename _Rep_type::size_type size_type; + typedef typename _Rep_type::difference_type difference_type; + typedef typename _Rep_type::reverse_iterator reverse_iterator; + typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator; + + // [23.3.1.1] construct/copy/destroy + // (get_allocator() is normally listed in this section, but seems to have + // been accidentally omitted in the printed standard) + /** + * @brief Default constructor creates no elements. + */ + map() + : _M_t(_Compare(), allocator_type()) { } + + // for some reason this was made a separate function + /** + * @brief Default constructor creates no elements. + */ + explicit + map(const _Compare& __comp, const allocator_type& __a = allocator_type()) + : _M_t(__comp, __a) { } + + /** + * @brief Map copy constructor. + * @param x A %map of identical element and allocator types. + * + * The newly-created %map uses a copy of the allocation object used + * by @a x. + */ + map(const map& __x) + : _M_t(__x._M_t) { } + + /** + * @brief Builds a %map from a range. + * @param first An input iterator. + * @param last An input iterator. + * + * Create a %map consisting of copies of the elements from [first,last). + * This is linear in N if the range is already sorted, and NlogN + * otherwise (where N is distance(first,last)). + */ + template + map(_InputIterator __first, _InputIterator __last) + : _M_t(_Compare(), allocator_type()) + { _M_t._M_insert_unique(__first, __last); } + + /** + * @brief Builds a %map from a range. + * @param first An input iterator. + * @param last An input iterator. + * @param comp A comparison functor. + * @param a An allocator object. + * + * Create a %map consisting of copies of the elements from [first,last). + * This is linear in N if the range is already sorted, and NlogN + * otherwise (where N is distance(first,last)). + */ + template + map(_InputIterator __first, _InputIterator __last, + const _Compare& __comp, const allocator_type& __a = allocator_type()) + : _M_t(__comp, __a) + { _M_t._M_insert_unique(__first, __last); } + + // FIXME There is no dtor declared, but we should have something + // generated by Doxygen. I don't know what tags to add to this + // paragraph to make that happen: + /** + * The dtor only erases the elements, and note that if the elements + * themselves are pointers, the pointed-to memory is not touched in any + * way. Managing the pointer is the user's responsibilty. + */ + + /** + * @brief Map assignment operator. + * @param x A %map of identical element and allocator types. + * + * All the elements of @a x are copied, but unlike the copy constructor, + * the allocator object is not copied. + */ + map& + operator=(const map& __x) + { + _M_t = __x._M_t; + return *this; + } + + /// Get a copy of the memory allocation object. + allocator_type + get_allocator() const + { return _M_t.get_allocator(); } + + // iterators + /** + * Returns a read/write iterator that points to the first pair in the + * %map. + * Iteration is done in ascending order according to the keys. + */ + iterator + begin() + { return _M_t.begin(); } + + /** + * Returns a read-only (constant) iterator that points to the first pair + * in the %map. Iteration is done in ascending order according to the + * keys. + */ + const_iterator + begin() const + { return _M_t.begin(); } + + /** + * Returns a read/write iterator that points one past the last + * pair in the %map. Iteration is done in ascending order + * according to the keys. + */ + iterator + end() + { return _M_t.end(); } + + /** + * Returns a read-only (constant) iterator that points one past the last + * pair in the %map. Iteration is done in ascending order according to + * the keys. + */ + const_iterator + end() const + { return _M_t.end(); } + + /** + * Returns a read/write reverse iterator that points to the last pair in + * the %map. Iteration is done in descending order according to the + * keys. + */ + reverse_iterator + rbegin() + { return _M_t.rbegin(); } + + /** + * Returns a read-only (constant) reverse iterator that points to the + * last pair in the %map. Iteration is done in descending order + * according to the keys. + */ + const_reverse_iterator + rbegin() const + { return _M_t.rbegin(); } + + /** + * Returns a read/write reverse iterator that points to one before the + * first pair in the %map. Iteration is done in descending order + * according to the keys. + */ + reverse_iterator + rend() + { return _M_t.rend(); } + + /** + * Returns a read-only (constant) reverse iterator that points to one + * before the first pair in the %map. Iteration is done in descending + * order according to the keys. + */ + const_reverse_iterator + rend() const + { return _M_t.rend(); } + + // capacity + /** Returns true if the %map is empty. (Thus begin() would equal + * end().) + */ + bool + empty() const + { return _M_t.empty(); } + + /** Returns the size of the %map. */ + size_type + size() const + { return _M_t.size(); } + + /** Returns the maximum size of the %map. */ + size_type + max_size() const + { return _M_t.max_size(); } + + // [23.3.1.2] element access + /** + * @brief Subscript ( @c [] ) access to %map data. + * @param k The key for which data should be retrieved. + * @return A reference to the data of the (key,data) %pair. + * + * Allows for easy lookup with the subscript ( @c [] ) + * operator. Returns data associated with the key specified in + * subscript. If the key does not exist, a pair with that key + * is created using default values, which is then returned. + * + * Lookup requires logarithmic time. + */ + mapped_type& + operator[](const key_type& __k) + { + // concept requirements + __glibcxx_function_requires(_DefaultConstructibleConcept) + + iterator __i = lower_bound(__k); + // __i->first is greater than or equivalent to __k. + if (__i == end() || key_comp()(__k, (*__i).first)) + __i = insert(__i, value_type(__k, mapped_type())); + return (*__i).second; + } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 464. Suggestion for new member functions in standard containers. + /** + * @brief Access to %map data. + * @param k The key for which data should be retrieved. + * @return A reference to the data whose key is equivalent to @a k, if + * such a data is present in the %map. + * @throw std::out_of_range If no such data is present. + */ + mapped_type& + at(const key_type& __k) + { + iterator __i = lower_bound(__k); + if (__i == end() || key_comp()(__k, (*__i).first)) + __throw_out_of_range(__N("map::at")); + return (*__i).second; + } + + const mapped_type& + at(const key_type& __k) const + { + const_iterator __i = lower_bound(__k); + if (__i == end() || key_comp()(__k, (*__i).first)) + __throw_out_of_range(__N("map::at")); + return (*__i).second; + } + + // modifiers + /** + * @brief Attempts to insert a std::pair into the %map. + + * @param x Pair to be inserted (see std::make_pair for easy creation + * of pairs). + + * @return A pair, of which the first element is an iterator that + * points to the possibly inserted pair, and the second is + * a bool that is true if the pair was actually inserted. + * + * This function attempts to insert a (key, value) %pair into the %map. + * A %map relies on unique keys and thus a %pair is only inserted if its + * first element (the key) is not already present in the %map. + * + * Insertion requires logarithmic time. + */ + std::pair + insert(const value_type& __x) + { return _M_t._M_insert_unique(__x); } + + /** + * @brief Attempts to insert a std::pair into the %map. + * @param position An iterator that serves as a hint as to where the + * pair should be inserted. + * @param x Pair to be inserted (see std::make_pair for easy creation + * of pairs). + * @return An iterator that points to the element with key of @a x (may + * or may not be the %pair passed in). + * + + * This function is not concerned about whether the insertion + * took place, and thus does not return a boolean like the + * single-argument insert() does. Note that the first + * parameter is only a hint and can potentially improve the + * performance of the insertion process. A bad hint would + * cause no gains in efficiency. + * + * See + * http://gcc.gnu.org/onlinedocs/libstdc++/23_containers/howto.html#4 + * for more on "hinting". + * + * Insertion requires logarithmic time (if the hint is not taken). + */ + iterator + insert(iterator __position, const value_type& __x) + { return _M_t._M_insert_unique(__position, __x); } + + /** + * @brief Template function that attemps to insert a range of elements. + * @param first Iterator pointing to the start of the range to be + * inserted. + * @param last Iterator pointing to the end of the range. + * + * Complexity similar to that of the range constructor. + */ + template + void + insert(_InputIterator __first, _InputIterator __last) + { _M_t._M_insert_unique(__first, __last); } + + /** + * @brief Erases an element from a %map. + * @param position An iterator pointing to the element to be erased. + * + * This function erases an element, pointed to by the given + * iterator, from a %map. Note that this function only erases + * the element, and that if the element is itself a pointer, + * the pointed-to memory is not touched in any way. Managing + * the pointer is the user's responsibilty. + */ + void + erase(iterator __position) + { _M_t.erase(__position); } + + /** + * @brief Erases elements according to the provided key. + * @param x Key of element to be erased. + * @return The number of elements erased. + * + * This function erases all the elements located by the given key from + * a %map. + * Note that this function only erases the element, and that if + * the element is itself a pointer, the pointed-to memory is not touched + * in any way. Managing the pointer is the user's responsibilty. + */ + size_type + erase(const key_type& __x) + { return _M_t.erase(__x); } + + /** + * @brief Erases a [first,last) range of elements from a %map. + * @param first Iterator pointing to the start of the range to be + * erased. + * @param last Iterator pointing to the end of the range to be erased. + * + * This function erases a sequence of elements from a %map. + * Note that this function only erases the element, and that if + * the element is itself a pointer, the pointed-to memory is not touched + * in any way. Managing the pointer is the user's responsibilty. + */ + void + erase(iterator __first, iterator __last) + { _M_t.erase(__first, __last); } + + /** + * @brief Swaps data with another %map. + * @param x A %map of the same element and allocator types. + * + * This exchanges the elements between two maps in constant + * time. (It is only swapping a pointer, an integer, and an + * instance of the @c Compare type (which itself is often + * stateless and empty), so it should be quite fast.) Note + * that the global std::swap() function is specialized such + * that std::swap(m1,m2) will feed to this function. + */ + void + swap(map& __x) + { _M_t.swap(__x._M_t); } + + /** + * Erases all elements in a %map. Note that this function only + * erases the elements, and that if the elements themselves are + * pointers, the pointed-to memory is not touched in any way. + * Managing the pointer is the user's responsibilty. + */ + void + clear() + { _M_t.clear(); } + + // observers + /** + * Returns the key comparison object out of which the %map was + * constructed. + */ + key_compare + key_comp() const + { return _M_t.key_comp(); } + + /** + * Returns a value comparison object, built from the key comparison + * object out of which the %map was constructed. + */ + value_compare + value_comp() const + { return value_compare(_M_t.key_comp()); } + + // [23.3.1.3] map operations + /** + * @brief Tries to locate an element in a %map. + * @param x Key of (key, value) %pair to be located. + * @return Iterator pointing to sought-after element, or end() if not + * found. + * + * This function takes a key and tries to locate the element with which + * the key matches. If successful the function returns an iterator + * pointing to the sought after %pair. If unsuccessful it returns the + * past-the-end ( @c end() ) iterator. + */ + iterator + find(const key_type& __x) + { return _M_t.find(__x); } + + /** + * @brief Tries to locate an element in a %map. + * @param x Key of (key, value) %pair to be located. + * @return Read-only (constant) iterator pointing to sought-after + * element, or end() if not found. + * + * This function takes a key and tries to locate the element with which + * the key matches. If successful the function returns a constant + * iterator pointing to the sought after %pair. If unsuccessful it + * returns the past-the-end ( @c end() ) iterator. + */ + const_iterator + find(const key_type& __x) const + { return _M_t.find(__x); } + + /** + * @brief Finds the number of elements with given key. + * @param x Key of (key, value) pairs to be located. + * @return Number of elements with specified key. + * + * This function only makes sense for multimaps; for map the result will + * either be 0 (not present) or 1 (present). + */ + size_type + count(const key_type& __x) const + { return _M_t.find(__x) == _M_t.end() ? 0 : 1; } + + /** + * @brief Finds the beginning of a subsequence matching given key. + * @param x Key of (key, value) pair to be located. + * @return Iterator pointing to first element equal to or greater + * than key, or end(). + * + * This function returns the first element of a subsequence of elements + * that matches the given key. If unsuccessful it returns an iterator + * pointing to the first element that has a greater value than given key + * or end() if no such element exists. + */ + iterator + lower_bound(const key_type& __x) + { return _M_t.lower_bound(__x); } + + /** + * @brief Finds the beginning of a subsequence matching given key. + * @param x Key of (key, value) pair to be located. + * @return Read-only (constant) iterator pointing to first element + * equal to or greater than key, or end(). + * + * This function returns the first element of a subsequence of elements + * that matches the given key. If unsuccessful it returns an iterator + * pointing to the first element that has a greater value than given key + * or end() if no such element exists. + */ + const_iterator + lower_bound(const key_type& __x) const + { return _M_t.lower_bound(__x); } + + /** + * @brief Finds the end of a subsequence matching given key. + * @param x Key of (key, value) pair to be located. + * @return Iterator pointing to the first element + * greater than key, or end(). + */ + iterator + upper_bound(const key_type& __x) + { return _M_t.upper_bound(__x); } + + /** + * @brief Finds the end of a subsequence matching given key. + * @param x Key of (key, value) pair to be located. + * @return Read-only (constant) iterator pointing to first iterator + * greater than key, or end(). + */ + const_iterator + upper_bound(const key_type& __x) const + { return _M_t.upper_bound(__x); } + + /** + * @brief Finds a subsequence matching given key. + * @param x Key of (key, value) pairs to be located. + * @return Pair of iterators that possibly points to the subsequence + * matching given key. + * + * This function is equivalent to + * @code + * std::make_pair(c.lower_bound(val), + * c.upper_bound(val)) + * @endcode + * (but is faster than making the calls separately). + * + * This function probably only makes sense for multimaps. + */ + std::pair + equal_range(const key_type& __x) + { return _M_t.equal_range(__x); } + + /** + * @brief Finds a subsequence matching given key. + * @param x Key of (key, value) pairs to be located. + * @return Pair of read-only (constant) iterators that possibly points + * to the subsequence matching given key. + * + * This function is equivalent to + * @code + * std::make_pair(c.lower_bound(val), + * c.upper_bound(val)) + * @endcode + * (but is faster than making the calls separately). + * + * This function probably only makes sense for multimaps. + */ + std::pair + equal_range(const key_type& __x) const + { return _M_t.equal_range(__x); } + + template + friend bool + operator== (const map<_K1, _T1, _C1, _A1>&, + const map<_K1, _T1, _C1, _A1>&); + + template + friend bool + operator< (const map<_K1, _T1, _C1, _A1>&, + const map<_K1, _T1, _C1, _A1>&); + }; + + /** + * @brief Map equality comparison. + * @param x A %map. + * @param y A %map of the same type as @a x. + * @return True iff the size and elements of the maps are equal. + * + * This is an equivalence relation. It is linear in the size of the + * maps. Maps are considered equivalent if their sizes are equal, + * and if corresponding elements compare equal. + */ + template + inline bool + operator==(const map<_Key, _Tp, _Compare, _Alloc>& __x, + const map<_Key, _Tp, _Compare, _Alloc>& __y) + { return __x._M_t == __y._M_t; } + + /** + * @brief Map ordering relation. + * @param x A %map. + * @param y A %map of the same type as @a x. + * @return True iff @a x is lexicographically less than @a y. + * + * This is a total ordering relation. It is linear in the size of the + * maps. The elements must be comparable with @c <. + * + * See std::lexicographical_compare() for how the determination is made. + */ + template + inline bool + operator<(const map<_Key, _Tp, _Compare, _Alloc>& __x, + const map<_Key, _Tp, _Compare, _Alloc>& __y) + { return __x._M_t < __y._M_t; } + + /// Based on operator== + template + inline bool + operator!=(const map<_Key, _Tp, _Compare, _Alloc>& __x, + const map<_Key, _Tp, _Compare, _Alloc>& __y) + { return !(__x == __y); } + + /// Based on operator< + template + inline bool + operator>(const map<_Key, _Tp, _Compare, _Alloc>& __x, + const map<_Key, _Tp, _Compare, _Alloc>& __y) + { return __y < __x; } + + /// Based on operator< + template + inline bool + operator<=(const map<_Key, _Tp, _Compare, _Alloc>& __x, + const map<_Key, _Tp, _Compare, _Alloc>& __y) + { return !(__y < __x); } + + /// Based on operator< + template + inline bool + operator>=(const map<_Key, _Tp, _Compare, _Alloc>& __x, + const map<_Key, _Tp, _Compare, _Alloc>& __y) + { return !(__x < __y); } + + /// See std::map::swap(). + template + inline void + swap(map<_Key, _Tp, _Compare, _Alloc>& __x, + map<_Key, _Tp, _Compare, _Alloc>& __y) + { __x.swap(__y); } + +} // namespace std + +#endif /* _MAP_H */ diff --git a/cpp_src/stl_multimap.h b/cpp_src/stl_multimap.h new file mode 100644 index 0000000..b39990d --- /dev/null +++ b/cpp_src/stl_multimap.h @@ -0,0 +1,670 @@ +// Multimap implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2004, 2005, 2006 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_multimap.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _MULTIMAP_H +#define _MULTIMAP_H 1 + +#include + +namespace std { + + /** + * @brief A standard container made up of (key,value) pairs, which can be + * retrieved based on a key, in logarithmic time. + * + * @ingroup Containers + * @ingroup Assoc_containers + * + * Meets the requirements of a container, a + * reversible container, and an + * associative container (using equivalent + * keys). For a @c multimap the key_type is Key, the mapped_type + * is T, and the value_type is std::pair. + * + * Multimaps support bidirectional iterators. + * + * @if maint + * The private tree data is declared exactly the same way for map and + * multimap; the distinction is made entirely in how the tree functions are + * called (*_unique versus *_equal, same as the standard). + * @endif + */ + template , + typename _Alloc = std::allocator > > + class multimap + { + public: + typedef _Key key_type; + typedef _Tp mapped_type; + typedef std::pair value_type; + typedef _Compare key_compare; + typedef _Alloc allocator_type; + + private: + // concept requirements + typedef typename _Alloc::value_type _Alloc_value_type; + __glibcxx_class_requires(_Tp, _SGIAssignableConcept) + __glibcxx_class_requires4(_Compare, bool, _Key, _Key, + _BinaryFunctionConcept) + __glibcxx_class_requires2(value_type, _Alloc_value_type, _SameTypeConcept) + + public: + class value_compare + : public std::binary_function + { + friend class multimap<_Key, _Tp, _Compare, _Alloc>; + protected: + _Compare comp; + + value_compare(_Compare __c) + : comp(__c) { } + + public: + bool operator()(const value_type& __x, const value_type& __y) const + { return comp(__x.first, __y.first); } + }; + + private: + /// @if maint This turns a red-black tree into a [multi]map. @endif + typedef typename _Alloc::template rebind::other + _Pair_alloc_type; + + typedef _Rb_tree, + key_compare, _Pair_alloc_type> _Rep_type; + /// @if maint The actual tree structure. @endif + _Rep_type _M_t; + + public: + // many of these are specified differently in ISO, but the following are + // "functionally equivalent" + typedef typename _Pair_alloc_type::pointer pointer; + typedef typename _Pair_alloc_type::const_pointer const_pointer; + typedef typename _Pair_alloc_type::reference reference; + typedef typename _Pair_alloc_type::const_reference const_reference; + typedef typename _Rep_type::iterator iterator; + typedef typename _Rep_type::const_iterator const_iterator; + typedef typename _Rep_type::size_type size_type; + typedef typename _Rep_type::difference_type difference_type; + typedef typename _Rep_type::reverse_iterator reverse_iterator; + typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator; + + // [23.3.2] construct/copy/destroy + // (get_allocator() is also listed in this section) + /** + * @brief Default constructor creates no elements. + */ + multimap() + : _M_t(_Compare(), allocator_type()) { } + + // for some reason this was made a separate function + /** + * @brief Default constructor creates no elements. + */ + explicit + multimap(const _Compare& __comp, + const allocator_type& __a = allocator_type()) + : _M_t(__comp, __a) { } + + /** + * @brief %Multimap copy constructor. + * @param x A %multimap of identical element and allocator types. + * + * The newly-created %multimap uses a copy of the allocation object used + * by @a x. + */ + multimap(const multimap& __x) + : _M_t(__x._M_t) { } + + /** + * @brief Builds a %multimap from a range. + * @param first An input iterator. + * @param last An input iterator. + * + * Create a %multimap consisting of copies of the elements from + * [first,last). This is linear in N if the range is already sorted, + * and NlogN otherwise (where N is distance(first,last)). + */ + template + multimap(_InputIterator __first, _InputIterator __last) + : _M_t(_Compare(), allocator_type()) + { _M_t._M_insert_equal(__first, __last); } + + /** + * @brief Builds a %multimap from a range. + * @param first An input iterator. + * @param last An input iterator. + * @param comp A comparison functor. + * @param a An allocator object. + * + * Create a %multimap consisting of copies of the elements from + * [first,last). This is linear in N if the range is already sorted, + * and NlogN otherwise (where N is distance(first,last)). + */ + template + multimap(_InputIterator __first, _InputIterator __last, + const _Compare& __comp, + const allocator_type& __a = allocator_type()) + : _M_t(__comp, __a) + { _M_t._M_insert_equal(__first, __last); } + + // FIXME There is no dtor declared, but we should have something generated + // by Doxygen. I don't know what tags to add to this paragraph to make + // that happen: + /** + * The dtor only erases the elements, and note that if the elements + * themselves are pointers, the pointed-to memory is not touched in any + * way. Managing the pointer is the user's responsibilty. + */ + + /** + * @brief %Multimap assignment operator. + * @param x A %multimap of identical element and allocator types. + * + * All the elements of @a x are copied, but unlike the copy constructor, + * the allocator object is not copied. + */ + multimap& + operator=(const multimap& __x) + { + _M_t = __x._M_t; + return *this; + } + + /// Get a copy of the memory allocation object. + allocator_type + get_allocator() const + { return _M_t.get_allocator(); } + + // iterators + /** + * Returns a read/write iterator that points to the first pair in the + * %multimap. Iteration is done in ascending order according to the + * keys. + */ + iterator + begin() + { return _M_t.begin(); } + + /** + * Returns a read-only (constant) iterator that points to the first pair + * in the %multimap. Iteration is done in ascending order according to + * the keys. + */ + const_iterator + begin() const + { return _M_t.begin(); } + + /** + * Returns a read/write iterator that points one past the last pair in + * the %multimap. Iteration is done in ascending order according to the + * keys. + */ + iterator + end() + { return _M_t.end(); } + + /** + * Returns a read-only (constant) iterator that points one past the last + * pair in the %multimap. Iteration is done in ascending order according + * to the keys. + */ + const_iterator + end() const + { return _M_t.end(); } + + /** + * Returns a read/write reverse iterator that points to the last pair in + * the %multimap. Iteration is done in descending order according to the + * keys. + */ + reverse_iterator + rbegin() + { return _M_t.rbegin(); } + + /** + * Returns a read-only (constant) reverse iterator that points to the + * last pair in the %multimap. Iteration is done in descending order + * according to the keys. + */ + const_reverse_iterator + rbegin() const + { return _M_t.rbegin(); } + + /** + * Returns a read/write reverse iterator that points to one before the + * first pair in the %multimap. Iteration is done in descending order + * according to the keys. + */ + reverse_iterator + rend() + { return _M_t.rend(); } + + /** + * Returns a read-only (constant) reverse iterator that points to one + * before the first pair in the %multimap. Iteration is done in + * descending order according to the keys. + */ + const_reverse_iterator + rend() const + { return _M_t.rend(); } + + // capacity + /** Returns true if the %multimap is empty. */ + bool + empty() const + { return _M_t.empty(); } + + /** Returns the size of the %multimap. */ + size_type + size() const + { return _M_t.size(); } + + /** Returns the maximum size of the %multimap. */ + size_type + max_size() const + { return _M_t.max_size(); } + + // modifiers + /** + * @brief Inserts a std::pair into the %multimap. + * @param x Pair to be inserted (see std::make_pair for easy creation + * of pairs). + * @return An iterator that points to the inserted (key,value) pair. + * + * This function inserts a (key, value) pair into the %multimap. + * Contrary to a std::map the %multimap does not rely on unique keys and + * thus multiple pairs with the same key can be inserted. + * + * Insertion requires logarithmic time. + */ + iterator + insert(const value_type& __x) + { return _M_t._M_insert_equal(__x); } + + /** + * @brief Inserts a std::pair into the %multimap. + * @param position An iterator that serves as a hint as to where the + * pair should be inserted. + * @param x Pair to be inserted (see std::make_pair for easy creation + * of pairs). + * @return An iterator that points to the inserted (key,value) pair. + * + * This function inserts a (key, value) pair into the %multimap. + * Contrary to a std::map the %multimap does not rely on unique keys and + * thus multiple pairs with the same key can be inserted. + * Note that the first parameter is only a hint and can potentially + * improve the performance of the insertion process. A bad hint would + * cause no gains in efficiency. + * + * See http://gcc.gnu.org/onlinedocs/libstdc++/23_containers/howto.html#4 + * for more on "hinting". + * + * Insertion requires logarithmic time (if the hint is not taken). + */ + iterator + insert(iterator __position, const value_type& __x) + { return _M_t._M_insert_equal(__position, __x); } + + /** + * @brief A template function that attemps to insert a range of elements. + * @param first Iterator pointing to the start of the range to be + * inserted. + * @param last Iterator pointing to the end of the range. + * + * Complexity similar to that of the range constructor. + */ + template + void + insert(_InputIterator __first, _InputIterator __last) + { _M_t._M_insert_equal(__first, __last); } + + /** + * @brief Erases an element from a %multimap. + * @param position An iterator pointing to the element to be erased. + * + * This function erases an element, pointed to by the given iterator, + * from a %multimap. Note that this function only erases the element, + * and that if the element is itself a pointer, the pointed-to memory is + * not touched in any way. Managing the pointer is the user's + * responsibilty. + */ + void + erase(iterator __position) + { _M_t.erase(__position); } + + /** + * @brief Erases elements according to the provided key. + * @param x Key of element to be erased. + * @return The number of elements erased. + * + * This function erases all elements located by the given key from a + * %multimap. + * Note that this function only erases the element, and that if + * the element is itself a pointer, the pointed-to memory is not touched + * in any way. Managing the pointer is the user's responsibilty. + */ + size_type + erase(const key_type& __x) + { return _M_t.erase(__x); } + + /** + * @brief Erases a [first,last) range of elements from a %multimap. + * @param first Iterator pointing to the start of the range to be + * erased. + * @param last Iterator pointing to the end of the range to be erased. + * + * This function erases a sequence of elements from a %multimap. + * Note that this function only erases the elements, and that if + * the elements themselves are pointers, the pointed-to memory is not + * touched in any way. Managing the pointer is the user's responsibilty. + */ + void + erase(iterator __first, iterator __last) + { _M_t.erase(__first, __last); } + + /** + * @brief Swaps data with another %multimap. + * @param x A %multimap of the same element and allocator types. + * + * This exchanges the elements between two multimaps in constant time. + * (It is only swapping a pointer, an integer, and an instance of + * the @c Compare type (which itself is often stateless and empty), so it + * should be quite fast.) + * Note that the global std::swap() function is specialized such that + * std::swap(m1,m2) will feed to this function. + */ + void + swap(multimap& __x) + { _M_t.swap(__x._M_t); } + + /** + * Erases all elements in a %multimap. Note that this function only + * erases the elements, and that if the elements themselves are pointers, + * the pointed-to memory is not touched in any way. Managing the pointer + * is the user's responsibilty. + */ + void + clear() + { _M_t.clear(); } + + // observers + /** + * Returns the key comparison object out of which the %multimap + * was constructed. + */ + key_compare + key_comp() const + { return _M_t.key_comp(); } + + /** + * Returns a value comparison object, built from the key comparison + * object out of which the %multimap was constructed. + */ + value_compare + value_comp() const + { return value_compare(_M_t.key_comp()); } + + // multimap operations + /** + * @brief Tries to locate an element in a %multimap. + * @param x Key of (key, value) pair to be located. + * @return Iterator pointing to sought-after element, + * or end() if not found. + * + * This function takes a key and tries to locate the element with which + * the key matches. If successful the function returns an iterator + * pointing to the sought after %pair. If unsuccessful it returns the + * past-the-end ( @c end() ) iterator. + */ + iterator + find(const key_type& __x) + { return _M_t.find(__x); } + + /** + * @brief Tries to locate an element in a %multimap. + * @param x Key of (key, value) pair to be located. + * @return Read-only (constant) iterator pointing to sought-after + * element, or end() if not found. + * + * This function takes a key and tries to locate the element with which + * the key matches. If successful the function returns a constant + * iterator pointing to the sought after %pair. If unsuccessful it + * returns the past-the-end ( @c end() ) iterator. + */ + const_iterator + find(const key_type& __x) const + { return _M_t.find(__x); } + + /** + * @brief Finds the number of elements with given key. + * @param x Key of (key, value) pairs to be located. + * @return Number of elements with specified key. + */ + size_type + count(const key_type& __x) const + { return _M_t.count(__x); } + + /** + * @brief Finds the beginning of a subsequence matching given key. + * @param x Key of (key, value) pair to be located. + * @return Iterator pointing to first element equal to or greater + * than key, or end(). + * + * This function returns the first element of a subsequence of elements + * that matches the given key. If unsuccessful it returns an iterator + * pointing to the first element that has a greater value than given key + * or end() if no such element exists. + */ + iterator + lower_bound(const key_type& __x) + { return _M_t.lower_bound(__x); } + + /** + * @brief Finds the beginning of a subsequence matching given key. + * @param x Key of (key, value) pair to be located. + * @return Read-only (constant) iterator pointing to first element + * equal to or greater than key, or end(). + * + * This function returns the first element of a subsequence of elements + * that matches the given key. If unsuccessful the iterator will point + * to the next greatest element or, if no such greater element exists, to + * end(). + */ + const_iterator + lower_bound(const key_type& __x) const + { return _M_t.lower_bound(__x); } + + /** + * @brief Finds the end of a subsequence matching given key. + * @param x Key of (key, value) pair to be located. + * @return Iterator pointing to the first element + * greater than key, or end(). + */ + iterator + upper_bound(const key_type& __x) + { return _M_t.upper_bound(__x); } + + /** + * @brief Finds the end of a subsequence matching given key. + * @param x Key of (key, value) pair to be located. + * @return Read-only (constant) iterator pointing to first iterator + * greater than key, or end(). + */ + const_iterator + upper_bound(const key_type& __x) const + { return _M_t.upper_bound(__x); } + + /** + * @brief Finds a subsequence matching given key. + * @param x Key of (key, value) pairs to be located. + * @return Pair of iterators that possibly points to the subsequence + * matching given key. + * + * This function is equivalent to + * @code + * std::make_pair(c.lower_bound(val), + * c.upper_bound(val)) + * @endcode + * (but is faster than making the calls separately). + */ + std::pair + equal_range(const key_type& __x) + { return _M_t.equal_range(__x); } + + /** + * @brief Finds a subsequence matching given key. + * @param x Key of (key, value) pairs to be located. + * @return Pair of read-only (constant) iterators that possibly points + * to the subsequence matching given key. + * + * This function is equivalent to + * @code + * std::make_pair(c.lower_bound(val), + * c.upper_bound(val)) + * @endcode + * (but is faster than making the calls separately). + */ + std::pair + equal_range(const key_type& __x) const + { return _M_t.equal_range(__x); } + + template + friend bool + operator== (const multimap<_K1, _T1, _C1, _A1>&, + const multimap<_K1, _T1, _C1, _A1>&); + + template + friend bool + operator< (const multimap<_K1, _T1, _C1, _A1>&, + const multimap<_K1, _T1, _C1, _A1>&); + }; + + /** + * @brief Multimap equality comparison. + * @param x A %multimap. + * @param y A %multimap of the same type as @a x. + * @return True iff the size and elements of the maps are equal. + * + * This is an equivalence relation. It is linear in the size of the + * multimaps. Multimaps are considered equivalent if their sizes are equal, + * and if corresponding elements compare equal. + */ + template + inline bool + operator==(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, + const multimap<_Key, _Tp, _Compare, _Alloc>& __y) + { return __x._M_t == __y._M_t; } + + /** + * @brief Multimap ordering relation. + * @param x A %multimap. + * @param y A %multimap of the same type as @a x. + * @return True iff @a x is lexicographically less than @a y. + * + * This is a total ordering relation. It is linear in the size of the + * multimaps. The elements must be comparable with @c <. + * + * See std::lexicographical_compare() for how the determination is made. + */ + template + inline bool + operator<(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, + const multimap<_Key, _Tp, _Compare, _Alloc>& __y) + { return __x._M_t < __y._M_t; } + + /// Based on operator== + template + inline bool + operator!=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, + const multimap<_Key, _Tp, _Compare, _Alloc>& __y) + { return !(__x == __y); } + + /// Based on operator< + template + inline bool + operator>(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, + const multimap<_Key, _Tp, _Compare, _Alloc>& __y) + { return __y < __x; } + + /// Based on operator< + template + inline bool + operator<=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, + const multimap<_Key, _Tp, _Compare, _Alloc>& __y) + { return !(__y < __x); } + + /// Based on operator< + template + inline bool + operator>=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, + const multimap<_Key, _Tp, _Compare, _Alloc>& __y) + { return !(__x < __y); } + + /// See std::multimap::swap(). + template + inline void + swap(multimap<_Key, _Tp, _Compare, _Alloc>& __x, + multimap<_Key, _Tp, _Compare, _Alloc>& __y) + { __x.swap(__y); } + +} // namespace std + +#endif /* _MULTIMAP_H */ diff --git a/cpp_src/stl_multiset.h b/cpp_src/stl_multiset.h new file mode 100644 index 0000000..7c9f2fd --- /dev/null +++ b/cpp_src/stl_multiset.h @@ -0,0 +1,565 @@ +// Multiset implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2004, 2005, 2006 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_multiset.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _MULTISET_H +#define _MULTISET_H 1 + +#include + +namespace std { + + /** + * @brief A standard container made up of elements, which can be retrieved + * in logarithmic time. + * + * @ingroup Containers + * @ingroup Assoc_containers + * + * Meets the requirements of a container, a + * reversible container, and an + * associative container (using equivalent + * keys). For a @c multiset the key_type and value_type are Key. + * + * Multisets support bidirectional iterators. + * + * @if maint + * The private tree data is declared exactly the same way for set and + * multiset; the distinction is made entirely in how the tree functions are + * called (*_unique versus *_equal, same as the standard). + * @endif + */ + template , + class _Alloc = std::allocator<_Key> > + class multiset + { + // concept requirements + typedef typename _Alloc::value_type _Alloc_value_type; + __glibcxx_class_requires(_Key, _SGIAssignableConcept) + __glibcxx_class_requires4(_Compare, bool, _Key, _Key, + _BinaryFunctionConcept) + __glibcxx_class_requires2(_Key, _Alloc_value_type, _SameTypeConcept) + + public: + // typedefs: + typedef _Key key_type; + typedef _Key value_type; + typedef _Compare key_compare; + typedef _Compare value_compare; + typedef _Alloc allocator_type; + + private: + /// @if maint This turns a red-black tree into a [multi]set. @endif + typedef typename _Alloc::template rebind<_Key>::other _Key_alloc_type; + + typedef _Rb_tree, + key_compare, _Key_alloc_type> _Rep_type; + /// @if maint The actual tree structure. @endif + _Rep_type _M_t; + + public: + typedef typename _Key_alloc_type::pointer pointer; + typedef typename _Key_alloc_type::const_pointer const_pointer; + typedef typename _Key_alloc_type::reference reference; + typedef typename _Key_alloc_type::const_reference const_reference; + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 103. set::iterator is required to be modifiable, + // but this allows modification of keys. + typedef typename _Rep_type::const_iterator iterator; + typedef typename _Rep_type::const_iterator const_iterator; + typedef typename _Rep_type::const_reverse_iterator reverse_iterator; + typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator; + typedef typename _Rep_type::size_type size_type; + typedef typename _Rep_type::difference_type difference_type; + + // allocation/deallocation + + /** + * @brief Default constructor creates no elements. + */ + multiset() + : _M_t(_Compare(), allocator_type()) { } + + explicit + multiset(const _Compare& __comp, + const allocator_type& __a = allocator_type()) + : _M_t(__comp, __a) { } + + /** + * @brief Builds a %multiset from a range. + * @param first An input iterator. + * @param last An input iterator. + * + * Create a %multiset consisting of copies of the elements from + * [first,last). This is linear in N if the range is already sorted, + * and NlogN otherwise (where N is distance(first,last)). + */ + template + multiset(_InputIterator __first, _InputIterator __last) + : _M_t(_Compare(), allocator_type()) + { _M_t._M_insert_equal(__first, __last); } + + /** + * @brief Builds a %multiset from a range. + * @param first An input iterator. + * @param last An input iterator. + * @param comp A comparison functor. + * @param a An allocator object. + * + * Create a %multiset consisting of copies of the elements from + * [first,last). This is linear in N if the range is already sorted, + * and NlogN otherwise (where N is distance(first,last)). + */ + template + multiset(_InputIterator __first, _InputIterator __last, + const _Compare& __comp, + const allocator_type& __a = allocator_type()) + : _M_t(__comp, __a) + { _M_t._M_insert_equal(__first, __last); } + + /** + * @brief %Multiset copy constructor. + * @param x A %multiset of identical element and allocator types. + * + * The newly-created %multiset uses a copy of the allocation object used + * by @a x. + */ + multiset(const multiset<_Key,_Compare,_Alloc>& __x) + : _M_t(__x._M_t) { } + + /** + * @brief %Multiset assignment operator. + * @param x A %multiset of identical element and allocator types. + * + * All the elements of @a x are copied, but unlike the copy constructor, + * the allocator object is not copied. + */ + multiset<_Key,_Compare,_Alloc>& + operator=(const multiset<_Key,_Compare,_Alloc>& __x) + { + _M_t = __x._M_t; + return *this; + } + + // accessors: + + /// Returns the comparison object. + key_compare + key_comp() const + { return _M_t.key_comp(); } + /// Returns the comparison object. + value_compare + value_comp() const + { return _M_t.key_comp(); } + /// Returns the memory allocation object. + allocator_type + get_allocator() const + { return _M_t.get_allocator(); } + + /** + * Returns a read/write iterator that points to the first element in the + * %multiset. Iteration is done in ascending order according to the + * keys. + */ + iterator + begin() const + { return _M_t.begin(); } + + /** + * Returns a read/write iterator that points one past the last element in + * the %multiset. Iteration is done in ascending order according to the + * keys. + */ + iterator + end() const + { return _M_t.end(); } + + /** + * Returns a read/write reverse iterator that points to the last element + * in the %multiset. Iteration is done in descending order according to + * the keys. + */ + reverse_iterator + rbegin() const + { return _M_t.rbegin(); } + + /** + * Returns a read/write reverse iterator that points to the last element + * in the %multiset. Iteration is done in descending order according to + * the keys. + */ + reverse_iterator + rend() const + { return _M_t.rend(); } + + /// Returns true if the %set is empty. + bool + empty() const + { return _M_t.empty(); } + + /// Returns the size of the %set. + size_type + size() const + { return _M_t.size(); } + + /// Returns the maximum size of the %set. + size_type + max_size() const + { return _M_t.max_size(); } + + /** + * @brief Swaps data with another %multiset. + * @param x A %multiset of the same element and allocator types. + * + * This exchanges the elements between two multisets in constant time. + * (It is only swapping a pointer, an integer, and an instance of the @c + * Compare type (which itself is often stateless and empty), so it should + * be quite fast.) + * Note that the global std::swap() function is specialized such that + * std::swap(s1,s2) will feed to this function. + */ + void + swap(multiset<_Key, _Compare, _Alloc>& __x) + { _M_t.swap(__x._M_t); } + + // insert/erase + /** + * @brief Inserts an element into the %multiset. + * @param x Element to be inserted. + * @return An iterator that points to the inserted element. + * + * This function inserts an element into the %multiset. Contrary + * to a std::set the %multiset does not rely on unique keys and thus + * multiple copies of the same element can be inserted. + * + * Insertion requires logarithmic time. + */ + iterator + insert(const value_type& __x) + { return _M_t._M_insert_equal(__x); } + + /** + * @brief Inserts an element into the %multiset. + * @param position An iterator that serves as a hint as to where the + * element should be inserted. + * @param x Element to be inserted. + * @return An iterator that points to the inserted element. + * + * This function inserts an element into the %multiset. Contrary + * to a std::set the %multiset does not rely on unique keys and thus + * multiple copies of the same element can be inserted. + * + * Note that the first parameter is only a hint and can potentially + * improve the performance of the insertion process. A bad hint would + * cause no gains in efficiency. + * + * See http://gcc.gnu.org/onlinedocs/libstdc++/23_containers/howto.html#4 + * for more on "hinting". + * + * Insertion requires logarithmic time (if the hint is not taken). + */ + iterator + insert(iterator __position, const value_type& __x) + { return _M_t._M_insert_equal(__position, __x); } + + /** + * @brief A template function that attemps to insert a range of elements. + * @param first Iterator pointing to the start of the range to be + * inserted. + * @param last Iterator pointing to the end of the range. + * + * Complexity similar to that of the range constructor. + */ + template + void + insert(_InputIterator __first, _InputIterator __last) + { _M_t._M_insert_equal(__first, __last); } + + /** + * @brief Erases an element from a %multiset. + * @param position An iterator pointing to the element to be erased. + * + * This function erases an element, pointed to by the given iterator, + * from a %multiset. Note that this function only erases the element, + * and that if the element is itself a pointer, the pointed-to memory is + * not touched in any way. Managing the pointer is the user's + * responsibilty. + */ + void + erase(iterator __position) + { _M_t.erase(__position); } + + /** + * @brief Erases elements according to the provided key. + * @param x Key of element to be erased. + * @return The number of elements erased. + * + * This function erases all elements located by the given key from a + * %multiset. + * Note that this function only erases the element, and that if + * the element is itself a pointer, the pointed-to memory is not touched + * in any way. Managing the pointer is the user's responsibilty. + */ + size_type + erase(const key_type& __x) + { return _M_t.erase(__x); } + + /** + * @brief Erases a [first,last) range of elements from a %multiset. + * @param first Iterator pointing to the start of the range to be + * erased. + * @param last Iterator pointing to the end of the range to be erased. + * + * This function erases a sequence of elements from a %multiset. + * Note that this function only erases the elements, and that if + * the elements themselves are pointers, the pointed-to memory is not + * touched in any way. Managing the pointer is the user's responsibilty. + */ + void + erase(iterator __first, iterator __last) + { _M_t.erase(__first, __last); } + + /** + * Erases all elements in a %multiset. Note that this function only + * erases the elements, and that if the elements themselves are pointers, + * the pointed-to memory is not touched in any way. Managing the pointer + * is the user's responsibilty. + */ + void + clear() + { _M_t.clear(); } + + // multiset operations: + + /** + * @brief Finds the number of elements with given key. + * @param x Key of elements to be located. + * @return Number of elements with specified key. + */ + size_type + count(const key_type& __x) const + { return _M_t.count(__x); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 214. set::find() missing const overload + //@{ + /** + * @brief Tries to locate an element in a %set. + * @param x Element to be located. + * @return Iterator pointing to sought-after element, or end() if not + * found. + * + * This function takes a key and tries to locate the element with which + * the key matches. If successful the function returns an iterator + * pointing to the sought after element. If unsuccessful it returns the + * past-the-end ( @c end() ) iterator. + */ + iterator + find(const key_type& __x) + { return _M_t.find(__x); } + + const_iterator + find(const key_type& __x) const + { return _M_t.find(__x); } + //@} + + //@{ + /** + * @brief Finds the beginning of a subsequence matching given key. + * @param x Key to be located. + * @return Iterator pointing to first element equal to or greater + * than key, or end(). + * + * This function returns the first element of a subsequence of elements + * that matches the given key. If unsuccessful it returns an iterator + * pointing to the first element that has a greater value than given key + * or end() if no such element exists. + */ + iterator + lower_bound(const key_type& __x) + { return _M_t.lower_bound(__x); } + + const_iterator + lower_bound(const key_type& __x) const + { return _M_t.lower_bound(__x); } + //@} + + //@{ + /** + * @brief Finds the end of a subsequence matching given key. + * @param x Key to be located. + * @return Iterator pointing to the first element + * greater than key, or end(). + */ + iterator + upper_bound(const key_type& __x) + { return _M_t.upper_bound(__x); } + + const_iterator + upper_bound(const key_type& __x) const + { return _M_t.upper_bound(__x); } + //@} + + //@{ + /** + * @brief Finds a subsequence matching given key. + * @param x Key to be located. + * @return Pair of iterators that possibly points to the subsequence + * matching given key. + * + * This function is equivalent to + * @code + * std::make_pair(c.lower_bound(val), + * c.upper_bound(val)) + * @endcode + * (but is faster than making the calls separately). + * + * This function probably only makes sense for multisets. + */ + std::pair + equal_range(const key_type& __x) + { return _M_t.equal_range(__x); } + + std::pair + equal_range(const key_type& __x) const + { return _M_t.equal_range(__x); } + + template + friend bool + operator== (const multiset<_K1, _C1, _A1>&, + const multiset<_K1, _C1, _A1>&); + + template + friend bool + operator< (const multiset<_K1, _C1, _A1>&, + const multiset<_K1, _C1, _A1>&); + }; + + /** + * @brief Multiset equality comparison. + * @param x A %multiset. + * @param y A %multiset of the same type as @a x. + * @return True iff the size and elements of the multisets are equal. + * + * This is an equivalence relation. It is linear in the size of the + * multisets. + * Multisets are considered equivalent if their sizes are equal, and if + * corresponding elements compare equal. + */ + template + inline bool + operator==(const multiset<_Key, _Compare, _Alloc>& __x, + const multiset<_Key, _Compare, _Alloc>& __y) + { return __x._M_t == __y._M_t; } + + /** + * @brief Multiset ordering relation. + * @param x A %multiset. + * @param y A %multiset of the same type as @a x. + * @return True iff @a x is lexicographically less than @a y. + * + * This is a total ordering relation. It is linear in the size of the + * maps. The elements must be comparable with @c <. + * + * See std::lexicographical_compare() for how the determination is made. + */ + template + inline bool + operator<(const multiset<_Key, _Compare, _Alloc>& __x, + const multiset<_Key, _Compare, _Alloc>& __y) + { return __x._M_t < __y._M_t; } + + /// Returns !(x == y). + template + inline bool + operator!=(const multiset<_Key, _Compare, _Alloc>& __x, + const multiset<_Key, _Compare, _Alloc>& __y) + { return !(__x == __y); } + + /// Returns y < x. + template + inline bool + operator>(const multiset<_Key,_Compare,_Alloc>& __x, + const multiset<_Key,_Compare,_Alloc>& __y) + { return __y < __x; } + + /// Returns !(y < x) + template + inline bool + operator<=(const multiset<_Key, _Compare, _Alloc>& __x, + const multiset<_Key, _Compare, _Alloc>& __y) + { return !(__y < __x); } + + /// Returns !(x < y) + template + inline bool + operator>=(const multiset<_Key, _Compare, _Alloc>& __x, + const multiset<_Key, _Compare, _Alloc>& __y) + { return !(__x < __y); } + + /// See std::multiset::swap(). + template + inline void + swap(multiset<_Key, _Compare, _Alloc>& __x, + multiset<_Key, _Compare, _Alloc>& __y) + { __x.swap(__y); } + +} // namespace std + +#endif /* _MULTISET_H */ diff --git a/cpp_src/stl_numeric.h b/cpp_src/stl_numeric.h new file mode 100644 index 0000000..468e068 --- /dev/null +++ b/cpp_src/stl_numeric.h @@ -0,0 +1,339 @@ +// Numeric functions implementation -*- C++ -*- + +// Copyright (C) 2001, 2004, 2005 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_numeric.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STL_NUMERIC_H +#define _STL_NUMERIC_H 1 + +#include + +namespace std { + + /** + * @brief Accumulate values in a range. + * + * Accumulates the values in the range [first,last) using operator+(). The + * initial value is @a init. The values are processed in order. + * + * @param first Start of range. + * @param last End of range. + * @param init Starting value to add other values to. + * @return The final sum. + */ + template + _Tp + accumulate(_InputIterator __first, _InputIterator __last, _Tp __init) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_requires_valid_range(__first, __last); + + for (; __first != __last; ++__first) + __init = __init + *__first; + return __init; + } + + /** + * @brief Accumulate values in a range with operation. + * + * Accumulates the values in the range [first,last) using the function + * object @a binary_op. The initial value is @a init. The values are + * processed in order. + * + * @param first Start of range. + * @param last End of range. + * @param init Starting value to add other values to. + * @param binary_op Function object to accumulate with. + * @return The final sum. + */ + template + _Tp + accumulate(_InputIterator __first, _InputIterator __last, _Tp __init, + _BinaryOperation __binary_op) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_requires_valid_range(__first, __last); + + for (; __first != __last; ++__first) + __init = __binary_op(__init, *__first); + return __init; + } + + /** + * @brief Compute inner product of two ranges. + * + * Starting with an initial value of @a init, multiplies successive + * elements from the two ranges and adds each product into the accumulated + * value using operator+(). The values in the ranges are processed in + * order. + * + * @param first1 Start of range 1. + * @param last1 End of range 1. + * @param first2 Start of range 2. + * @param init Starting value to add other values to. + * @return The final inner product. + */ + template + _Tp + inner_product(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _Tp __init) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_requires_valid_range(__first1, __last1); + + for (; __first1 != __last1; ++__first1, ++__first2) + __init = __init + (*__first1 * *__first2); + return __init; + } + + /** + * @brief Compute inner product of two ranges. + * + * Starting with an initial value of @a init, applies @a binary_op2 to + * successive elements from the two ranges and accumulates each result into + * the accumulated value using @a binary_op1. The values in the ranges are + * processed in order. + * + * @param first1 Start of range 1. + * @param last1 End of range 1. + * @param first2 Start of range 2. + * @param init Starting value to add other values to. + * @param binary_op1 Function object to accumulate with. + * @param binary_op2 Function object to apply to pairs of input values. + * @return The final inner product. + */ + template + _Tp + inner_product(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _Tp __init, + _BinaryOperation1 __binary_op1, + _BinaryOperation2 __binary_op2) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_requires_valid_range(__first1, __last1); + + for (; __first1 != __last1; ++__first1, ++__first2) + __init = __binary_op1(__init, __binary_op2(*__first1, *__first2)); + return __init; + } + + /** + * @brief Return list of partial sums + * + * Accumulates the values in the range [first,last) using operator+(). + * As each successive input value is added into the total, that partial sum + * is written to @a result. Therefore, the first value in result is the + * first value of the input, the second value in result is the sum of the + * first and second input values, and so on. + * + * @param first Start of input range. + * @param last End of input range. + * @param result Output to write sums to. + * @return Iterator pointing just beyond the values written to result. + */ + template + _OutputIterator + partial_sum(_InputIterator __first, _InputIterator __last, + _OutputIterator __result) + { + typedef typename iterator_traits<_InputIterator>::value_type _ValueType; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return __result; + _ValueType __value = *__first; + *__result = __value; + while (++__first != __last) + { + __value = __value + *__first; + *++__result = __value; + } + return ++__result; + } + + /** + * @brief Return list of partial sums + * + * Accumulates the values in the range [first,last) using operator+(). + * As each successive input value is added into the total, that partial sum + * is written to @a result. Therefore, the first value in result is the + * first value of the input, the second value in result is the sum of the + * first and second input values, and so on. + * + * @param first Start of input range. + * @param last End of input range. + * @param result Output to write sums to. + * @return Iterator pointing just beyond the values written to result. + */ + template + _OutputIterator + partial_sum(_InputIterator __first, _InputIterator __last, + _OutputIterator __result, _BinaryOperation __binary_op) + { + typedef typename iterator_traits<_InputIterator>::value_type _ValueType; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return __result; + _ValueType __value = *__first; + *__result = __value; + while (++__first != __last) + { + __value = __binary_op(__value, *__first); + *++__result = __value; + } + return ++__result; + } + + /** + * @brief Return differences between adjacent values. + * + * Computes the difference between adjacent values in the range + * [first,last) using operator-() and writes the result to @a result. + * + * @param first Start of input range. + * @param last End of input range. + * @param result Output to write sums to. + * @return Iterator pointing just beyond the values written to result. + */ + template + _OutputIterator + adjacent_difference(_InputIterator __first, + _InputIterator __last, _OutputIterator __result) + { + typedef typename iterator_traits<_InputIterator>::value_type _ValueType; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return __result; + _ValueType __value = *__first; + *__result = __value; + while (++__first != __last) + { + _ValueType __tmp = *__first; + *++__result = __tmp - __value; + __value = __tmp; + } + return ++__result; + } + + /** + * @brief Return differences between adjacent values. + * + * Computes the difference between adjacent values in the range + * [first,last) using the function object @a binary_op and writes the + * result to @a result. + * + * @param first Start of input range. + * @param last End of input range. + * @param result Output to write sums to. + * @return Iterator pointing just beyond the values written to result. + */ + template + _OutputIterator + adjacent_difference(_InputIterator __first, _InputIterator __last, + _OutputIterator __result, _BinaryOperation __binary_op) + { + typedef typename iterator_traits<_InputIterator>::value_type _ValueType; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return __result; + _ValueType __value = *__first; + *__result = __value; + while (++__first != __last) + { + _ValueType __tmp = *__first; + *++__result = __binary_op(__tmp, __value); + __value = __tmp; + } + return ++__result; + } + +} // namespace std + +#endif /* _STL_NUMERIC_H */ diff --git a/cpp_src/stl_pair.h b/cpp_src/stl_pair.h new file mode 100644 index 0000000..53a180c --- /dev/null +++ b/cpp_src/stl_pair.h @@ -0,0 +1,149 @@ +// Pair implementation -*- C++ -*- + +// Copyright (C) 2001, 2004, 2005 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_pair.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _PAIR_H +#define _PAIR_H 1 + +namespace std { + + /// pair holds two objects of arbitrary type. + template + struct pair + { + typedef _T1 first_type; ///< @c first_type is the first bound type + typedef _T2 second_type; ///< @c second_type is the second bound type + + _T1 first; ///< @c first is a copy of the first object + _T2 second; ///< @c second is a copy of the second object + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 265. std::pair::pair() effects overly restrictive + /** The default constructor creates @c first and @c second using their + * respective default constructors. */ + pair() + : first(), second() { } + + /** Two objects may be passed to a @c pair constructor to be copied. */ + pair(const _T1& __a, const _T2& __b) + : first(__a), second(__b) { } + + /** There is also a templated copy ctor for the @c pair class itself. */ + template + pair(const pair<_U1, _U2>& __p) + : first(__p.first), second(__p.second) { } + }; + + /// Two pairs of the same type are equal iff their members are equal. + template + inline bool + operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) + { return __x.first == __y.first && __x.second == __y.second; } + + /// + template + inline bool + operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) + { return __x.first < __y.first + || (!(__y.first < __x.first) && __x.second < __y.second); } + + /// Uses @c operator== to find the result. + template + inline bool + operator!=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) + { return !(__x == __y); } + + /// Uses @c operator< to find the result. + template + inline bool + operator>(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) + { return __y < __x; } + + /// Uses @c operator< to find the result. + template + inline bool + operator<=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) + { return !(__y < __x); } + + /// Uses @c operator< to find the result. + template + inline bool + operator>=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) + { return !(__x < __y); } + + /** + * @brief A convenience wrapper for creating a pair from two objects. + * @param x The first object. + * @param y The second object. + * @return A newly-constructed pair<> object of the appropriate type. + * + * The standard requires that the objects be passed by reference-to-const, + * but LWG issue #181 says they should be passed by const value. We follow + * the LWG by default. + */ + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 181. make_pair() unintended behavior + template + inline pair<_T1, _T2> + make_pair(_T1 __x, _T2 __y) + { return pair<_T1, _T2>(__x, __y); } + +} // namespace std + +#endif /* _PAIR_H */ diff --git a/cpp_src/stl_queue.h b/cpp_src/stl_queue.h new file mode 100644 index 0000000..469327e --- /dev/null +++ b/cpp_src/stl_queue.h @@ -0,0 +1,443 @@ +// Queue implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_queue.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _QUEUE_H +#define _QUEUE_H 1 + +#include +#include + +namespace std { + + /** + * @brief A standard container giving FIFO behavior. + * + * @ingroup Containers + * @ingroup Sequences + * + * Meets many of the requirements of a + * container, + * but does not define anything to do with iterators. Very few of the + * other standard container interfaces are defined. + * + * This is not a true container, but an @e adaptor. It holds another + * container, and provides a wrapper interface to that container. The + * wrapper is what enforces strict first-in-first-out %queue behavior. + * + * The second template parameter defines the type of the underlying + * sequence/container. It defaults to std::deque, but it can be any type + * that supports @c front, @c back, @c push_back, and @c pop_front, + * such as std::list or an appropriate user-defined type. + * + * Members not found in "normal" containers are @c container_type, + * which is a typedef for the second Sequence parameter, and @c push and + * @c pop, which are standard %queue/FIFO operations. + */ + template > + class queue + { + // concept requirements + typedef typename _Sequence::value_type _Sequence_value_type; + __glibcxx_class_requires(_Tp, _SGIAssignableConcept) + __glibcxx_class_requires(_Sequence, _FrontInsertionSequenceConcept) + __glibcxx_class_requires(_Sequence, _BackInsertionSequenceConcept) + __glibcxx_class_requires2(_Tp, _Sequence_value_type, _SameTypeConcept) + + template + friend bool + operator==(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&); + + template + friend bool + operator<(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&); + + public: + typedef typename _Sequence::value_type value_type; + typedef typename _Sequence::reference reference; + typedef typename _Sequence::const_reference const_reference; + typedef typename _Sequence::size_type size_type; + typedef _Sequence container_type; + + protected: + /** + * 'c' is the underlying container. Maintainers wondering why + * this isn't uglified as per style guidelines should note that + * this name is specified in the standard, [23.2.3.1]. (Why? + * Presumably for the same reason that it's protected instead + * of private: to allow derivation. But none of the other + * containers allow for derivation. Odd.) + */ + _Sequence c; + + public: + /** + * @brief Default constructor creates no elements. + */ + explicit + queue(const _Sequence& __c = _Sequence()) : c(__c) {} + + /** + * Returns true if the %queue is empty. + */ + bool + empty() const + { return c.empty(); } + + /** Returns the number of elements in the %queue. */ + size_type + size() const + { return c.size(); } + + /** + * Returns a read/write reference to the data at the first + * element of the %queue. + */ + reference + front() + { + __glibcxx_requires_nonempty(); + return c.front(); + } + + /** + * Returns a read-only (constant) reference to the data at the first + * element of the %queue. + */ + const_reference + front() const + { + __glibcxx_requires_nonempty(); + return c.front(); + } + + /** + * Returns a read/write reference to the data at the last + * element of the %queue. + */ + reference + back() + { + __glibcxx_requires_nonempty(); + return c.back(); + } + + /** + * Returns a read-only (constant) reference to the data at the last + * element of the %queue. + */ + const_reference + back() const + { + __glibcxx_requires_nonempty(); + return c.back(); + } + + /** + * @brief Add data to the end of the %queue. + * @param x Data to be added. + * + * This is a typical %queue operation. The function creates an + * element at the end of the %queue and assigns the given data + * to it. The time complexity of the operation depends on the + * underlying sequence. + */ + void + push(const value_type& __x) + { c.push_back(__x); } + + /** + * @brief Removes first element. + * + * This is a typical %queue operation. It shrinks the %queue by one. + * The time complexity of the operation depends on the underlying + * sequence. + * + * Note that no data is returned, and if the first element's + * data is needed, it should be retrieved before pop() is + * called. + */ + void + pop() + { + __glibcxx_requires_nonempty(); + c.pop_front(); + } + }; + + + /** + * @brief Queue equality comparison. + * @param x A %queue. + * @param y A %queue of the same type as @a x. + * @return True iff the size and elements of the queues are equal. + * + * This is an equivalence relation. Complexity and semantics depend on the + * underlying sequence type, but the expected rules are: this relation is + * linear in the size of the sequences, and queues are considered equivalent + * if their sequences compare equal. + */ + template + inline bool + operator==(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) + { return __x.c == __y.c; } + + /** + * @brief Queue ordering relation. + * @param x A %queue. + * @param y A %queue of the same type as @a x. + * @return True iff @a x is lexicographically less than @a y. + * + * This is an total ordering relation. Complexity and semantics + * depend on the underlying sequence type, but the expected rules + * are: this relation is linear in the size of the sequences, the + * elements must be comparable with @c <, and + * std::lexicographical_compare() is usually used to make the + * determination. + */ + template + inline bool + operator<(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) + { return __x.c < __y.c; } + + /// Based on operator== + template + inline bool + operator!=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) + { return !(__x == __y); } + + /// Based on operator< + template + inline bool + operator>(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) + { return __y < __x; } + + /// Based on operator< + template + inline bool + operator<=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) + { return !(__y < __x); } + + /// Based on operator< + template + inline bool + operator>=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) + { return !(__x < __y); } + + /** + * @brief A standard container automatically sorting its contents. + * + * @ingroup Containers + * @ingroup Sequences + * + * This is not a true container, but an @e adaptor. It holds + * another container, and provides a wrapper interface to that + * container. The wrapper is what enforces priority-based sorting + * and %queue behavior. Very few of the standard container/sequence + * interface requirements are met (e.g., iterators). + * + * The second template parameter defines the type of the underlying + * sequence/container. It defaults to std::vector, but it can be + * any type that supports @c front(), @c push_back, @c pop_back, + * and random-access iterators, such as std::deque or an + * appropriate user-defined type. + * + * The third template parameter supplies the means of making + * priority comparisons. It defaults to @c less but + * can be anything defining a strict weak ordering. + * + * Members not found in "normal" containers are @c container_type, + * which is a typedef for the second Sequence parameter, and @c + * push, @c pop, and @c top, which are standard %queue operations. + * + * @note No equality/comparison operators are provided for + * %priority_queue. + * + * @note Sorting of the elements takes place as they are added to, + * and removed from, the %priority_queue using the + * %priority_queue's member functions. If you access the elements + * by other means, and change their data such that the sorting + * order would be different, the %priority_queue will not re-sort + * the elements for you. (How could it know to do so?) + */ + template, + typename _Compare = less > + class priority_queue + { + // concept requirements + typedef typename _Sequence::value_type _Sequence_value_type; + __glibcxx_class_requires(_Tp, _SGIAssignableConcept) + __glibcxx_class_requires(_Sequence, _SequenceConcept) + __glibcxx_class_requires(_Sequence, _RandomAccessContainerConcept) + __glibcxx_class_requires2(_Tp, _Sequence_value_type, _SameTypeConcept) + __glibcxx_class_requires4(_Compare, bool, _Tp, _Tp, + _BinaryFunctionConcept) + + public: + typedef typename _Sequence::value_type value_type; + typedef typename _Sequence::reference reference; + typedef typename _Sequence::const_reference const_reference; + typedef typename _Sequence::size_type size_type; + typedef _Sequence container_type; + + protected: + // See queue::c for notes on these names. + _Sequence c; + _Compare comp; + + public: + /** + * @brief Default constructor creates no elements. + */ + explicit + priority_queue(const _Compare& __x = _Compare(), + const _Sequence& __s = _Sequence()) + : c(__s), comp(__x) + { std::make_heap(c.begin(), c.end(), comp); } + + /** + * @brief Builds a %queue from a range. + * @param first An input iterator. + * @param last An input iterator. + * @param x A comparison functor describing a strict weak ordering. + * @param s An initial sequence with which to start. + * + * Begins by copying @a s, inserting a copy of the elements + * from @a [first,last) into the copy of @a s, then ordering + * the copy according to @a x. + * + * For more information on function objects, see the + * documentation on @link s20_3_1_base functor base + * classes@endlink. + */ + template + priority_queue(_InputIterator __first, _InputIterator __last, + const _Compare& __x = _Compare(), + const _Sequence& __s = _Sequence()) + : c(__s), comp(__x) + { + __glibcxx_requires_valid_range(__first, __last); + c.insert(c.end(), __first, __last); + std::make_heap(c.begin(), c.end(), comp); + } + + /** + * Returns true if the %queue is empty. + */ + bool + empty() const + { return c.empty(); } + + /** Returns the number of elements in the %queue. */ + size_type + size() const + { return c.size(); } + + /** + * Returns a read-only (constant) reference to the data at the first + * element of the %queue. + */ + const_reference + top() const + { + __glibcxx_requires_nonempty(); + return c.front(); + } + + /** + * @brief Add data to the %queue. + * @param x Data to be added. + * + * This is a typical %queue operation. + * The time complexity of the operation depends on the underlying + * sequence. + */ + void + push(const value_type& __x) + { + c.push_back(__x); + std::push_heap(c.begin(), c.end(), comp); + } + + /** + * @brief Removes first element. + * + * This is a typical %queue operation. It shrinks the %queue + * by one. The time complexity of the operation depends on the + * underlying sequence. + * + * Note that no data is returned, and if the first element's + * data is needed, it should be retrieved before pop() is + * called. + */ + void + pop() + { + __glibcxx_requires_nonempty(); + std::pop_heap(c.begin(), c.end(), comp); + c.pop_back(); + } + }; + + // No equality/comparison operators are provided for priority_queue. + +} // namespace std + +#endif /* _QUEUE_H */ diff --git a/cpp_src/stl_raw_storage_iter.h b/cpp_src/stl_raw_storage_iter.h new file mode 100644 index 0000000..736c281 --- /dev/null +++ b/cpp_src/stl_raw_storage_iter.h @@ -0,0 +1,110 @@ +// -*- C++ -*- + +// Copyright (C) 2001, 2004, 2005 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_raw_storage_iter.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STL_RAW_STORAGE_ITERATOR_H +#define _STL_RAW_STORAGE_ITERATOR_H 1 + +namespace std { + + /** + * This iterator class lets algorithms store their results into + * uninitialized memory. + */ + template + class raw_storage_iterator + : public iterator + { + protected: + _ForwardIterator _M_iter; + + public: + explicit + raw_storage_iterator(_ForwardIterator __x) + : _M_iter(__x) {} + + raw_storage_iterator& + operator*() { return *this; } + + raw_storage_iterator& + operator=(const _Tp& __element) + { + std::_Construct(&*_M_iter, __element); + return *this; + } + + raw_storage_iterator<_ForwardIterator, _Tp>& + operator++() + { + ++_M_iter; + return *this; + } + + raw_storage_iterator<_ForwardIterator, _Tp> + operator++(int) + { + raw_storage_iterator<_ForwardIterator, _Tp> __tmp = *this; + ++_M_iter; + return __tmp; + } + }; + +} // namespace std + +#endif diff --git a/cpp_src/stl_relops.h b/cpp_src/stl_relops.h new file mode 100644 index 0000000..e216249 --- /dev/null +++ b/cpp_src/stl_relops.h @@ -0,0 +1,138 @@ +// std::rel_ops implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2004, 2005 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * Copyright (c) 1996,1997 + * Silicon Graphics + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + */ + +/** @file stl_relops.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + * + * @if maint + * Inclusion of this file has been removed from + * all of the other STL headers for safety reasons, except std_utility.h. + * For more information, see the thread of about twenty messages starting + * with http://gcc.gnu.org/ml/libstdc++/2001-01/msg00223.html , or the + * FAQ at http://gcc.gnu.org/onlinedocs/libstdc++/faq/index.html#4_4 . + * + * Short summary: the rel_ops operators should be avoided for the present. + * @endif + */ + +#ifndef _STL_RELOPS_H +#define _STL_RELOPS_H 1 + +namespace std { + + namespace rel_ops + { + /** @namespace std::rel_ops + * @brief The generated relational operators are sequestered here. + */ + + /** + * @brief Defines @c != for arbitrary types, in terms of @c ==. + * @param x A thing. + * @param y Another thing. + * @return x != y + * + * This function uses @c == to determine its result. + */ + template + inline bool + operator!=(const _Tp& __x, const _Tp& __y) + { return !(__x == __y); } + + /** + * @brief Defines @c > for arbitrary types, in terms of @c <. + * @param x A thing. + * @param y Another thing. + * @return x > y + * + * This function uses @c < to determine its result. + */ + template + inline bool + operator>(const _Tp& __x, const _Tp& __y) + { return __y < __x; } + + /** + * @brief Defines @c <= for arbitrary types, in terms of @c <. + * @param x A thing. + * @param y Another thing. + * @return x <= y + * + * This function uses @c < to determine its result. + */ + template + inline bool + operator<=(const _Tp& __x, const _Tp& __y) + { return !(__y < __x); } + + /** + * @brief Defines @c >= for arbitrary types, in terms of @c <. + * @param x A thing. + * @param y Another thing. + * @return x >= y + * + * This function uses @c < to determine its result. + */ + template + inline bool + operator>=(const _Tp& __x, const _Tp& __y) + { return !(__x < __y); } + + } // namespace rel_ops + +} // namespace std + +#endif /* _STL_RELOPS_H */ diff --git a/cpp_src/stl_set.h b/cpp_src/stl_set.h new file mode 100644 index 0000000..5797ce7 --- /dev/null +++ b/cpp_src/stl_set.h @@ -0,0 +1,578 @@ +// Set implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2004, 2005, 2006 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_set.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _SET_H +#define _SET_H 1 + +#include + +namespace std { + + /** + * @brief A standard container made up of unique keys, which can be + * retrieved in logarithmic time. + * + * @ingroup Containers + * @ingroup Assoc_containers + * + * Meets the requirements of a container, a + * reversible container, and an + * associative container (using unique keys). + * + * Sets support bidirectional iterators. + * + * @param Key Type of key objects. + * @param Compare Comparison function object type, defaults to less. + * @param Alloc Allocator type, defaults to allocator. + * + * @if maint + * The private tree data is declared exactly the same way for set and + * multiset; the distinction is made entirely in how the tree functions are + * called (*_unique versus *_equal, same as the standard). + * @endif + */ + template, + class _Alloc = std::allocator<_Key> > + class set + { + // concept requirements + typedef typename _Alloc::value_type _Alloc_value_type; + __glibcxx_class_requires(_Key, _SGIAssignableConcept) + __glibcxx_class_requires4(_Compare, bool, _Key, _Key, + _BinaryFunctionConcept) + __glibcxx_class_requires2(_Key, _Alloc_value_type, _SameTypeConcept) + + public: + // typedefs: + //@{ + /// Public typedefs. + typedef _Key key_type; + typedef _Key value_type; + typedef _Compare key_compare; + typedef _Compare value_compare; + typedef _Alloc allocator_type; + //@} + + private: + typedef typename _Alloc::template rebind<_Key>::other _Key_alloc_type; + + typedef _Rb_tree, + key_compare, _Key_alloc_type> _Rep_type; + _Rep_type _M_t; // red-black tree representing set + + public: + //@{ + /// Iterator-related typedefs. + typedef typename _Key_alloc_type::pointer pointer; + typedef typename _Key_alloc_type::const_pointer const_pointer; + typedef typename _Key_alloc_type::reference reference; + typedef typename _Key_alloc_type::const_reference const_reference; + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 103. set::iterator is required to be modifiable, + // but this allows modification of keys. + typedef typename _Rep_type::const_iterator iterator; + typedef typename _Rep_type::const_iterator const_iterator; + typedef typename _Rep_type::const_reverse_iterator reverse_iterator; + typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator; + typedef typename _Rep_type::size_type size_type; + typedef typename _Rep_type::difference_type difference_type; + //@} + + // allocation/deallocation + /// Default constructor creates no elements. + set() + : _M_t(_Compare(), allocator_type()) {} + + /** + * @brief Default constructor creates no elements. + * + * @param comp Comparator to use. + * @param a Allocator to use. + */ + explicit + set(const _Compare& __comp, + const allocator_type& __a = allocator_type()) + : _M_t(__comp, __a) {} + + /** + * @brief Builds a %set from a range. + * @param first An input iterator. + * @param last An input iterator. + * + * Create a %set consisting of copies of the elements from [first,last). + * This is linear in N if the range is already sorted, and NlogN + * otherwise (where N is distance(first,last)). + */ + template + set(_InputIterator __first, _InputIterator __last) + : _M_t(_Compare(), allocator_type()) + { _M_t._M_insert_unique(__first, __last); } + + /** + * @brief Builds a %set from a range. + * @param first An input iterator. + * @param last An input iterator. + * @param comp A comparison functor. + * @param a An allocator object. + * + * Create a %set consisting of copies of the elements from [first,last). + * This is linear in N if the range is already sorted, and NlogN + * otherwise (where N is distance(first,last)). + */ + template + set(_InputIterator __first, _InputIterator __last, + const _Compare& __comp, + const allocator_type& __a = allocator_type()) + : _M_t(__comp, __a) + { _M_t._M_insert_unique(__first, __last); } + + /** + * @brief Set copy constructor. + * @param x A %set of identical element and allocator types. + * + * The newly-created %set uses a copy of the allocation object used + * by @a x. + */ + set(const set<_Key,_Compare,_Alloc>& __x) + : _M_t(__x._M_t) { } + + /** + * @brief Set assignment operator. + * @param x A %set of identical element and allocator types. + * + * All the elements of @a x are copied, but unlike the copy constructor, + * the allocator object is not copied. + */ + set<_Key,_Compare,_Alloc>& + operator=(const set<_Key, _Compare, _Alloc>& __x) + { + _M_t = __x._M_t; + return *this; + } + + // accessors: + + /// Returns the comparison object with which the %set was constructed. + key_compare + key_comp() const + { return _M_t.key_comp(); } + /// Returns the comparison object with which the %set was constructed. + value_compare + value_comp() const + { return _M_t.key_comp(); } + /// Returns the allocator object with which the %set was constructed. + allocator_type + get_allocator() const + { return _M_t.get_allocator(); } + + /** + * Returns a read/write iterator that points to the first element in the + * %set. Iteration is done in ascending order according to the keys. + */ + iterator + begin() const + { return _M_t.begin(); } + + /** + * Returns a read/write iterator that points one past the last element in + * the %set. Iteration is done in ascending order according to the keys. + */ + iterator + end() const + { return _M_t.end(); } + + /** + * Returns a read/write reverse iterator that points to the last element + * in the %set. Iteration is done in descending order according to the + * keys. + */ + reverse_iterator + rbegin() const + { return _M_t.rbegin(); } + + /** + * Returns a read-only (constant) reverse iterator that points to the + * last pair in the %map. Iteration is done in descending order + * according to the keys. + */ + reverse_iterator + rend() const + { return _M_t.rend(); } + + /// Returns true if the %set is empty. + bool + empty() const + { return _M_t.empty(); } + + /// Returns the size of the %set. + size_type + size() const + { return _M_t.size(); } + + /// Returns the maximum size of the %set. + size_type + max_size() const + { return _M_t.max_size(); } + + /** + * @brief Swaps data with another %set. + * @param x A %set of the same element and allocator types. + * + * This exchanges the elements between two sets in constant time. + * (It is only swapping a pointer, an integer, and an instance of + * the @c Compare type (which itself is often stateless and empty), so it + * should be quite fast.) + * Note that the global std::swap() function is specialized such that + * std::swap(s1,s2) will feed to this function. + */ + void + swap(set<_Key,_Compare,_Alloc>& __x) + { _M_t.swap(__x._M_t); } + + // insert/erase + /** + * @brief Attempts to insert an element into the %set. + * @param x Element to be inserted. + * @return A pair, of which the first element is an iterator that points + * to the possibly inserted element, and the second is a bool + * that is true if the element was actually inserted. + * + * This function attempts to insert an element into the %set. A %set + * relies on unique keys and thus an element is only inserted if it is + * not already present in the %set. + * + * Insertion requires logarithmic time. + */ + std::pair + insert(const value_type& __x) + { + std::pair __p = + _M_t._M_insert_unique(__x); + return std::pair(__p.first, __p.second); + } + + /** + * @brief Attempts to insert an element into the %set. + * @param position An iterator that serves as a hint as to where the + * element should be inserted. + * @param x Element to be inserted. + * @return An iterator that points to the element with key of @a x (may + * or may not be the element passed in). + * + * This function is not concerned about whether the insertion took place, + * and thus does not return a boolean like the single-argument insert() + * does. Note that the first parameter is only a hint and can + * potentially improve the performance of the insertion process. A bad + * hint would cause no gains in efficiency. + * + * See http://gcc.gnu.org/onlinedocs/libstdc++/23_containers/howto.html#4 + * for more on "hinting". + * + * Insertion requires logarithmic time (if the hint is not taken). + */ + iterator + insert(iterator __position, const value_type& __x) + { return _M_t._M_insert_unique(__position, __x); } + + /** + * @brief A template function that attemps to insert a range of elements. + * @param first Iterator pointing to the start of the range to be + * inserted. + * @param last Iterator pointing to the end of the range. + * + * Complexity similar to that of the range constructor. + */ + template + void + insert(_InputIterator __first, _InputIterator __last) + { _M_t._M_insert_unique(__first, __last); } + + /** + * @brief Erases an element from a %set. + * @param position An iterator pointing to the element to be erased. + * + * This function erases an element, pointed to by the given iterator, + * from a %set. Note that this function only erases the element, and + * that if the element is itself a pointer, the pointed-to memory is not + * touched in any way. Managing the pointer is the user's responsibilty. + */ + void + erase(iterator __position) + { _M_t.erase(__position); } + + /** + * @brief Erases elements according to the provided key. + * @param x Key of element to be erased. + * @return The number of elements erased. + * + * This function erases all the elements located by the given key from + * a %set. + * Note that this function only erases the element, and that if + * the element is itself a pointer, the pointed-to memory is not touched + * in any way. Managing the pointer is the user's responsibilty. + */ + size_type + erase(const key_type& __x) + { return _M_t.erase(__x); } + + /** + * @brief Erases a [first,last) range of elements from a %set. + * @param first Iterator pointing to the start of the range to be + * erased. + * @param last Iterator pointing to the end of the range to be erased. + * + * This function erases a sequence of elements from a %set. + * Note that this function only erases the element, and that if + * the element is itself a pointer, the pointed-to memory is not touched + * in any way. Managing the pointer is the user's responsibilty. + */ + void + erase(iterator __first, iterator __last) + { _M_t.erase(__first, __last); } + + /** + * Erases all elements in a %set. Note that this function only erases + * the elements, and that if the elements themselves are pointers, the + * pointed-to memory is not touched in any way. Managing the pointer is + * the user's responsibilty. + */ + void + clear() + { _M_t.clear(); } + + // set operations: + + /** + * @brief Finds the number of elements. + * @param x Element to located. + * @return Number of elements with specified key. + * + * This function only makes sense for multisets; for set the result will + * either be 0 (not present) or 1 (present). + */ + size_type + count(const key_type& __x) const + { return _M_t.find(__x) == _M_t.end() ? 0 : 1; } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 214. set::find() missing const overload + //@{ + /** + * @brief Tries to locate an element in a %set. + * @param x Element to be located. + * @return Iterator pointing to sought-after element, or end() if not + * found. + * + * This function takes a key and tries to locate the element with which + * the key matches. If successful the function returns an iterator + * pointing to the sought after element. If unsuccessful it returns the + * past-the-end ( @c end() ) iterator. + */ + iterator + find(const key_type& __x) + { return _M_t.find(__x); } + + const_iterator + find(const key_type& __x) const + { return _M_t.find(__x); } + //@} + + //@{ + /** + * @brief Finds the beginning of a subsequence matching given key. + * @param x Key to be located. + * @return Iterator pointing to first element equal to or greater + * than key, or end(). + * + * This function returns the first element of a subsequence of elements + * that matches the given key. If unsuccessful it returns an iterator + * pointing to the first element that has a greater value than given key + * or end() if no such element exists. + */ + iterator + lower_bound(const key_type& __x) + { return _M_t.lower_bound(__x); } + + const_iterator + lower_bound(const key_type& __x) const + { return _M_t.lower_bound(__x); } + //@} + + //@{ + /** + * @brief Finds the end of a subsequence matching given key. + * @param x Key to be located. + * @return Iterator pointing to the first element + * greater than key, or end(). + */ + iterator + upper_bound(const key_type& __x) + { return _M_t.upper_bound(__x); } + + const_iterator + upper_bound(const key_type& __x) const + { return _M_t.upper_bound(__x); } + //@} + + //@{ + /** + * @brief Finds a subsequence matching given key. + * @param x Key to be located. + * @return Pair of iterators that possibly points to the subsequence + * matching given key. + * + * This function is equivalent to + * @code + * std::make_pair(c.lower_bound(val), + * c.upper_bound(val)) + * @endcode + * (but is faster than making the calls separately). + * + * This function probably only makes sense for multisets. + */ + std::pair + equal_range(const key_type& __x) + { return _M_t.equal_range(__x); } + + std::pair + equal_range(const key_type& __x) const + { return _M_t.equal_range(__x); } + //@} + + template + friend bool + operator== (const set<_K1, _C1, _A1>&, const set<_K1, _C1, _A1>&); + + template + friend bool + operator< (const set<_K1, _C1, _A1>&, const set<_K1, _C1, _A1>&); + }; + + + /** + * @brief Set equality comparison. + * @param x A %set. + * @param y A %set of the same type as @a x. + * @return True iff the size and elements of the sets are equal. + * + * This is an equivalence relation. It is linear in the size of the sets. + * Sets are considered equivalent if their sizes are equal, and if + * corresponding elements compare equal. + */ + template + inline bool + operator==(const set<_Key, _Compare, _Alloc>& __x, + const set<_Key, _Compare, _Alloc>& __y) + { return __x._M_t == __y._M_t; } + + /** + * @brief Set ordering relation. + * @param x A %set. + * @param y A %set of the same type as @a x. + * @return True iff @a x is lexicographically less than @a y. + * + * This is a total ordering relation. It is linear in the size of the + * maps. The elements must be comparable with @c <. + * + * See std::lexicographical_compare() for how the determination is made. + */ + template + inline bool + operator<(const set<_Key, _Compare, _Alloc>& __x, + const set<_Key, _Compare, _Alloc>& __y) + { return __x._M_t < __y._M_t; } + + /// Returns !(x == y). + template + inline bool + operator!=(const set<_Key, _Compare, _Alloc>& __x, + const set<_Key, _Compare, _Alloc>& __y) + { return !(__x == __y); } + + /// Returns y < x. + template + inline bool + operator>(const set<_Key, _Compare, _Alloc>& __x, + const set<_Key, _Compare, _Alloc>& __y) + { return __y < __x; } + + /// Returns !(y < x) + template + inline bool + operator<=(const set<_Key, _Compare, _Alloc>& __x, + const set<_Key, _Compare, _Alloc>& __y) + { return !(__y < __x); } + + /// Returns !(x < y) + template + inline bool + operator>=(const set<_Key, _Compare, _Alloc>& __x, + const set<_Key, _Compare, _Alloc>& __y) + { return !(__x < __y); } + + /// See std::set::swap(). + template + inline void + swap(set<_Key, _Compare, _Alloc>& __x, set<_Key, _Compare, _Alloc>& __y) + { __x.swap(__y); } + +} // namespace std + +#endif /* _SET_H */ diff --git a/cpp_src/stl_stack.h b/cpp_src/stl_stack.h new file mode 100644 index 0000000..f576073 --- /dev/null +++ b/cpp_src/stl_stack.h @@ -0,0 +1,261 @@ +// Stack implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_stack.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STACK_H +#define _STACK_H 1 + +#include +#include + +namespace std { + + /** + * @brief A standard container giving FILO behavior. + * + * @ingroup Containers + * @ingroup Sequences + * + * Meets many of the requirements of a + * container, + * but does not define anything to do with iterators. Very few of the + * other standard container interfaces are defined. + * + * This is not a true container, but an @e adaptor. It holds + * another container, and provides a wrapper interface to that + * container. The wrapper is what enforces strict + * first-in-last-out %stack behavior. + * + * The second template parameter defines the type of the underlying + * sequence/container. It defaults to std::deque, but it can be + * any type that supports @c back, @c push_back, and @c pop_front, + * such as std::list, std::vector, or an appropriate user-defined + * type. + * + * Members not found in "normal" containers are @c container_type, + * which is a typedef for the second Sequence parameter, and @c + * push, @c pop, and @c top, which are standard %stack/FILO + * operations. + */ + template > + class stack + { + // concept requirements + typedef typename _Sequence::value_type _Sequence_value_type; + __glibcxx_class_requires(_Tp, _SGIAssignableConcept) + __glibcxx_class_requires(_Sequence, _BackInsertionSequenceConcept) + __glibcxx_class_requires2(_Tp, _Sequence_value_type, _SameTypeConcept) + + template + friend bool + operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&); + + template + friend bool + operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&); + + public: + typedef typename _Sequence::value_type value_type; + typedef typename _Sequence::reference reference; + typedef typename _Sequence::const_reference const_reference; + typedef typename _Sequence::size_type size_type; + typedef _Sequence container_type; + + protected: + // See queue::c for notes on this name. + _Sequence c; + + public: + // XXX removed old def ctor, added def arg to this one to match 14882 + /** + * @brief Default constructor creates no elements. + */ + explicit + stack(const _Sequence& __c = _Sequence()) + : c(__c) { } + + /** + * Returns true if the %stack is empty. + */ + bool + empty() const + { return c.empty(); } + + /** Returns the number of elements in the %stack. */ + size_type + size() const + { return c.size(); } + + /** + * Returns a read/write reference to the data at the first + * element of the %stack. + */ + reference + top() + { + __glibcxx_requires_nonempty(); + return c.back(); + } + + /** + * Returns a read-only (constant) reference to the data at the first + * element of the %stack. + */ + const_reference + top() const + { + __glibcxx_requires_nonempty(); + return c.back(); + } + + /** + * @brief Add data to the top of the %stack. + * @param x Data to be added. + * + * This is a typical %stack operation. The function creates an + * element at the top of the %stack and assigns the given data + * to it. The time complexity of the operation depends on the + * underlying sequence. + */ + void + push(const value_type& __x) + { c.push_back(__x); } + + /** + * @brief Removes first element. + * + * This is a typical %stack operation. It shrinks the %stack + * by one. The time complexity of the operation depends on the + * underlying sequence. + * + * Note that no data is returned, and if the first element's + * data is needed, it should be retrieved before pop() is + * called. + */ + void + pop() + { + __glibcxx_requires_nonempty(); + c.pop_back(); + } + }; + + /** + * @brief Stack equality comparison. + * @param x A %stack. + * @param y A %stack of the same type as @a x. + * @return True iff the size and elements of the stacks are equal. + * + * This is an equivalence relation. Complexity and semantics + * depend on the underlying sequence type, but the expected rules + * are: this relation is linear in the size of the sequences, and + * stacks are considered equivalent if their sequences compare + * equal. + */ + template + inline bool + operator==(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) + { return __x.c == __y.c; } + + /** + * @brief Stack ordering relation. + * @param x A %stack. + * @param y A %stack of the same type as @a x. + * @return True iff @a x is lexicographically less than @a y. + * + * This is an total ordering relation. Complexity and semantics + * depend on the underlying sequence type, but the expected rules + * are: this relation is linear in the size of the sequences, the + * elements must be comparable with @c <, and + * std::lexicographical_compare() is usually used to make the + * determination. + */ + template + inline bool + operator<(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) + { return __x.c < __y.c; } + + /// Based on operator== + template + inline bool + operator!=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) + { return !(__x == __y); } + + /// Based on operator< + template + inline bool + operator>(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) + { return __y < __x; } + + /// Based on operator< + template + inline bool + operator<=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) + { return !(__y < __x); } + + /// Based on operator< + template + inline bool + operator>=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) + { return !(__x < __y); } + +} // namespace std + +#endif /* _STACK_H */ diff --git a/cpp_src/stl_tempbuf.h b/cpp_src/stl_tempbuf.h new file mode 100644 index 0000000..99ddf54 --- /dev/null +++ b/cpp_src/stl_tempbuf.h @@ -0,0 +1,172 @@ +// Temporary buffer implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_tempbuf.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _TEMPBUF_H +#define _TEMPBUF_H 1 + +#include + +namespace std { + + /** + * @if maint + * This class is used in two places: stl_algo.h and ext/memory, + * where it is wrapped as the temporary_buffer class. See + * temporary_buffer docs for more notes. + * @endif + */ + template + class _Temporary_buffer + { + // concept requirements + __glibcxx_class_requires(_ForwardIterator, _ForwardIteratorConcept) + + public: + typedef _Tp value_type; + typedef value_type* pointer; + typedef pointer iterator; + typedef ptrdiff_t size_type; + + protected: + size_type _M_original_len; + size_type _M_len; + pointer _M_buffer; + + void + _M_initialize_buffer(const _Tp&, __true_type) { } + + void + _M_initialize_buffer(const _Tp& __val, __false_type) + { std::uninitialized_fill_n(_M_buffer, _M_len, __val); } + + public: + /// As per Table mumble. + size_type + size() const + { return _M_len; } + + /// Returns the size requested by the constructor; may be >size(). + size_type + requested_size() const + { return _M_original_len; } + + /// As per Table mumble. + iterator + begin() + { return _M_buffer; } + + /// As per Table mumble. + iterator + end() + { return _M_buffer + _M_len; } + + /** + * Constructs a temporary buffer of a size somewhere between + * zero and the size of the given range. + */ + _Temporary_buffer(_ForwardIterator __first, _ForwardIterator __last); + + ~_Temporary_buffer() + { + std::_Destroy(_M_buffer, _M_buffer + _M_len); + std::return_temporary_buffer(_M_buffer); + } + + private: + // Disable copy constructor and assignment operator. + _Temporary_buffer(const _Temporary_buffer&); + + void + operator=(const _Temporary_buffer&); + }; + + + template + _Temporary_buffer<_ForwardIterator, _Tp>:: + _Temporary_buffer(_ForwardIterator __first, _ForwardIterator __last) + : _M_original_len(std::distance(__first, __last)), + _M_len(0), _M_buffer(0) + { + // Workaround for a __type_traits bug in the pre-7.3 compiler. + typedef typename std::__is_scalar<_Tp>::__type _Trivial; + + try + { + pair __p(get_temporary_buffer< + value_type>(_M_original_len)); + _M_buffer = __p.first; + _M_len = __p.second; + if (_M_len > 0) + _M_initialize_buffer(*__first, _Trivial()); + } + catch(...) + { + std::return_temporary_buffer(_M_buffer); + _M_buffer = 0; + _M_len = 0; + __throw_exception_again; + } + } + +} // namespace std + +#endif /* _TEMPBUF_H */ + diff --git a/cpp_src/stl_tree.h b/cpp_src/stl_tree.h new file mode 100644 index 0000000..14978f1 --- /dev/null +++ b/cpp_src/stl_tree.h @@ -0,0 +1,1557 @@ +// RB tree implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + */ + +/** @file stl_tree.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _TREE_H +#define _TREE_H 1 + +#include +#include +#include +#include +#include + +namespace std { + + // Red-black tree class, designed for use in implementing STL + // associative containers (set, multiset, map, and multimap). The + // insertion and deletion algorithms are based on those in Cormen, + // Leiserson, and Rivest, Introduction to Algorithms (MIT Press, + // 1990), except that + // + // (1) the header cell is maintained with links not only to the root + // but also to the leftmost node of the tree, to enable constant + // time begin(), and to the rightmost node of the tree, to enable + // linear time performance when used with the generic set algorithms + // (set_union, etc.) + // + // (2) when a node being deleted has two children its successor node + // is relinked into its place, rather than copied, so that the only + // iterators invalidated are those referring to the deleted node. + + enum _Rb_tree_color { _S_red = false, _S_black = true }; + + struct _Rb_tree_node_base + { + typedef _Rb_tree_node_base* _Base_ptr; + typedef const _Rb_tree_node_base* _Const_Base_ptr; + + _Rb_tree_color _M_color; + _Base_ptr _M_parent; + _Base_ptr _M_left; + _Base_ptr _M_right; + + static _Base_ptr + _S_minimum(_Base_ptr __x) + { + while (__x->_M_left != 0) __x = __x->_M_left; + return __x; + } + + static _Const_Base_ptr + _S_minimum(_Const_Base_ptr __x) + { + while (__x->_M_left != 0) __x = __x->_M_left; + return __x; + } + + static _Base_ptr + _S_maximum(_Base_ptr __x) + { + while (__x->_M_right != 0) __x = __x->_M_right; + return __x; + } + + static _Const_Base_ptr + _S_maximum(_Const_Base_ptr __x) + { + while (__x->_M_right != 0) __x = __x->_M_right; + return __x; + } + }; + + template + struct _Rb_tree_node : public _Rb_tree_node_base + { + typedef _Rb_tree_node<_Val>* _Link_type; + _Val _M_value_field; + }; + + _Rb_tree_node_base* + _Rb_tree_increment(_Rb_tree_node_base* __x); + + const _Rb_tree_node_base* + _Rb_tree_increment(const _Rb_tree_node_base* __x); + + _Rb_tree_node_base* + _Rb_tree_decrement(_Rb_tree_node_base* __x); + + const _Rb_tree_node_base* + _Rb_tree_decrement(const _Rb_tree_node_base* __x); + + template + struct _Rb_tree_iterator + { + typedef _Tp value_type; + typedef _Tp& reference; + typedef _Tp* pointer; + + typedef bidirectional_iterator_tag iterator_category; + typedef ptrdiff_t difference_type; + + typedef _Rb_tree_iterator<_Tp> _Self; + typedef _Rb_tree_node_base::_Base_ptr _Base_ptr; + typedef _Rb_tree_node<_Tp>* _Link_type; + + _Rb_tree_iterator() + : _M_node() { } + + explicit + _Rb_tree_iterator(_Link_type __x) + : _M_node(__x) { } + + reference + operator*() const + { return static_cast<_Link_type>(_M_node)->_M_value_field; } + + pointer + operator->() const + { return &static_cast<_Link_type>(_M_node)->_M_value_field; } + + _Self& + operator++() + { + _M_node = _Rb_tree_increment(_M_node); + return *this; + } + + _Self + operator++(int) + { + _Self __tmp = *this; + _M_node = _Rb_tree_increment(_M_node); + return __tmp; + } + + _Self& + operator--() + { + _M_node = _Rb_tree_decrement(_M_node); + return *this; + } + + _Self + operator--(int) + { + _Self __tmp = *this; + _M_node = _Rb_tree_decrement(_M_node); + return __tmp; + } + + bool + operator==(const _Self& __x) const + { return _M_node == __x._M_node; } + + bool + operator!=(const _Self& __x) const + { return _M_node != __x._M_node; } + + _Base_ptr _M_node; + }; + + template + struct _Rb_tree_const_iterator + { + typedef _Tp value_type; + typedef const _Tp& reference; + typedef const _Tp* pointer; + + typedef _Rb_tree_iterator<_Tp> iterator; + + typedef bidirectional_iterator_tag iterator_category; + typedef ptrdiff_t difference_type; + + typedef _Rb_tree_const_iterator<_Tp> _Self; + typedef _Rb_tree_node_base::_Const_Base_ptr _Base_ptr; + typedef const _Rb_tree_node<_Tp>* _Link_type; + + _Rb_tree_const_iterator() + : _M_node() { } + + explicit + _Rb_tree_const_iterator(_Link_type __x) + : _M_node(__x) { } + + _Rb_tree_const_iterator(const iterator& __it) + : _M_node(__it._M_node) { } + + reference + operator*() const + { return static_cast<_Link_type>(_M_node)->_M_value_field; } + + pointer + operator->() const + { return &static_cast<_Link_type>(_M_node)->_M_value_field; } + + _Self& + operator++() + { + _M_node = _Rb_tree_increment(_M_node); + return *this; + } + + _Self + operator++(int) + { + _Self __tmp = *this; + _M_node = _Rb_tree_increment(_M_node); + return __tmp; + } + + _Self& + operator--() + { + _M_node = _Rb_tree_decrement(_M_node); + return *this; + } + + _Self + operator--(int) + { + _Self __tmp = *this; + _M_node = _Rb_tree_decrement(_M_node); + return __tmp; + } + + bool + operator==(const _Self& __x) const + { return _M_node == __x._M_node; } + + bool + operator!=(const _Self& __x) const + { return _M_node != __x._M_node; } + + _Base_ptr _M_node; + }; + + template + inline bool + operator==(const _Rb_tree_iterator<_Val>& __x, + const _Rb_tree_const_iterator<_Val>& __y) + { return __x._M_node == __y._M_node; } + + template + inline bool + operator!=(const _Rb_tree_iterator<_Val>& __x, + const _Rb_tree_const_iterator<_Val>& __y) + { return __x._M_node != __y._M_node; } + + void + _Rb_tree_rotate_left(_Rb_tree_node_base* const __x, + _Rb_tree_node_base*& __root); + + void + _Rb_tree_rotate_right(_Rb_tree_node_base* const __x, + _Rb_tree_node_base*& __root); + + void + _Rb_tree_insert_and_rebalance(const bool __insert_left, + _Rb_tree_node_base* __x, + _Rb_tree_node_base* __p, + _Rb_tree_node_base& __header); + + _Rb_tree_node_base* + _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* const __z, + _Rb_tree_node_base& __header); + + + template > + class _Rb_tree + { + typedef typename _Alloc::template rebind<_Rb_tree_node<_Val> >::other + _Node_allocator; + + protected: + typedef _Rb_tree_node_base* _Base_ptr; + typedef const _Rb_tree_node_base* _Const_Base_ptr; + typedef _Rb_tree_node<_Val> _Rb_tree_node; + + public: + typedef _Key key_type; + typedef _Val value_type; + typedef value_type* pointer; + typedef const value_type* const_pointer; + typedef value_type& reference; + typedef const value_type& const_reference; + typedef _Rb_tree_node* _Link_type; + typedef const _Rb_tree_node* _Const_Link_type; + typedef size_t size_type; + typedef ptrdiff_t difference_type; + typedef _Alloc allocator_type; + + _Node_allocator& + _M_get_Node_allocator() + { return *static_cast<_Node_allocator*>(&this->_M_impl); } + + const _Node_allocator& + _M_get_Node_allocator() const + { return *static_cast(&this->_M_impl); } + + allocator_type + get_allocator() const + { return allocator_type(_M_get_Node_allocator()); } + + protected: + _Rb_tree_node* + _M_get_node() + { return _M_impl._Node_allocator::allocate(1); } + + void + _M_put_node(_Rb_tree_node* __p) + { _M_impl._Node_allocator::deallocate(__p, 1); } + + _Link_type + _M_create_node(const value_type& __x) + { + _Link_type __tmp = _M_get_node(); + try + { get_allocator().construct(&__tmp->_M_value_field, __x); } + catch(...) + { + _M_put_node(__tmp); + __throw_exception_again; + } + return __tmp; + } + + _Link_type + _M_clone_node(_Const_Link_type __x) + { + _Link_type __tmp = _M_create_node(__x->_M_value_field); + __tmp->_M_color = __x->_M_color; + __tmp->_M_left = 0; + __tmp->_M_right = 0; + return __tmp; + } + + void + _M_destroy_node(_Link_type __p) + { + get_allocator().destroy(&__p->_M_value_field); + _M_put_node(__p); + } + + protected: + template::__value> + struct _Rb_tree_impl : public _Node_allocator + { + _Key_compare _M_key_compare; + _Rb_tree_node_base _M_header; + size_type _M_node_count; // Keeps track of size of tree. + + _Rb_tree_impl(const _Node_allocator& __a = _Node_allocator(), + const _Key_compare& __comp = _Key_compare()) + : _Node_allocator(__a), _M_key_compare(__comp), _M_header(), + _M_node_count(0) + { + this->_M_header._M_color = _S_red; + this->_M_header._M_parent = 0; + this->_M_header._M_left = &this->_M_header; + this->_M_header._M_right = &this->_M_header; + } + }; + + // Specialization for _Comparison types that are not capable of + // being base classes / super classes. + template + struct _Rb_tree_impl<_Key_compare, true> : public _Node_allocator + { + _Key_compare _M_key_compare; + _Rb_tree_node_base _M_header; + size_type _M_node_count; // Keeps track of size of tree. + + _Rb_tree_impl(const _Node_allocator& __a = _Node_allocator(), + const _Key_compare& __comp = _Key_compare()) + : _Node_allocator(__a), _M_key_compare(__comp), _M_header(), + _M_node_count(0) + { + this->_M_header._M_color = _S_red; + this->_M_header._M_parent = 0; + this->_M_header._M_left = &this->_M_header; + this->_M_header._M_right = &this->_M_header; + } + }; + + _Rb_tree_impl<_Compare> _M_impl; + + protected: + _Base_ptr& + _M_root() + { return this->_M_impl._M_header._M_parent; } + + _Const_Base_ptr + _M_root() const + { return this->_M_impl._M_header._M_parent; } + + _Base_ptr& + _M_leftmost() + { return this->_M_impl._M_header._M_left; } + + _Const_Base_ptr + _M_leftmost() const + { return this->_M_impl._M_header._M_left; } + + _Base_ptr& + _M_rightmost() + { return this->_M_impl._M_header._M_right; } + + _Const_Base_ptr + _M_rightmost() const + { return this->_M_impl._M_header._M_right; } + + _Link_type + _M_begin() + { return static_cast<_Link_type>(this->_M_impl._M_header._M_parent); } + + _Const_Link_type + _M_begin() const + { + return static_cast<_Const_Link_type> + (this->_M_impl._M_header._M_parent); + } + + _Link_type + _M_end() + { return static_cast<_Link_type>(&this->_M_impl._M_header); } + + _Const_Link_type + _M_end() const + { return static_cast<_Const_Link_type>(&this->_M_impl._M_header); } + + static const_reference + _S_value(_Const_Link_type __x) + { return __x->_M_value_field; } + + static const _Key& + _S_key(_Const_Link_type __x) + { return _KeyOfValue()(_S_value(__x)); } + + static _Link_type + _S_left(_Base_ptr __x) + { return static_cast<_Link_type>(__x->_M_left); } + + static _Const_Link_type + _S_left(_Const_Base_ptr __x) + { return static_cast<_Const_Link_type>(__x->_M_left); } + + static _Link_type + _S_right(_Base_ptr __x) + { return static_cast<_Link_type>(__x->_M_right); } + + static _Const_Link_type + _S_right(_Const_Base_ptr __x) + { return static_cast<_Const_Link_type>(__x->_M_right); } + + static const_reference + _S_value(_Const_Base_ptr __x) + { return static_cast<_Const_Link_type>(__x)->_M_value_field; } + + static const _Key& + _S_key(_Const_Base_ptr __x) + { return _KeyOfValue()(_S_value(__x)); } + + static _Base_ptr + _S_minimum(_Base_ptr __x) + { return _Rb_tree_node_base::_S_minimum(__x); } + + static _Const_Base_ptr + _S_minimum(_Const_Base_ptr __x) + { return _Rb_tree_node_base::_S_minimum(__x); } + + static _Base_ptr + _S_maximum(_Base_ptr __x) + { return _Rb_tree_node_base::_S_maximum(__x); } + + static _Const_Base_ptr + _S_maximum(_Const_Base_ptr __x) + { return _Rb_tree_node_base::_S_maximum(__x); } + + public: + typedef _Rb_tree_iterator iterator; + typedef _Rb_tree_const_iterator const_iterator; + + typedef std::reverse_iterator reverse_iterator; + typedef std::reverse_iterator const_reverse_iterator; + + private: + iterator + _M_insert(_Base_ptr __x, _Base_ptr __y, const value_type& __v); + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 233. Insertion hints in associative containers. + iterator + _M_insert_lower(_Base_ptr __x, _Base_ptr __y, const value_type& __v); + + const_iterator + _M_insert(_Const_Base_ptr __x, _Const_Base_ptr __y, + const value_type& __v); + + _Link_type + _M_copy(_Const_Link_type __x, _Link_type __p); + + void + _M_erase(_Link_type __x); + + public: + // allocation/deallocation + _Rb_tree() + { } + + _Rb_tree(const _Compare& __comp) + : _M_impl(allocator_type(), __comp) + { } + + _Rb_tree(const _Compare& __comp, const allocator_type& __a) + : _M_impl(__a, __comp) + { } + + _Rb_tree(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x) + : _M_impl(__x._M_get_Node_allocator(), __x._M_impl._M_key_compare) + { + if (__x._M_root() != 0) + { + _M_root() = _M_copy(__x._M_begin(), _M_end()); + _M_leftmost() = _S_minimum(_M_root()); + _M_rightmost() = _S_maximum(_M_root()); + _M_impl._M_node_count = __x._M_impl._M_node_count; + } + } + + ~_Rb_tree() + { _M_erase(_M_begin()); } + + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& + operator=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x); + + // Accessors. + _Compare + key_comp() const + { return _M_impl._M_key_compare; } + + iterator + begin() + { + return iterator(static_cast<_Link_type> + (this->_M_impl._M_header._M_left)); + } + + const_iterator + begin() const + { + return const_iterator(static_cast<_Const_Link_type> + (this->_M_impl._M_header._M_left)); + } + + iterator + end() + { return iterator(static_cast<_Link_type>(&this->_M_impl._M_header)); } + + const_iterator + end() const + { + return const_iterator(static_cast<_Const_Link_type> + (&this->_M_impl._M_header)); + } + + reverse_iterator + rbegin() + { return reverse_iterator(end()); } + + const_reverse_iterator + rbegin() const + { return const_reverse_iterator(end()); } + + reverse_iterator + rend() + { return reverse_iterator(begin()); } + + const_reverse_iterator + rend() const + { return const_reverse_iterator(begin()); } + + bool + empty() const + { return _M_impl._M_node_count == 0; } + + size_type + size() const + { return _M_impl._M_node_count; } + + size_type + max_size() const + { return get_allocator().max_size(); } + + void + swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __t); + + // Insert/erase. + pair + _M_insert_unique(const value_type& __x); + + iterator + _M_insert_equal(const value_type& __x); + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 233. Insertion hints in associative containers. + iterator + _M_insert_equal_lower(const value_type& __x); + + iterator + _M_insert_unique(iterator __position, const value_type& __x); + + const_iterator + _M_insert_unique(const_iterator __position, const value_type& __x); + + iterator + _M_insert_equal(iterator __position, const value_type& __x); + + const_iterator + _M_insert_equal(const_iterator __position, const value_type& __x); + + template + void + _M_insert_unique(_InputIterator __first, _InputIterator __last); + + template + void + _M_insert_equal(_InputIterator __first, _InputIterator __last); + + void + erase(iterator __position); + + void + erase(const_iterator __position); + + size_type + erase(const key_type& __x); + + void + erase(iterator __first, iterator __last); + + void + erase(const_iterator __first, const_iterator __last); + + void + erase(const key_type* __first, const key_type* __last); + + void + clear() + { + _M_erase(_M_begin()); + _M_leftmost() = _M_end(); + _M_root() = 0; + _M_rightmost() = _M_end(); + _M_impl._M_node_count = 0; + } + + // Set operations. + iterator + find(const key_type& __x); + + const_iterator + find(const key_type& __x) const; + + size_type + count(const key_type& __x) const; + + iterator + lower_bound(const key_type& __x); + + const_iterator + lower_bound(const key_type& __x) const; + + iterator + upper_bound(const key_type& __x); + + const_iterator + upper_bound(const key_type& __x) const; + + pair + equal_range(const key_type& __x); + + pair + equal_range(const key_type& __x) const; + + // Debugging. + bool + __rb_verify() const; + }; + + template + inline bool + operator==(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, + const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) + { + return __x.size() == __y.size() + && std::equal(__x.begin(), __x.end(), __y.begin()); + } + + template + inline bool + operator<(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, + const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) + { + return std::lexicographical_compare(__x.begin(), __x.end(), + __y.begin(), __y.end()); + } + + template + inline bool + operator!=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, + const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) + { return !(__x == __y); } + + template + inline bool + operator>(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, + const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) + { return __y < __x; } + + template + inline bool + operator<=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, + const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) + { return !(__y < __x); } + + template + inline bool + operator>=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, + const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) + { return !(__x < __y); } + + template + inline void + swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) + { __x.swap(__y); } + + template + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + operator=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x) + { + if (this != &__x) + { + // Note that _Key may be a constant type. + clear(); + _M_impl._M_key_compare = __x._M_impl._M_key_compare; + if (__x._M_root() != 0) + { + _M_root() = _M_copy(__x._M_begin(), _M_end()); + _M_leftmost() = _S_minimum(_M_root()); + _M_rightmost() = _S_maximum(_M_root()); + _M_impl._M_node_count = __x._M_impl._M_node_count; + } + } + return *this; + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + _M_insert(_Base_ptr __x, _Base_ptr __p, const _Val& __v) + { + bool __insert_left = (__x != 0 || __p == _M_end() + || _M_impl._M_key_compare(_KeyOfValue()(__v), + _S_key(__p))); + + _Link_type __z = _M_create_node(__v); + + _Rb_tree_insert_and_rebalance(__insert_left, __z, __p, + this->_M_impl._M_header); + ++_M_impl._M_node_count; + return iterator(__z); + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + _M_insert_lower(_Base_ptr __x, _Base_ptr __p, const _Val& __v) + { + bool __insert_left = (__x != 0 || __p == _M_end() + || !_M_impl._M_key_compare(_S_key(__p), + _KeyOfValue()(__v))); + + _Link_type __z = _M_create_node(__v); + + _Rb_tree_insert_and_rebalance(__insert_left, __z, __p, + this->_M_impl._M_header); + ++_M_impl._M_node_count; + return iterator(__z); + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + _M_insert(_Const_Base_ptr __x, _Const_Base_ptr __p, const _Val& __v) + { + bool __insert_left = (__x != 0 || __p == _M_end() + || _M_impl._M_key_compare(_KeyOfValue()(__v), + _S_key(__p))); + + _Link_type __z = _M_create_node(__v); + + _Rb_tree_insert_and_rebalance(__insert_left, __z, + const_cast<_Base_ptr>(__p), + this->_M_impl._M_header); + ++_M_impl._M_node_count; + return const_iterator(__z); + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + _M_insert_equal(const _Val& __v) + { + _Link_type __x = _M_begin(); + _Link_type __y = _M_end(); + while (__x != 0) + { + __y = __x; + __x = _M_impl._M_key_compare(_KeyOfValue()(__v), _S_key(__x)) ? + _S_left(__x) : _S_right(__x); + } + return _M_insert(__x, __y, __v); + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + _M_insert_equal_lower(const _Val& __v) + { + _Link_type __x = _M_begin(); + _Link_type __y = _M_end(); + while (__x != 0) + { + __y = __x; + __x = !_M_impl._M_key_compare(_S_key(__x), _KeyOfValue()(__v)) ? + _S_left(__x) : _S_right(__x); + } + return _M_insert_lower(__x, __y, __v); + } + + template + void + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __t) + { + if (_M_root() == 0) + { + if (__t._M_root() != 0) + { + _M_root() = __t._M_root(); + _M_leftmost() = __t._M_leftmost(); + _M_rightmost() = __t._M_rightmost(); + _M_root()->_M_parent = _M_end(); + + __t._M_root() = 0; + __t._M_leftmost() = __t._M_end(); + __t._M_rightmost() = __t._M_end(); + } + } + else if (__t._M_root() == 0) + { + __t._M_root() = _M_root(); + __t._M_leftmost() = _M_leftmost(); + __t._M_rightmost() = _M_rightmost(); + __t._M_root()->_M_parent = __t._M_end(); + + _M_root() = 0; + _M_leftmost() = _M_end(); + _M_rightmost() = _M_end(); + } + else + { + std::swap(_M_root(),__t._M_root()); + std::swap(_M_leftmost(),__t._M_leftmost()); + std::swap(_M_rightmost(),__t._M_rightmost()); + + _M_root()->_M_parent = _M_end(); + __t._M_root()->_M_parent = __t._M_end(); + } + // No need to swap header's color as it does not change. + std::swap(this->_M_impl._M_node_count, __t._M_impl._M_node_count); + std::swap(this->_M_impl._M_key_compare, __t._M_impl._M_key_compare); + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 431. Swapping containers with unequal allocators. + std::__alloc_swap<_Node_allocator>:: + _S_do_it(_M_get_Node_allocator(), __t._M_get_Node_allocator()); + } + + template + pair::iterator, bool> + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + _M_insert_unique(const _Val& __v) + { + _Link_type __x = _M_begin(); + _Link_type __y = _M_end(); + bool __comp = true; + while (__x != 0) + { + __y = __x; + __comp = _M_impl._M_key_compare(_KeyOfValue()(__v), _S_key(__x)); + __x = __comp ? _S_left(__x) : _S_right(__x); + } + iterator __j = iterator(__y); + if (__comp) + if (__j == begin()) + return pair(_M_insert(__x, __y, __v), true); + else + --__j; + if (_M_impl._M_key_compare(_S_key(__j._M_node), _KeyOfValue()(__v))) + return pair(_M_insert(__x, __y, __v), true); + return pair(__j, false); + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + _M_insert_unique(iterator __position, const _Val& __v) + { + // end() + if (__position._M_node == _M_end()) + { + if (size() > 0 + && _M_impl._M_key_compare(_S_key(_M_rightmost()), + _KeyOfValue()(__v))) + return _M_insert(0, _M_rightmost(), __v); + else + return _M_insert_unique(__v).first; + } + else if (_M_impl._M_key_compare(_KeyOfValue()(__v), + _S_key(__position._M_node))) + { + // First, try before... + iterator __before = __position; + if (__position._M_node == _M_leftmost()) // begin() + return _M_insert(_M_leftmost(), _M_leftmost(), __v); + else if (_M_impl._M_key_compare(_S_key((--__before)._M_node), + _KeyOfValue()(__v))) + { + if (_S_right(__before._M_node) == 0) + return _M_insert(0, __before._M_node, __v); + else + return _M_insert(__position._M_node, + __position._M_node, __v); + } + else + return _M_insert_unique(__v).first; + } + else if (_M_impl._M_key_compare(_S_key(__position._M_node), + _KeyOfValue()(__v))) + { + // ... then try after. + iterator __after = __position; + if (__position._M_node == _M_rightmost()) + return _M_insert(0, _M_rightmost(), __v); + else if (_M_impl._M_key_compare(_KeyOfValue()(__v), + _S_key((++__after)._M_node))) + { + if (_S_right(__position._M_node) == 0) + return _M_insert(0, __position._M_node, __v); + else + return _M_insert(__after._M_node, __after._M_node, __v); + } + else + return _M_insert_unique(__v).first; + } + else + return __position; // Equivalent keys. + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + _M_insert_unique(const_iterator __position, const _Val& __v) + { + // end() + if (__position._M_node == _M_end()) + { + if (size() > 0 + && _M_impl._M_key_compare(_S_key(_M_rightmost()), + _KeyOfValue()(__v))) + return _M_insert(0, _M_rightmost(), __v); + else + return const_iterator(_M_insert_unique(__v).first); + } + else if (_M_impl._M_key_compare(_KeyOfValue()(__v), + _S_key(__position._M_node))) + { + // First, try before... + const_iterator __before = __position; + if (__position._M_node == _M_leftmost()) // begin() + return _M_insert(_M_leftmost(), _M_leftmost(), __v); + else if (_M_impl._M_key_compare(_S_key((--__before)._M_node), + _KeyOfValue()(__v))) + { + if (_S_right(__before._M_node) == 0) + return _M_insert(0, __before._M_node, __v); + else + return _M_insert(__position._M_node, + __position._M_node, __v); + } + else + return const_iterator(_M_insert_unique(__v).first); + } + else if (_M_impl._M_key_compare(_S_key(__position._M_node), + _KeyOfValue()(__v))) + { + // ... then try after. + const_iterator __after = __position; + if (__position._M_node == _M_rightmost()) + return _M_insert(0, _M_rightmost(), __v); + else if (_M_impl._M_key_compare(_KeyOfValue()(__v), + _S_key((++__after)._M_node))) + { + if (_S_right(__position._M_node) == 0) + return _M_insert(0, __position._M_node, __v); + else + return _M_insert(__after._M_node, __after._M_node, __v); + } + else + return const_iterator(_M_insert_unique(__v).first); + } + else + return __position; // Equivalent keys. + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + _M_insert_equal(iterator __position, const _Val& __v) + { + // end() + if (__position._M_node == _M_end()) + { + if (size() > 0 + && !_M_impl._M_key_compare(_KeyOfValue()(__v), + _S_key(_M_rightmost()))) + return _M_insert(0, _M_rightmost(), __v); + else + return _M_insert_equal(__v); + } + else if (!_M_impl._M_key_compare(_S_key(__position._M_node), + _KeyOfValue()(__v))) + { + // First, try before... + iterator __before = __position; + if (__position._M_node == _M_leftmost()) // begin() + return _M_insert(_M_leftmost(), _M_leftmost(), __v); + else if (!_M_impl._M_key_compare(_KeyOfValue()(__v), + _S_key((--__before)._M_node))) + { + if (_S_right(__before._M_node) == 0) + return _M_insert(0, __before._M_node, __v); + else + return _M_insert(__position._M_node, + __position._M_node, __v); + } + else + return _M_insert_equal(__v); + } + else + { + // ... then try after. + iterator __after = __position; + if (__position._M_node == _M_rightmost()) + return _M_insert(0, _M_rightmost(), __v); + else if (!_M_impl._M_key_compare(_S_key((++__after)._M_node), + _KeyOfValue()(__v))) + { + if (_S_right(__position._M_node) == 0) + return _M_insert(0, __position._M_node, __v); + else + return _M_insert(__after._M_node, __after._M_node, __v); + } + else + return _M_insert_equal_lower(__v); + } + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + _M_insert_equal(const_iterator __position, const _Val& __v) + { + // end() + if (__position._M_node == _M_end()) + { + if (size() > 0 + && !_M_impl._M_key_compare(_KeyOfValue()(__v), + _S_key(_M_rightmost()))) + return _M_insert(0, _M_rightmost(), __v); + else + return const_iterator(_M_insert_equal(__v)); + } + else if (!_M_impl._M_key_compare(_S_key(__position._M_node), + _KeyOfValue()(__v))) + { + // First, try before... + const_iterator __before = __position; + if (__position._M_node == _M_leftmost()) // begin() + return _M_insert(_M_leftmost(), _M_leftmost(), __v); + else if (!_M_impl._M_key_compare(_KeyOfValue()(__v), + _S_key((--__before)._M_node))) + { + if (_S_right(__before._M_node) == 0) + return _M_insert(0, __before._M_node, __v); + else + return _M_insert(__position._M_node, + __position._M_node, __v); + } + else + return const_iterator(_M_insert_equal(__v)); + } + else + { + // ... then try after. + const_iterator __after = __position; + if (__position._M_node == _M_rightmost()) + return _M_insert(0, _M_rightmost(), __v); + else if (!_M_impl._M_key_compare(_S_key((++__after)._M_node), + _KeyOfValue()(__v))) + { + if (_S_right(__position._M_node) == 0) + return _M_insert(0, __position._M_node, __v); + else + return _M_insert(__after._M_node, __after._M_node, __v); + } + else + return const_iterator(_M_insert_equal_lower(__v)); + } + } + + template + template + void + _Rb_tree<_Key, _Val, _KoV, _Cmp, _Alloc>:: + _M_insert_equal(_II __first, _II __last) + { + for (; __first != __last; ++__first) + _M_insert_equal(end(), *__first); + } + + template + template + void + _Rb_tree<_Key, _Val, _KoV, _Cmp, _Alloc>:: + _M_insert_unique(_II __first, _II __last) + { + for (; __first != __last; ++__first) + _M_insert_unique(end(), *__first); + } + + template + inline void + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + erase(iterator __position) + { + _Link_type __y = + static_cast<_Link_type>(_Rb_tree_rebalance_for_erase + (__position._M_node, + this->_M_impl._M_header)); + _M_destroy_node(__y); + --_M_impl._M_node_count; + } + + template + inline void + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + erase(const_iterator __position) + { + _Link_type __y = + static_cast<_Link_type>(_Rb_tree_rebalance_for_erase + (const_cast<_Base_ptr>(__position._M_node), + this->_M_impl._M_header)); + _M_destroy_node(__y); + --_M_impl._M_node_count; + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::size_type + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + erase(const _Key& __x) + { + pair __p = equal_range(__x); + const size_type __old_size = size(); + erase(__p.first, __p.second); + return __old_size - size(); + } + + template + typename _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::_Link_type + _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>:: + _M_copy(_Const_Link_type __x, _Link_type __p) + { + // Structural copy. __x and __p must be non-null. + _Link_type __top = _M_clone_node(__x); + __top->_M_parent = __p; + + try + { + if (__x->_M_right) + __top->_M_right = _M_copy(_S_right(__x), __top); + __p = __top; + __x = _S_left(__x); + + while (__x != 0) + { + _Link_type __y = _M_clone_node(__x); + __p->_M_left = __y; + __y->_M_parent = __p; + if (__x->_M_right) + __y->_M_right = _M_copy(_S_right(__x), __y); + __p = __y; + __x = _S_left(__x); + } + } + catch(...) + { + _M_erase(__top); + __throw_exception_again; + } + return __top; + } + + template + void + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + _M_erase(_Link_type __x) + { + // Erase without rebalancing. + while (__x != 0) + { + _M_erase(_S_right(__x)); + _Link_type __y = _S_left(__x); + _M_destroy_node(__x); + __x = __y; + } + } + + template + void + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + erase(iterator __first, iterator __last) + { + if (__first == begin() && __last == end()) + clear(); + else + while (__first != __last) + erase(__first++); + } + + template + void + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + erase(const_iterator __first, const_iterator __last) + { + if (__first == begin() && __last == end()) + clear(); + else + while (__first != __last) + erase(__first++); + } + + template + void + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + erase(const _Key* __first, const _Key* __last) + { + while (__first != __last) + erase(*__first++); + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + find(const _Key& __k) + { + _Link_type __x = _M_begin(); // Current node. + _Link_type __y = _M_end(); // Last node which is not less than __k. + + while (__x != 0) + if (!_M_impl._M_key_compare(_S_key(__x), __k)) + __y = __x, __x = _S_left(__x); + else + __x = _S_right(__x); + + iterator __j = iterator(__y); + return (__j == end() + || _M_impl._M_key_compare(__k, + _S_key(__j._M_node))) ? end() : __j; + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + find(const _Key& __k) const + { + _Const_Link_type __x = _M_begin(); // Current node. + _Const_Link_type __y = _M_end(); // Last node which is not less than __k. + + while (__x != 0) + { + if (!_M_impl._M_key_compare(_S_key(__x), __k)) + __y = __x, __x = _S_left(__x); + else + __x = _S_right(__x); + } + const_iterator __j = const_iterator(__y); + return (__j == end() + || _M_impl._M_key_compare(__k, + _S_key(__j._M_node))) ? end() : __j; + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::size_type + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + count(const _Key& __k) const + { + pair __p = equal_range(__k); + const size_type __n = std::distance(__p.first, __p.second); + return __n; + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + lower_bound(const _Key& __k) + { + _Link_type __x = _M_begin(); // Current node. + _Link_type __y = _M_end(); // Last node which is not less than __k. + + while (__x != 0) + if (!_M_impl._M_key_compare(_S_key(__x), __k)) + __y = __x, __x = _S_left(__x); + else + __x = _S_right(__x); + + return iterator(__y); + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + lower_bound(const _Key& __k) const + { + _Const_Link_type __x = _M_begin(); // Current node. + _Const_Link_type __y = _M_end(); // Last node which is not less than __k. + + while (__x != 0) + if (!_M_impl._M_key_compare(_S_key(__x), __k)) + __y = __x, __x = _S_left(__x); + else + __x = _S_right(__x); + + return const_iterator(__y); + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + upper_bound(const _Key& __k) + { + _Link_type __x = _M_begin(); // Current node. + _Link_type __y = _M_end(); // Last node which is greater than __k. + + while (__x != 0) + if (_M_impl._M_key_compare(__k, _S_key(__x))) + __y = __x, __x = _S_left(__x); + else + __x = _S_right(__x); + + return iterator(__y); + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + upper_bound(const _Key& __k) const + { + _Const_Link_type __x = _M_begin(); // Current node. + _Const_Link_type __y = _M_end(); // Last node which is greater than __k. + + while (__x != 0) + if (_M_impl._M_key_compare(__k, _S_key(__x))) + __y = __x, __x = _S_left(__x); + else + __x = _S_right(__x); + + return const_iterator(__y); + } + + template + inline + pair::iterator, + typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator> + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + equal_range(const _Key& __k) + { return pair(lower_bound(__k), upper_bound(__k)); } + + template + inline + pair::const_iterator, + typename _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::const_iterator> + _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>:: + equal_range(const _Key& __k) const + { return pair(lower_bound(__k), + upper_bound(__k)); } + + unsigned int + _Rb_tree_black_count(const _Rb_tree_node_base* __node, + const _Rb_tree_node_base* __root); + + template + bool + _Rb_tree<_Key,_Val,_KeyOfValue,_Compare,_Alloc>::__rb_verify() const + { + if (_M_impl._M_node_count == 0 || begin() == end()) + return _M_impl._M_node_count == 0 && begin() == end() + && this->_M_impl._M_header._M_left == _M_end() + && this->_M_impl._M_header._M_right == _M_end(); + + unsigned int __len = _Rb_tree_black_count(_M_leftmost(), _M_root()); + for (const_iterator __it = begin(); __it != end(); ++__it) + { + _Const_Link_type __x = static_cast<_Const_Link_type>(__it._M_node); + _Const_Link_type __L = _S_left(__x); + _Const_Link_type __R = _S_right(__x); + + if (__x->_M_color == _S_red) + if ((__L && __L->_M_color == _S_red) + || (__R && __R->_M_color == _S_red)) + return false; + + if (__L && _M_impl._M_key_compare(_S_key(__x), _S_key(__L))) + return false; + if (__R && _M_impl._M_key_compare(_S_key(__R), _S_key(__x))) + return false; + + if (!__L && !__R && _Rb_tree_black_count(__x, _M_root()) != __len) + return false; + } + + if (_M_leftmost() != _Rb_tree_node_base::_S_minimum(_M_root())) + return false; + if (_M_rightmost() != _Rb_tree_node_base::_S_maximum(_M_root())) + return false; + return true; + } + +} // namespace std + +#endif diff --git a/cpp_src/stl_uninitialized.h b/cpp_src/stl_uninitialized.h new file mode 100644 index 0000000..f745de4 --- /dev/null +++ b/cpp_src/stl_uninitialized.h @@ -0,0 +1,392 @@ +// Raw memory manipulators -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_uninitialized.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STL_UNINITIALIZED_H +#define _STL_UNINITIALIZED_H 1 + +#include + +namespace std { + + // uninitialized_copy + template + inline _ForwardIterator + __uninitialized_copy_aux(_InputIterator __first, _InputIterator __last, + _ForwardIterator __result, + __true_type) + { return std::copy(__first, __last, __result); } + + template + inline _ForwardIterator + __uninitialized_copy_aux(_InputIterator __first, _InputIterator __last, + _ForwardIterator __result, + __false_type) + { + _ForwardIterator __cur = __result; + try + { + for (; __first != __last; ++__first, ++__cur) + std::_Construct(&*__cur, *__first); + return __cur; + } + catch(...) + { + std::_Destroy(__result, __cur); + __throw_exception_again; + } + } + + /** + * @brief Copies the range [first,last) into result. + * @param first An input iterator. + * @param last An input iterator. + * @param result An output iterator. + * @return result + (first - last) + * + * Like copy(), but does not require an initialized output range. + */ + template + inline _ForwardIterator + uninitialized_copy(_InputIterator __first, _InputIterator __last, + _ForwardIterator __result) + { + typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType; + typedef typename std::__is_scalar<_ValueType>::__type _Is_POD; + return std::__uninitialized_copy_aux(__first, __last, __result, + _Is_POD()); + } + + inline char* + uninitialized_copy(const char* __first, const char* __last, char* __result) + { + std::memmove(__result, __first, __last - __first); + return __result + (__last - __first); + } + + inline wchar_t* + uninitialized_copy(const wchar_t* __first, const wchar_t* __last, + wchar_t* __result) + { + std::memmove(__result, __first, sizeof(wchar_t) * (__last - __first)); + return __result + (__last - __first); + } + + // Valid if copy construction is equivalent to assignment, and if the + // destructor is trivial. + template + inline void + __uninitialized_fill_aux(_ForwardIterator __first, + _ForwardIterator __last, + const _Tp& __x, __true_type) + { std::fill(__first, __last, __x); } + + template + void + __uninitialized_fill_aux(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __x, __false_type) + { + _ForwardIterator __cur = __first; + try + { + for (; __cur != __last; ++__cur) + std::_Construct(&*__cur, __x); + } + catch(...) + { + std::_Destroy(__first, __cur); + __throw_exception_again; + } + } + + /** + * @brief Copies the value x into the range [first,last). + * @param first An input iterator. + * @param last An input iterator. + * @param x The source value. + * @return Nothing. + * + * Like fill(), but does not require an initialized output range. + */ + template + inline void + uninitialized_fill(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __x) + { + typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType; + typedef typename std::__is_scalar<_ValueType>::__type _Is_POD; + std::__uninitialized_fill_aux(__first, __last, __x, _Is_POD()); + } + + // Valid if copy construction is equivalent to assignment, and if the + // destructor is trivial. + template + inline void + __uninitialized_fill_n_aux(_ForwardIterator __first, _Size __n, + const _Tp& __x, __true_type) + { std::fill_n(__first, __n, __x); } + + template + void + __uninitialized_fill_n_aux(_ForwardIterator __first, _Size __n, + const _Tp& __x, __false_type) + { + _ForwardIterator __cur = __first; + try + { + for (; __n > 0; --__n, ++__cur) + std::_Construct(&*__cur, __x); + } + catch(...) + { + std::_Destroy(__first, __cur); + __throw_exception_again; + } + } + + /** + * @brief Copies the value x into the range [first,first+n). + * @param first An input iterator. + * @param n The number of copies to make. + * @param x The source value. + * @return Nothing. + * + * Like fill_n(), but does not require an initialized output range. + */ + template + inline void + uninitialized_fill_n(_ForwardIterator __first, _Size __n, const _Tp& __x) + { + typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType; + typedef typename std::__is_scalar<_ValueType>::__type _Is_POD; + std::__uninitialized_fill_n_aux(__first, __n, __x, _Is_POD()); + } + + // Extensions: versions of uninitialized_copy, uninitialized_fill, + // and uninitialized_fill_n that take an allocator parameter. + // We dispatch back to the standard versions when we're given the + // default allocator. For nondefault allocators we do not use + // any of the POD optimizations. + + template + _ForwardIterator + __uninitialized_copy_a(_InputIterator __first, _InputIterator __last, + _ForwardIterator __result, + _Allocator __alloc) + { + _ForwardIterator __cur = __result; + try + { + for (; __first != __last; ++__first, ++__cur) + __alloc.construct(&*__cur, *__first); + return __cur; + } + catch(...) + { + std::_Destroy(__result, __cur, __alloc); + __throw_exception_again; + } + } + + template + inline _ForwardIterator + __uninitialized_copy_a(_InputIterator __first, _InputIterator __last, + _ForwardIterator __result, + allocator<_Tp>) + { return std::uninitialized_copy(__first, __last, __result); } + + template + void + __uninitialized_fill_a(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __x, _Allocator __alloc) + { + _ForwardIterator __cur = __first; + try + { + for (; __cur != __last; ++__cur) + __alloc.construct(&*__cur, __x); + } + catch(...) + { + std::_Destroy(__first, __cur, __alloc); + __throw_exception_again; + } + } + + template + inline void + __uninitialized_fill_a(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __x, allocator<_Tp2>) + { std::uninitialized_fill(__first, __last, __x); } + + template + void + __uninitialized_fill_n_a(_ForwardIterator __first, _Size __n, + const _Tp& __x, + _Allocator __alloc) + { + _ForwardIterator __cur = __first; + try + { + for (; __n > 0; --__n, ++__cur) + __alloc.construct(&*__cur, __x); + } + catch(...) + { + std::_Destroy(__first, __cur, __alloc); + __throw_exception_again; + } + } + + template + inline void + __uninitialized_fill_n_a(_ForwardIterator __first, _Size __n, + const _Tp& __x, + allocator<_Tp2>) + { std::uninitialized_fill_n(__first, __n, __x); } + + + // Extensions: __uninitialized_copy_copy, __uninitialized_copy_fill, + // __uninitialized_fill_copy. All of these algorithms take a user- + // supplied allocator, which is used for construction and destruction. + + // __uninitialized_copy_copy + // Copies [first1, last1) into [result, result + (last1 - first1)), and + // copies [first2, last2) into + // [result, result + (last1 - first1) + (last2 - first2)). + + template + inline _ForwardIterator + __uninitialized_copy_copy(_InputIterator1 __first1, + _InputIterator1 __last1, + _InputIterator2 __first2, + _InputIterator2 __last2, + _ForwardIterator __result, + _Allocator __alloc) + { + _ForwardIterator __mid = std::__uninitialized_copy_a(__first1, __last1, + __result, + __alloc); + try + { + return std::__uninitialized_copy_a(__first2, __last2, __mid, __alloc); + } + catch(...) + { + std::_Destroy(__result, __mid, __alloc); + __throw_exception_again; + } + } + + // __uninitialized_fill_copy + // Fills [result, mid) with x, and copies [first, last) into + // [mid, mid + (last - first)). + template + inline _ForwardIterator + __uninitialized_fill_copy(_ForwardIterator __result, _ForwardIterator __mid, + const _Tp& __x, _InputIterator __first, + _InputIterator __last, + _Allocator __alloc) + { + std::__uninitialized_fill_a(__result, __mid, __x, __alloc); + try + { + return std::__uninitialized_copy_a(__first, __last, __mid, __alloc); + } + catch(...) + { + std::_Destroy(__result, __mid, __alloc); + __throw_exception_again; + } + } + + // __uninitialized_copy_fill + // Copies [first1, last1) into [first2, first2 + (last1 - first1)), and + // fills [first2 + (last1 - first1), last2) with x. + template + inline void + __uninitialized_copy_fill(_InputIterator __first1, _InputIterator __last1, + _ForwardIterator __first2, + _ForwardIterator __last2, const _Tp& __x, + _Allocator __alloc) + { + _ForwardIterator __mid2 = std::__uninitialized_copy_a(__first1, __last1, + __first2, + __alloc); + try + { + std::__uninitialized_fill_a(__mid2, __last2, __x, __alloc); + } + catch(...) + { + std::_Destroy(__first2, __mid2, __alloc); + __throw_exception_again; + } + } + +} // namespace std + +#endif /* _STL_UNINITIALIZED_H */ diff --git a/cpp_src/stl_vector.h b/cpp_src/stl_vector.h new file mode 100644 index 0000000..e1affe4 --- /dev/null +++ b/cpp_src/stl_vector.h @@ -0,0 +1,992 @@ +// Vector implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_vector.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _VECTOR_H +#define _VECTOR_H 1 + +#include +#include +#include + +namespace std { + + /** + * @if maint + * See bits/stl_deque.h's _Deque_base for an explanation. + * @endif + */ + template + struct _Vector_base + { + typedef typename _Alloc::template rebind<_Tp>::other _Tp_alloc_type; + + struct _Vector_impl + : public _Tp_alloc_type + { + _Tp* _M_start; + _Tp* _M_finish; + _Tp* _M_end_of_storage; + _Vector_impl(_Tp_alloc_type const& __a) + : _Tp_alloc_type(__a), _M_start(0), _M_finish(0), _M_end_of_storage(0) + { } + }; + + public: + typedef _Alloc allocator_type; + + _Tp_alloc_type& + _M_get_Tp_allocator() + { return *static_cast<_Tp_alloc_type*>(&this->_M_impl); } + + const _Tp_alloc_type& + _M_get_Tp_allocator() const + { return *static_cast(&this->_M_impl); } + + allocator_type + get_allocator() const + { return allocator_type(_M_get_Tp_allocator()); } + + _Vector_base(const allocator_type& __a) + : _M_impl(__a) + { } + + _Vector_base(size_t __n, const allocator_type& __a) + : _M_impl(__a) + { + this->_M_impl._M_start = this->_M_allocate(__n); + this->_M_impl._M_finish = this->_M_impl._M_start; + this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n; + } + + ~_Vector_base() + { _M_deallocate(this->_M_impl._M_start, this->_M_impl._M_end_of_storage + - this->_M_impl._M_start); } + + public: + _Vector_impl _M_impl; + + _Tp* + _M_allocate(size_t __n) + { return _M_impl.allocate(__n); } + + void + _M_deallocate(_Tp* __p, size_t __n) + { + if (__p) + _M_impl.deallocate(__p, __n); + } + }; + + + /** + * @brief A standard container which offers fixed time access to + * individual elements in any order. + * + * @ingroup Containers + * @ingroup Sequences + * + * Meets the requirements of a container, a + * reversible container, and a + * sequence, including the + * optional sequence requirements with the + * %exception of @c push_front and @c pop_front. + * + * In some terminology a %vector can be described as a dynamic + * C-style array, it offers fast and efficient access to individual + * elements in any order and saves the user from worrying about + * memory and size allocation. Subscripting ( @c [] ) access is + * also provided as with C-style arrays. + */ + template > + class vector : protected _Vector_base<_Tp, _Alloc> + { + // Concept requirements. + typedef typename _Alloc::value_type _Alloc_value_type; + __glibcxx_class_requires(_Tp, _SGIAssignableConcept) + __glibcxx_class_requires2(_Tp, _Alloc_value_type, _SameTypeConcept) + + typedef _Vector_base<_Tp, _Alloc> _Base; + typedef vector<_Tp, _Alloc> vector_type; + typedef typename _Base::_Tp_alloc_type _Tp_alloc_type; + + public: + typedef _Tp value_type; + typedef typename _Tp_alloc_type::pointer pointer; + typedef typename _Tp_alloc_type::const_pointer const_pointer; + typedef typename _Tp_alloc_type::reference reference; + typedef typename _Tp_alloc_type::const_reference const_reference; + typedef __gnu_cxx::__normal_iterator iterator; + typedef __gnu_cxx::__normal_iterator + const_iterator; + typedef std::reverse_iterator const_reverse_iterator; + typedef std::reverse_iterator reverse_iterator; + typedef size_t size_type; + typedef ptrdiff_t difference_type; + typedef _Alloc allocator_type; + + protected: + using _Base::_M_allocate; + using _Base::_M_deallocate; + using _Base::_M_impl; + using _Base::_M_get_Tp_allocator; + + public: + // [23.2.4.1] construct/copy/destroy + // (assign() and get_allocator() are also listed in this section) + /** + * @brief Default constructor creates no elements. + */ + explicit + vector(const allocator_type& __a = allocator_type()) + : _Base(__a) + { } + + /** + * @brief Create a %vector with copies of an exemplar element. + * @param n The number of elements to initially create. + * @param value An element to copy. + * + * This constructor fills the %vector with @a n copies of @a value. + */ + explicit + vector(size_type __n, const value_type& __value = value_type(), + const allocator_type& __a = allocator_type()) + : _Base(__n, __a) + { + std::__uninitialized_fill_n_a(this->_M_impl._M_start, __n, __value, + _M_get_Tp_allocator()); + this->_M_impl._M_finish = this->_M_impl._M_start + __n; + } + + /** + * @brief %Vector copy constructor. + * @param x A %vector of identical element and allocator types. + * + * The newly-created %vector uses a copy of the allocation + * object used by @a x. All the elements of @a x are copied, + * but any extra memory in + * @a x (for fast expansion) will not be copied. + */ + vector(const vector& __x) + : _Base(__x.size(), __x._M_get_Tp_allocator()) + { this->_M_impl._M_finish = + std::__uninitialized_copy_a(__x.begin(), __x.end(), + this->_M_impl._M_start, + _M_get_Tp_allocator()); + } + + /** + * @brief Builds a %vector from a range. + * @param first An input iterator. + * @param last An input iterator. + * + * Create a %vector consisting of copies of the elements from + * [first,last). + * + * If the iterators are forward, bidirectional, or + * random-access, then this will call the elements' copy + * constructor N times (where N is distance(first,last)) and do + * no memory reallocation. But if only input iterators are + * used, then this will do at most 2N calls to the copy + * constructor, and logN memory reallocations. + */ + template + vector(_InputIterator __first, _InputIterator __last, + const allocator_type& __a = allocator_type()) + : _Base(__a) + { + // Check whether it's an integral type. If so, it's not an iterator. + typedef typename std::__is_integer<_InputIterator>::__type _Integral; + _M_initialize_dispatch(__first, __last, _Integral()); + } + + /** + * The dtor only erases the elements, and note that if the + * elements themselves are pointers, the pointed-to memory is + * not touched in any way. Managing the pointer is the user's + * responsibilty. + */ + ~vector() + { std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish, + _M_get_Tp_allocator()); } + + /** + * @brief %Vector assignment operator. + * @param x A %vector of identical element and allocator types. + * + * All the elements of @a x are copied, but any extra memory in + * @a x (for fast expansion) will not be copied. Unlike the + * copy constructor, the allocator object is not copied. + */ + vector& + operator=(const vector& __x); + + /** + * @brief Assigns a given value to a %vector. + * @param n Number of elements to be assigned. + * @param val Value to be assigned. + * + * This function fills a %vector with @a n copies of the given + * value. Note that the assignment completely changes the + * %vector and that the resulting %vector's size is the same as + * the number of elements assigned. Old data may be lost. + */ + void + assign(size_type __n, const value_type& __val) + { _M_fill_assign(__n, __val); } + + /** + * @brief Assigns a range to a %vector. + * @param first An input iterator. + * @param last An input iterator. + * + * This function fills a %vector with copies of the elements in the + * range [first,last). + * + * Note that the assignment completely changes the %vector and + * that the resulting %vector's size is the same as the number + * of elements assigned. Old data may be lost. + */ + template + void + assign(_InputIterator __first, _InputIterator __last) + { + // Check whether it's an integral type. If so, it's not an iterator. + typedef typename std::__is_integer<_InputIterator>::__type _Integral; + _M_assign_dispatch(__first, __last, _Integral()); + } + + /// Get a copy of the memory allocation object. + using _Base::get_allocator; + + // iterators + /** + * Returns a read/write iterator that points to the first + * element in the %vector. Iteration is done in ordinary + * element order. + */ + iterator + begin() + { return iterator(this->_M_impl._M_start); } + + /** + * Returns a read-only (constant) iterator that points to the + * first element in the %vector. Iteration is done in ordinary + * element order. + */ + const_iterator + begin() const + { return const_iterator(this->_M_impl._M_start); } + + /** + * Returns a read/write iterator that points one past the last + * element in the %vector. Iteration is done in ordinary + * element order. + */ + iterator + end() + { return iterator(this->_M_impl._M_finish); } + + /** + * Returns a read-only (constant) iterator that points one past + * the last element in the %vector. Iteration is done in + * ordinary element order. + */ + const_iterator + end() const + { return const_iterator(this->_M_impl._M_finish); } + + /** + * Returns a read/write reverse iterator that points to the + * last element in the %vector. Iteration is done in reverse + * element order. + */ + reverse_iterator + rbegin() + { return reverse_iterator(end()); } + + /** + * Returns a read-only (constant) reverse iterator that points + * to the last element in the %vector. Iteration is done in + * reverse element order. + */ + const_reverse_iterator + rbegin() const + { return const_reverse_iterator(end()); } + + /** + * Returns a read/write reverse iterator that points to one + * before the first element in the %vector. Iteration is done + * in reverse element order. + */ + reverse_iterator + rend() + { return reverse_iterator(begin()); } + + /** + * Returns a read-only (constant) reverse iterator that points + * to one before the first element in the %vector. Iteration + * is done in reverse element order. + */ + const_reverse_iterator + rend() const + { return const_reverse_iterator(begin()); } + + // [23.2.4.2] capacity + /** Returns the number of elements in the %vector. */ + size_type + size() const + { return size_type(this->_M_impl._M_finish - this->_M_impl._M_start); } + + /** Returns the size() of the largest possible %vector. */ + size_type + max_size() const + { return _M_get_Tp_allocator().max_size(); } + + /** + * @brief Resizes the %vector to the specified number of elements. + * @param new_size Number of elements the %vector should contain. + * @param x Data with which new elements should be populated. + * + * This function will %resize the %vector to the specified + * number of elements. If the number is smaller than the + * %vector's current size the %vector is truncated, otherwise + * the %vector is extended and new elements are populated with + * given data. + */ + void + resize(size_type __new_size, value_type __x = value_type()) + { + if (__new_size < size()) + _M_erase_at_end(this->_M_impl._M_start + __new_size); + else + insert(end(), __new_size - size(), __x); + } + + /** + * Returns the total number of elements that the %vector can + * hold before needing to allocate more memory. + */ + size_type + capacity() const + { return size_type(this->_M_impl._M_end_of_storage + - this->_M_impl._M_start); } + + /** + * Returns true if the %vector is empty. (Thus begin() would + * equal end().) + */ + bool + empty() const + { return begin() == end(); } + + /** + * @brief Attempt to preallocate enough memory for specified number of + * elements. + * @param n Number of elements required. + * @throw std::length_error If @a n exceeds @c max_size(). + * + * This function attempts to reserve enough memory for the + * %vector to hold the specified number of elements. If the + * number requested is more than max_size(), length_error is + * thrown. + * + * The advantage of this function is that if optimal code is a + * necessity and the user can determine the number of elements + * that will be required, the user can reserve the memory in + * %advance, and thus prevent a possible reallocation of memory + * and copying of %vector data. + */ + void + reserve(size_type __n); + + // element access + /** + * @brief Subscript access to the data contained in the %vector. + * @param n The index of the element for which data should be + * accessed. + * @return Read/write reference to data. + * + * This operator allows for easy, array-style, data access. + * Note that data access with this operator is unchecked and + * out_of_range lookups are not defined. (For checked lookups + * see at().) + */ + reference + operator[](size_type __n) + { return *(this->_M_impl._M_start + __n); } + + /** + * @brief Subscript access to the data contained in the %vector. + * @param n The index of the element for which data should be + * accessed. + * @return Read-only (constant) reference to data. + * + * This operator allows for easy, array-style, data access. + * Note that data access with this operator is unchecked and + * out_of_range lookups are not defined. (For checked lookups + * see at().) + */ + const_reference + operator[](size_type __n) const + { return *(this->_M_impl._M_start + __n); } + + protected: + /// @if maint Safety check used only from at(). @endif + void + _M_range_check(size_type __n) const + { + if (__n >= this->size()) + __throw_out_of_range(__N("vector::_M_range_check")); + } + + public: + /** + * @brief Provides access to the data contained in the %vector. + * @param n The index of the element for which data should be + * accessed. + * @return Read/write reference to data. + * @throw std::out_of_range If @a n is an invalid index. + * + * This function provides for safer data access. The parameter + * is first checked that it is in the range of the vector. The + * function throws out_of_range if the check fails. + */ + reference + at(size_type __n) + { + _M_range_check(__n); + return (*this)[__n]; + } + + /** + * @brief Provides access to the data contained in the %vector. + * @param n The index of the element for which data should be + * accessed. + * @return Read-only (constant) reference to data. + * @throw std::out_of_range If @a n is an invalid index. + * + * This function provides for safer data access. The parameter + * is first checked that it is in the range of the vector. The + * function throws out_of_range if the check fails. + */ + const_reference + at(size_type __n) const + { + _M_range_check(__n); + return (*this)[__n]; + } + + /** + * Returns a read/write reference to the data at the first + * element of the %vector. + */ + reference + front() + { return *begin(); } + + /** + * Returns a read-only (constant) reference to the data at the first + * element of the %vector. + */ + const_reference + front() const + { return *begin(); } + + /** + * Returns a read/write reference to the data at the last + * element of the %vector. + */ + reference + back() + { return *(end() - 1); } + + /** + * Returns a read-only (constant) reference to the data at the + * last element of the %vector. + */ + const_reference + back() const + { return *(end() - 1); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 464. Suggestion for new member functions in standard containers. + // data access + /** + * Returns a pointer such that [data(), data() + size()) is a valid + * range. For a non-empty %vector, data() == &front(). + */ + pointer + data() + { return pointer(this->_M_impl._M_start); } + + const_pointer + data() const + { return const_pointer(this->_M_impl._M_start); } + + // [23.2.4.3] modifiers + /** + * @brief Add data to the end of the %vector. + * @param x Data to be added. + * + * This is a typical stack operation. The function creates an + * element at the end of the %vector and assigns the given data + * to it. Due to the nature of a %vector this operation can be + * done in constant time if the %vector has preallocated space + * available. + */ + void + push_back(const value_type& __x) + { + if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage) + { + this->_M_impl.construct(this->_M_impl._M_finish, __x); + ++this->_M_impl._M_finish; + } + else + _M_insert_aux(end(), __x); + } + + /** + * @brief Removes last element. + * + * This is a typical stack operation. It shrinks the %vector by one. + * + * Note that no data is returned, and if the last element's + * data is needed, it should be retrieved before pop_back() is + * called. + */ + void + pop_back() + { + --this->_M_impl._M_finish; + this->_M_impl.destroy(this->_M_impl._M_finish); + } + + /** + * @brief Inserts given value into %vector before specified iterator. + * @param position An iterator into the %vector. + * @param x Data to be inserted. + * @return An iterator that points to the inserted data. + * + * This function will insert a copy of the given value before + * the specified location. Note that this kind of operation + * could be expensive for a %vector and if it is frequently + * used the user should consider using std::list. + */ + iterator + insert(iterator __position, const value_type& __x); + + /** + * @brief Inserts a number of copies of given data into the %vector. + * @param position An iterator into the %vector. + * @param n Number of elements to be inserted. + * @param x Data to be inserted. + * + * This function will insert a specified number of copies of + * the given data before the location specified by @a position. + * + * Note that this kind of operation could be expensive for a + * %vector and if it is frequently used the user should + * consider using std::list. + */ + void + insert(iterator __position, size_type __n, const value_type& __x) + { _M_fill_insert(__position, __n, __x); } + + /** + * @brief Inserts a range into the %vector. + * @param position An iterator into the %vector. + * @param first An input iterator. + * @param last An input iterator. + * + * This function will insert copies of the data in the range + * [first,last) into the %vector before the location specified + * by @a pos. + * + * Note that this kind of operation could be expensive for a + * %vector and if it is frequently used the user should + * consider using std::list. + */ + template + void + insert(iterator __position, _InputIterator __first, + _InputIterator __last) + { + // Check whether it's an integral type. If so, it's not an iterator. + typedef typename std::__is_integer<_InputIterator>::__type _Integral; + _M_insert_dispatch(__position, __first, __last, _Integral()); + } + + /** + * @brief Remove element at given position. + * @param position Iterator pointing to element to be erased. + * @return An iterator pointing to the next element (or end()). + * + * This function will erase the element at the given position and thus + * shorten the %vector by one. + * + * Note This operation could be expensive and if it is + * frequently used the user should consider using std::list. + * The user is also cautioned that this function only erases + * the element, and that if the element is itself a pointer, + * the pointed-to memory is not touched in any way. Managing + * the pointer is the user's responsibilty. + */ + iterator + erase(iterator __position); + + /** + * @brief Remove a range of elements. + * @param first Iterator pointing to the first element to be erased. + * @param last Iterator pointing to one past the last element to be + * erased. + * @return An iterator pointing to the element pointed to by @a last + * prior to erasing (or end()). + * + * This function will erase the elements in the range [first,last) and + * shorten the %vector accordingly. + * + * Note This operation could be expensive and if it is + * frequently used the user should consider using std::list. + * The user is also cautioned that this function only erases + * the elements, and that if the elements themselves are + * pointers, the pointed-to memory is not touched in any way. + * Managing the pointer is the user's responsibilty. + */ + iterator + erase(iterator __first, iterator __last); + + /** + * @brief Swaps data with another %vector. + * @param x A %vector of the same element and allocator types. + * + * This exchanges the elements between two vectors in constant time. + * (Three pointers, so it should be quite fast.) + * Note that the global std::swap() function is specialized such that + * std::swap(v1,v2) will feed to this function. + */ + void + swap(vector& __x) + { + std::swap(this->_M_impl._M_start, __x._M_impl._M_start); + std::swap(this->_M_impl._M_finish, __x._M_impl._M_finish); + std::swap(this->_M_impl._M_end_of_storage, + __x._M_impl._M_end_of_storage); + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 431. Swapping containers with unequal allocators. + std::__alloc_swap<_Tp_alloc_type>::_S_do_it(_M_get_Tp_allocator(), + __x._M_get_Tp_allocator()); + } + + /** + * Erases all the elements. Note that this function only erases the + * elements, and that if the elements themselves are pointers, the + * pointed-to memory is not touched in any way. Managing the pointer is + * the user's responsibilty. + */ + void + clear() + { _M_erase_at_end(this->_M_impl._M_start); } + + protected: + /** + * @if maint + * Memory expansion handler. Uses the member allocation function to + * obtain @a n bytes of memory, and then copies [first,last) into it. + * @endif + */ + template + pointer + _M_allocate_and_copy(size_type __n, + _ForwardIterator __first, _ForwardIterator __last) + { + pointer __result = this->_M_allocate(__n); + try + { + std::__uninitialized_copy_a(__first, __last, __result, + _M_get_Tp_allocator()); + return __result; + } + catch(...) + { + _M_deallocate(__result, __n); + __throw_exception_again; + } + } + + + // Internal constructor functions follow. + + // Called by the range constructor to implement [23.1.1]/9 + template + void + _M_initialize_dispatch(_Integer __n, _Integer __value, __true_type) + { + this->_M_impl._M_start = _M_allocate(__n); + this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n; + std::__uninitialized_fill_n_a(this->_M_impl._M_start, __n, __value, + _M_get_Tp_allocator()); + this->_M_impl._M_finish = this->_M_impl._M_end_of_storage; + } + + // Called by the range constructor to implement [23.1.1]/9 + template + void + _M_initialize_dispatch(_InputIterator __first, _InputIterator __last, + __false_type) + { + typedef typename std::iterator_traits<_InputIterator>:: + iterator_category _IterCategory; + _M_range_initialize(__first, __last, _IterCategory()); + } + + // Called by the second initialize_dispatch above + template + void + _M_range_initialize(_InputIterator __first, + _InputIterator __last, std::input_iterator_tag) + { + for (; __first != __last; ++__first) + push_back(*__first); + } + + // Called by the second initialize_dispatch above + template + void + _M_range_initialize(_ForwardIterator __first, + _ForwardIterator __last, std::forward_iterator_tag) + { + const size_type __n = std::distance(__first, __last); + this->_M_impl._M_start = this->_M_allocate(__n); + this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n; + this->_M_impl._M_finish = + std::__uninitialized_copy_a(__first, __last, + this->_M_impl._M_start, + _M_get_Tp_allocator()); + } + + + // Internal assign functions follow. The *_aux functions do the actual + // assignment work for the range versions. + + // Called by the range assign to implement [23.1.1]/9 + template + void + _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) + { + _M_fill_assign(static_cast(__n), + static_cast(__val)); + } + + // Called by the range assign to implement [23.1.1]/9 + template + void + _M_assign_dispatch(_InputIterator __first, _InputIterator __last, + __false_type) + { + typedef typename std::iterator_traits<_InputIterator>:: + iterator_category _IterCategory; + _M_assign_aux(__first, __last, _IterCategory()); + } + + // Called by the second assign_dispatch above + template + void + _M_assign_aux(_InputIterator __first, _InputIterator __last, + std::input_iterator_tag); + + // Called by the second assign_dispatch above + template + void + _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last, + std::forward_iterator_tag); + + // Called by assign(n,t), and the range assign when it turns out + // to be the same thing. + void + _M_fill_assign(size_type __n, const value_type& __val); + + + // Internal insert functions follow. + + // Called by the range insert to implement [23.1.1]/9 + template + void + _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val, + __true_type) + { + _M_fill_insert(__pos, static_cast(__n), + static_cast(__val)); + } + + // Called by the range insert to implement [23.1.1]/9 + template + void + _M_insert_dispatch(iterator __pos, _InputIterator __first, + _InputIterator __last, __false_type) + { + typedef typename std::iterator_traits<_InputIterator>:: + iterator_category _IterCategory; + _M_range_insert(__pos, __first, __last, _IterCategory()); + } + + // Called by the second insert_dispatch above + template + void + _M_range_insert(iterator __pos, _InputIterator __first, + _InputIterator __last, std::input_iterator_tag); + + // Called by the second insert_dispatch above + template + void + _M_range_insert(iterator __pos, _ForwardIterator __first, + _ForwardIterator __last, std::forward_iterator_tag); + + // Called by insert(p,n,x), and the range insert when it turns out to be + // the same thing. + void + _M_fill_insert(iterator __pos, size_type __n, const value_type& __x); + + // Called by insert(p,x) + void + _M_insert_aux(iterator __position, const value_type& __x); + + // Internal erase functions follow. + + // Called by erase(q1,q2), clear(), resize(), _M_fill_assign, + // _M_assign_aux. + void + _M_erase_at_end(pointer __pos) + { + std::_Destroy(__pos, this->_M_impl._M_finish, _M_get_Tp_allocator()); + this->_M_impl._M_finish = __pos; + } + }; + + + /** + * @brief Vector equality comparison. + * @param x A %vector. + * @param y A %vector of the same type as @a x. + * @return True iff the size and elements of the vectors are equal. + * + * This is an equivalence relation. It is linear in the size of the + * vectors. Vectors are considered equivalent if their sizes are equal, + * and if corresponding elements compare equal. + */ + template + inline bool + operator==(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) + { return (__x.size() == __y.size() + && std::equal(__x.begin(), __x.end(), __y.begin())); } + + /** + * @brief Vector ordering relation. + * @param x A %vector. + * @param y A %vector of the same type as @a x. + * @return True iff @a x is lexicographically less than @a y. + * + * This is a total ordering relation. It is linear in the size of the + * vectors. The elements must be comparable with @c <. + * + * See std::lexicographical_compare() for how the determination is made. + */ + template + inline bool + operator<(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) + { return std::lexicographical_compare(__x.begin(), __x.end(), + __y.begin(), __y.end()); } + + /// Based on operator== + template + inline bool + operator!=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) + { return !(__x == __y); } + + /// Based on operator< + template + inline bool + operator>(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) + { return __y < __x; } + + /// Based on operator< + template + inline bool + operator<=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) + { return !(__y < __x); } + + /// Based on operator< + template + inline bool + operator>=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) + { return !(__x < __y); } + + /// See std::vector::swap(). + template + inline void + swap(vector<_Tp, _Alloc>& __x, vector<_Tp, _Alloc>& __y) + { __x.swap(__y); } + +} // namespace std + +#endif /* _VECTOR_H */ diff --git a/cpp_src/stream_iterator.h b/cpp_src/stream_iterator.h new file mode 100644 index 0000000..8f63aaa --- /dev/null +++ b/cpp_src/stream_iterator.h @@ -0,0 +1,216 @@ +// Stream iterators + +// Copyright (C) 2001, 2004, 2005 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file stream_iterator.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STREAM_ITERATOR_H +#define _STREAM_ITERATOR_H 1 + +#pragma GCC system_header + +#include + +namespace std { + + /// Provides input iterator semantics for streams. + template, typename _Dist = ptrdiff_t> + class istream_iterator + : public iterator + { + public: + typedef _CharT char_type; + typedef _Traits traits_type; + typedef basic_istream<_CharT, _Traits> istream_type; + + private: + istream_type* _M_stream; + _Tp _M_value; + bool _M_ok; + + public: + /// Construct end of input stream iterator. + istream_iterator() + : _M_stream(0), _M_value(), _M_ok(false) {} + + /// Construct start of input stream iterator. + istream_iterator(istream_type& __s) + : _M_stream(&__s) + { _M_read(); } + + istream_iterator(const istream_iterator& __obj) + : _M_stream(__obj._M_stream), _M_value(__obj._M_value), + _M_ok(__obj._M_ok) + { } + + const _Tp& + operator*() const + { + __glibcxx_requires_cond(_M_ok, + _M_message(__gnu_debug::__msg_deref_istream) + ._M_iterator(*this)); + return _M_value; + } + + const _Tp* + operator->() const { return &(operator*()); } + + istream_iterator& + operator++() + { + __glibcxx_requires_cond(_M_ok, + _M_message(__gnu_debug::__msg_inc_istream) + ._M_iterator(*this)); + _M_read(); + return *this; + } + + istream_iterator + operator++(int) + { + __glibcxx_requires_cond(_M_ok, + _M_message(__gnu_debug::__msg_inc_istream) + ._M_iterator(*this)); + istream_iterator __tmp = *this; + _M_read(); + return __tmp; + } + + bool + _M_equal(const istream_iterator& __x) const + { return (_M_ok == __x._M_ok) && (!_M_ok || _M_stream == __x._M_stream); } + + private: + void + _M_read() + { + _M_ok = (_M_stream && *_M_stream) ? true : false; + if (_M_ok) + { + *_M_stream >> _M_value; + _M_ok = *_M_stream ? true : false; + } + } + }; + + /// Return true if x and y are both end or not end, or x and y are the same. + template + inline bool + operator==(const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __x, + const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __y) + { return __x._M_equal(__y); } + + /// Return false if x and y are both end or not end, or x and y are the same. + template + inline bool + operator!=(const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __x, + const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __y) + { return !__x._M_equal(__y); } + + /** + * @brief Provides output iterator semantics for streams. + * + * This class provides an iterator to write to an ostream. The type Tp is + * the only type written by this iterator and there must be an + * operator<<(Tp) defined. + * + * @param Tp The type to write to the ostream. + * @param CharT The ostream char_type. + * @param Traits The ostream char_traits. + */ + template > + class ostream_iterator + : public iterator + { + public: + //@{ + /// Public typedef + typedef _CharT char_type; + typedef _Traits traits_type; + typedef basic_ostream<_CharT, _Traits> ostream_type; + //@} + + private: + ostream_type* _M_stream; + const _CharT* _M_string; + + public: + /// Construct from an ostream. + ostream_iterator(ostream_type& __s) : _M_stream(&__s), _M_string(0) {} + + /** + * Construct from an ostream. + * + * The delimiter string @a c is written to the stream after every Tp + * written to the stream. The delimiter is not copied, and thus must + * not be destroyed while this iterator is in use. + * + * @param s Underlying ostream to write to. + * @param c CharT delimiter string to insert. + */ + ostream_iterator(ostream_type& __s, const _CharT* __c) + : _M_stream(&__s), _M_string(__c) { } + + /// Copy constructor. + ostream_iterator(const ostream_iterator& __obj) + : _M_stream(__obj._M_stream), _M_string(__obj._M_string) { } + + /// Writes @a value to underlying ostream using operator<<. If + /// constructed with delimiter string, writes delimiter to ostream. + ostream_iterator& + operator=(const _Tp& __value) + { + __glibcxx_requires_cond(_M_stream != 0, + _M_message(__gnu_debug::__msg_output_ostream) + ._M_iterator(*this)); + *_M_stream << __value; + if (_M_string) *_M_stream << _M_string; + return *this; + } + + ostream_iterator& + operator*() + { return *this; } + + ostream_iterator& + operator++() + { return *this; } + + ostream_iterator& + operator++(int) + { return *this; } + }; + +} // namespace std + +#endif diff --git a/cpp_src/streambuf b/cpp_src/streambuf new file mode 100644 index 0000000..ab5b8d0 --- /dev/null +++ b/cpp_src/streambuf @@ -0,0 +1,823 @@ +// Stream buffer classes -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file streambuf + * This is a Standard C++ Library header. + */ + +// +// ISO C++ 14882: 27.5 Stream buffers +// + +#ifndef _GLIBXX_STREAMBUF +#define _GLIBXX_STREAMBUF 1 + +#pragma GCC system_header + +#include +#include +#include +#include +#include +#include + +namespace std { + + /** + * @if maint + * Does stuff. + * @endif + */ + template + streamsize + __copy_streambufs_eof(basic_streambuf<_CharT, _Traits>*, + basic_streambuf<_CharT, _Traits>*, bool&); + + /** + * @brief The actual work of input and output (interface). + * + * This is a base class. Derived stream buffers each control a + * pair of character sequences: one for input, and one for output. + * + * Section [27.5.1] of the standard describes the requirements and + * behavior of stream buffer classes. That section (three paragraphs) + * is reproduced here, for simplicity and accuracy. + * + * -# Stream buffers can impose various constraints on the sequences + * they control. Some constraints are: + * - The controlled input sequence can be not readable. + * - The controlled output sequence can be not writable. + * - The controlled sequences can be associated with the contents of + * other representations for character sequences, such as external + * files. + * - The controlled sequences can support operations @e directly to or + * from associated sequences. + * - The controlled sequences can impose limitations on how the + * program can read characters from a sequence, write characters to + * a sequence, put characters back into an input sequence, or alter + * the stream position. + * . + * -# Each sequence is characterized by three pointers which, if non-null, + * all point into the same @c charT array object. The array object + * represents, at any moment, a (sub)sequence of characters from the + * sequence. Operations performed on a sequence alter the values + * stored in these pointers, perform reads and writes directly to or + * from associated sequences, and alter "the stream position" and + * conversion state as needed to maintain this subsequence relationship. + * The three pointers are: + * - the beginning pointer, or lowest element address in the + * array (called @e xbeg here); + * - the next pointer, or next element address that is a + * current candidate for reading or writing (called @e xnext here); + * - the end pointer, or first element address beyond the + * end of the array (called @e xend here). + * . + * -# The following semantic constraints shall always apply for any set + * of three pointers for a sequence, using the pointer names given + * immediately above: + * - If @e xnext is not a null pointer, then @e xbeg and @e xend shall + * also be non-null pointers into the same @c charT array, as + * described above; otherwise, @e xbeg and @e xend shall also be null. + * - If @e xnext is not a null pointer and @e xnext < @e xend for an + * output sequence, then a write position is available. + * In this case, @e *xnext shall be assignable as the next element + * to write (to put, or to store a character value, into the sequence). + * - If @e xnext is not a null pointer and @e xbeg < @e xnext for an + * input sequence, then a putback position is available. + * In this case, @e xnext[-1] shall have a defined value and is the + * next (preceding) element to store a character that is put back + * into the input sequence. + * - If @e xnext is not a null pointer and @e xnext< @e xend for an + * input sequence, then a read position is available. + * In this case, @e *xnext shall have a defined value and is the + * next element to read (to get, or to obtain a character value, + * from the sequence). + */ + template + class basic_streambuf + { + public: + //@{ + /** + * These are standard types. They permit a standardized way of + * referring to names of (or names dependant on) the template + * parameters, which are specific to the implementation. + */ + typedef _CharT char_type; + typedef _Traits traits_type; + typedef typename traits_type::int_type int_type; + typedef typename traits_type::pos_type pos_type; + typedef typename traits_type::off_type off_type; + //@} + + //@{ + /** + * @if maint + * This is a non-standard type. + * @endif + */ + typedef basic_streambuf __streambuf_type; + //@} + + friend class basic_ios; + friend class basic_istream; + friend class basic_ostream; + friend class istreambuf_iterator; + friend class ostreambuf_iterator; + + friend streamsize + __copy_streambufs_eof<>(__streambuf_type*, __streambuf_type*, bool&); + + template + friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, + _CharT2*>::__type + __copy_aux(istreambuf_iterator<_CharT2>, + istreambuf_iterator<_CharT2>, _CharT2*); + + template + friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, + istreambuf_iterator<_CharT2> >::__type + find(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, + const _CharT2&); + + template + friend basic_istream<_CharT2, _Traits2>& + operator>>(basic_istream<_CharT2, _Traits2>&, _CharT2*); + + template + friend basic_istream<_CharT2, _Traits2>& + operator>>(basic_istream<_CharT2, _Traits2>&, + basic_string<_CharT2, _Traits2, _Alloc>&); + + template + friend basic_istream<_CharT2, _Traits2>& + getline(basic_istream<_CharT2, _Traits2>&, + basic_string<_CharT2, _Traits2, _Alloc>&, _CharT2); + + protected: + //@{ + /** + * @if maint + * This is based on _IO_FILE, just reordered to be more consistent, + * and is intended to be the most minimal abstraction for an + * internal buffer. + * - get == input == read + * - put == output == write + * @endif + */ + char_type* _M_in_beg; // Start of get area. + char_type* _M_in_cur; // Current read area. + char_type* _M_in_end; // End of get area. + char_type* _M_out_beg; // Start of put area. + char_type* _M_out_cur; // Current put area. + char_type* _M_out_end; // End of put area. + + /** + * @if maint + * Current locale setting. + * @endif + */ + locale _M_buf_locale; + + public: + /// Destructor deallocates no buffer space. + virtual + ~basic_streambuf() + { } + + // [27.5.2.2.1] locales + /** + * @brief Entry point for imbue(). + * @param loc The new locale. + * @return The previous locale. + * + * Calls the derived imbue(loc). + */ + locale + pubimbue(const locale &__loc) + { + locale __tmp(this->getloc()); + this->imbue(__loc); + _M_buf_locale = __loc; + return __tmp; + } + + /** + * @brief Locale access. + * @return The current locale in effect. + * + * If pubimbue(loc) has been called, then the most recent @c loc + * is returned. Otherwise the global locale in effect at the time + * of construction is returned. + */ + locale + getloc() const + { return _M_buf_locale; } + + // [27.5.2.2.2] buffer management and positioning + //@{ + /** + * @brief Entry points for derived buffer functions. + * + * The public versions of @c pubfoo dispatch to the protected + * derived @c foo member functions, passing the arguments (if any) + * and returning the result unchanged. + */ + __streambuf_type* + pubsetbuf(char_type* __s, streamsize __n) + { return this->setbuf(__s, __n); } + + pos_type + pubseekoff(off_type __off, ios_base::seekdir __way, + ios_base::openmode __mode = ios_base::in | ios_base::out) + { return this->seekoff(__off, __way, __mode); } + + pos_type + pubseekpos(pos_type __sp, + ios_base::openmode __mode = ios_base::in | ios_base::out) + { return this->seekpos(__sp, __mode); } + + int + pubsync() { return this->sync(); } + //@} + + // [27.5.2.2.3] get area + /** + * @brief Looking ahead into the stream. + * @return The number of characters available. + * + * If a read position is available, returns the number of characters + * available for reading before the buffer must be refilled. + * Otherwise returns the derived @c showmanyc(). + */ + streamsize + in_avail() + { + const streamsize __ret = this->egptr() - this->gptr(); + return __ret ? __ret : this->showmanyc(); + } + + /** + * @brief Getting the next character. + * @return The next character, or eof. + * + * Calls @c sbumpc(), and if that function returns + * @c traits::eof(), so does this function. Otherwise, @c sgetc(). + */ + int_type + snextc() + { + int_type __ret = traits_type::eof(); + if (__builtin_expect(!traits_type::eq_int_type(this->sbumpc(), + __ret), true)) + __ret = this->sgetc(); + return __ret; + } + + /** + * @brief Getting the next character. + * @return The next character, or eof. + * + * If the input read position is available, returns that character + * and increments the read pointer, otherwise calls and returns + * @c uflow(). + */ + int_type + sbumpc() + { + int_type __ret; + if (__builtin_expect(this->gptr() < this->egptr(), true)) + { + __ret = traits_type::to_int_type(*this->gptr()); + this->gbump(1); + } + else + __ret = this->uflow(); + return __ret; + } + + /** + * @brief Getting the next character. + * @return The next character, or eof. + * + * If the input read position is available, returns that character, + * otherwise calls and returns @c underflow(). Does not move the + * read position after fetching the character. + */ + int_type + sgetc() + { + int_type __ret; + if (__builtin_expect(this->gptr() < this->egptr(), true)) + __ret = traits_type::to_int_type(*this->gptr()); + else + __ret = this->underflow(); + return __ret; + } + + /** + * @brief Entry point for xsgetn. + * @param s A buffer area. + * @param n A count. + * + * Returns xsgetn(s,n). The effect is to fill @a s[0] through + * @a s[n-1] with characters from the input sequence, if possible. + */ + streamsize + sgetn(char_type* __s, streamsize __n) + { return this->xsgetn(__s, __n); } + + // [27.5.2.2.4] putback + /** + * @brief Pushing characters back into the input stream. + * @param c The character to push back. + * @return The previous character, if possible. + * + * Similar to sungetc(), but @a c is pushed onto the stream instead + * of "the previous character". If successful, the next character + * fetched from the input stream will be @a c. + */ + int_type + sputbackc(char_type __c) + { + int_type __ret; + const bool __testpos = this->eback() < this->gptr(); + if (__builtin_expect(!__testpos || + !traits_type::eq(__c, this->gptr()[-1]), false)) + __ret = this->pbackfail(traits_type::to_int_type(__c)); + else + { + this->gbump(-1); + __ret = traits_type::to_int_type(*this->gptr()); + } + return __ret; + } + + /** + * @brief Moving backwards in the input stream. + * @return The previous character, if possible. + * + * If a putback position is available, this function decrements the + * input pointer and returns that character. Otherwise, calls and + * returns pbackfail(). The effect is to "unget" the last character + * "gotten". + */ + int_type + sungetc() + { + int_type __ret; + if (__builtin_expect(this->eback() < this->gptr(), true)) + { + this->gbump(-1); + __ret = traits_type::to_int_type(*this->gptr()); + } + else + __ret = this->pbackfail(); + return __ret; + } + + // [27.5.2.2.5] put area + /** + * @brief Entry point for all single-character output functions. + * @param c A character to output. + * @return @a c, if possible. + * + * One of two public output functions. + * + * If a write position is available for the output sequence (i.e., + * the buffer is not full), stores @a c in that position, increments + * the position, and returns @c traits::to_int_type(c). If a write + * position is not available, returns @c overflow(c). + */ + int_type + sputc(char_type __c) + { + int_type __ret; + if (__builtin_expect(this->pptr() < this->epptr(), true)) + { + *this->pptr() = __c; + this->pbump(1); + __ret = traits_type::to_int_type(__c); + } + else + __ret = this->overflow(traits_type::to_int_type(__c)); + return __ret; + } + + /** + * @brief Entry point for all single-character output functions. + * @param s A buffer read area. + * @param n A count. + * + * One of two public output functions. + * + * + * Returns xsputn(s,n). The effect is to write @a s[0] through + * @a s[n-1] to the output sequence, if possible. + */ + streamsize + sputn(const char_type* __s, streamsize __n) + { return this->xsputn(__s, __n); } + + protected: + /** + * @brief Base constructor. + * + * Only called from derived constructors, and sets up all the + * buffer data to zero, including the pointers described in the + * basic_streambuf class description. Note that, as a result, + * - the class starts with no read nor write positions available, + * - this is not an error + */ + basic_streambuf() + : _M_in_beg(0), _M_in_cur(0), _M_in_end(0), + _M_out_beg(0), _M_out_cur(0), _M_out_end(0), + _M_buf_locale(locale()) + { } + + // [27.5.2.3.1] get area access + //@{ + /** + * @brief Access to the get area. + * + * These functions are only available to other protected functions, + * including derived classes. + * + * - eback() returns the beginning pointer for the input sequence + * - gptr() returns the next pointer for the input sequence + * - egptr() returns the end pointer for the input sequence + */ + char_type* + eback() const { return _M_in_beg; } + + char_type* + gptr() const { return _M_in_cur; } + + char_type* + egptr() const { return _M_in_end; } + //@} + + /** + * @brief Moving the read position. + * @param n The delta by which to move. + * + * This just advances the read position without returning any data. + */ + void + gbump(int __n) { _M_in_cur += __n; } + + /** + * @brief Setting the three read area pointers. + * @param gbeg A pointer. + * @param gnext A pointer. + * @param gend A pointer. + * @post @a gbeg == @c eback(), @a gnext == @c gptr(), and + * @a gend == @c egptr() + */ + void + setg(char_type* __gbeg, char_type* __gnext, char_type* __gend) + { + _M_in_beg = __gbeg; + _M_in_cur = __gnext; + _M_in_end = __gend; + } + + // [27.5.2.3.2] put area access + //@{ + /** + * @brief Access to the put area. + * + * These functions are only available to other protected functions, + * including derived classes. + * + * - pbase() returns the beginning pointer for the output sequence + * - pptr() returns the next pointer for the output sequence + * - epptr() returns the end pointer for the output sequence + */ + char_type* + pbase() const { return _M_out_beg; } + + char_type* + pptr() const { return _M_out_cur; } + + char_type* + epptr() const { return _M_out_end; } + //@} + + /** + * @brief Moving the write position. + * @param n The delta by which to move. + * + * This just advances the write position without returning any data. + */ + void + pbump(int __n) { _M_out_cur += __n; } + + /** + * @brief Setting the three write area pointers. + * @param pbeg A pointer. + * @param pend A pointer. + * @post @a pbeg == @c pbase(), @a pbeg == @c pptr(), and + * @a pend == @c epptr() + */ + void + setp(char_type* __pbeg, char_type* __pend) + { + _M_out_beg = _M_out_cur = __pbeg; + _M_out_end = __pend; + } + + // [27.5.2.4] virtual functions + // [27.5.2.4.1] locales + /** + * @brief Changes translations. + * @param loc A new locale. + * + * Translations done during I/O which depend on the current locale + * are changed by this call. The standard adds, "Between invocations + * of this function a class derived from streambuf can safely cache + * results of calls to locale functions and to members of facets + * so obtained." + * + * @note Base class version does nothing. + */ + virtual void + imbue(const locale&) + { } + + // [27.5.2.4.2] buffer management and positioning + /** + * @brief Maniuplates the buffer. + * + * Each derived class provides its own appropriate behavior. See + * the next-to-last paragraph of + * http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#2 for + * more on this function. + * + * @note Base class version does nothing, returns @c this. + */ + virtual basic_streambuf* + setbuf(char_type*, streamsize) + { return this; } + + /** + * @brief Alters the stream positions. + * + * Each derived class provides its own appropriate behavior. + * @note Base class version does nothing, returns a @c pos_type + * that represents an invalid stream position. + */ + virtual pos_type + seekoff(off_type, ios_base::seekdir, + ios_base::openmode /*__mode*/ = ios_base::in | ios_base::out) + { return pos_type(off_type(-1)); } + + /** + * @brief Alters the stream positions. + * + * Each derived class provides its own appropriate behavior. + * @note Base class version does nothing, returns a @c pos_type + * that represents an invalid stream position. + */ + virtual pos_type + seekpos(pos_type, + ios_base::openmode /*__mode*/ = ios_base::in | ios_base::out) + { return pos_type(off_type(-1)); } + + /** + * @brief Synchronizes the buffer arrays with the controlled sequences. + * @return -1 on failure. + * + * Each derived class provides its own appropriate behavior, + * including the definition of "failure". + * @note Base class version does nothing, returns zero. + */ + virtual int + sync() { return 0; } + + // [27.5.2.4.3] get area + /** + * @brief Investigating the data available. + * @return An estimate of the number of characters available in the + * input sequence, or -1. + * + * "If it returns a positive value, then successive calls to + * @c underflow() will not return @c traits::eof() until at least that + * number of characters have been supplied. If @c showmanyc() + * returns -1, then calls to @c underflow() or @c uflow() will fail." + * [27.5.2.4.3]/1 + * + * @note Base class version does nothing, returns zero. + * @note The standard adds that "the intention is not only that the + * calls [to underflow or uflow] will not return @c eof() but + * that they will return "immediately". + * @note The standard adds that "the morphemes of @c showmanyc are + * "es-how-many-see", not "show-manic". + */ + virtual streamsize + showmanyc() { return 0; } + + /** + * @brief Multiple character extraction. + * @param s A buffer area. + * @param n Maximum number of characters to assign. + * @return The number of characters assigned. + * + * Fills @a s[0] through @a s[n-1] with characters from the input + * sequence, as if by @c sbumpc(). Stops when either @a n characters + * have been copied, or when @c traits::eof() would be copied. + * + * It is expected that derived classes provide a more efficient + * implementation by overriding this definition. + */ + virtual streamsize + xsgetn(char_type* __s, streamsize __n); + + /** + * @brief Fetches more data from the controlled sequence. + * @return The first character from the pending sequence. + * + * Informally, this function is called when the input buffer is + * exhausted (or does not exist, as buffering need not actually be + * done). If a buffer exists, it is "refilled". In either case, the + * next available character is returned, or @c traits::eof() to + * indicate a null pending sequence. + * + * For a formal definiton of the pending sequence, see a good text + * such as Langer & Kreft, or [27.5.2.4.3]/7-14. + * + * A functioning input streambuf can be created by overriding only + * this function (no buffer area will be used). For an example, see + * http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#6 + * + * @note Base class version does nothing, returns eof(). + */ + virtual int_type + underflow() + { return traits_type::eof(); } + + /** + * @brief Fetches more data from the controlled sequence. + * @return The first character from the pending sequence. + * + * Informally, this function does the same thing as @c underflow(), + * and in fact is required to call that function. It also returns + * the new character, like @c underflow() does. However, this + * function also moves the read position forward by one. + */ + virtual int_type + uflow() + { + int_type __ret = traits_type::eof(); + const bool __testeof = traits_type::eq_int_type(this->underflow(), + __ret); + if (!__testeof) + { + __ret = traits_type::to_int_type(*this->gptr()); + this->gbump(1); + } + return __ret; + } + + // [27.5.2.4.4] putback + /** + * @brief Tries to back up the input sequence. + * @param c The character to be inserted back into the sequence. + * @return eof() on failure, "some other value" on success + * @post The constraints of @c gptr(), @c eback(), and @c pptr() + * are the same as for @c underflow(). + * + * @note Base class version does nothing, returns eof(). + */ + virtual int_type + pbackfail(int_type /* __c */ = traits_type::eof()) + { return traits_type::eof(); } + + // Put area: + /** + * @brief Multiple character insertion. + * @param s A buffer area. + * @param n Maximum number of characters to write. + * @return The number of characters written. + * + * Writes @a s[0] through @a s[n-1] to the output sequence, as if + * by @c sputc(). Stops when either @a n characters have been + * copied, or when @c sputc() would return @c traits::eof(). + * + * It is expected that derived classes provide a more efficient + * implementation by overriding this definition. + */ + virtual streamsize + xsputn(const char_type* __s, streamsize __n); + + /** + * @brief Consumes data from the buffer; writes to the + * controlled sequence. + * @param c An additional character to consume. + * @return eof() to indicate failure, something else (usually + * @a c, or not_eof()) + * + * Informally, this function is called when the output buffer is full + * (or does not exist, as buffering need not actually be done). If a + * buffer exists, it is "consumed", with "some effect" on the + * controlled sequence. (Typically, the buffer is written out to the + * sequence verbatim.) In either case, the character @a c is also + * written out, if @a c is not @c eof(). + * + * For a formal definiton of this function, see a good text + * such as Langer & Kreft, or [27.5.2.4.5]/3-7. + * + * A functioning output streambuf can be created by overriding only + * this function (no buffer area will be used). + * + * @note Base class version does nothing, returns eof(). + */ + virtual int_type + overflow(int_type /* __c */ = traits_type::eof()) + { return traits_type::eof(); } + +#ifdef _GLIBCXX_DEPRECATED + // Annex D.6 + public: + /** + * @brief Tosses a character. + * + * Advances the read pointer, ignoring the character that would have + * 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 (this->gptr() < this->egptr()) + this->gbump(1); + else + this->uflow(); + } +#endif + + private: + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // Side effect of DR 50. + basic_streambuf(const __streambuf_type& __sb) + : _M_in_beg(__sb._M_in_beg), _M_in_cur(__sb._M_in_cur), + _M_in_end(__sb._M_in_end), _M_out_beg(__sb._M_out_beg), + _M_out_cur(__sb._M_out_cur), _M_out_end(__sb._M_out_cur), + _M_buf_locale(__sb._M_buf_locale) + { } + + __streambuf_type& + operator=(const __streambuf_type&) { return *this; }; + }; + + // Explicit specialization declarations, defined in src/streambuf.cc. + template<> + streamsize + __copy_streambufs_eof(basic_streambuf* __sbin, + basic_streambuf* __sbout, bool& __ineof); +#ifdef _GLIBCXX_USE_WCHAR_T + template<> + streamsize + __copy_streambufs_eof(basic_streambuf* __sbin, + basic_streambuf* __sbout, bool& __ineof); +#endif + +} // namespace std + +#ifndef _GLIBCXX_EXPORT_TEMPLATE +# include +#endif + +#endif /* _GLIBCXX_STREAMBUF */ diff --git a/cpp_src/streambuf.tcc b/cpp_src/streambuf.tcc new file mode 100644 index 0000000..11b3307 --- /dev/null +++ b/cpp_src/streambuf.tcc @@ -0,0 +1,179 @@ +// Stream buffer classes -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file streambuf.tcc + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 27.5 Stream buffers +// + +#ifndef _STREAMBUF_TCC +#define _STREAMBUF_TCC 1 + +#pragma GCC system_header + +namespace std { + + template + streamsize + basic_streambuf<_CharT, _Traits>:: + xsgetn(char_type* __s, streamsize __n) + { + streamsize __ret = 0; + while (__ret < __n) + { + const streamsize __buf_len = this->egptr() - this->gptr(); + if (__buf_len) + { + const streamsize __remaining = __n - __ret; + const streamsize __len = std::min(__buf_len, __remaining); + traits_type::copy(__s, this->gptr(), __len); + __ret += __len; + __s += __len; + this->gbump(__len); + } + + if (__ret < __n) + { + const int_type __c = this->uflow(); + if (!traits_type::eq_int_type(__c, traits_type::eof())) + { + traits_type::assign(*__s++, traits_type::to_char_type(__c)); + ++__ret; + } + else + break; + } + } + return __ret; + } + + template + streamsize + basic_streambuf<_CharT, _Traits>:: + xsputn(const char_type* __s, streamsize __n) + { + streamsize __ret = 0; + while (__ret < __n) + { + const streamsize __buf_len = this->epptr() - this->pptr(); + if (__buf_len) + { + const streamsize __remaining = __n - __ret; + const streamsize __len = std::min(__buf_len, __remaining); + traits_type::copy(this->pptr(), __s, __len); + __ret += __len; + __s += __len; + this->pbump(__len); + } + + if (__ret < __n) + { + int_type __c = this->overflow(traits_type::to_int_type(*__s)); + if (!traits_type::eq_int_type(__c, traits_type::eof())) + { + ++__ret; + ++__s; + } + else + break; + } + } + return __ret; + } + + // Conceivably, this could be used to implement buffer-to-buffer + // copies, if this was ever desired in an un-ambiguous way by the + // standard. + template + streamsize + __copy_streambufs_eof(basic_streambuf<_CharT, _Traits>* __sbin, + basic_streambuf<_CharT, _Traits>* __sbout, + bool& __ineof) + { + streamsize __ret = 0; + __ineof = true; + typename _Traits::int_type __c = __sbin->sgetc(); + while (!_Traits::eq_int_type(__c, _Traits::eof())) + { + __c = __sbout->sputc(_Traits::to_char_type(__c)); + if (_Traits::eq_int_type(__c, _Traits::eof())) + { + __ineof = false; + break; + } + ++__ret; + __c = __sbin->snextc(); + } + return __ret; + } + + template + inline streamsize + __copy_streambufs(basic_streambuf<_CharT, _Traits>* __sbin, + basic_streambuf<_CharT, _Traits>* __sbout) + { + bool __ineof; + return __copy_streambufs_eof(__sbin, __sbout, __ineof); + } + + // Inhibit implicit instantiations for required instantiations, + // which are defined via explicit instantiations elsewhere. + // NB: This syntax is a GNU extension. +#if _GLIBCXX_EXTERN_TEMPLATE + extern template class basic_streambuf; + extern template + streamsize + __copy_streambufs(basic_streambuf*, + basic_streambuf*); + extern template + streamsize + __copy_streambufs_eof(basic_streambuf*, + basic_streambuf*, bool&); + +#ifdef _GLIBCXX_USE_WCHAR_T + extern template class basic_streambuf; + extern template + streamsize + __copy_streambufs(basic_streambuf*, + basic_streambuf*); + extern template + streamsize + __copy_streambufs_eof(basic_streambuf*, + basic_streambuf*, bool&); +#endif +#endif + +} // namespace std + +#endif diff --git a/cpp_src/streambuf_iterator.h b/cpp_src/streambuf_iterator.h new file mode 100644 index 0000000..ce6d1ed --- /dev/null +++ b/cpp_src/streambuf_iterator.h @@ -0,0 +1,400 @@ +// Streambuf iterators + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file streambuf_iterator.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STREAMBUF_ITERATOR_H +#define _STREAMBUF_ITERATOR_H 1 + +#pragma GCC system_header + +#include +#include + +namespace std { + + // 24.5.3 Template class istreambuf_iterator + /// Provides input iterator semantics for streambufs. + template + class istreambuf_iterator + : public iterator + { + public: + // Types: + //@{ + /// Public typedefs + typedef _CharT char_type; + typedef _Traits traits_type; + typedef typename _Traits::int_type int_type; + typedef basic_streambuf<_CharT, _Traits> streambuf_type; + typedef basic_istream<_CharT, _Traits> istream_type; + //@} + + template + friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, + ostreambuf_iterator<_CharT2> >::__type + copy(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, + ostreambuf_iterator<_CharT2>); + + template + friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, + _CharT2*>::__type + __copy_aux(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, + _CharT2*); + + template + friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, + istreambuf_iterator<_CharT2> >::__type + find(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, + const _CharT2&); + + private: + // 24.5.3 istreambuf_iterator + // p 1 + // If the end of stream is reached (streambuf_type::sgetc() + // returns traits_type::eof()), the iterator becomes equal to + // the "end of stream" iterator value. + // NB: This implementation assumes the "end of stream" value + // is EOF, or -1. + mutable streambuf_type* _M_sbuf; + mutable int_type _M_c; + + public: + /// Construct end of input stream iterator. + istreambuf_iterator() throw() + : _M_sbuf(0), _M_c(traits_type::eof()) { } + + /// Construct start of input stream iterator. + istreambuf_iterator(istream_type& __s) throw() + : _M_sbuf(__s.rdbuf()), _M_c(traits_type::eof()) { } + + /// Construct start of streambuf iterator. + istreambuf_iterator(streambuf_type* __s) throw() + : _M_sbuf(__s), _M_c(traits_type::eof()) { } + + /// Return the current character pointed to by iterator. This returns + /// streambuf.sgetc(). It cannot be assigned. NB: The result of + /// operator*() on an end of stream is undefined. + char_type + operator*() const + { +#ifdef _GLIBCXX_DEBUG_PEDANTIC + // Dereferencing a past-the-end istreambuf_iterator is a + // libstdc++ extension + __glibcxx_requires_cond(!_M_at_eof(), + _M_message(__gnu_debug::__msg_deref_istreambuf) + ._M_iterator(*this)); +#endif + return traits_type::to_char_type(_M_get()); + } + + /// Advance the iterator. Calls streambuf.sbumpc(). + istreambuf_iterator& + operator++() + { + __glibcxx_requires_cond(!_M_at_eof(), + _M_message(__gnu_debug::__msg_inc_istreambuf) + ._M_iterator(*this)); + if (_M_sbuf) + { + _M_sbuf->sbumpc(); + _M_c = traits_type::eof(); + } + return *this; + } + + /// Advance the iterator. Calls streambuf.sbumpc(). + istreambuf_iterator + operator++(int) + { + __glibcxx_requires_cond(!_M_at_eof(), + _M_message(__gnu_debug::__msg_inc_istreambuf) + ._M_iterator(*this)); + + istreambuf_iterator __old = *this; + if (_M_sbuf) + { + __old._M_c = _M_sbuf->sbumpc(); + _M_c = traits_type::eof(); + } + return __old; + } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 110 istreambuf_iterator::equal not const + // NB: there is also number 111 (NAD, Future) pending on this function. + /// Return true both iterators are end or both are not end. + bool + equal(const istreambuf_iterator& __b) const + { + const bool __thiseof = _M_at_eof(); + const bool __beof = __b._M_at_eof(); + return (__thiseof && __beof || (!__thiseof && !__beof)); + } + + private: + int_type + _M_get() const + { + const int_type __eof = traits_type::eof(); + int_type __ret = __eof; + if (_M_sbuf) + { + if (!traits_type::eq_int_type(_M_c, __eof)) + __ret = _M_c; + else if (!traits_type::eq_int_type((__ret = _M_sbuf->sgetc()), + __eof)) + _M_c = __ret; + else + _M_sbuf = 0; + } + return __ret; + } + + bool + _M_at_eof() const + { + const int_type __eof = traits_type::eof(); + return traits_type::eq_int_type(_M_get(), __eof); + } + }; + + template + inline bool + operator==(const istreambuf_iterator<_CharT, _Traits>& __a, + const istreambuf_iterator<_CharT, _Traits>& __b) + { return __a.equal(__b); } + + template + inline bool + operator!=(const istreambuf_iterator<_CharT, _Traits>& __a, + const istreambuf_iterator<_CharT, _Traits>& __b) + { return !__a.equal(__b); } + + /// Provides output iterator semantics for streambufs. + template + class ostreambuf_iterator + : public iterator + { + public: + // Types: + //@{ + /// Public typedefs + typedef _CharT char_type; + typedef _Traits traits_type; + typedef basic_streambuf<_CharT, _Traits> streambuf_type; + typedef basic_ostream<_CharT, _Traits> ostream_type; + //@} + + template + friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, + ostreambuf_iterator<_CharT2> >::__type + copy(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, + ostreambuf_iterator<_CharT2>); + + private: + streambuf_type* _M_sbuf; + bool _M_failed; + + public: + /// Construct output iterator from ostream. + ostreambuf_iterator(ostream_type& __s) throw () + : _M_sbuf(__s.rdbuf()), _M_failed(!_M_sbuf) { } + + /// Construct output iterator from streambuf. + ostreambuf_iterator(streambuf_type* __s) throw () + : _M_sbuf(__s), _M_failed(!_M_sbuf) { } + + /// Write character to streambuf. Calls streambuf.sputc(). + ostreambuf_iterator& + operator=(_CharT __c) + { + if (!_M_failed && + _Traits::eq_int_type(_M_sbuf->sputc(__c), _Traits::eof())) + _M_failed = true; + return *this; + } + + /// Return *this. + ostreambuf_iterator& + operator*() + { return *this; } + + /// Return *this. + ostreambuf_iterator& + operator++(int) + { return *this; } + + /// Return *this. + ostreambuf_iterator& + operator++() + { return *this; } + + /// Return true if previous operator=() failed. + bool + failed() const throw() + { return _M_failed; } + + ostreambuf_iterator& + _M_put(const _CharT* __ws, streamsize __len) + { + if (__builtin_expect(!_M_failed, true) + && __builtin_expect(this->_M_sbuf->sputn(__ws, __len) != __len, + false)) + _M_failed = true; + return *this; + } + }; + + // Overloads for streambuf iterators. + template + typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, + ostreambuf_iterator<_CharT> >::__type + copy(istreambuf_iterator<_CharT> __first, + istreambuf_iterator<_CharT> __last, + ostreambuf_iterator<_CharT> __result) + { + if (__first._M_sbuf && !__last._M_sbuf && !__result._M_failed) + { + bool __ineof; + __copy_streambufs_eof(__first._M_sbuf, __result._M_sbuf, __ineof); + if (!__ineof) + __result._M_failed = true; + } + return __result; + } + + template + typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, + ostreambuf_iterator<_CharT> >::__type + __copy_aux(_CharT* __first, _CharT* __last, + ostreambuf_iterator<_CharT> __result) + { + const streamsize __num = __last - __first; + if (__num > 0) + __result._M_put(__first, __num); + return __result; + } + + template + typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, + ostreambuf_iterator<_CharT> >::__type + __copy_aux(const _CharT* __first, const _CharT* __last, + ostreambuf_iterator<_CharT> __result) + { + const streamsize __num = __last - __first; + if (__num > 0) + __result._M_put(__first, __num); + return __result; + } + + template + typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, + _CharT*>::__type + __copy_aux(istreambuf_iterator<_CharT> __first, + istreambuf_iterator<_CharT> __last, _CharT* __result) + { + typedef istreambuf_iterator<_CharT> __is_iterator_type; + typedef typename __is_iterator_type::traits_type traits_type; + typedef typename __is_iterator_type::streambuf_type streambuf_type; + typedef typename traits_type::int_type int_type; + + if (__first._M_sbuf && !__last._M_sbuf) + { + streambuf_type* __sb = __first._M_sbuf; + int_type __c = __sb->sgetc(); + while (!traits_type::eq_int_type(__c, traits_type::eof())) + { + const streamsize __n = __sb->egptr() - __sb->gptr(); + if (__n > 1) + { + traits_type::copy(__result, __sb->gptr(), __n); + __sb->gbump(__n); + __result += __n; + __c = __sb->underflow(); + } + else + { + *__result++ = traits_type::to_char_type(__c); + __c = __sb->snextc(); + } + } + } + return __result; + } + + template + typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, + istreambuf_iterator<_CharT> >::__type + find(istreambuf_iterator<_CharT> __first, + istreambuf_iterator<_CharT> __last, const _CharT& __val) + { + typedef istreambuf_iterator<_CharT> __is_iterator_type; + typedef typename __is_iterator_type::traits_type traits_type; + typedef typename __is_iterator_type::streambuf_type streambuf_type; + typedef typename traits_type::int_type int_type; + + if (__first._M_sbuf && !__last._M_sbuf) + { + const int_type __ival = traits_type::to_int_type(__val); + streambuf_type* __sb = __first._M_sbuf; + int_type __c = __sb->sgetc(); + while (!traits_type::eq_int_type(__c, traits_type::eof()) + && !traits_type::eq_int_type(__c, __ival)) + { + streamsize __n = __sb->egptr() - __sb->gptr(); + if (__n > 1) + { + const _CharT* __p = traits_type::find(__sb->gptr(), + __n, __val); + if (__p) + __n = __p - __sb->gptr(); + __sb->gbump(__n); + __c = __sb->sgetc(); + } + else + __c = __sb->snextc(); + } + + if (!traits_type::eq_int_type(__c, traits_type::eof())) + __first._M_c = __c; + else + __first._M_sbuf = 0; + } + return __first; + } + +} // namespace std + +#endif diff --git a/cpp_src/string b/cpp_src/string new file mode 100644 index 0000000..3046946 --- /dev/null +++ b/cpp_src/string @@ -0,0 +1,61 @@ +// Components for manipulating sequences of characters -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file include/string + * This is a Standard C++ Library header. + */ + +// +// ISO C++ 14882: 21 Strings library +// + +#ifndef _GLIBCXX_STRING +#define _GLIBCXX_STRING 1 + +#pragma GCC system_header + +#include +#include +#include +#include // For allocator. +#include +#include // For operators >>, <<, and getline decls. +#include +#include +#include // For less +#include + +#ifndef _GLIBCXX_EXPORT_TEMPLATE +# include // for find_if +# include +#endif + +#endif /* _GLIBCXX_STRING */ diff --git a/cpp_src/stringfwd.h b/cpp_src/stringfwd.h new file mode 100644 index 0000000..f00e736 --- /dev/null +++ b/cpp_src/stringfwd.h @@ -0,0 +1,70 @@ +// String support -*- C++ -*- + +// Copyright (C) 2001, 2002, 2005 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file stringfwd.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 21 Strings library +// + +#ifndef _STRINGFWD_H +#define _STRINGFWD_H 1 + +#pragma GCC system_header + +#include + +namespace std { + + template + class allocator; + + template + struct char_traits; + + template, + typename _Alloc = allocator<_CharT> > + class basic_string; + + template<> struct char_traits; + + typedef basic_string string; + +#ifdef _GLIBCXX_USE_WCHAR_T + template<> struct char_traits; + + typedef basic_string wstring; +#endif + +} // namespace std + +#endif // _STRINGFWD_H diff --git a/cpp_src/typeinfo b/cpp_src/typeinfo new file mode 100644 index 0000000..cddb65e --- /dev/null +++ b/cpp_src/typeinfo @@ -0,0 +1,169 @@ +// RTTI support for -*- C++ -*- +// Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, +// 2003, 2004, 2005, 2006, 2007 +// Free Software Foundation +// +// This file is part of GCC. +// +// GCC is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation; either version 2, or (at your option) +// any later version. +// +// GCC is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. +// +// You should have received a copy of the GNU General Public License +// along with GCC; see the file COPYING. If not, write to +// the Free Software Foundation, 51 Franklin Street, Fifth Floor, +// Boston, MA 02110-1301, USA. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file typeinfo + * This is a Standard C++ Library header. + */ + +#ifndef _TYPEINFO +#define _TYPEINFO + +#include + +#pragma GCC visibility push(default) + +extern "C++" { + +namespace __cxxabiv1 +{ + class __class_type_info; +} // namespace __cxxabiv1 + +#ifndef __GXX_MERGED_TYPEINFO_NAMES + #if !__GXX_WEAK__ + // If weak symbols are not supported, typeinfo names are not merged. + #define __GXX_MERGED_TYPEINFO_NAMES 0 + #else + // On platforms that support weak symbols, typeinfo names are merged. + #define __GXX_MERGED_TYPEINFO_NAMES 1 + #endif +#endif + +namespace std +{ + /** + * @brief Part of RTTI. + * + * The @c type_info class describes type information generated by + * an implementation. + */ + class type_info + { + public: + /** Destructor first. Being the first non-inline virtual function, this + * controls in which translation unit the vtable is emitted. The + * compiler makes use of that information to know where to emit + * the runtime-mandated type_info structures in the new-abi. */ + virtual ~type_info(); + + /** Returns an @e implementation-defined byte string; this is not + * portable between compilers! */ + const char* name() const + { return __name; } + +#if !__GXX_MERGED_TYPEINFO_NAMES + bool before(const type_info& __arg) const; + + // In old abi, or when weak symbols are not supported, there can + // be multiple instances of a type_info object for one + // type. Uniqueness must use the _name value, not object address. + bool operator==(const type_info& __arg) const; +#else + /** Returns true if @c *this precedes @c __arg in the implementation's + * collation order. */ + // In new abi we can rely on type_info's NTBS being unique, + // and therefore address comparisons are sufficient. + bool before(const type_info& __arg) const + { return __name < __arg.__name; } + + bool operator==(const type_info& __arg) const + { return __name == __arg.__name; } +#endif + bool operator!=(const type_info& __arg) const + { return !operator==(__arg); } + + // Return true if this is a pointer type of some kind + virtual bool __is_pointer_p() const; + + // Return true if this is a function type + virtual bool __is_function_p() const; + + // Try and catch a thrown type. Store an adjusted pointer to the + // caught type in THR_OBJ. If THR_TYPE is not a pointer type, then + // THR_OBJ points to the thrown object. If THR_TYPE is a pointer + // type, then THR_OBJ is the pointer itself. OUTER indicates the + // number of outer pointers, and whether they were const + // qualified. + virtual bool __do_catch(const type_info *__thr_type, void **__thr_obj, + unsigned __outer) const; + + // Internally used during catch matching + virtual bool __do_upcast(const __cxxabiv1::__class_type_info *__target, + void **__obj_ptr) const; + + protected: + const char *__name; + + explicit type_info(const char *__n): __name(__n) { } + + private: + /// Assigning type_info is not supported. + type_info& operator=(const type_info&); + type_info(const type_info&); + }; + + /** + * @brief Thrown during incorrect typecasting. + * + * If you attempt an invalid @c dynamic_cast expression, an instance of + * this class (or something derived from this class) is thrown. */ + class bad_cast : public exception + { + public: + bad_cast() throw() { } + + // This declaration is not useless: + // http://gcc.gnu.org/onlinedocs/gcc-3.0.2/gcc_6.html#SEC118 + virtual ~bad_cast() throw(); + + // See comment in eh_exception.cc. + virtual const char* what() const throw(); + }; + + /** If you use a NULL pointer in a @c typeid expression, this is thrown. */ + class bad_typeid : public exception + { + public: + bad_typeid () throw() { } + + // This declaration is not useless: + // http://gcc.gnu.org/onlinedocs/gcc-3.0.2/gcc_6.html#SEC118 + virtual ~bad_typeid() throw(); + + // See comment in eh_exception.cc. + virtual const char* what() const throw(); + }; +} // namespace std + +#pragma GCC visibility pop + +} // extern "C++" +#endif diff --git a/cpp_src/utility b/cpp_src/utility new file mode 100644 index 0000000..84c9131 --- /dev/null +++ b/cpp_src/utility @@ -0,0 +1,69 @@ +// -*- C++ -*- + +// Copyright (C) 2001, 2002 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file include/utility + * This is a Standard C++ Library header. + */ + +#ifndef _GLIBCXX_UTILITY +#define _GLIBCXX_UTILITY 1 + +#pragma GCC system_header + +#include +#include +#include + +#endif /* _GLIBCXX_UTILITY */ diff --git a/cpp_src/valarray b/cpp_src/valarray new file mode 100644 index 0000000..8fb48d5 --- /dev/null +++ b/cpp_src/valarray @@ -0,0 +1,1039 @@ +// The template and inlines for the -*- C++ -*- valarray class. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2004, 2005, 2006, 2007 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file valarray + * This is a Standard C++ Library header. + */ + +// Written by Gabriel Dos Reis + +#ifndef _GLIBCXX_VALARRAY +#define _GLIBCXX_VALARRAY 1 + +#pragma GCC system_header + +#include +#include +#include +#include +#include +#include +#include + +namespace std { + + template + class _Expr; + + template + class _ValArray; + + template class _Meta, class _Dom> + struct _UnClos; + + template class _Meta1, + template class _Meta2, + class _Dom1, class _Dom2> + class _BinClos; + + template class _Meta, class _Dom> + class _SClos; + + template class _Meta, class _Dom> + class _GClos; + + template class _Meta, class _Dom> + class _IClos; + + template class _Meta, class _Dom> + class _ValFunClos; + + template class _Meta, class _Dom> + class _RefFunClos; + + template class valarray; // An array of type _Tp + class slice; // BLAS-like slice out of an array + template class slice_array; + class gslice; // generalized slice out of an array + template class gslice_array; + template class mask_array; // masked array + template class indirect_array; // indirected array + +} // namespace std + +#include +#include + +namespace std { + + /** + * @brief Smart array designed to support numeric processing. + * + * A valarray is an array that provides constraints intended to allow for + * effective optimization of numeric array processing by reducing the + * aliasing that can result from pointer representations. It represents a + * one-dimensional array from which different multidimensional subsets can + * be accessed and modified. + * + * @param Tp Type of object in the array. + */ + template + class valarray + { + template + struct _UnaryOp + { + typedef typename __fun<_Op, _Tp>::result_type __rt; + typedef _Expr<_UnClos<_Op, _ValArray, _Tp>, __rt> _Rt; + }; + public: + typedef _Tp value_type; + + // _lib.valarray.cons_ construct/destroy: + /// Construct an empty array. + valarray(); + + /// Construct an array with @a n elements. + explicit valarray(size_t); + + /// Construct an array with @a n elements initialized to @a t. + valarray(const _Tp&, size_t); + + /// Construct an array initialized to the first @a n elements of @a t. + valarray(const _Tp* __restrict__, size_t); + + /// Copy constructor. + valarray(const valarray&); + + /// Construct an array with the same size and values in @a sa. + valarray(const slice_array<_Tp>&); + + /// Construct an array with the same size and values in @a ga. + valarray(const gslice_array<_Tp>&); + + /// Construct an array with the same size and values in @a ma. + valarray(const mask_array<_Tp>&); + + /// Construct an array with the same size and values in @a ia. + valarray(const indirect_array<_Tp>&); + + template + valarray(const _Expr<_Dom, _Tp>& __e); + + ~valarray(); + + // _lib.valarray.assign_ assignment: + /** + * @brief Assign elements to an array. + * + * Assign elements of array to values in @a v. Results are undefined + * if @a v does not have the same size as this array. + * + * @param v Valarray to get values from. + */ + valarray<_Tp>& operator=(const valarray<_Tp>&); + + /** + * @brief Assign elements to a value. + * + * Assign all elements of array to @a t. + * + * @param t Value for elements. + */ + valarray<_Tp>& operator=(const _Tp&); + + /** + * @brief Assign elements to an array subset. + * + * Assign elements of array to values in @a sa. Results are undefined + * if @a sa does not have the same size as this array. + * + * @param sa Array slice to get values from. + */ + valarray<_Tp>& operator=(const slice_array<_Tp>&); + + /** + * @brief Assign elements to an array subset. + * + * Assign elements of array to values in @a ga. Results are undefined + * if @a ga does not have the same size as this array. + * + * @param ga Array slice to get values from. + */ + valarray<_Tp>& operator=(const gslice_array<_Tp>&); + + /** + * @brief Assign elements to an array subset. + * + * Assign elements of array to values in @a ma. Results are undefined + * if @a ma does not have the same size as this array. + * + * @param ma Array slice to get values from. + */ + valarray<_Tp>& operator=(const mask_array<_Tp>&); + + /** + * @brief Assign elements to an array subset. + * + * Assign elements of array to values in @a ia. Results are undefined + * if @a ia does not have the same size as this array. + * + * @param ia Array slice to get values from. + */ + valarray<_Tp>& operator=(const indirect_array<_Tp>&); + + template valarray<_Tp>& + operator= (const _Expr<_Dom, _Tp>&); + + // _lib.valarray.access_ element access: + /** + * Return a reference to the i'th array element. + * + * @param i Index of element to return. + * @return Reference to the i'th element. + */ + _Tp& operator[](size_t); + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 389. Const overload of valarray::operator[] returns by value. + const _Tp& operator[](size_t) const; + + // _lib.valarray.sub_ subset operations: + /** + * @brief Return an array subset. + * + * Returns a new valarray containing the elements of the array + * indicated by the slice argument. The new valarray has the same size + * as the input slice. @see slice. + * + * @param s The source slice. + * @return New valarray containing elements in @a s. + */ + _Expr<_SClos<_ValArray, _Tp>, _Tp> operator[](slice) const; + + /** + * @brief Return a reference to an array subset. + * + * Returns a new valarray containing the elements of the array + * indicated by the slice argument. The new valarray has the same size + * as the input slice. @see slice. + * + * @param s The source slice. + * @return New valarray containing elements in @a s. + */ + slice_array<_Tp> operator[](slice); + + /** + * @brief Return an array subset. + * + * Returns a slice_array referencing the elements of the array + * indicated by the slice argument. @see gslice. + * + * @param s The source slice. + * @return Slice_array referencing elements indicated by @a s. + */ + _Expr<_GClos<_ValArray, _Tp>, _Tp> operator[](const gslice&) const; + + /** + * @brief Return a reference to an array subset. + * + * Returns a new valarray containing the elements of the array + * indicated by the gslice argument. The new valarray has + * the same size as the input gslice. @see gslice. + * + * @param s The source gslice. + * @return New valarray containing elements in @a s. + */ + gslice_array<_Tp> operator[](const gslice&); + + /** + * @brief Return an array subset. + * + * Returns a new valarray containing the elements of the array + * indicated by the argument. The input is a valarray of bool which + * represents a bitmask indicating which elements should be copied into + * the new valarray. Each element of the array is added to the return + * valarray if the corresponding element of the argument is true. + * + * @param m The valarray bitmask. + * @return New valarray containing elements indicated by @a m. + */ + valarray<_Tp> operator[](const valarray&) const; + + /** + * @brief Return a reference to an array subset. + * + * Returns a new mask_array referencing the elements of the array + * indicated by the argument. The input is a valarray of bool which + * represents a bitmask indicating which elements are part of the + * subset. Elements of the array are part of the subset if the + * corresponding element of the argument is true. + * + * @param m The valarray bitmask. + * @return New valarray containing elements indicated by @a m. + */ + mask_array<_Tp> operator[](const valarray&); + + /** + * @brief Return an array subset. + * + * Returns a new valarray containing the elements of the array + * indicated by the argument. The elements in the argument are + * interpreted as the indices of elements of this valarray to copy to + * the return valarray. + * + * @param i The valarray element index list. + * @return New valarray containing elements in @a s. + */ + _Expr<_IClos<_ValArray, _Tp>, _Tp> + operator[](const valarray&) const; + + /** + * @brief Return a reference to an array subset. + * + * Returns an indirect_array referencing the elements of the array + * indicated by the argument. The elements in the argument are + * interpreted as the indices of elements of this valarray to include + * in the subset. The returned indirect_array refers to these + * elements. + * + * @param i The valarray element index list. + * @return Indirect_array referencing elements in @a i. + */ + indirect_array<_Tp> operator[](const valarray&); + + // _lib.valarray.unary_ unary operators: + /// Return a new valarray by applying unary + to each element. + typename _UnaryOp<__unary_plus>::_Rt operator+() const; + + /// Return a new valarray by applying unary - to each element. + typename _UnaryOp<__negate>::_Rt operator-() const; + + /// Return a new valarray by applying unary ~ to each element. + typename _UnaryOp<__bitwise_not>::_Rt operator~() const; + + /// Return a new valarray by applying unary ! to each element. + typename _UnaryOp<__logical_not>::_Rt operator!() const; + + // _lib.valarray.cassign_ computed assignment: + /// Multiply each element of array by @a t. + valarray<_Tp>& operator*=(const _Tp&); + + /// Divide each element of array by @a t. + valarray<_Tp>& operator/=(const _Tp&); + + /// Set each element e of array to e % @a t. + valarray<_Tp>& operator%=(const _Tp&); + + /// Add @a t to each element of array. + valarray<_Tp>& operator+=(const _Tp&); + + /// Subtract @a t to each element of array. + valarray<_Tp>& operator-=(const _Tp&); + + /// Set each element e of array to e ^ @a t. + valarray<_Tp>& operator^=(const _Tp&); + + /// Set each element e of array to e & @a t. + valarray<_Tp>& operator&=(const _Tp&); + + /// Set each element e of array to e | @a t. + valarray<_Tp>& operator|=(const _Tp&); + + /// Left shift each element e of array by @a t bits. + valarray<_Tp>& operator<<=(const _Tp&); + + /// Right shift each element e of array by @a t bits. + valarray<_Tp>& operator>>=(const _Tp&); + + /// Multiply elements of array by corresponding elements of @a v. + valarray<_Tp>& operator*=(const valarray<_Tp>&); + + /// Divide elements of array by corresponding elements of @a v. + valarray<_Tp>& operator/=(const valarray<_Tp>&); + + /// Modulo elements of array by corresponding elements of @a v. + valarray<_Tp>& operator%=(const valarray<_Tp>&); + + /// Add corresponding elements of @a v to elements of array. + valarray<_Tp>& operator+=(const valarray<_Tp>&); + + /// Subtract corresponding elements of @a v from elements of array. + valarray<_Tp>& operator-=(const valarray<_Tp>&); + + /// Logical xor corresponding elements of @a v with elements of array. + valarray<_Tp>& operator^=(const valarray<_Tp>&); + + /// Logical or corresponding elements of @a v with elements of array. + valarray<_Tp>& operator|=(const valarray<_Tp>&); + + /// Logical and corresponding elements of @a v with elements of array. + valarray<_Tp>& operator&=(const valarray<_Tp>&); + + /// Left shift elements of array by corresponding elements of @a v. + valarray<_Tp>& operator<<=(const valarray<_Tp>&); + + /// Right shift elements of array by corresponding elements of @a v. + valarray<_Tp>& operator>>=(const valarray<_Tp>&); + + template + valarray<_Tp>& operator*=(const _Expr<_Dom, _Tp>&); + template + valarray<_Tp>& operator/=(const _Expr<_Dom, _Tp>&); + template + valarray<_Tp>& operator%=(const _Expr<_Dom, _Tp>&); + template + valarray<_Tp>& operator+=(const _Expr<_Dom, _Tp>&); + template + valarray<_Tp>& operator-=(const _Expr<_Dom, _Tp>&); + template + valarray<_Tp>& operator^=(const _Expr<_Dom, _Tp>&); + template + valarray<_Tp>& operator|=(const _Expr<_Dom, _Tp>&); + template + valarray<_Tp>& operator&=(const _Expr<_Dom, _Tp>&); + template + valarray<_Tp>& operator<<=(const _Expr<_Dom, _Tp>&); + template + valarray<_Tp>& operator>>=(const _Expr<_Dom, _Tp>&); + + // _lib.valarray.members_ member functions: + /// Return the number of elements in array. + size_t size() const; + + /** + * @brief Return the sum of all elements in the array. + * + * Accumulates the sum of all elements into a Tp using +=. The order + * of adding the elements is unspecified. + */ + _Tp sum() const; + + /// Return the minimum element using operator<(). + _Tp min() const; + + /// Return the maximum element using operator<(). + _Tp max() const; + + /** + * @brief Return a shifted array. + * + * A new valarray is constructed as a copy of this array with elements + * in shifted positions. For an element with index i, the new position + * is i - n. The new valarray has the same size as the current one. + * New elements without a value are set to 0. Elements whose new + * position is outside the bounds of the array are discarded. + * + * Positive arguments shift toward index 0, discarding elements [0, n). + * Negative arguments discard elements from the top of the array. + * + * @param n Number of element positions to shift. + * @return New valarray with elements in shifted positions. + */ + valarray<_Tp> shift (int) const; + + /** + * @brief Return a rotated array. + * + * A new valarray is constructed as a copy of this array with elements + * in shifted positions. For an element with index i, the new position + * is (i - n) % size(). The new valarray has the same size as the + * current one. Elements that are shifted beyond the array bounds are + * shifted into the other end of the array. No elements are lost. + * + * Positive arguments shift toward index 0, wrapping around the top. + * Negative arguments shift towards the top, wrapping around to 0. + * + * @param n Number of element positions to rotate. + * @return New valarray with elements in shifted positions. + */ + valarray<_Tp> cshift(int) const; + + /** + * @brief Apply a function to the array. + * + * Returns a new valarray with elements assigned to the result of + * applying func to the corresponding element of this array. The new + * array has the same size as this one. + * + * @param func Function of Tp returning Tp to apply. + * @return New valarray with transformed elements. + */ + _Expr<_ValFunClos<_ValArray, _Tp>, _Tp> apply(_Tp func(_Tp)) const; + + /** + * @brief Apply a function to the array. + * + * Returns a new valarray with elements assigned to the result of + * applying func to the corresponding element of this array. The new + * array has the same size as this one. + * + * @param func Function of const Tp& returning Tp to apply. + * @return New valarray with transformed elements. + */ + _Expr<_RefFunClos<_ValArray, _Tp>, _Tp> apply(_Tp func(const _Tp&)) const; + + /** + * @brief Resize array. + * + * Resize this array to @a size and set all elements to @a c. All + * references and iterators are invalidated. + * + * @param size New array size. + * @param c New value for all elements. + */ + void resize(size_t __size, _Tp __c = _Tp()); + + private: + size_t _M_size; + _Tp* __restrict__ _M_data; + + friend class _Array<_Tp>; + }; + + template + inline const _Tp& + valarray<_Tp>::operator[](size_t __i) const + { + __glibcxx_requires_subscript(__i); + return _M_data[__i]; + } + + template + inline _Tp& + valarray<_Tp>::operator[](size_t __i) + { + __glibcxx_requires_subscript(__i); + return _M_data[__i]; + } + +} // namespace std + +#include +#include +#include +#include +#include +#include + +namespace std { + + template + inline + valarray<_Tp>::valarray() : _M_size(0), _M_data(0) {} + + template + inline + valarray<_Tp>::valarray(size_t __n) + : _M_size(__n), _M_data(__valarray_get_storage<_Tp>(__n)) + { std::__valarray_default_construct(_M_data, _M_data + __n); } + + template + inline + valarray<_Tp>::valarray(const _Tp& __t, size_t __n) + : _M_size(__n), _M_data(__valarray_get_storage<_Tp>(__n)) + { std::__valarray_fill_construct(_M_data, _M_data + __n, __t); } + + template + inline + valarray<_Tp>::valarray(const _Tp* __restrict__ __p, size_t __n) + : _M_size(__n), _M_data(__valarray_get_storage<_Tp>(__n)) + { + _GLIBCXX_DEBUG_ASSERT(__p != 0 || __n == 0); + std::__valarray_copy_construct(__p, __p + __n, _M_data); + } + + template + inline + valarray<_Tp>::valarray(const valarray<_Tp>& __v) + : _M_size(__v._M_size), _M_data(__valarray_get_storage<_Tp>(__v._M_size)) + { std::__valarray_copy_construct(__v._M_data, __v._M_data + _M_size, + _M_data); } + + template + inline + valarray<_Tp>::valarray(const slice_array<_Tp>& __sa) + : _M_size(__sa._M_sz), _M_data(__valarray_get_storage<_Tp>(__sa._M_sz)) + { + std::__valarray_copy_construct + (__sa._M_array, __sa._M_sz, __sa._M_stride, _Array<_Tp>(_M_data)); + } + + template + inline + valarray<_Tp>::valarray(const gslice_array<_Tp>& __ga) + : _M_size(__ga._M_index.size()), + _M_data(__valarray_get_storage<_Tp>(_M_size)) + { + std::__valarray_copy_construct + (__ga._M_array, _Array(__ga._M_index), + _Array<_Tp>(_M_data), _M_size); + } + + template + inline + valarray<_Tp>::valarray(const mask_array<_Tp>& __ma) + : _M_size(__ma._M_sz), _M_data(__valarray_get_storage<_Tp>(__ma._M_sz)) + { + std::__valarray_copy_construct + (__ma._M_array, __ma._M_mask, _Array<_Tp>(_M_data), _M_size); + } + + template + inline + valarray<_Tp>::valarray(const indirect_array<_Tp>& __ia) + : _M_size(__ia._M_sz), _M_data(__valarray_get_storage<_Tp>(__ia._M_sz)) + { + std::__valarray_copy_construct + (__ia._M_array, __ia._M_index, _Array<_Tp>(_M_data), _M_size); + } + + template template + inline + valarray<_Tp>::valarray(const _Expr<_Dom, _Tp>& __e) + : _M_size(__e.size()), _M_data(__valarray_get_storage<_Tp>(_M_size)) + { std::__valarray_copy_construct(__e, _M_size, _Array<_Tp>(_M_data)); } + + template + inline + valarray<_Tp>::~valarray() + { + std::__valarray_destroy_elements(_M_data, _M_data + _M_size); + std::__valarray_release_memory(_M_data); + } + + template + inline valarray<_Tp>& + valarray<_Tp>::operator=(const valarray<_Tp>& __v) + { + _GLIBCXX_DEBUG_ASSERT(_M_size == __v._M_size); + std::__valarray_copy(__v._M_data, _M_size, _M_data); + return *this; + } + + template + inline valarray<_Tp>& + valarray<_Tp>::operator=(const _Tp& __t) + { + std::__valarray_fill(_M_data, _M_size, __t); + return *this; + } + + template + inline valarray<_Tp>& + valarray<_Tp>::operator=(const slice_array<_Tp>& __sa) + { + _GLIBCXX_DEBUG_ASSERT(_M_size == __sa._M_sz); + std::__valarray_copy(__sa._M_array, __sa._M_sz, + __sa._M_stride, _Array<_Tp>(_M_data)); + return *this; + } + + template + inline valarray<_Tp>& + valarray<_Tp>::operator=(const gslice_array<_Tp>& __ga) + { + _GLIBCXX_DEBUG_ASSERT(_M_size == __ga._M_index.size()); + std::__valarray_copy(__ga._M_array, _Array(__ga._M_index), + _Array<_Tp>(_M_data), _M_size); + return *this; + } + + template + inline valarray<_Tp>& + valarray<_Tp>::operator=(const mask_array<_Tp>& __ma) + { + _GLIBCXX_DEBUG_ASSERT(_M_size == __ma._M_sz); + std::__valarray_copy(__ma._M_array, __ma._M_mask, + _Array<_Tp>(_M_data), _M_size); + return *this; + } + + template + inline valarray<_Tp>& + valarray<_Tp>::operator=(const indirect_array<_Tp>& __ia) + { + _GLIBCXX_DEBUG_ASSERT(_M_size == __ia._M_sz); + std::__valarray_copy(__ia._M_array, __ia._M_index, + _Array<_Tp>(_M_data), _M_size); + return *this; + } + + template template + inline valarray<_Tp>& + valarray<_Tp>::operator=(const _Expr<_Dom, _Tp>& __e) + { + _GLIBCXX_DEBUG_ASSERT(_M_size == __e.size()); + std::__valarray_copy(__e, _M_size, _Array<_Tp>(_M_data)); + return *this; + } + + template + inline _Expr<_SClos<_ValArray,_Tp>, _Tp> + valarray<_Tp>::operator[](slice __s) const + { + typedef _SClos<_ValArray,_Tp> _Closure; + return _Expr<_Closure, _Tp>(_Closure (_Array<_Tp>(_M_data), __s)); + } + + template + inline slice_array<_Tp> + valarray<_Tp>::operator[](slice __s) + { return slice_array<_Tp>(_Array<_Tp>(_M_data), __s); } + + template + inline _Expr<_GClos<_ValArray,_Tp>, _Tp> + valarray<_Tp>::operator[](const gslice& __gs) const + { + typedef _GClos<_ValArray,_Tp> _Closure; + return _Expr<_Closure, _Tp> + (_Closure(_Array<_Tp>(_M_data), __gs._M_index->_M_index)); + } + + template + inline gslice_array<_Tp> + valarray<_Tp>::operator[](const gslice& __gs) + { + return gslice_array<_Tp> + (_Array<_Tp>(_M_data), __gs._M_index->_M_index); + } + + template + inline valarray<_Tp> + valarray<_Tp>::operator[](const valarray& __m) const + { + size_t __s = 0; + size_t __e = __m.size(); + for (size_t __i=0; __i<__e; ++__i) + if (__m[__i]) ++__s; + return valarray<_Tp>(mask_array<_Tp>(_Array<_Tp>(_M_data), __s, + _Array (__m))); + } + + template + inline mask_array<_Tp> + valarray<_Tp>::operator[](const valarray& __m) + { + size_t __s = 0; + size_t __e = __m.size(); + for (size_t __i=0; __i<__e; ++__i) + if (__m[__i]) ++__s; + return mask_array<_Tp>(_Array<_Tp>(_M_data), __s, _Array(__m)); + } + + template + inline _Expr<_IClos<_ValArray,_Tp>, _Tp> + valarray<_Tp>::operator[](const valarray& __i) const + { + typedef _IClos<_ValArray,_Tp> _Closure; + return _Expr<_Closure, _Tp>(_Closure(*this, __i)); + } + + template + inline indirect_array<_Tp> + valarray<_Tp>::operator[](const valarray& __i) + { + return indirect_array<_Tp>(_Array<_Tp>(_M_data), __i.size(), + _Array(__i)); + } + + template + inline size_t + valarray<_Tp>::size() const + { return _M_size; } + + template + inline _Tp + valarray<_Tp>::sum() const + { + _GLIBCXX_DEBUG_ASSERT(_M_size > 0); + return std::__valarray_sum(_M_data, _M_data + _M_size); + } + + template + inline valarray<_Tp> + valarray<_Tp>::shift(int __n) const + { + valarray<_Tp> __ret; + + if (_M_size == 0) + return __ret; + + _Tp* __restrict__ __tmp_M_data = + std::__valarray_get_storage<_Tp>(_M_size); + + if (__n == 0) + std::__valarray_copy_construct(_M_data, + _M_data + _M_size, __tmp_M_data); + else if (__n > 0) // shift left + { + if (size_t(__n) > _M_size) + __n = _M_size; + + std::__valarray_copy_construct(_M_data + __n, + _M_data + _M_size, __tmp_M_data); + std::__valarray_default_construct(__tmp_M_data + _M_size - __n, + __tmp_M_data + _M_size); + } + else // shift right + { + if (size_t(-__n) > _M_size) + __n = -_M_size; + + std::__valarray_copy_construct(_M_data, _M_data + _M_size + __n, + __tmp_M_data - __n); + std::__valarray_default_construct(__tmp_M_data, + __tmp_M_data - __n); + } + + __ret._M_size = _M_size; + __ret._M_data = __tmp_M_data; + return __ret; + } + + template + inline valarray<_Tp> + valarray<_Tp>::cshift(int __n) const + { + valarray<_Tp> __ret; + + if (_M_size == 0) + return __ret; + + _Tp* __restrict__ __tmp_M_data = + std::__valarray_get_storage<_Tp>(_M_size); + + if (__n == 0) + std::__valarray_copy_construct(_M_data, + _M_data + _M_size, __tmp_M_data); + else if (__n > 0) // cshift left + { + if (size_t(__n) > _M_size) + __n = __n % _M_size; + + std::__valarray_copy_construct(_M_data, _M_data + __n, + __tmp_M_data + _M_size - __n); + std::__valarray_copy_construct(_M_data + __n, _M_data + _M_size, + __tmp_M_data); + } + else // cshift right + { + if (size_t(-__n) > _M_size) + __n = -(size_t(-__n) % _M_size); + + std::__valarray_copy_construct(_M_data + _M_size + __n, + _M_data + _M_size, __tmp_M_data); + std::__valarray_copy_construct(_M_data, _M_data + _M_size + __n, + __tmp_M_data - __n); + } + + __ret._M_size = _M_size; + __ret._M_data = __tmp_M_data; + return __ret; + } + + template + inline void + valarray<_Tp>::resize(size_t __n, _Tp __c) + { + // This complication is so to make valarray > work + // even though it is not required by the standard. Nobody should + // be saying valarray > anyway. See the specs. + std::__valarray_destroy_elements(_M_data, _M_data + _M_size); + if (_M_size != __n) + { + std::__valarray_release_memory(_M_data); + _M_size = __n; + _M_data = __valarray_get_storage<_Tp>(__n); + } + std::__valarray_fill_construct(_M_data, _M_data + __n, __c); + } + + template + inline _Tp + valarray<_Tp>::min() const + { + _GLIBCXX_DEBUG_ASSERT(_M_size > 0); + return *std::min_element(_M_data, _M_data+_M_size); + } + + template + inline _Tp + valarray<_Tp>::max() const + { + _GLIBCXX_DEBUG_ASSERT(_M_size > 0); + return *std::max_element(_M_data, _M_data+_M_size); + } + + template + inline _Expr<_ValFunClos<_ValArray, _Tp>, _Tp> + valarray<_Tp>::apply(_Tp func(_Tp)) const + { + typedef _ValFunClos<_ValArray, _Tp> _Closure; + return _Expr<_Closure, _Tp>(_Closure(*this, func)); + } + + template + inline _Expr<_RefFunClos<_ValArray, _Tp>, _Tp> + valarray<_Tp>::apply(_Tp func(const _Tp &)) const + { + typedef _RefFunClos<_ValArray, _Tp> _Closure; + return _Expr<_Closure, _Tp>(_Closure(*this, func)); + } + +#define _DEFINE_VALARRAY_UNARY_OPERATOR(_Op, _Name) \ + template \ + inline typename valarray<_Tp>::template _UnaryOp<_Name>::_Rt \ + valarray<_Tp>::operator _Op() const \ + { \ + typedef _UnClos<_Name, _ValArray, _Tp> _Closure; \ + typedef typename __fun<_Name, _Tp>::result_type _Rt; \ + return _Expr<_Closure, _Rt>(_Closure(*this)); \ + } + + _DEFINE_VALARRAY_UNARY_OPERATOR(+, __unary_plus) + _DEFINE_VALARRAY_UNARY_OPERATOR(-, __negate) + _DEFINE_VALARRAY_UNARY_OPERATOR(~, __bitwise_not) + _DEFINE_VALARRAY_UNARY_OPERATOR (!, __logical_not) + +#undef _DEFINE_VALARRAY_UNARY_OPERATOR + +#define _DEFINE_VALARRAY_AUGMENTED_ASSIGNMENT(_Op, _Name) \ + template \ + inline valarray<_Tp>& \ + valarray<_Tp>::operator _Op##=(const _Tp &__t) \ + { \ + _Array_augmented_##_Name(_Array<_Tp>(_M_data), _M_size, __t); \ + return *this; \ + } \ + \ + template \ + inline valarray<_Tp>& \ + valarray<_Tp>::operator _Op##=(const valarray<_Tp> &__v) \ + { \ + _GLIBCXX_DEBUG_ASSERT(_M_size == __v._M_size); \ + _Array_augmented_##_Name(_Array<_Tp>(_M_data), _M_size, \ + _Array<_Tp>(__v._M_data)); \ + return *this; \ + } + +_DEFINE_VALARRAY_AUGMENTED_ASSIGNMENT(+, __plus) +_DEFINE_VALARRAY_AUGMENTED_ASSIGNMENT(-, __minus) +_DEFINE_VALARRAY_AUGMENTED_ASSIGNMENT(*, __multiplies) +_DEFINE_VALARRAY_AUGMENTED_ASSIGNMENT(/, __divides) +_DEFINE_VALARRAY_AUGMENTED_ASSIGNMENT(%, __modulus) +_DEFINE_VALARRAY_AUGMENTED_ASSIGNMENT(^, __bitwise_xor) +_DEFINE_VALARRAY_AUGMENTED_ASSIGNMENT(&, __bitwise_and) +_DEFINE_VALARRAY_AUGMENTED_ASSIGNMENT(|, __bitwise_or) +_DEFINE_VALARRAY_AUGMENTED_ASSIGNMENT(<<, __shift_left) +_DEFINE_VALARRAY_AUGMENTED_ASSIGNMENT(>>, __shift_right) + +#undef _DEFINE_VALARRAY_AUGMENTED_ASSIGNMENT + +#define _DEFINE_VALARRAY_EXPR_AUGMENTED_ASSIGNMENT(_Op, _Name) \ + template template \ + inline valarray<_Tp>& \ + valarray<_Tp>::operator _Op##=(const _Expr<_Dom, _Tp>& __e) \ + { \ + _Array_augmented_##_Name(_Array<_Tp>(_M_data), __e, _M_size); \ + return *this; \ + } + +_DEFINE_VALARRAY_EXPR_AUGMENTED_ASSIGNMENT(+, __plus) +_DEFINE_VALARRAY_EXPR_AUGMENTED_ASSIGNMENT(-, __minus) +_DEFINE_VALARRAY_EXPR_AUGMENTED_ASSIGNMENT(*, __multiplies) +_DEFINE_VALARRAY_EXPR_AUGMENTED_ASSIGNMENT(/, __divides) +_DEFINE_VALARRAY_EXPR_AUGMENTED_ASSIGNMENT(%, __modulus) +_DEFINE_VALARRAY_EXPR_AUGMENTED_ASSIGNMENT(^, __bitwise_xor) +_DEFINE_VALARRAY_EXPR_AUGMENTED_ASSIGNMENT(&, __bitwise_and) +_DEFINE_VALARRAY_EXPR_AUGMENTED_ASSIGNMENT(|, __bitwise_or) +_DEFINE_VALARRAY_EXPR_AUGMENTED_ASSIGNMENT(<<, __shift_left) +_DEFINE_VALARRAY_EXPR_AUGMENTED_ASSIGNMENT(>>, __shift_right) + +#undef _DEFINE_VALARRAY_EXPR_AUGMENTED_ASSIGNMENT + + +#define _DEFINE_BINARY_OPERATOR(_Op, _Name) \ + template \ + inline _Expr<_BinClos<_Name, _ValArray, _ValArray, _Tp, _Tp>, \ + typename __fun<_Name, _Tp>::result_type> \ + operator _Op(const valarray<_Tp>& __v, const valarray<_Tp>& __w) \ + { \ + _GLIBCXX_DEBUG_ASSERT(__v.size() == __w.size()); \ + typedef _BinClos<_Name, _ValArray, _ValArray, _Tp, _Tp> _Closure; \ + typedef typename __fun<_Name, _Tp>::result_type _Rt; \ + return _Expr<_Closure, _Rt>(_Closure(__v, __w)); \ + } \ + \ + template \ + inline _Expr<_BinClos<_Name, _ValArray,_Constant, _Tp, _Tp>, \ + typename __fun<_Name, _Tp>::result_type> \ + operator _Op(const valarray<_Tp>& __v, const _Tp& __t) \ + { \ + typedef _BinClos<_Name, _ValArray, _Constant, _Tp, _Tp> _Closure; \ + typedef typename __fun<_Name, _Tp>::result_type _Rt; \ + return _Expr<_Closure, _Rt>(_Closure(__v, __t)); \ + } \ + \ + template \ + inline _Expr<_BinClos<_Name, _Constant, _ValArray, _Tp, _Tp>, \ + typename __fun<_Name, _Tp>::result_type> \ + operator _Op(const _Tp& __t, const valarray<_Tp>& __v) \ + { \ + typedef _BinClos<_Name, _Constant, _ValArray, _Tp, _Tp> _Closure; \ + typedef typename __fun<_Name, _Tp>::result_type _Rt; \ + return _Expr<_Closure, _Rt>(_Closure(__t, __v)); \ + } + +_DEFINE_BINARY_OPERATOR(+, __plus) +_DEFINE_BINARY_OPERATOR(-, __minus) +_DEFINE_BINARY_OPERATOR(*, __multiplies) +_DEFINE_BINARY_OPERATOR(/, __divides) +_DEFINE_BINARY_OPERATOR(%, __modulus) +_DEFINE_BINARY_OPERATOR(^, __bitwise_xor) +_DEFINE_BINARY_OPERATOR(&, __bitwise_and) +_DEFINE_BINARY_OPERATOR(|, __bitwise_or) +_DEFINE_BINARY_OPERATOR(<<, __shift_left) +_DEFINE_BINARY_OPERATOR(>>, __shift_right) +_DEFINE_BINARY_OPERATOR(&&, __logical_and) +_DEFINE_BINARY_OPERATOR(||, __logical_or) +_DEFINE_BINARY_OPERATOR(==, __equal_to) +_DEFINE_BINARY_OPERATOR(!=, __not_equal_to) +_DEFINE_BINARY_OPERATOR(<, __less) +_DEFINE_BINARY_OPERATOR(>, __greater) +_DEFINE_BINARY_OPERATOR(<=, __less_equal) +_DEFINE_BINARY_OPERATOR(>=, __greater_equal) + +#undef _DEFINE_BINARY_OPERATOR + +} // namespace std + +#endif /* _GLIBCXX_VALARRAY */ diff --git a/cpp_src/valarray_after.h b/cpp_src/valarray_after.h new file mode 100644 index 0000000..7af3329 --- /dev/null +++ b/cpp_src/valarray_after.h @@ -0,0 +1,554 @@ +// The template and inlines for the -*- C++ -*- internal _Meta class. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file valarray_after.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// Written by Gabriel Dos Reis + +#ifndef _VALARRAY_AFTER_H +#define _VALARRAY_AFTER_H 1 + +#pragma GCC system_header + +namespace std { + + // + // gslice_array closure. + // + template + class _GBase + { + public: + typedef typename _Dom::value_type value_type; + + _GBase (const _Dom& __e, const valarray& __i) + : _M_expr (__e), _M_index(__i) {} + + value_type + operator[] (size_t __i) const + { return _M_expr[_M_index[__i]]; } + + size_t + size () const + { return _M_index.size(); } + + private: + const _Dom& _M_expr; + const valarray& _M_index; + }; + + template + class _GBase<_Array<_Tp> > + { + public: + typedef _Tp value_type; + + _GBase (_Array<_Tp> __a, const valarray& __i) + : _M_array (__a), _M_index(__i) {} + + value_type + operator[] (size_t __i) const + { return _M_array._M_data[_M_index[__i]]; } + + size_t + size () const + { return _M_index.size(); } + + private: + const _Array<_Tp> _M_array; + const valarray& _M_index; + }; + + template + struct _GClos<_Expr, _Dom> + : _GBase<_Dom> + { + typedef _GBase<_Dom> _Base; + typedef typename _Base::value_type value_type; + + _GClos (const _Dom& __e, const valarray& __i) + : _Base (__e, __i) {} + }; + + template + struct _GClos<_ValArray, _Tp> + : _GBase<_Array<_Tp> > + { + typedef _GBase<_Array<_Tp> > _Base; + typedef typename _Base::value_type value_type; + + _GClos (_Array<_Tp> __a, const valarray& __i) + : _Base (__a, __i) {} + }; + + // + // indirect_array closure + // + template + class _IBase + { + public: + typedef typename _Dom::value_type value_type; + + _IBase (const _Dom& __e, const valarray& __i) + : _M_expr (__e), _M_index (__i) {} + + value_type + operator[] (size_t __i) const + { return _M_expr[_M_index[__i]]; } + + size_t + size() const + { return _M_index.size(); } + + private: + const _Dom& _M_expr; + const valarray& _M_index; + }; + + template + struct _IClos<_Expr, _Dom> + : _IBase<_Dom> + { + typedef _IBase<_Dom> _Base; + typedef typename _Base::value_type value_type; + + _IClos (const _Dom& __e, const valarray& __i) + : _Base (__e, __i) {} + }; + + template + struct _IClos<_ValArray, _Tp> + : _IBase > + { + typedef _IBase > _Base; + typedef _Tp value_type; + + _IClos (const valarray<_Tp>& __a, const valarray& __i) + : _Base (__a, __i) {} + }; + + // + // class _Expr + // + template + class _Expr + { + public: + typedef _Tp value_type; + + _Expr(const _Clos&); + + const _Clos& operator()() const; + + value_type operator[](size_t) const; + valarray operator[](slice) const; + valarray operator[](const gslice&) const; + valarray operator[](const valarray&) const; + valarray operator[](const valarray&) const; + + _Expr<_UnClos<__unary_plus, std::_Expr, _Clos>, value_type> + operator+() const; + + _Expr<_UnClos<__negate, std::_Expr, _Clos>, value_type> + operator-() const; + + _Expr<_UnClos<__bitwise_not, std::_Expr, _Clos>, value_type> + operator~() const; + + _Expr<_UnClos<__logical_not, std::_Expr, _Clos>, bool> + operator!() const; + + size_t size() const; + value_type sum() const; + + valarray shift(int) const; + valarray cshift(int) const; + + value_type min() const; + value_type max() const; + + valarray apply(value_type (*)(const value_type&)) const; + valarray apply(value_type (*)(value_type)) const; + + private: + const _Clos _M_closure; + }; + + template + inline + _Expr<_Clos, _Tp>::_Expr(const _Clos& __c) : _M_closure(__c) {} + + template + inline const _Clos& + _Expr<_Clos, _Tp>::operator()() const + { return _M_closure; } + + template + inline _Tp + _Expr<_Clos, _Tp>::operator[](size_t __i) const + { return _M_closure[__i]; } + + template + inline valarray<_Tp> + _Expr<_Clos, _Tp>::operator[](slice __s) const + { + valarray<_Tp> __v = valarray<_Tp>(*this)[__s]; + return __v; + } + + template + inline valarray<_Tp> + _Expr<_Clos, _Tp>::operator[](const gslice& __gs) const + { + valarray<_Tp> __v = valarray<_Tp>(*this)[__gs]; + return __v; + } + + template + inline valarray<_Tp> + _Expr<_Clos, _Tp>::operator[](const valarray& __m) const + { + valarray<_Tp> __v = valarray<_Tp>(*this)[__m]; + return __v; + } + + template + inline valarray<_Tp> + _Expr<_Clos, _Tp>::operator[](const valarray& __i) const + { + valarray<_Tp> __v = valarray<_Tp>(*this)[__i]; + return __v; + } + + template + inline size_t + _Expr<_Clos, _Tp>::size() const + { return _M_closure.size(); } + + template + inline valarray<_Tp> + _Expr<_Clos, _Tp>::shift(int __n) const + { + valarray<_Tp> __v = valarray<_Tp>(*this).shift(__n); + return __v; + } + + template + inline valarray<_Tp> + _Expr<_Clos, _Tp>::cshift(int __n) const + { + valarray<_Tp> __v = valarray<_Tp>(*this).cshift(__n); + return __v; + } + + template + inline valarray<_Tp> + _Expr<_Clos, _Tp>::apply(_Tp __f(const _Tp&)) const + { + valarray<_Tp> __v = valarray<_Tp>(*this).apply(__f); + return __v; + } + + template + inline valarray<_Tp> + _Expr<_Clos, _Tp>::apply(_Tp __f(_Tp)) const + { + valarray<_Tp> __v = valarray<_Tp>(*this).apply(__f); + return __v; + } + + // XXX: replace this with a more robust summation algorithm. + template + inline _Tp + _Expr<_Clos, _Tp>::sum() const + { + size_t __n = _M_closure.size(); + if (__n == 0) + return _Tp(); + else + { + _Tp __s = _M_closure[--__n]; + while (__n != 0) + __s += _M_closure[--__n]; + return __s; + } + } + + template + inline _Tp + _Expr<_Clos, _Tp>::min() const + { return __valarray_min(_M_closure); } + + template + inline _Tp + _Expr<_Clos, _Tp>::max() const + { return __valarray_max(_M_closure); } + + template + inline _Expr<_UnClos<__logical_not, _Expr, _Dom>, bool> + _Expr<_Dom, _Tp>::operator!() const + { + typedef _UnClos<__logical_not, std::_Expr, _Dom> _Closure; + return _Expr<_Closure, _Tp>(_Closure(this->_M_closure)); + } + +#define _DEFINE_EXPR_UNARY_OPERATOR(_Op, _Name) \ + template \ + inline _Expr<_UnClos<_Name, std::_Expr, _Dom>, _Tp> \ + _Expr<_Dom, _Tp>::operator _Op() const \ + { \ + typedef _UnClos<_Name, std::_Expr, _Dom> _Closure; \ + return _Expr<_Closure, _Tp>(_Closure(this->_M_closure)); \ + } + + _DEFINE_EXPR_UNARY_OPERATOR(+, __unary_plus) + _DEFINE_EXPR_UNARY_OPERATOR(-, __negate) + _DEFINE_EXPR_UNARY_OPERATOR(~, __bitwise_not) + +#undef _DEFINE_EXPR_UNARY_OPERATOR + +#define _DEFINE_EXPR_BINARY_OPERATOR(_Op, _Name) \ + template \ + inline _Expr<_BinClos<_Name, _Expr, _Expr, _Dom1, _Dom2>, \ + typename __fun<_Name, typename _Dom1::value_type>::result_type> \ + operator _Op(const _Expr<_Dom1, typename _Dom1::value_type>& __v, \ + const _Expr<_Dom2, typename _Dom2::value_type>& __w) \ + { \ + typedef typename _Dom1::value_type _Arg; \ + typedef typename __fun<_Name, _Arg>::result_type _Value; \ + typedef _BinClos<_Name, _Expr, _Expr, _Dom1, _Dom2> _Closure; \ + return _Expr<_Closure, _Value>(_Closure(__v(), __w())); \ + } \ + \ + template \ + inline _Expr<_BinClos<_Name, _Expr, _Constant, _Dom, \ + typename _Dom::value_type>, \ + typename __fun<_Name, typename _Dom::value_type>::result_type> \ + operator _Op(const _Expr<_Dom, typename _Dom::value_type>& __v, \ + const typename _Dom::value_type& __t) \ + { \ + typedef typename _Dom::value_type _Arg; \ + typedef typename __fun<_Name, _Arg>::result_type _Value; \ + typedef _BinClos<_Name, _Expr, _Constant, _Dom, _Arg> _Closure; \ + return _Expr<_Closure, _Value>(_Closure(__v(), __t)); \ + } \ + \ + template \ + inline _Expr<_BinClos<_Name, _Constant, _Expr, \ + typename _Dom::value_type, _Dom>, \ + typename __fun<_Name, typename _Dom::value_type>::result_type> \ + operator _Op(const typename _Dom::value_type& __t, \ + const _Expr<_Dom, typename _Dom::value_type>& __v) \ + { \ + typedef typename _Dom::value_type _Arg; \ + typedef typename __fun<_Name, _Arg>::result_type _Value; \ + typedef _BinClos<_Name, _Constant, _Expr, _Arg, _Dom> _Closure; \ + return _Expr<_Closure, _Value>(_Closure(__t, __v())); \ + } \ + \ + template \ + inline _Expr<_BinClos<_Name, _Expr, _ValArray, \ + _Dom, typename _Dom::value_type>, \ + typename __fun<_Name, typename _Dom::value_type>::result_type> \ + operator _Op(const _Expr<_Dom,typename _Dom::value_type>& __e, \ + const valarray& __v) \ + { \ + typedef typename _Dom::value_type _Arg; \ + typedef typename __fun<_Name, _Arg>::result_type _Value; \ + typedef _BinClos<_Name, _Expr, _ValArray, _Dom, _Arg> _Closure; \ + return _Expr<_Closure, _Value>(_Closure(__e(), __v)); \ + } \ + \ + template \ + inline _Expr<_BinClos<_Name, _ValArray, _Expr, \ + typename _Dom::value_type, _Dom>, \ + typename __fun<_Name, typename _Dom::value_type>::result_type> \ + operator _Op(const valarray& __v, \ + const _Expr<_Dom, typename _Dom::value_type>& __e) \ + { \ + typedef typename _Dom::value_type _Tp; \ + typedef typename __fun<_Name, _Tp>::result_type _Value; \ + typedef _BinClos<_Name, _ValArray, _Expr, _Tp, _Dom> _Closure; \ + return _Expr<_Closure, _Value>(_Closure(__v, __e ())); \ + } + + _DEFINE_EXPR_BINARY_OPERATOR(+, __plus) + _DEFINE_EXPR_BINARY_OPERATOR(-, __minus) + _DEFINE_EXPR_BINARY_OPERATOR(*, __multiplies) + _DEFINE_EXPR_BINARY_OPERATOR(/, __divides) + _DEFINE_EXPR_BINARY_OPERATOR(%, __modulus) + _DEFINE_EXPR_BINARY_OPERATOR(^, __bitwise_xor) + _DEFINE_EXPR_BINARY_OPERATOR(&, __bitwise_and) + _DEFINE_EXPR_BINARY_OPERATOR(|, __bitwise_or) + _DEFINE_EXPR_BINARY_OPERATOR(<<, __shift_left) + _DEFINE_EXPR_BINARY_OPERATOR(>>, __shift_right) + _DEFINE_EXPR_BINARY_OPERATOR(&&, __logical_and) + _DEFINE_EXPR_BINARY_OPERATOR(||, __logical_or) + _DEFINE_EXPR_BINARY_OPERATOR(==, __equal_to) + _DEFINE_EXPR_BINARY_OPERATOR(!=, __not_equal_to) + _DEFINE_EXPR_BINARY_OPERATOR(<, __less) + _DEFINE_EXPR_BINARY_OPERATOR(>, __greater) + _DEFINE_EXPR_BINARY_OPERATOR(<=, __less_equal) + _DEFINE_EXPR_BINARY_OPERATOR(>=, __greater_equal) + +#undef _DEFINE_EXPR_BINARY_OPERATOR + +#define _DEFINE_EXPR_UNARY_FUNCTION(_Name) \ + template \ + inline _Expr<_UnClos<__##_Name, _Expr, _Dom>, \ + typename _Dom::value_type> \ + _Name(const _Expr<_Dom, typename _Dom::value_type>& __e) \ + { \ + typedef typename _Dom::value_type _Tp; \ + typedef _UnClos<__##_Name, _Expr, _Dom> _Closure; \ + return _Expr<_Closure, _Tp>(_Closure(__e())); \ + } \ + \ + template \ + inline _Expr<_UnClos<__##_Name, _ValArray, _Tp>, _Tp> \ + _Name(const valarray<_Tp>& __v) \ + { \ + typedef _UnClos<__##_Name, _ValArray, _Tp> _Closure; \ + return _Expr<_Closure, _Tp>(_Closure(__v)); \ + } + + _DEFINE_EXPR_UNARY_FUNCTION(abs) + _DEFINE_EXPR_UNARY_FUNCTION(cos) + _DEFINE_EXPR_UNARY_FUNCTION(acos) + _DEFINE_EXPR_UNARY_FUNCTION(cosh) + _DEFINE_EXPR_UNARY_FUNCTION(sin) + _DEFINE_EXPR_UNARY_FUNCTION(asin) + _DEFINE_EXPR_UNARY_FUNCTION(sinh) + _DEFINE_EXPR_UNARY_FUNCTION(tan) + _DEFINE_EXPR_UNARY_FUNCTION(tanh) + _DEFINE_EXPR_UNARY_FUNCTION(atan) + _DEFINE_EXPR_UNARY_FUNCTION(exp) + _DEFINE_EXPR_UNARY_FUNCTION(log) + _DEFINE_EXPR_UNARY_FUNCTION(log10) + _DEFINE_EXPR_UNARY_FUNCTION(sqrt) + +#undef _DEFINE_EXPR_UNARY_FUNCTION + +#define _DEFINE_EXPR_BINARY_FUNCTION(_Fun) \ + template \ + inline _Expr<_BinClos<__##_Fun, _Expr, _Expr, _Dom1, _Dom2>, \ + typename _Dom1::value_type> \ + _Fun(const _Expr<_Dom1, typename _Dom1::value_type>& __e1, \ + const _Expr<_Dom2, typename _Dom2::value_type>& __e2) \ + { \ + typedef typename _Dom1::value_type _Tp; \ + typedef _BinClos<__##_Fun, _Expr, _Expr, _Dom1, _Dom2> _Closure; \ + return _Expr<_Closure, _Tp>(_Closure(__e1(), __e2())); \ + } \ + \ + template \ + inline _Expr<_BinClos<__##_Fun, _Expr, _ValArray, _Dom, \ + typename _Dom::value_type>, \ + typename _Dom::value_type> \ + _Fun(const _Expr<_Dom, typename _Dom::value_type>& __e, \ + const valarray& __v) \ + { \ + typedef typename _Dom::value_type _Tp; \ + typedef _BinClos<__##_Fun, _Expr, _ValArray, _Dom, _Tp> _Closure; \ + return _Expr<_Closure, _Tp>(_Closure(__e(), __v)); \ + } \ + \ + template \ + inline _Expr<_BinClos<__##_Fun, _ValArray, _Expr, \ + typename _Dom::value_type, _Dom>, \ + typename _Dom::value_type> \ + _Fun(const valarray& __v, \ + const _Expr<_Dom, typename _Dom::value_type>& __e) \ + { \ + typedef typename _Dom::value_type _Tp; \ + typedef _BinClos<__##_Fun, _ValArray, _Expr, _Tp, _Dom> _Closure; \ + return _Expr<_Closure, _Tp>(_Closure(__v, __e())); \ + } \ + \ + template \ + inline _Expr<_BinClos<__##_Fun, _Expr, _Constant, _Dom, \ + typename _Dom::value_type>, \ + typename _Dom::value_type> \ + _Fun(const _Expr<_Dom, typename _Dom::value_type>& __e, \ + const typename _Dom::value_type& __t) \ + { \ + typedef typename _Dom::value_type _Tp; \ + typedef _BinClos<__##_Fun, _Expr, _Constant, _Dom, _Tp> _Closure;\ + return _Expr<_Closure, _Tp>(_Closure(__e(), __t)); \ + } \ + \ + template \ + inline _Expr<_BinClos<__##_Fun, _Constant, _Expr, \ + typename _Dom::value_type, _Dom>, \ + typename _Dom::value_type> \ + _Fun(const typename _Dom::value_type& __t, \ + const _Expr<_Dom, typename _Dom::value_type>& __e) \ + { \ + typedef typename _Dom::value_type _Tp; \ + typedef _BinClos<__##_Fun, _Constant, _Expr, _Tp, _Dom> _Closure; \ + return _Expr<_Closure, _Tp>(_Closure(__t, __e())); \ + } \ + \ + template \ + inline _Expr<_BinClos<__##_Fun, _ValArray, _ValArray, _Tp, _Tp>, _Tp> \ + _Fun(const valarray<_Tp>& __v, const valarray<_Tp>& __w) \ + { \ + typedef _BinClos<__##_Fun, _ValArray, _ValArray, _Tp, _Tp> _Closure; \ + return _Expr<_Closure, _Tp>(_Closure(__v, __w)); \ + } \ + \ + template \ + inline _Expr<_BinClos<__##_Fun, _ValArray, _Constant, _Tp, _Tp>, _Tp> \ + _Fun(const valarray<_Tp>& __v, const _Tp& __t) \ + { \ + typedef _BinClos<__##_Fun, _ValArray, _Constant, _Tp, _Tp> _Closure; \ + return _Expr<_Closure, _Tp>(_Closure(__v, __t)); \ + } \ + \ + template \ + inline _Expr<_BinClos<__##_Fun, _Constant, _ValArray, _Tp, _Tp>, _Tp> \ + _Fun(const _Tp& __t, const valarray<_Tp>& __v) \ + { \ + typedef _BinClos<__##_Fun, _Constant, _ValArray, _Tp, _Tp> _Closure; \ + return _Expr<_Closure, _Tp>(_Closure(__t, __v)); \ + } + +_DEFINE_EXPR_BINARY_FUNCTION(atan2) +_DEFINE_EXPR_BINARY_FUNCTION(pow) + +#undef _DEFINE_EXPR_BINARY_FUNCTION + +} // namespace std + +#endif /* _CPP_VALARRAY_AFTER_H */ diff --git a/cpp_src/valarray_array.h b/cpp_src/valarray_array.h new file mode 100644 index 0000000..afbaf56 --- /dev/null +++ b/cpp_src/valarray_array.h @@ -0,0 +1,704 @@ +// The template and inlines for the -*- C++ -*- internal _Array helper class. + +// Copyright (C) 1997, 1998, 1999, 2000, 2003, 2004, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file valarray_array.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// Written by Gabriel Dos Reis + +#ifndef _VALARRAY_ARRAY_H +#define _VALARRAY_ARRAY_H 1 + +#pragma GCC system_header + +#include +#include +#include +#include +#include + +namespace std { + + // + // Helper functions on raw pointers + // + + // We get memory by the old fashion way + inline void* + __valarray_get_memory(size_t __n) + { return operator new(__n); } + + template + inline _Tp*__restrict__ + __valarray_get_storage(size_t __n) + { + return static_cast<_Tp*__restrict__> + (std::__valarray_get_memory(__n * sizeof(_Tp))); + } + + // Return memory to the system + inline void + __valarray_release_memory(void* __p) + { operator delete(__p); } + + // Turn a raw-memory into an array of _Tp filled with _Tp() + // This is required in 'valarray v(n);' + template + struct _Array_default_ctor + { + // Please note that this isn't exception safe. But + // valarrays aren't required to be exception safe. + inline static void + _S_do_it(_Tp* __restrict__ __b, _Tp* __restrict__ __e) + { + while (__b != __e) + new(__b++) _Tp(); + } + }; + + template + struct _Array_default_ctor<_Tp, true> + { + // For fundamental types, it suffices to say 'memset()' + inline static void + _S_do_it(_Tp* __restrict__ __b, _Tp* __restrict__ __e) + { std::memset(__b, 0, (__e - __b) * sizeof(_Tp)); } + }; + + template + inline void + __valarray_default_construct(_Tp* __restrict__ __b, _Tp* __restrict__ __e) + { + _Array_default_ctor<_Tp, __is_pod<_Tp>::__value>::_S_do_it(__b, __e); + } + + // Turn a raw-memory into an array of _Tp filled with __t + // This is the required in valarray v(n, t). Also + // used in valarray<>::resize(). + template + struct _Array_init_ctor + { + // Please note that this isn't exception safe. But + // valarrays aren't required to be exception safe. + inline static void + _S_do_it(_Tp* __restrict__ __b, _Tp* __restrict__ __e, const _Tp __t) + { + while (__b != __e) + new(__b++) _Tp(__t); + } + }; + + template + struct _Array_init_ctor<_Tp, true> + { + inline static void + _S_do_it(_Tp* __restrict__ __b, _Tp* __restrict__ __e, const _Tp __t) + { + while (__b != __e) + *__b++ = __t; + } + }; + + template + inline void + __valarray_fill_construct(_Tp* __restrict__ __b, _Tp* __restrict__ __e, + const _Tp __t) + { + _Array_init_ctor<_Tp, __is_pod<_Tp>::__value>::_S_do_it(__b, __e, __t); + } + + // + // copy-construct raw array [__o, *) from plain array [__b, __e) + // We can't just say 'memcpy()' + // + template + struct _Array_copy_ctor + { + // Please note that this isn't exception safe. But + // valarrays aren't required to be exception safe. + inline static void + _S_do_it(const _Tp* __restrict__ __b, const _Tp* __restrict__ __e, + _Tp* __restrict__ __o) + { + while (__b != __e) + new(__o++) _Tp(*__b++); + } + }; + + template + struct _Array_copy_ctor<_Tp, true> + { + inline static void + _S_do_it(const _Tp* __restrict__ __b, const _Tp* __restrict__ __e, + _Tp* __restrict__ __o) + { std::memcpy(__o, __b, (__e - __b)*sizeof(_Tp)); } + }; + + template + inline void + __valarray_copy_construct(const _Tp* __restrict__ __b, + const _Tp* __restrict__ __e, + _Tp* __restrict__ __o) + { + _Array_copy_ctor<_Tp, __is_pod<_Tp>::__value>::_S_do_it(__b, __e, __o); + } + + // copy-construct raw array [__o, *) from strided array __a[<__n : __s>] + template + inline void + __valarray_copy_construct (const _Tp* __restrict__ __a, size_t __n, + size_t __s, _Tp* __restrict__ __o) + { + if (__is_pod<_Tp>::__value) + while (__n--) + { + *__o++ = *__a; + __a += __s; + } + else + while (__n--) + { + new(__o++) _Tp(*__a); + __a += __s; + } + } + + // copy-construct raw array [__o, *) from indexed array __a[__i[<__n>]] + template + inline void + __valarray_copy_construct (const _Tp* __restrict__ __a, + const size_t* __restrict__ __i, + _Tp* __restrict__ __o, size_t __n) + { + if (__is_pod<_Tp>::__value) + while (__n--) + *__o++ = __a[*__i++]; + else + while (__n--) + new (__o++) _Tp(__a[*__i++]); + } + + // Do the necessary cleanup when we're done with arrays. + template + inline void + __valarray_destroy_elements(_Tp* __restrict__ __b, _Tp* __restrict__ __e) + { + if (!__is_pod<_Tp>::__value) + while (__b != __e) + { + __b->~_Tp(); + ++__b; + } + } + + // Fill a plain array __a[<__n>] with __t + template + inline void + __valarray_fill(_Tp* __restrict__ __a, size_t __n, const _Tp& __t) + { + while (__n--) + *__a++ = __t; + } + + // fill strided array __a[<__n-1 : __s>] with __t + template + inline void + __valarray_fill(_Tp* __restrict__ __a, size_t __n, + size_t __s, const _Tp& __t) + { + for (size_t __i = 0; __i < __n; ++__i, __a += __s) + *__a = __t; + } + + // fill indir ect array __a[__i[<__n>]] with __i + template + inline void + __valarray_fill(_Tp* __restrict__ __a, const size_t* __restrict__ __i, + size_t __n, const _Tp& __t) + { + for (size_t __j = 0; __j < __n; ++__j, ++__i) + __a[*__i] = __t; + } + + // copy plain array __a[<__n>] in __b[<__n>] + // For non-fundamental types, it is wrong to say 'memcpy()' + template + struct _Array_copier + { + inline static void + _S_do_it(const _Tp* __restrict__ __a, size_t __n, _Tp* __restrict__ __b) + { + while(__n--) + *__b++ = *__a++; + } + }; + + template + struct _Array_copier<_Tp, true> + { + inline static void + _S_do_it(const _Tp* __restrict__ __a, size_t __n, _Tp* __restrict__ __b) + { std::memcpy (__b, __a, __n * sizeof (_Tp)); } + }; + + // Copy a plain array __a[<__n>] into a play array __b[<>] + template + inline void + __valarray_copy(const _Tp* __restrict__ __a, size_t __n, + _Tp* __restrict__ __b) + { + _Array_copier<_Tp, __is_pod<_Tp>::__value>::_S_do_it(__a, __n, __b); + } + + // Copy strided array __a[<__n : __s>] in plain __b[<__n>] + template + inline void + __valarray_copy(const _Tp* __restrict__ __a, size_t __n, size_t __s, + _Tp* __restrict__ __b) + { + for (size_t __i = 0; __i < __n; ++__i, ++__b, __a += __s) + *__b = *__a; + } + + // Copy a plain array __a[<__n>] into a strided array __b[<__n : __s>] + template + inline void + __valarray_copy(const _Tp* __restrict__ __a, _Tp* __restrict__ __b, + size_t __n, size_t __s) + { + for (size_t __i = 0; __i < __n; ++__i, ++__a, __b += __s) + *__b = *__a; + } + + // Copy strided array __src[<__n : __s1>] into another + // strided array __dst[< : __s2>]. Their sizes must match. + template + inline void + __valarray_copy(const _Tp* __restrict__ __src, size_t __n, size_t __s1, + _Tp* __restrict__ __dst, size_t __s2) + { + for (size_t __i = 0; __i < __n; ++__i) + __dst[__i * __s2] = __src[__i * __s1]; + } + + // Copy an indexed array __a[__i[<__n>]] in plain array __b[<__n>] + template + inline void + __valarray_copy(const _Tp* __restrict__ __a, + const size_t* __restrict__ __i, + _Tp* __restrict__ __b, size_t __n) + { + for (size_t __j = 0; __j < __n; ++__j, ++__b, ++__i) + *__b = __a[*__i]; + } + + // Copy a plain array __a[<__n>] in an indexed array __b[__i[<__n>]] + template + inline void + __valarray_copy(const _Tp* __restrict__ __a, size_t __n, + _Tp* __restrict__ __b, const size_t* __restrict__ __i) + { + for (size_t __j = 0; __j < __n; ++__j, ++__a, ++__i) + __b[*__i] = *__a; + } + + // Copy the __n first elements of an indexed array __src[<__i>] into + // another indexed array __dst[<__j>]. + template + inline void + __valarray_copy(const _Tp* __restrict__ __src, size_t __n, + const size_t* __restrict__ __i, + _Tp* __restrict__ __dst, const size_t* __restrict__ __j) + { + for (size_t __k = 0; __k < __n; ++__k) + __dst[*__j++] = __src[*__i++]; + } + + // + // Compute the sum of elements in range [__f, __l) + // This is a naive algorithm. It suffers from cancelling. + // In the future try to specialize + // for _Tp = float, double, long double using a more accurate + // algorithm. + // + template + inline _Tp + __valarray_sum(const _Tp* __restrict__ __f, const _Tp* __restrict__ __l) + { + _Tp __r = _Tp(); + while (__f != __l) + __r += *__f++; + return __r; + } + + // Compute the product of all elements in range [__f, __l) + template + inline _Tp + __valarray_product(const _Tp* __restrict__ __f, + const _Tp* __restrict__ __l) + { + _Tp __r = _Tp(1); + while (__f != __l) + __r = __r * *__f++; + return __r; + } + + // Compute the min/max of an array-expression + template + inline typename _Ta::value_type + __valarray_min(const _Ta& __a) + { + size_t __s = __a.size(); + typedef typename _Ta::value_type _Value_type; + _Value_type __r = __s == 0 ? _Value_type() : __a[0]; + for (size_t __i = 1; __i < __s; ++__i) + { + _Value_type __t = __a[__i]; + if (__t < __r) + __r = __t; + } + return __r; + } + + template + inline typename _Ta::value_type + __valarray_max(const _Ta& __a) + { + size_t __s = __a.size(); + typedef typename _Ta::value_type _Value_type; + _Value_type __r = __s == 0 ? _Value_type() : __a[0]; + for (size_t __i = 1; __i < __s; ++__i) + { + _Value_type __t = __a[__i]; + if (__t > __r) + __r = __t; + } + return __r; + } + + // + // Helper class _Array, first layer of valarray abstraction. + // All operations on valarray should be forwarded to this class + // whenever possible. -- gdr + // + + template + struct _Array + { + explicit _Array(size_t); + explicit _Array(_Tp* const __restrict__); + explicit _Array(const valarray<_Tp>&); + _Array(const _Tp* __restrict__, size_t); + + _Tp* begin() const; + + _Tp* const __restrict__ _M_data; + }; + + + // Copy-construct plain array __b[<__n>] from indexed array __a[__i[<__n>]] + template + inline void + __valarray_copy_construct(_Array<_Tp> __a, _Array __i, + _Array<_Tp> __b, size_t __n) + { std::__valarray_copy_construct(__a._M_data, __i._M_data, + __b._M_data, __n); } + + // Copy-construct plain array __b[<__n>] from strided array __a[<__n : __s>] + template + inline void + __valarray_copy_construct(_Array<_Tp> __a, size_t __n, size_t __s, + _Array<_Tp> __b) + { std::__valarray_copy_construct(__a._M_data, __n, __s, __b._M_data); } + + template + inline void + __valarray_fill (_Array<_Tp> __a, size_t __n, const _Tp& __t) + { std::__valarray_fill(__a._M_data, __n, __t); } + + template + inline void + __valarray_fill(_Array<_Tp> __a, size_t __n, size_t __s, const _Tp& __t) + { std::__valarray_fill(__a._M_data, __n, __s, __t); } + + template + inline void + __valarray_fill(_Array<_Tp> __a, _Array __i, + size_t __n, const _Tp& __t) + { std::__valarray_fill(__a._M_data, __i._M_data, __n, __t); } + + // Copy a plain array __a[<__n>] into a play array __b[<>] + template + inline void + __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b) + { std::__valarray_copy(__a._M_data, __n, __b._M_data); } + + // Copy strided array __a[<__n : __s>] in plain __b[<__n>] + template + inline void + __valarray_copy(_Array<_Tp> __a, size_t __n, size_t __s, _Array<_Tp> __b) + { std::__valarray_copy(__a._M_data, __n, __s, __b._M_data); } + + // Copy a plain array __a[<__n>] into a strided array __b[<__n : __s>] + template + inline void + __valarray_copy(_Array<_Tp> __a, _Array<_Tp> __b, size_t __n, size_t __s) + { __valarray_copy(__a._M_data, __b._M_data, __n, __s); } + + // Copy strided array __src[<__n : __s1>] into another + // strided array __dst[< : __s2>]. Their sizes must match. + template + inline void + __valarray_copy(_Array<_Tp> __a, size_t __n, size_t __s1, + _Array<_Tp> __b, size_t __s2) + { std::__valarray_copy(__a._M_data, __n, __s1, __b._M_data, __s2); } + + // Copy an indexed array __a[__i[<__n>]] in plain array __b[<__n>] + template + inline void + __valarray_copy(_Array<_Tp> __a, _Array __i, + _Array<_Tp> __b, size_t __n) + { std::__valarray_copy(__a._M_data, __i._M_data, __b._M_data, __n); } + + // Copy a plain array __a[<__n>] in an indexed array __b[__i[<__n>]] + template + inline void + __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b, + _Array __i) + { std::__valarray_copy(__a._M_data, __n, __b._M_data, __i._M_data); } + + // Copy the __n first elements of an indexed array __src[<__i>] into + // another indexed array __dst[<__j>]. + template + inline void + __valarray_copy(_Array<_Tp> __src, size_t __n, _Array __i, + _Array<_Tp> __dst, _Array __j) + { + std::__valarray_copy(__src._M_data, __n, __i._M_data, + __dst._M_data, __j._M_data); + } + + template + inline + _Array<_Tp>::_Array(size_t __n) + : _M_data(__valarray_get_storage<_Tp>(__n)) + { std::__valarray_default_construct(_M_data, _M_data + __n); } + + template + inline + _Array<_Tp>::_Array(_Tp* const __restrict__ __p) + : _M_data (__p) {} + + template + inline + _Array<_Tp>::_Array(const valarray<_Tp>& __v) + : _M_data (__v._M_data) {} + + template + inline + _Array<_Tp>::_Array(const _Tp* __restrict__ __b, size_t __s) + : _M_data(__valarray_get_storage<_Tp>(__s)) + { std::__valarray_copy_construct(__b, __s, _M_data); } + + template + inline _Tp* + _Array<_Tp>::begin () const + { return _M_data; } + +#define _DEFINE_ARRAY_FUNCTION(_Op, _Name) \ + template \ + inline void \ + _Array_augmented_##_Name(_Array<_Tp> __a, size_t __n, const _Tp& __t) \ + { \ + for (_Tp* __p = __a._M_data; __p < __a._M_data + __n; ++__p) \ + *__p _Op##= __t; \ + } \ + \ + template \ + inline void \ + _Array_augmented_##_Name(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b) \ + { \ + _Tp* __p = __a._M_data; \ + for (_Tp* __q = __b._M_data; __q < __b._M_data + __n; ++__p, ++__q) \ + *__p _Op##= *__q; \ + } \ + \ + template \ + void \ + _Array_augmented_##_Name(_Array<_Tp> __a, \ + const _Expr<_Dom, _Tp>& __e, size_t __n) \ + { \ + _Tp* __p(__a._M_data); \ + for (size_t __i = 0; __i < __n; ++__i, ++__p) \ + *__p _Op##= __e[__i]; \ + } \ + \ + template \ + inline void \ + _Array_augmented_##_Name(_Array<_Tp> __a, size_t __n, size_t __s, \ + _Array<_Tp> __b) \ + { \ + _Tp* __q(__b._M_data); \ + for (_Tp* __p = __a._M_data; __p < __a._M_data + __s * __n; \ + __p += __s, ++__q) \ + *__p _Op##= *__q; \ + } \ + \ + template \ + inline void \ + _Array_augmented_##_Name(_Array<_Tp> __a, _Array<_Tp> __b, \ + size_t __n, size_t __s) \ + { \ + _Tp* __q(__b._M_data); \ + for (_Tp* __p = __a._M_data; __p < __a._M_data + __n; \ + ++__p, __q += __s) \ + *__p _Op##= *__q; \ + } \ + \ + template \ + void \ + _Array_augmented_##_Name(_Array<_Tp> __a, size_t __s, \ + const _Expr<_Dom, _Tp>& __e, size_t __n) \ + { \ + _Tp* __p(__a._M_data); \ + for (size_t __i = 0; __i < __n; ++__i, __p += __s) \ + *__p _Op##= __e[__i]; \ + } \ + \ + template \ + inline void \ + _Array_augmented_##_Name(_Array<_Tp> __a, _Array __i, \ + _Array<_Tp> __b, size_t __n) \ + { \ + _Tp* __q(__b._M_data); \ + for (size_t* __j = __i._M_data; __j < __i._M_data + __n; \ + ++__j, ++__q) \ + __a._M_data[*__j] _Op##= *__q; \ + } \ + \ + template \ + inline void \ + _Array_augmented_##_Name(_Array<_Tp> __a, size_t __n, \ + _Array<_Tp> __b, _Array __i) \ + { \ + _Tp* __p(__a._M_data); \ + for (size_t* __j = __i._M_data; __j<__i._M_data + __n; \ + ++__j, ++__p) \ + *__p _Op##= __b._M_data[*__j]; \ + } \ + \ + template \ + void \ + _Array_augmented_##_Name(_Array<_Tp> __a, _Array __i, \ + const _Expr<_Dom, _Tp>& __e, size_t __n) \ + { \ + size_t* __j(__i._M_data); \ + for (size_t __k = 0; __k<__n; ++__k, ++__j) \ + __a._M_data[*__j] _Op##= __e[__k]; \ + } \ + \ + template \ + void \ + _Array_augmented_##_Name(_Array<_Tp> __a, _Array __m, \ + _Array<_Tp> __b, size_t __n) \ + { \ + bool* __ok(__m._M_data); \ + _Tp* __p(__a._M_data); \ + for (_Tp* __q = __b._M_data; __q < __b._M_data + __n; \ + ++__q, ++__ok, ++__p) \ + { \ + while (! *__ok) \ + { \ + ++__ok; \ + ++__p; \ + } \ + *__p _Op##= *__q; \ + } \ + } \ + \ + template \ + void \ + _Array_augmented_##_Name(_Array<_Tp> __a, size_t __n, \ + _Array<_Tp> __b, _Array __m) \ + { \ + bool* __ok(__m._M_data); \ + _Tp* __q(__b._M_data); \ + for (_Tp* __p = __a._M_data; __p < __a._M_data + __n; \ + ++__p, ++__ok, ++__q) \ + { \ + while (! *__ok) \ + { \ + ++__ok; \ + ++__q; \ + } \ + *__p _Op##= *__q; \ + } \ + } \ + \ + template \ + void \ + _Array_augmented_##_Name(_Array<_Tp> __a, _Array __m, \ + const _Expr<_Dom, _Tp>& __e, size_t __n) \ + { \ + bool* __ok(__m._M_data); \ + _Tp* __p(__a._M_data); \ + for (size_t __i = 0; __i < __n; ++__i, ++__ok, ++__p) \ + { \ + while (! *__ok) \ + { \ + ++__ok; \ + ++__p; \ + } \ + *__p _Op##= __e[__i]; \ + } \ + } + + _DEFINE_ARRAY_FUNCTION(+, __plus) + _DEFINE_ARRAY_FUNCTION(-, __minus) + _DEFINE_ARRAY_FUNCTION(*, __multiplies) + _DEFINE_ARRAY_FUNCTION(/, __divides) + _DEFINE_ARRAY_FUNCTION(%, __modulus) + _DEFINE_ARRAY_FUNCTION(^, __bitwise_xor) + _DEFINE_ARRAY_FUNCTION(|, __bitwise_or) + _DEFINE_ARRAY_FUNCTION(&, __bitwise_and) + _DEFINE_ARRAY_FUNCTION(<<, __shift_left) + _DEFINE_ARRAY_FUNCTION(>>, __shift_right) + +#undef _DEFINE_ARRAY_FUNCTION + +} // namespace std + +#ifndef _GLIBCXX_EXPORT_TEMPLATE +# include +#endif + +#endif /* _ARRAY_H */ diff --git a/cpp_src/valarray_array.tcc b/cpp_src/valarray_array.tcc new file mode 100644 index 0000000..d6102ca --- /dev/null +++ b/cpp_src/valarray_array.tcc @@ -0,0 +1,246 @@ +// The template and inlines for the -*- C++ -*- internal _Array helper class. + +// Copyright (C) 1997, 1998, 1999, 2003, 2005 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file valarray_array.tcc + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// Written by Gabriel Dos Reis + +#ifndef _VALARRAY_ARRAY_TCC +#define _VALARRAY_ARRAY_TCC 1 + +namespace std { + + template + void + __valarray_fill(_Array<_Tp> __a, size_t __n, _Array __m, + const _Tp& __t) + { + _Tp* __p = __a._M_data; + bool* __ok (__m._M_data); + for (size_t __i=0; __i < __n; ++__i, ++__ok, ++__p) + { + while (!*__ok) + { + ++__ok; + ++__p; + } + *__p = __t; + } + } + + // Copy n elements of a into consecutive elements of b. When m is + // false, the corresponding element of a is skipped. m must contain + // at least n true elements. a must contain at least n elements and + // enough elements to match up with m through the nth true element + // of m. I.e. if n is 10, m has 15 elements with 5 false followed + // by 10 true, a must have 15 elements. + template + void + __valarray_copy(_Array<_Tp> __a, _Array __m, _Array<_Tp> __b, + size_t __n) + { + _Tp* __p (__a._M_data); + bool* __ok (__m._M_data); + for (_Tp* __q = __b._M_data; __q < __b._M_data + __n; + ++__q, ++__ok, ++__p) + { + while (! *__ok) + { + ++__ok; + ++__p; + } + *__q = *__p; + } + } + + // Copy n consecutive elements from a into elements of b. Elements + // of b are skipped if the corresponding element of m is false. m + // must contain at least n true elements. b must have at least as + // many elements as the index of the nth true element of m. I.e. if + // m has 15 elements with 5 false followed by 10 true, b must have + // at least 15 elements. + template + void + __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b, + _Array __m) + { + _Tp* __q (__b._M_data); + bool* __ok (__m._M_data); + for (_Tp* __p = __a._M_data; __p < __a._M_data+__n; + ++__p, ++__ok, ++__q) + { + while (! *__ok) + { + ++__ok; + ++__q; + } + *__q = *__p; + } + } + + // Copy n elements from a into elements of b. Elements of a are + // skipped if the corresponding element of m is false. Elements of + // b are skipped if the corresponding element of k is false. m and + // k must contain at least n true elements. a and b must have at + // least as many elements as the index of the nth true element of m. + template + void + __valarray_copy(_Array<_Tp> __a, _Array __m, size_t __n, + _Array<_Tp> __b, _Array __k) + { + _Tp* __p (__a._M_data); + _Tp* __q (__b._M_data); + bool* __srcok (__m._M_data); + bool* __dstok (__k._M_data); + for (size_t __i = 0; __i < __n; + ++__srcok, ++__p, ++__dstok, ++__q, ++__i) + { + while (! *__srcok) + { + ++__srcok; + ++__p; + } + while (! *__dstok) + { + ++__dstok; + ++__q; + } + *__q = *__p; + } + } + + // Copy n consecutive elements of e into consecutive elements of a. + // I.e. a[i] = e[i]. + template + void + __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n, _Array<_Tp> __a) + { + _Tp* __p (__a._M_data); + for (size_t __i = 0; __i < __n; ++__i, ++__p) + *__p = __e[__i]; + } + + // Copy n consecutive elements of e into elements of a using stride + // s. I.e., a[0] = e[0], a[s] = e[1], a[2*s] = e[2]. + template + void + __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n, + _Array<_Tp> __a, size_t __s) + { + _Tp* __p (__a._M_data); + for (size_t __i = 0; __i < __n; ++__i, __p += __s) + *__p = __e[__i]; + } + + // Copy n consecutive elements of e into elements of a indexed by + // contents of i. I.e., a[i[0]] = e[0]. + template + void + __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n, + _Array<_Tp> __a, _Array __i) + { + size_t* __j (__i._M_data); + for (size_t __k = 0; __k < __n; ++__k, ++__j) + __a._M_data[*__j] = __e[__k]; + } + + // Copy n elements of e indexed by contents of f into elements of a + // indexed by contents of i. I.e., a[i[0]] = e[f[0]]. + template + void + __valarray_copy(_Array<_Tp> __e, _Array __f, + size_t __n, + _Array<_Tp> __a, _Array __i) + { + size_t* __g (__f._M_data); + size_t* __j (__i._M_data); + for (size_t __k = 0; __k < __n; ++__k, ++__j, ++__g) + __a._M_data[*__j] = __e._M_data[*__g]; + } + + // Copy n consecutive elements of e into elements of a. Elements of + // a are skipped if the corresponding element of m is false. m must + // have at least n true elements and a must have at least as many + // elements as the index of the nth true element of m. I.e. if m + // has 5 false followed by 10 true elements and n == 10, a must have + // at least 15 elements. + template + void + __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n, + _Array<_Tp> __a, _Array __m) + { + bool* __ok (__m._M_data); + _Tp* __p (__a._M_data); + for (size_t __i = 0; __i < __n; ++__i, ++__ok, ++__p) + { + while (! *__ok) + { + ++__ok; + ++__p; + } + *__p = __e[__i]; + } + } + + + template + void + __valarray_copy_construct(const _Expr<_Dom, _Tp>& __e, size_t __n, + _Array<_Tp> __a) + { + _Tp* __p (__a._M_data); + for (size_t __i = 0; __i < __n; ++__i, ++__p) + new (__p) _Tp(__e[__i]); + } + + + template + void + __valarray_copy_construct(_Array<_Tp> __a, _Array __m, + _Array<_Tp> __b, size_t __n) + { + _Tp* __p (__a._M_data); + bool* __ok (__m._M_data); + for (_Tp* __q = __b._M_data; __q < __b._M_data+__n; ++__q, ++__ok, ++__p) + { + while (! *__ok) + { + ++__ok; + ++__p; + } + new (__q) _Tp(*__p); + } + } + +} // namespace std + +#endif /* _VALARRAY_ARRAY_TCC */ diff --git a/cpp_src/valarray_before.h b/cpp_src/valarray_before.h new file mode 100644 index 0000000..bf13016 --- /dev/null +++ b/cpp_src/valarray_before.h @@ -0,0 +1,735 @@ +// The template and inlines for the -*- C++ -*- internal _Meta class. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006 +// 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/** @file valarray_before.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// Written by Gabriel Dos Reis + +#ifndef _VALARRAY_BEFORE_H +#define _VALARRAY_BEFORE_H 1 + +#pragma GCC system_header + +#include + +namespace std { + + // + // Implementing a loosened valarray return value is tricky. + // First we need to meet 26.3.1/3: we should not add more than + // two levels of template nesting. Therefore we resort to template + // template to "flatten" loosened return value types. + // At some point we use partial specialization to remove one level + // template nesting due to _Expr<> + // + + // This class is NOT defined. It doesn't need to. + template class _Constant; + + // Implementations of unary functions applied to valarray<>s. + // I use hard-coded object functions here instead of a generic + // approach like pointers to function: + // 1) correctness: some functions take references, others values. + // we can't deduce the correct type afterwards. + // 2) efficiency -- object functions can be easily inlined + // 3) be Koenig-lookup-friendly + + struct __abs + { + template + _Tp operator()(const _Tp& __t) const + { return abs(__t); } + }; + + struct __cos + { + template + _Tp operator()(const _Tp& __t) const + { return cos(__t); } + }; + + struct __acos + { + template + _Tp operator()(const _Tp& __t) const + { return acos(__t); } + }; + + struct __cosh + { + template + _Tp operator()(const _Tp& __t) const + { return cosh(__t); } + }; + + struct __sin + { + template + _Tp operator()(const _Tp& __t) const + { return sin(__t); } + }; + + struct __asin + { + template + _Tp operator()(const _Tp& __t) const + { return asin(__t); } + }; + + struct __sinh + { + template + _Tp operator()(const _Tp& __t) const + { return sinh(__t); } + }; + + struct __tan + { + template + _Tp operator()(const _Tp& __t) const + { return tan(__t); } + }; + + struct __atan + { + template + _Tp operator()(const _Tp& __t) const + { return atan(__t); } + }; + + struct __tanh + { + template + _Tp operator()(const _Tp& __t) const + { return tanh(__t); } + }; + + struct __exp + { + template + _Tp operator()(const _Tp& __t) const + { return exp(__t); } + }; + + struct __log + { + template + _Tp operator()(const _Tp& __t) const + { return log(__t); } + }; + + struct __log10 + { + template + _Tp operator()(const _Tp& __t) const + { return log10(__t); } + }; + + struct __sqrt + { + template + _Tp operator()(const _Tp& __t) const + { return sqrt(__t); } + }; + + // In the past, we used to tailor operator applications semantics + // to the specialization of standard function objects (i.e. plus<>, etc.) + // That is incorrect. Therefore we provide our own surrogates. + + struct __unary_plus + { + template + _Tp operator()(const _Tp& __t) const + { return +__t; } + }; + + struct __negate + { + template + _Tp operator()(const _Tp& __t) const + { return -__t; } + }; + + struct __bitwise_not + { + template + _Tp operator()(const _Tp& __t) const + { return ~__t; } + }; + + struct __plus + { + template + _Tp operator()(const _Tp& __x, const _Tp& __y) const + { return __x + __y; } + }; + + struct __minus + { + template + _Tp operator()(const _Tp& __x, const _Tp& __y) const + { return __x - __y; } + }; + + struct __multiplies + { + template + _Tp operator()(const _Tp& __x, const _Tp& __y) const + { return __x * __y; } + }; + + struct __divides + { + template + _Tp operator()(const _Tp& __x, const _Tp& __y) const + { return __x / __y; } + }; + + struct __modulus + { + template + _Tp operator()(const _Tp& __x, const _Tp& __y) const + { return __x % __y; } + }; + + struct __bitwise_xor + { + template + _Tp operator()(const _Tp& __x, const _Tp& __y) const + { return __x ^ __y; } + }; + + struct __bitwise_and + { + template + _Tp operator()(const _Tp& __x, const _Tp& __y) const + { return __x & __y; } + }; + + struct __bitwise_or + { + template + _Tp operator()(const _Tp& __x, const _Tp& __y) const + { return __x | __y; } + }; + + struct __shift_left + { + template + _Tp operator()(const _Tp& __x, const _Tp& __y) const + { return __x << __y; } + }; + + struct __shift_right + { + template + _Tp operator()(const _Tp& __x, const _Tp& __y) const + { return __x >> __y; } + }; + + struct __logical_and + { + template + bool operator()(const _Tp& __x, const _Tp& __y) const + { return __x && __y; } + }; + + struct __logical_or + { + template + bool operator()(const _Tp& __x, const _Tp& __y) const + { return __x || __y; } + }; + + struct __logical_not + { + template + bool operator()(const _Tp& __x) const { return !__x; } + }; + + struct __equal_to + { + template + bool operator()(const _Tp& __x, const _Tp& __y) const + { return __x == __y; } + }; + + struct __not_equal_to + { + template + bool operator()(const _Tp& __x, const _Tp& __y) const + { return __x != __y; } + }; + + struct __less + { + template + bool operator()(const _Tp& __x, const _Tp& __y) const + { return __x < __y; } + }; + + struct __greater + { + template + bool operator()(const _Tp& __x, const _Tp& __y) const + { return __x > __y; } + }; + + struct __less_equal + { + template + bool operator()(const _Tp& __x, const _Tp& __y) const + { return __x <= __y; } + }; + + struct __greater_equal + { + template + bool operator()(const _Tp& __x, const _Tp& __y) const + { return __x >= __y; } + }; + + // The few binary functions we miss. + struct __atan2 + { + template + _Tp operator()(const _Tp& __x, const _Tp& __y) const + { return atan2(__x, __y); } + }; + + struct __pow + { + template + _Tp operator()(const _Tp& __x, const _Tp& __y) const + { return pow(__x, __y); } + }; + + + // We need these bits in order to recover the return type of + // some functions/operators now that we're no longer using + // function templates. + template + struct __fun + { + typedef _Tp result_type; + }; + + // several specializations for relational operators. + template + struct __fun<__logical_not, _Tp> + { + typedef bool result_type; + }; + + template + struct __fun<__logical_and, _Tp> + { + typedef bool result_type; + }; + + template + struct __fun<__logical_or, _Tp> + { + typedef bool result_type; + }; + + template + struct __fun<__less, _Tp> + { + typedef bool result_type; + }; + + template + struct __fun<__greater, _Tp> + { + typedef bool result_type; + }; + + template + struct __fun<__less_equal, _Tp> + { + typedef bool result_type; + }; + + template + struct __fun<__greater_equal, _Tp> + { + typedef bool result_type; + }; + + template + struct __fun<__equal_to, _Tp> + { + typedef bool result_type; + }; + + template + struct __fun<__not_equal_to, _Tp> + { + typedef bool result_type; + }; + + // + // Apply function taking a value/const reference closure + // + + template + class _FunBase + { + public: + typedef typename _Dom::value_type value_type; + + _FunBase(const _Dom& __e, value_type __f(_Arg)) + : _M_expr(__e), _M_func(__f) {} + + value_type operator[](size_t __i) const + { return _M_func (_M_expr[__i]); } + + size_t size() const { return _M_expr.size ();} + + private: + const _Dom& _M_expr; + value_type (*_M_func)(_Arg); + }; + + template + struct _ValFunClos<_Expr,_Dom> : _FunBase<_Dom, typename _Dom::value_type> + { + typedef _FunBase<_Dom, typename _Dom::value_type> _Base; + typedef typename _Base::value_type value_type; + typedef value_type _Tp; + + _ValFunClos(const _Dom& __e, _Tp __f(_Tp)) : _Base(__e, __f) {} + }; + + template + struct _ValFunClos<_ValArray,_Tp> : _FunBase, _Tp> + { + typedef _FunBase, _Tp> _Base; + typedef _Tp value_type; + + _ValFunClos(const valarray<_Tp>& __v, _Tp __f(_Tp)) : _Base(__v, __f) {} + }; + + template + struct _RefFunClos<_Expr, _Dom> + : _FunBase<_Dom, const typename _Dom::value_type&> + { + typedef _FunBase<_Dom, const typename _Dom::value_type&> _Base; + typedef typename _Base::value_type value_type; + typedef value_type _Tp; + + _RefFunClos(const _Dom& __e, _Tp __f(const _Tp&)) + : _Base(__e, __f) {} + }; + + template + struct _RefFunClos<_ValArray, _Tp> + : _FunBase, const _Tp&> + { + typedef _FunBase, const _Tp&> _Base; + typedef _Tp value_type; + + _RefFunClos(const valarray<_Tp>& __v, _Tp __f(const _Tp&)) + : _Base(__v, __f) {} + }; + + // + // Unary expression closure. + // + + template + class _UnBase + { + public: + typedef typename _Arg::value_type _Vt; + typedef typename __fun<_Oper, _Vt>::result_type value_type; + + _UnBase(const _Arg& __e) : _M_expr(__e) {} + + value_type operator[](size_t __i) const + { return _Oper()(_M_expr[__i]); } + + size_t size() const { return _M_expr.size(); } + + private: + const _Arg& _M_expr; + }; + + template + struct _UnClos<_Oper, _Expr, _Dom> + : _UnBase<_Oper, _Dom> + { + typedef _Dom _Arg; + typedef _UnBase<_Oper, _Dom> _Base; + typedef typename _Base::value_type value_type; + + _UnClos(const _Arg& __e) : _Base(__e) {} + }; + + template + struct _UnClos<_Oper, _ValArray, _Tp> + : _UnBase<_Oper, valarray<_Tp> > + { + typedef valarray<_Tp> _Arg; + typedef _UnBase<_Oper, valarray<_Tp> > _Base; + typedef typename _Base::value_type value_type; + + _UnClos(const _Arg& __e) : _Base(__e) {} + }; + + + // + // Binary expression closure. + // + + template + class _BinBase + { + public: + typedef typename _FirstArg::value_type _Vt; + typedef typename __fun<_Oper, _Vt>::result_type value_type; + + _BinBase(const _FirstArg& __e1, const _SecondArg& __e2) + : _M_expr1(__e1), _M_expr2(__e2) {} + + value_type operator[](size_t __i) const + { return _Oper()(_M_expr1[__i], _M_expr2[__i]); } + + size_t size() const { return _M_expr1.size(); } + + private: + const _FirstArg& _M_expr1; + const _SecondArg& _M_expr2; + }; + + + template + class _BinBase2 + { + public: + typedef typename _Clos::value_type _Vt; + typedef typename __fun<_Oper, _Vt>::result_type value_type; + + _BinBase2(const _Clos& __e, const _Vt& __t) + : _M_expr1(__e), _M_expr2(__t) {} + + value_type operator[](size_t __i) const + { return _Oper()(_M_expr1[__i], _M_expr2); } + + size_t size() const { return _M_expr1.size(); } + + private: + const _Clos& _M_expr1; + const _Vt& _M_expr2; + }; + + template + class _BinBase1 + { + public: + typedef typename _Clos::value_type _Vt; + typedef typename __fun<_Oper, _Vt>::result_type value_type; + + _BinBase1(const _Vt& __t, const _Clos& __e) + : _M_expr1(__t), _M_expr2(__e) {} + + value_type operator[](size_t __i) const + { return _Oper()(_M_expr1, _M_expr2[__i]); } + + size_t size() const { return _M_expr2.size(); } + + private: + const _Vt& _M_expr1; + const _Clos& _M_expr2; + }; + + template + struct _BinClos<_Oper, _Expr, _Expr, _Dom1, _Dom2> + : _BinBase<_Oper, _Dom1, _Dom2> + { + typedef _BinBase<_Oper, _Dom1, _Dom2> _Base; + typedef typename _Base::value_type value_type; + + _BinClos(const _Dom1& __e1, const _Dom2& __e2) : _Base(__e1, __e2) {} + }; + + template + struct _BinClos<_Oper,_ValArray, _ValArray, _Tp, _Tp> + : _BinBase<_Oper, valarray<_Tp>, valarray<_Tp> > + { + typedef _BinBase<_Oper, valarray<_Tp>, valarray<_Tp> > _Base; + typedef typename _Base::value_type value_type; + + _BinClos(const valarray<_Tp>& __v, const valarray<_Tp>& __w) + : _Base(__v, __w) {} + }; + + template + struct _BinClos<_Oper, _Expr, _ValArray, _Dom, typename _Dom::value_type> + : _BinBase<_Oper, _Dom, valarray > + { + typedef typename _Dom::value_type _Tp; + typedef _BinBase<_Oper,_Dom,valarray<_Tp> > _Base; + typedef typename _Base::value_type value_type; + + _BinClos(const _Dom& __e1, const valarray<_Tp>& __e2) + : _Base(__e1, __e2) {} + }; + + template + struct _BinClos<_Oper, _ValArray, _Expr, typename _Dom::value_type, _Dom> + : _BinBase<_Oper, valarray,_Dom> + { + typedef typename _Dom::value_type _Tp; + typedef _BinBase<_Oper, valarray<_Tp>, _Dom> _Base; + typedef typename _Base::value_type value_type; + + _BinClos(const valarray<_Tp>& __e1, const _Dom& __e2) + : _Base(__e1, __e2) {} + }; + + template + struct _BinClos<_Oper, _Expr, _Constant, _Dom, typename _Dom::value_type> + : _BinBase2<_Oper, _Dom> + { + typedef typename _Dom::value_type _Tp; + typedef _BinBase2<_Oper,_Dom> _Base; + typedef typename _Base::value_type value_type; + + _BinClos(const _Dom& __e1, const _Tp& __e2) : _Base(__e1, __e2) {} + }; + + template + struct _BinClos<_Oper, _Constant, _Expr, typename _Dom::value_type, _Dom> + : _BinBase1<_Oper, _Dom> + { + typedef typename _Dom::value_type _Tp; + typedef _BinBase1<_Oper, _Dom> _Base; + typedef typename _Base::value_type value_type; + + _BinClos(const _Tp& __e1, const _Dom& __e2) : _Base(__e1, __e2) {} + }; + + template + struct _BinClos<_Oper, _ValArray, _Constant, _Tp, _Tp> + : _BinBase2<_Oper, valarray<_Tp> > + { + typedef _BinBase2<_Oper,valarray<_Tp> > _Base; + typedef typename _Base::value_type value_type; + + _BinClos(const valarray<_Tp>& __v, const _Tp& __t) : _Base(__v, __t) {} + }; + + template + struct _BinClos<_Oper, _Constant, _ValArray, _Tp, _Tp> + : _BinBase1<_Oper, valarray<_Tp> > + { + typedef _BinBase1<_Oper, valarray<_Tp> > _Base; + typedef typename _Base::value_type value_type; + + _BinClos(const _Tp& __t, const valarray<_Tp>& __v) : _Base(__t, __v) {} + }; + + // + // slice_array closure. + // + template + class _SBase + { + public: + typedef typename _Dom::value_type value_type; + + _SBase (const _Dom& __e, const slice& __s) + : _M_expr (__e), _M_slice (__s) {} + + value_type + operator[] (size_t __i) const + { return _M_expr[_M_slice.start () + __i * _M_slice.stride ()]; } + + size_t + size() const + { return _M_slice.size (); } + + private: + const _Dom& _M_expr; + const slice& _M_slice; + }; + + template + class _SBase<_Array<_Tp> > + { + public: + typedef _Tp value_type; + + _SBase (_Array<_Tp> __a, const slice& __s) + : _M_array (__a._M_data+__s.start()), _M_size (__s.size()), + _M_stride (__s.stride()) {} + + value_type + operator[] (size_t __i) const + { return _M_array._M_data[__i * _M_stride]; } + + size_t + size() const + { return _M_size; } + + private: + const _Array<_Tp> _M_array; + const size_t _M_size; + const size_t _M_stride; + }; + + template + struct _SClos<_Expr, _Dom> + : _SBase<_Dom> + { + typedef _SBase<_Dom> _Base; + typedef typename _Base::value_type value_type; + + _SClos (const _Dom& __e, const slice& __s) : _Base (__e, __s) {} + }; + + template + struct _SClos<_ValArray, _Tp> + : _SBase<_Array<_Tp> > + { + typedef _SBase<_Array<_Tp> > _Base; + typedef _Tp value_type; + + _SClos (_Array<_Tp> __a, const slice& __s) : _Base (__a, __s) {} + }; + +} // namespace std + +#endif /* _CPP_VALARRAY_BEFORE_H */ diff --git a/cpp_src/vector b/cpp_src/vector new file mode 100644 index 0000000..a4a527e --- /dev/null +++ b/cpp_src/vector @@ -0,0 +1,82 @@ +// -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file include/vector + * This is a Standard C++ Library header. + */ + +#ifndef _GLIBCXX_VECTOR +#define _GLIBCXX_VECTOR 1 + +#pragma GCC system_header + +#include +#include +#include +#include +#include +#include +#include + +#ifndef _GLIBCXX_EXPORT_TEMPLATE +# include +#endif + +#ifdef _GLIBCXX_DEBUG +# include +#endif + +#endif /* _GLIBCXX_VECTOR */ + diff --git a/cpp_src/vector.tcc b/cpp_src/vector.tcc new file mode 100644 index 0000000..80335f9 --- /dev/null +++ b/cpp_src/vector.tcc @@ -0,0 +1,496 @@ +// Vector implementation (out of line) -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005 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. + +// As a special exception, you may use this file as part of a free software +// library without restriction. Specifically, if other files instantiate +// templates or use macros or inline functions from this file, or you compile +// this file and link it with other files to produce an executable, this +// file does not by itself cause the resulting executable to be covered by +// the GNU General Public License. This exception does not however +// invalidate any other reasons why the executable file might be covered by +// the GNU General Public License. + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file vector.tcc + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _VECTOR_TCC +#define _VECTOR_TCC 1 + +namespace std { + + template + void + vector<_Tp, _Alloc>:: + reserve(size_type __n) + { + if (__n > this->max_size()) + __throw_length_error(__N("vector::reserve")); + if (this->capacity() < __n) + { + const size_type __old_size = size(); + pointer __tmp = _M_allocate_and_copy(__n, this->_M_impl._M_start, + this->_M_impl._M_finish); + std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish, + _M_get_Tp_allocator()); + _M_deallocate(this->_M_impl._M_start, + this->_M_impl._M_end_of_storage + - this->_M_impl._M_start); + this->_M_impl._M_start = __tmp; + this->_M_impl._M_finish = __tmp + __old_size; + this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n; + } + } + + template + typename vector<_Tp, _Alloc>::iterator + vector<_Tp, _Alloc>:: + insert(iterator __position, const value_type& __x) + { + const size_type __n = __position - begin(); + if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage + && __position == end()) + { + this->_M_impl.construct(this->_M_impl._M_finish, __x); + ++this->_M_impl._M_finish; + } + else + _M_insert_aux(__position, __x); + return iterator(this->_M_impl._M_start + __n); + } + + template + typename vector<_Tp, _Alloc>::iterator + vector<_Tp, _Alloc>:: + erase(iterator __position) + { + if (__position + 1 != end()) + std::copy(__position + 1, end(), __position); + --this->_M_impl._M_finish; + this->_M_impl.destroy(this->_M_impl._M_finish); + return __position; + } + + template + typename vector<_Tp, _Alloc>::iterator + vector<_Tp, _Alloc>:: + erase(iterator __first, iterator __last) + { + if (__last != end()) + std::copy(__last, end(), __first); + _M_erase_at_end(__first.base() + (end() - __last)); + return __first; + } + + template + vector<_Tp, _Alloc>& + vector<_Tp, _Alloc>:: + operator=(const vector<_Tp, _Alloc>& __x) + { + if (&__x != this) + { + const size_type __xlen = __x.size(); + if (__xlen > capacity()) + { + pointer __tmp = _M_allocate_and_copy(__xlen, __x.begin(), + __x.end()); + std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish, + _M_get_Tp_allocator()); + _M_deallocate(this->_M_impl._M_start, + this->_M_impl._M_end_of_storage + - this->_M_impl._M_start); + this->_M_impl._M_start = __tmp; + this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __xlen; + } + else if (size() >= __xlen) + { + std::_Destroy(std::copy(__x.begin(), __x.end(), begin()), + end(), _M_get_Tp_allocator()); + } + else + { + std::copy(__x._M_impl._M_start, __x._M_impl._M_start + size(), + this->_M_impl._M_start); + std::__uninitialized_copy_a(__x._M_impl._M_start + size(), + __x._M_impl._M_finish, + this->_M_impl._M_finish, + _M_get_Tp_allocator()); + } + this->_M_impl._M_finish = this->_M_impl._M_start + __xlen; + } + return *this; + } + + template + void + vector<_Tp, _Alloc>:: + _M_fill_assign(size_t __n, const value_type& __val) + { + if (__n > capacity()) + { + vector __tmp(__n, __val, _M_get_Tp_allocator()); + __tmp.swap(*this); + } + else if (__n > size()) + { + std::fill(begin(), end(), __val); + std::__uninitialized_fill_n_a(this->_M_impl._M_finish, + __n - size(), __val, + _M_get_Tp_allocator()); + this->_M_impl._M_finish += __n - size(); + } + else + _M_erase_at_end(std::fill_n(this->_M_impl._M_start, __n, __val)); + } + + template + template + void + vector<_Tp, _Alloc>:: + _M_assign_aux(_InputIterator __first, _InputIterator __last, + std::input_iterator_tag) + { + pointer __cur(this->_M_impl._M_start); + for (; __first != __last && __cur != this->_M_impl._M_finish; + ++__cur, ++__first) + *__cur = *__first; + if (__first == __last) + _M_erase_at_end(__cur); + else + insert(end(), __first, __last); + } + + template + template + void + vector<_Tp, _Alloc>:: + _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last, + std::forward_iterator_tag) + { + const size_type __len = std::distance(__first, __last); + + if (__len > capacity()) + { + pointer __tmp(_M_allocate_and_copy(__len, __first, __last)); + std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish, + _M_get_Tp_allocator()); + _M_deallocate(this->_M_impl._M_start, + this->_M_impl._M_end_of_storage + - this->_M_impl._M_start); + this->_M_impl._M_start = __tmp; + this->_M_impl._M_finish = this->_M_impl._M_start + __len; + this->_M_impl._M_end_of_storage = this->_M_impl._M_finish; + } + else if (size() >= __len) + _M_erase_at_end(std::copy(__first, __last, this->_M_impl._M_start)); + else + { + _ForwardIterator __mid = __first; + std::advance(__mid, size()); + std::copy(__first, __mid, this->_M_impl._M_start); + this->_M_impl._M_finish = + std::__uninitialized_copy_a(__mid, __last, + this->_M_impl._M_finish, + _M_get_Tp_allocator()); + } + } + + template + void + vector<_Tp, _Alloc>:: + _M_insert_aux(iterator __position, const _Tp& __x) + { + if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage) + { + this->_M_impl.construct(this->_M_impl._M_finish, + *(this->_M_impl._M_finish - 1)); + ++this->_M_impl._M_finish; + _Tp __x_copy = __x; + std::copy_backward(__position.base(), + this->_M_impl._M_finish - 2, + this->_M_impl._M_finish - 1); + *__position = __x_copy; + } + else + { + const size_type __old_size = size(); + if (__old_size == this->max_size()) + __throw_length_error(__N("vector::_M_insert_aux")); + + // When sizeof(value_type) == 1 and __old_size > size_type(-1)/2 + // __len overflows: if we don't notice and _M_allocate doesn't + // throw we crash badly later. + size_type __len = __old_size != 0 ? 2 * __old_size : 1; + if (__len < __old_size) + __len = this->max_size(); + + pointer __new_start(this->_M_allocate(__len)); + pointer __new_finish(__new_start); + try + { + __new_finish = + std::__uninitialized_copy_a(this->_M_impl._M_start, + __position.base(), __new_start, + _M_get_Tp_allocator()); + this->_M_impl.construct(__new_finish, __x); + ++__new_finish; + __new_finish = + std::__uninitialized_copy_a(__position.base(), + this->_M_impl._M_finish, + __new_finish, + _M_get_Tp_allocator()); + } + catch(...) + { + std::_Destroy(__new_start, __new_finish, _M_get_Tp_allocator()); + _M_deallocate(__new_start, __len); + __throw_exception_again; + } + std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish, + _M_get_Tp_allocator()); + _M_deallocate(this->_M_impl._M_start, + this->_M_impl._M_end_of_storage + - this->_M_impl._M_start); + this->_M_impl._M_start = __new_start; + this->_M_impl._M_finish = __new_finish; + this->_M_impl._M_end_of_storage = __new_start + __len; + } + } + + template + void + vector<_Tp, _Alloc>:: + _M_fill_insert(iterator __position, size_type __n, const value_type& __x) + { + if (__n != 0) + { + if (size_type(this->_M_impl._M_end_of_storage + - this->_M_impl._M_finish) >= __n) + { + value_type __x_copy = __x; + const size_type __elems_after = end() - __position; + pointer __old_finish(this->_M_impl._M_finish); + if (__elems_after > __n) + { + std::__uninitialized_copy_a(this->_M_impl._M_finish - __n, + this->_M_impl._M_finish, + this->_M_impl._M_finish, + _M_get_Tp_allocator()); + this->_M_impl._M_finish += __n; + std::copy_backward(__position.base(), __old_finish - __n, + __old_finish); + std::fill(__position.base(), __position.base() + __n, + __x_copy); + } + else + { + std::__uninitialized_fill_n_a(this->_M_impl._M_finish, + __n - __elems_after, + __x_copy, + _M_get_Tp_allocator()); + this->_M_impl._M_finish += __n - __elems_after; + std::__uninitialized_copy_a(__position.base(), __old_finish, + this->_M_impl._M_finish, + _M_get_Tp_allocator()); + this->_M_impl._M_finish += __elems_after; + std::fill(__position.base(), __old_finish, __x_copy); + } + } + else + { + const size_type __old_size = size(); + if (this->max_size() - __old_size < __n) + __throw_length_error(__N("vector::_M_fill_insert")); + + // See _M_insert_aux above. + size_type __len = __old_size + std::max(__old_size, __n); + if (__len < __old_size) + __len = this->max_size(); + + pointer __new_start(this->_M_allocate(__len)); + pointer __new_finish(__new_start); + try + { + __new_finish = + std::__uninitialized_copy_a(this->_M_impl._M_start, + __position.base(), + __new_start, + _M_get_Tp_allocator()); + std::__uninitialized_fill_n_a(__new_finish, __n, __x, + _M_get_Tp_allocator()); + __new_finish += __n; + __new_finish = + std::__uninitialized_copy_a(__position.base(), + this->_M_impl._M_finish, + __new_finish, + _M_get_Tp_allocator()); + } + catch(...) + { + std::_Destroy(__new_start, __new_finish, + _M_get_Tp_allocator()); + _M_deallocate(__new_start, __len); + __throw_exception_again; + } + std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish, + _M_get_Tp_allocator()); + _M_deallocate(this->_M_impl._M_start, + this->_M_impl._M_end_of_storage + - this->_M_impl._M_start); + this->_M_impl._M_start = __new_start; + this->_M_impl._M_finish = __new_finish; + this->_M_impl._M_end_of_storage = __new_start + __len; + } + } + } + + template template + void + vector<_Tp, _Alloc>:: + _M_range_insert(iterator __pos, _InputIterator __first, + _InputIterator __last, std::input_iterator_tag) + { + for (; __first != __last; ++__first) + { + __pos = insert(__pos, *__first); + ++__pos; + } + } + + template + template + void + vector<_Tp, _Alloc>:: + _M_range_insert(iterator __position, _ForwardIterator __first, + _ForwardIterator __last, std::forward_iterator_tag) + { + if (__first != __last) + { + const size_type __n = std::distance(__first, __last); + if (size_type(this->_M_impl._M_end_of_storage + - this->_M_impl._M_finish) >= __n) + { + const size_type __elems_after = end() - __position; + pointer __old_finish(this->_M_impl._M_finish); + if (__elems_after > __n) + { + std::__uninitialized_copy_a(this->_M_impl._M_finish - __n, + this->_M_impl._M_finish, + this->_M_impl._M_finish, + _M_get_Tp_allocator()); + this->_M_impl._M_finish += __n; + std::copy_backward(__position.base(), __old_finish - __n, + __old_finish); + std::copy(__first, __last, __position); + } + else + { + _ForwardIterator __mid = __first; + std::advance(__mid, __elems_after); + std::__uninitialized_copy_a(__mid, __last, + this->_M_impl._M_finish, + _M_get_Tp_allocator()); + this->_M_impl._M_finish += __n - __elems_after; + std::__uninitialized_copy_a(__position.base(), + __old_finish, + this->_M_impl._M_finish, + _M_get_Tp_allocator()); + this->_M_impl._M_finish += __elems_after; + std::copy(__first, __mid, __position); + } + } + else + { + const size_type __old_size = size(); + if (this->max_size() - __old_size < __n) + __throw_length_error(__N("vector::_M_range_insert")); + + // See _M_insert_aux above. + size_type __len = __old_size + std::max(__old_size, __n); + if (__len < __old_size) + __len = this->max_size(); + + pointer __new_start(this->_M_allocate(__len)); + pointer __new_finish(__new_start); + try + { + __new_finish = + std::__uninitialized_copy_a(this->_M_impl._M_start, + __position.base(), + __new_start, + _M_get_Tp_allocator()); + __new_finish = + std::__uninitialized_copy_a(__first, __last, __new_finish, + _M_get_Tp_allocator()); + __new_finish = + std::__uninitialized_copy_a(__position.base(), + this->_M_impl._M_finish, + __new_finish, + _M_get_Tp_allocator()); + } + catch(...) + { + std::_Destroy(__new_start, __new_finish, + _M_get_Tp_allocator()); + _M_deallocate(__new_start, __len); + __throw_exception_again; + } + std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish, + _M_get_Tp_allocator()); + _M_deallocate(this->_M_impl._M_start, + this->_M_impl._M_end_of_storage + - this->_M_impl._M_start); + this->_M_impl._M_start = __new_start; + this->_M_impl._M_finish = __new_finish; + this->_M_impl._M_end_of_storage = __new_start + __len; + } + } + } + +} // namespace std + +#endif /* _VECTOR_TCC */ diff --git a/vimrc b/vimrc index 7152be7..9e38d0d 100644 --- a/vimrc +++ b/vimrc @@ -46,7 +46,25 @@ set smartcase set foldenable set mousehide set mouse=a + +set foldmethod=syntax +nnoremap o zo +nnoremap a za +nnoremap c zc +nnoremap m zM +nnoremap r zR +inoremap za +nnoremap za +onoremap za +vnoremap zf + nnoremap v vl +nnoremap s sj +nnoremap h h +nnoremap l l +nnoremap j j +nnoremap k k + set sessionoptions=resize,winpos,winsize,buffers,tabpages,folds,curdir,help nmap ev :tabedit $MYVIMRC @@ -84,33 +102,20 @@ else let sep=":" endif -let classpath = join ( - \[".", - \ "src", "src/main/clojure", "src/main/resources", - \ "test", "src/test/clojure", "src/test/resources", - \ "classes", "target/classes", - \ "lib/*", "lib/dev/*", - \ "bin", - \ vimfiles."/lib/*" - \], - \ sep ) - -" Settings for VimClojure - let vimclojureRoot = vimfiles."/bundle/vimclojure" - let vimclojure#HighlightBuiltins=1 - let vimclojure#HighlightContrib=1 - let vimclojure#DynamicHighlighting=1 - let vimclojure#ParenRainbow=1 - let vimclojure#WantNailgun = 1 - let vimclojure#NailgunClient = vimclojureRoot."/lib/nailgun/ng" -" if windows -" " In stupid windows, no forward slashes, and tack on .exe -" let vimclojure#NailgunClient = substitute(vimclojure#NailgunClient, -" "/", "\\", "g") . ".exe" -" endif -" -" " Start vimclojure nailgun server (uses screen.vim to manage -" lifetime) -nmap sc :execute "ScreenShell java -cp \"" . classpath . sep . vimclojureRoot . "/lib/*" . "\" vimclojure.nailgun.NGServer 127.0.0.1" -" Start a generic Clojure repl (uses screen.vim) -nmap sC :execute "ScreenShell java -cp \"" . classpath . "\" clojure.main" +" configure tags - add additional tags here or comment out not-used ones +set tags+=~/.vim/tags/cpp +" build tags of your own project with Ctrl-F12 +map :!ctags -R --sort=yes --c++-kinds=+p --fields=+iaS --extra=+q . + +" OmniCppComplete +let OmniCpp_NamespaceSearch = 1 +let OmniCpp_GlobalScopeSearch = 1 +let OmniCpp_ShowAccess = 1 +let OmniCpp_ShowPrototypeInAbbr = 1 " show function parameters +let OmniCpp_MayCompleteDot = 1 " autocomplete after . +let OmniCpp_MayCompleteArrow = 1 " autocomplete after -> +let OmniCpp_MayCompleteScope = 1 " autocomplete after :: +let OmniCpp_DefaultNamespaces = ["std", "_GLIBCXX_STD"] +" automatically open and close the popup menu / preview window +au CursorMovedI,InsertLeave * if pumvisible() == 0|silent! pclose|endif +set completeopt=menuone,menu,longest,preview