SYMBOL INDEX (3561 symbols across 343 files) FILE: stl-3.3-source/char_traits.h type _IntT (line 31) | typedef _IntT int_type; type streamoff (line 33) | typedef streamoff off_type; type streampos (line 34) | typedef streampos pos_type; type mbstate_t (line 35) | typedef mbstate_t state_type; function assign (line 38) | static void assign(char_type& __c1, const char_type& __c2) { __c1 = __c2; } function eq (line 39) | static bool eq(const _CharT& __c1, const _CharT& __c2) function lt (line 41) | static bool lt(const _CharT& __c1, const _CharT& __c2) function compare (line 44) | static int compare(const _CharT* __s1, const _CharT* __s2, size_t __n) { function length (line 51) | static size_t length(const _CharT* __s) { function _CharT (line 59) | static const _CharT* find(const _CharT* __s, size_t __n, const _CharT& __c) function _CharT (line 67) | static _CharT* move(_CharT* __s1, const _CharT* __s2, size_t __n) { function _CharT (line 72) | static _CharT* copy(_CharT* __s1, const _CharT* __s2, size_t __n) { function _CharT (line 77) | static _CharT* assign(_CharT* __s, size_t __n, _CharT __c) { function int_type (line 83) | static int_type not_eof(const int_type& __c) { function char_type (line 87) | static char_type to_char_type(const int_type& __c) { function int_type (line 91) | static int_type to_int_type(const char_type& __c) { function eq_int_type (line 95) | static bool eq_int_type(const int_type& __c1, const int_type& __c2) { function int_type (line 99) | static int_type eof() { function int_type (line 123) | static int_type to_int_type(const char_type& __c) { function compare (line 127) | static int compare(const char* __s1, const char* __s2, size_t __n) function length (line 130) | static size_t length(const char* __s) { return strlen(__s); } function assign (line 132) | static void assign(char& __c1, const char& __c2) { __c1 = __c2; } FILE: stl-3.3-source/concept_checks.h type _Tp (line 234) | typedef _Tp _Type; type _Tp (line 238) | typedef _Tp _Type; function __sink_unused_warning (line 244) | __sink_unused_warning(_Type) { } function __type_X_is_not_convertible_to_type_Y (line 248) | static void function __type_X_not_same_as_type_Y (line 260) | static void function _Ret (line 271) | static _Ret __generator_requirement_violation(_Func& __f) { function _Ret (line 286) | static _Ret function _Ret (line 304) | static _Ret function __assignment_operator_requirement_violation (line 360) | struct _STL_ERROR { function _Type (line 374) | _Type function _Type (line 380) | _Type function _Type (line 387) | _Type function _Type (line 394) | _Type function _Type (line 400) | _Type function __dereference_operator_requirement_violation (line 406) | void function __dereference_operator_and_assignment_requirement_violation (line 411) | void function __preincrement_operator_requirement_violation (line 416) | void function __postincrement_operator_requirement_violation (line 421) | void function __predecrement_operator_requirement_violation (line 426) | void function __postdecrement_operator_requirement_violation (line 431) | void function __postincrement_operator_and_assignment_requirement_violation (line 436) | void function _Iterator (line 442) | _Iterator function _Iterator (line 449) | _Iterator function _Iterator (line 456) | _Iterator function _Iterator (line 463) | _Iterator function _Distance (line 469) | _Distance function _Type (line 476) | _Type function __element_assignment_operator_requirement_violation (line 482) | void function __STL_END_NAMESPACE (line 495) | __STL_END_NAMESPACE type typename (line 504) | typedef typename __STD::iterator_traits<_Iter>::difference_type type typename (line 510) | typedef typename __STD::iterator_traits<_Iter>::reference reference; type typename (line 515) | typedef typename __STD::iterator_traits<_Iter>::pointer pointer; type typename (line 520) | typedef typename __STD::iterator_traits<_Iter>::iterator_category function _Assignable_requirement_violation (line 529) | static void _Assignable_requirement_violation(_Type __a) { function _DefaultConstructible_requirement_violation (line 542) | static void _DefaultConstructible_requirement_violation(_Type __a) { function _EqualityComparable_requirement_violation (line 551) | static void _EqualityComparable_requirement_violation(_Type __a) { function _LessThanComparable_requirement_violation (line 559) | static void _LessThanComparable_requirement_violation(_Type __a) { function _TrivialIterator_requirement_violation (line 568) | static void function _Mutable_TrivialIterator_requirement_violation (line 589) | static void function _InputIterator_requirement_violation (line 602) | static void function _OutputIterator_requirement_violation (line 622) | static void function _ForwardIterator_requirement_violation (line 642) | static void function _Mutable_ForwardIterator_requirement_violation (line 652) | static void function _BidirectionalIterator_requirement_violation (line 666) | static void function _Mutable_BidirectionalIterator_requirement_violation (line 679) | static void function _RandomAccessIterator_requirement_violation (line 703) | static void function _Mutable_RandomAccessIterator_requirement_violation (line 742) | static void function _Allocator_requirement_violation (line 783) | static void FILE: stl-3.3-source/container_concepts.h function __const_begin_iterator_accessor_requirement_violation (line 31) | struct _ERROR_IN_STL_CONTAINER { function __end_iterator_accessor_requirement_violation (line 46) | void function __const_end_iterator_accessor_requirement_violation (line 51) | void function __rbegin_iterator_accessor_requirement_violation (line 57) | void function __const_rbegin_iterator_accessor_requirement_violation (line 62) | void function __rend_iterator_accessor_requirement_violation (line 67) | void function __const_rend_iterator_accessor_requirement_violation (line 72) | void function __size_function_must_be_const (line 77) | void function __max_size_function_must_be_const (line 88) | void function __empty_function_must_be_const (line 99) | void function _Container_requirement_violation (line 125) | static void function _ForwardContainer_requirement_violation (line 158) | static void function _ReversibleContainer_requirement_violation (line 176) | static void function _const_ReversibleContainer_requirement_violation (line 198) | static void function _RandomAccessContainer_requirement_violation (line 224) | static void FILE: stl-3.3-source/defalloc.h function T (line 38) | T* allocate(ptrdiff_t size, T*) { function deallocate (line 50) | void deallocate(T* buffer) { type T (line 58) | typedef T* pointer; type T (line 59) | typedef const T* const_pointer; type T (line 60) | typedef T& reference; type T (line 61) | typedef const T& const_reference; type size_type (line 62) | typedef size_t size_type; type difference_type (line 63) | typedef ptrdiff_t difference_type; function pointer (line 64) | pointer allocate(size_type n) { function deallocate (line 67) | void deallocate(pointer p) { ::deallocate(p); } function pointer (line 68) | pointer address(reference x) { return (pointer)&x; } function const_pointer (line 69) | const_pointer const_address(const_reference x) { function size_type (line 72) | size_type init_page_size() { function class (line 80) | class allocator { FILE: stl-3.3-source/ropeimpl.h type basic_ostream (line 806) | typedef basic_ostream<_CharT,_Traits> _Insert_ostream; type ostream (line 808) | typedef ostream _Insert_ostream; function _Rope_fill (line 915) | inline void _Rope_fill(ostream& __o, size_t __n) function _Rope_is_simple (line 925) | bool _Rope_is_simple(_CharT*) { return false; } function _Rope_is_simple (line 926) | inline bool _Rope_is_simple(char*) { return true; } function _Rope_is_simple (line 927) | inline bool _Rope_is_simple(wchar_t*) { return true; } type typename (line 1534) | typedef typename _Rope_iterator::value_type _CharT; type typename (line 1535) | typedef typename _Rope_iterator::_allocator_type _Alloc; function rotate (line 1555) | inline void rotate(_Rope_iterator __... function rotate (line 1570) | inline void rotate( FILE: stl-3.3-source/sequence_concepts.h function __fill_default_constructor_requirement_violation (line 26) | struct _ERROR_IN_STL_SEQ { function __const_front_function_requirement_violation (line 103) | void function __const_back_function_requirement_violation (line 116) | void function _Sequence_requirement_violation (line 157) | static void function _FrontInsertionSequence_requirement_violation (line 178) | static void function _BackInsertionSequence_requirement_violation (line 190) | static void FILE: stl-3.3-source/stl_algo.h function _InputIter (line 97) | _InputIter find(_InputIter __first, _InputIter __last, function _InputIter (line 107) | _InputIter find_if(_InputIter __first, _InputIter __last, function _InputIter (line 197) | _InputIter find(_InputIter __first, _InputIter __last, function _InputIter (line 207) | _InputIter find_if(_InputIter __first, _InputIter __last, function _OutputIter (line 678) | _OutputIter __unique_copy(_InputIter __first, _InputIter __last, function _OutputIter (line 695) | _OutputIter unique_copy(_InputIter __first, _InputIter __last, function _OutputIter (line 723) | _OutputIter __unique_copy(_InputIter __first, _InputIter __last, function _OutputIter (line 746) | _OutputIter unique_copy(_InputIter __first, _InputIter __last, function reverse (line 796) | void reverse(_BidirectionalIter __first, _BidirectionalIter __last) { function _ForwardIter (line 948) | _ForwardIter rotate(_ForwardIter __first, _ForwardIter __middle, function _Distance (line 969) | _Distance __random_number(_Distance __n) { function random_shuffle (line 980) | void random_shuffle(_RandomAccessIter __first, function _RandomAccessIter (line 1094) | _RandomAccessIter function _RandomAccessIter (line 1107) | _RandomAccessIter function _ForwardIter (line 1169) | _ForwardIter partition(_ForwardIter __first, function _ForwardIter (line 1231) | _ForwardIter function _ForwardIter (line 1246) | _ForwardIter stable_partition(_ForwardIter __first, function __linear_insert (line 1326) | void __linear_insert(_RandomAccessIter __first, function __linear_insert (line 1338) | void __linear_insert(_RandomAccessIter __first, function __unguarded_insertion_sort (line 1386) | void __unguarded_insertion_sort(_RandomAccessIter __first, function _Size (line 1416) | _Size __lg(_Size __n) { function sort (line 1466) | void sort(_RandomAccessIter __first, _RandomAccessIter __last) { function sort (line 1479) | void sort(_RandomAccessIter __first, _RandomAccessIter __last, function stable_sort (line 1709) | void stable_sort(_RandomAccessIter __first, function partial_sort (line 1756) | void partial_sort(_RandomAccessIter __first, function _RandomAccessIter (line 1793) | _RandomAccessIter function _RandomAccessIter (line 1838) | _RandomAccessIter function nth_element (line 1903) | void nth_element(_RandomAccessIter __first, _RandomAccessIter __nth, function _ForwardIter (line 1940) | _ForwardIter lower_bound(_ForwardIter __first, _ForwardIter __last, function _ForwardIter (line 1975) | _ForwardIter lower_bound(_ForwardIter __first, _ForwardIter __last, function _ForwardIter (line 2010) | _ForwardIter upper_bound(_ForwardIter __first, _ForwardIter __last, function _ForwardIter (line 2045) | _ForwardIter upper_bound(_ForwardIter __first, _ForwardIter __last, function inplace_merge (line 2512) | void inplace_merge(_BidirectionalIter __first, type reverse_iterator (line 3111) | typedef reverse_iterator<_BidirectionalIter1> _RevIter1; type reverse_iterator (line 3112) | typedef reverse_iterator<_BidirectionalIter2> _RevIter2; type reverse_iterator (line 3138) | typedef reverse_iterator<_BidirectionalIter1> _RevIter1; type reverse_iterator (line 3139) | typedef reverse_iterator<_BidirectionalIter2> _RevIter2; function _ForwardIter1 (line 3160) | _ForwardIter1 function _ForwardIter1 (line 3176) | _ForwardIter1 function is_heap (line 3225) | bool is_heap(_RandomAccessIter __first, _RandomAccessIter __last) function is_heap (line 3235) | bool is_heap(_RandomAccessIter __first, _RandomAccessIter __last, FILE: stl-3.3-source/stl_algobase.h function iter_swap (line 79) | void iter_swap(_ForwardIter1 __a, _ForwardIter2 __b) { function _OutputIter (line 139) | _OutputIter __copy(_InputIter __first, _InputIter __last, function _OutputIter (line 149) | _OutputIter function _Tp (line 162) | _Tp* function _OutputIter (line 171) | _OutputIter __copy_aux2(_InputIter __first, _InputIter __last, function _OutputIter (line 179) | _OutputIter __copy_aux2(_InputIter __first, _InputIter __last, function _Tp (line 189) | _Tp* __copy_aux2(_Tp* __first, _Tp* __last, _Tp* __result, function _Tp (line 197) | _Tp* __copy_aux2(const _Tp* __first, const _Tp* __last, _Tp* __result, function _OutputIter (line 204) | _OutputIter __copy_aux(_InputIter __first, _InputIter __last, function _OutputIter (line 212) | _OutputIter copy(_InputIter __first, _InputIter __last, function _OutputIter (line 225) | static _OutputIter copy(_InputIter __first, _InputIter __last, function _OutputIter (line 250) | _OutputIter copy(_InputIter __first, _InputIter __last, function _OutputIter (line 267) | _OutputIter copy(_InputIter __first, _InputIter __last, function _BidirectionalIter (line 321) | _BidirectionalIter __copy_backward(_RandomAccessIter __first, type typename (line 343) | typedef typename iterator_traits<_BidirectionalIter1>::iterator_category type typename (line 345) | typedef typename iterator_traits<_BidirectionalIter1>::difference_type function _BidirectionalIter2 (line 348) | static _BidirectionalIter2 copy(_BidirectionalIter1 __first, function _BI2 (line 375) | _BI2 copy_backward(_BI1 __first, _BI1 __last, _BI2 __result) { function _BI2 (line 390) | _BI2 copy_backward(_BI1 __first, _BI1 __last, _BI2 __result) { function fill (line 458) | inline void fill(unsigned char* __first, unsigned char* __last, function fill (line 464) | inline void fill(signed char* __first, signed char* __last, function fill (line 470) | inline void fill(char* __first, char* __last, const char& __c) { function equal (line 534) | bool equal(_InputIter1 __first1, _InputIter1 __last1, function equal (line 549) | bool equal(_InputIter1 __first1, _InputIter1 __last1, function lexicographical_compare (line 598) | inline bool function lexicographical_compare (line 610) | inline bool lexicographical_compare(const char* __first1, const char* __... function __lexicographical_compare_3way (line 646) | inline int function __lexicographical_compare_3way (line 659) | inline int FILE: stl-3.3-source/stl_alloc.h function deallocate (line 129) | static void deallocate(void* __p, size_t /* __n */) type __malloc_alloc_template (line 188) | typedef __malloc_alloc_template<0> malloc_alloc; function _Tp (line 196) | static _Tp* allocate(void) function deallocate (line 198) | static void deallocate(_Tp* __p, size_t __n) function deallocate (line 200) | static void deallocate(_Tp* __p) function deallocate (line 227) | static void deallocate(void* __p, size_t __n) type malloc_alloc (line 250) | typedef malloc_alloc alloc; type malloc_alloc (line 251) | typedef malloc_alloc single_client_alloc; function _S_round_up (line 299) | static size_t function _S_freelist_index (line 315) | static size_t _S_freelist_index(size_t __bytes) { function class (line 339) | class _Lock { function deallocate (line 378) | static void deallocate(void* __p, size_t __n) type __default_alloc_template (line 402) | typedef __default_alloc_template<__NODE_ALLOCATOR_THREADS, 0> alloc; type alloc (line 590) | typedef alloc _Alloc; type difference_type (line 593) | typedef ptrdiff_t difference_type; type _Tp (line 594) | typedef _Tp* pointer; type _Tp (line 595) | typedef const _Tp* const_pointer; type _Tp (line 596) | typedef _Tp& reference; type _Tp (line 597) | typedef const _Tp& const_reference; type _Tp (line 598) | typedef _Tp value_type; type allocator (line 601) | typedef allocator<_Tp1> other; function __STL_NOTHROW (line 605) | allocator(const allocator&) __STL_NOTHROW {} type difference_type (line 634) | typedef ptrdiff_t difference_type; type value_type (line 637) | typedef void value_type; type allocator (line 640) | typedef allocator<_Tp1> other; type size_type (line 668) | typedef size_t size_type; type difference_type (line 669) | typedef ptrdiff_t difference_type; type _Tp (line 670) | typedef _Tp* pointer; type _Tp (line 671) | typedef const _Tp* const_pointer; type _Tp (line 672) | typedef _Tp& reference; type _Tp (line 673) | typedef const _Tp& const_reference; type _Tp (line 674) | typedef _Tp value_type; type __allocator (line 677) | typedef __allocator<_Tp1, _Alloc> other; function __underlying_alloc (line 681) | __allocator(const __allocator& __a) __STL_NOTHROW function pointer (line 688) | pointer address(reference __x) const { return &__x; } function const_pointer (line 689) | const_pointer address(const_reference __x) const { return &__x; } function deallocate (line 699) | void deallocate(pointer __p, size_type __n) function construct (line 705) | void construct(pointer __p, const _Tp& __val) { new(__p) _Tp(__val); } function destroy (line 706) | void destroy(pointer __p) { __p->~_Tp(); } type difference_type (line 712) | typedef ptrdiff_t difference_type; type value_type (line 715) | typedef void value_type; type __allocator (line 718) | typedef __allocator<_Tp1, _Alloc> other; type typename (line 805) | typedef typename _Allocator::__STL_TEMPLATE type simple_alloc (line 818) | typedef simple_alloc<_Tp, alloc> _Alloc_type; type allocator (line 819) | typedef allocator<_Tp> allocator_type; type simple_alloc (line 828) | typedef simple_alloc<_Tp, __malloc_alloc_template<__inst> > _Alloc_type; type __allocator (line 829) | typedef __allocator<_Tp, __malloc_alloc_template<__inst> > allocator_type; type simple_alloc (line 836) | typedef simple_alloc<_Tp, __default_alloc_template<__threads, __inst> > type __allocator (line 838) | typedef __allocator<_Tp, __default_alloc_template<__threads, __inst> > type simple_alloc (line 846) | typedef simple_alloc<_Tp, debug_alloc<_Alloc> > _Alloc_type; type __allocator (line 847) | typedef __allocator<_Tp, debug_alloc<_Alloc> > allocator_type; type simple_alloc (line 858) | typedef simple_alloc<_Tp, __malloc_alloc_template<__inst> > _Alloc_type; type __allocator (line 859) | typedef __allocator<_Tp, __malloc_alloc_template<__inst> > allocator_type; type simple_alloc (line 868) | typedef simple_alloc<_Tp, __default_alloc_template<__thr,__inst> > type __allocator (line 870) | typedef __allocator<_Tp, __default_alloc_template<__thr,__inst> > type simple_alloc (line 878) | typedef simple_alloc<_Tp, debug_alloc<_Alloc> > _Alloc_type; type __allocator (line 879) | typedef __allocator<_Tp, debug_alloc<_Alloc> > allocator_type; FILE: stl-3.3-source/stl_bvector.h type _Bit_reference (line 43) | struct _Bit_reference { function flip (line 65) | void flip() { *_M_p ^= _M_mask; } function swap (line 68) | inline void swap(_Bit_reference __x, _Bit_reference __y) type _Bit_iterator_base (line 75) | struct _Bit_iterator_base function _M_bump_down (line 89) | void _M_bump_down() { function _M_incr (line 96) | void _M_incr(ptrdiff_t __i) { function _Bit_iterator_base (line 133) | struct _Bit_iterator : public _Bit_iterator_base function reference (line 179) | reference operator[](difference_type __i) { return *(*this + __i); } function _Bit_iterator_base (line 186) | struct _Bit_const_iterator : public _Bit_iterator_base function const_reference (line 236) | const_reference operator[](difference_type __i) { function _M_deallocate (line 294) | void _M_deallocate() { function _Base (line 316) | _Bvector_base(const allocator_type& __a) : _Base(__a) {} function _M_deallocate (line 338) | void _M_deallocate() { type size_type (line 379) | typedef size_t size_type; type difference_type (line 380) | typedef ptrdiff_t difference_type; type _Bit_reference (line 381) | typedef _Bit_reference reference; type const_reference (line 382) | typedef bool const_reference; type _Bit_reference (line 383) | typedef _Bit_reference* pointer; type _Bit_iterator (line 386) | typedef _Bit_iterator iterator; type _Bit_const_iterator (line 387) | typedef _Bit_const_iterator const_iterator; type reverse_iterator (line 390) | typedef reverse_iterator const_reverse_iterator; type reverse_iterator (line 391) | typedef reverse_iterator reverse_iterator; type reverse_iterator (line 393) | typedef reverse_iterator type typename (line 399) | typedef typename __BVECTOR_BASE::allocator_type allocator_type; function _M_insert_aux (line 420) | void _M_insert_aux(iterator __position, bool __x) { function iterator (line 498) | iterator end() { return _M_finish; } function reverse_iterator (line 501) | reverse_iterator rbegin() { return reverse_iterator(end()); } function reverse_iterator (line 505) | reverse_iterator rend() { return reverse_iterator(begin()); } function reference (line 517) | reference operator[](size_type __n) function const_reference (line 519) | const_reference operator[](size_type __n) const function _M_range_check (line 523) | void _M_range_check(size_type __n) const { function reference (line 528) | reference at(size_type __n) function const_reference (line 530) | const_reference at(size_type __n) const function __BVECTOR_BASE (line 535) | __BVECTOR_BASE(__a) {} function explicit (line 545) | explicit __VECTOR(size_type __n) function __BVECTOR_BASE (line 552) | __VECTOR(const __VECTOR& __x) : __BVECTOR_BASE(__x.get_allocator()) { function __BVECTOR_BASE (line 576) | __BVECTOR_BASE(__a) function _M_fill_assign (line 623) | void _M_fill_assign(size_t __n, bool __x) { function assign (line 634) | void assign(size_t __n, bool __x) { _M_fill_assign(__n, __x); } type typename (line 640) | typedef typename _Is_integer<_InputIterator>::_Integral _Integral; function reserve (line 681) | void reserve(size_type __n) { function reference (line 691) | reference front() { return *begin(); } function reference (line 693) | reference back() { return *(end() - 1); } function push_back (line 695) | void push_back(bool __x) { function swap (line 701) | void swap(__BVECTOR& __x) { function iterator (line 706) | iterator insert(iterator __position, bool __x = bool()) { type typename (line 734) | typedef typename _Is_integer<_InputIterator>::_Integral _Integral; function insert (line 739) | void insert(iterator __position, function insert (line 761) | void insert(iterator __position, const bool* __first, const bool* __last) { function _M_fill_insert (line 783) | void _M_fill_insert(iterator __position, size_type __n, bool __x) { function insert (line 802) | void insert(iterator __position, size_type __n, bool __x) { function pop_back (line 806) | void pop_back() { --_M_finish; } function iterator (line 807) | iterator erase(iterator __position) { function iterator (line 813) | iterator erase(iterator __first, iterator __last) { function resize (line 817) | void resize(size_type __new_size, bool __x = bool()) { function flip (line 823) | void flip() { function clear (line 828) | void clear() { erase(begin(), end()); } type vector (line 834) | typedef vector bit_vector; function swap (line 838) | inline void swap(bit_vector& __x, bit_vector& __y) { FILE: stl-3.3-source/stl_construct.h function __destroy_aux (line 70) | void __destroy_aux(_ForwardIterator, _ForwardIterator, __true_type) {} function __destroy (line 73) | void function _Destroy (line 82) | void _Destroy(_ForwardIterator __first, _ForwardIterator __last) { function _Destroy (line 86) | inline void _Destroy(char*, char*) {} function _Destroy (line 87) | inline void _Destroy(int*, int*) {} function _Destroy (line 88) | inline void _Destroy(long*, long*) {} function _Destroy (line 89) | inline void _Destroy(float*, float*) {} function _Destroy (line 90) | inline void _Destroy(double*, double*) {} function _Destroy (line 92) | inline void _Destroy(wchar_t*, wchar_t*) {} function construct (line 99) | void construct(_T1* __p, const _T2& __value) { function construct (line 104) | void construct(_T1* __p) { function destroy (line 109) | void destroy(_Tp* __pointer) { function destroy (line 114) | void destroy(_ForwardIterator __first, _ForwardIterator __last) { FILE: stl-3.3-source/stl_ctraits_fns.h function const (line 32) | bool operator()(const typename _Traits::char_type& __x, FILE: stl-3.3-source/stl_deque.h function __deque_buf_size (line 79) | inline size_t __deque_buf_size(size_t __size) { type _Deque_iterator (line 85) | typedef _Deque_iterator<_Tp, _Tp&, _Tp*> iterator; type _Deque_iterator (line 86) | typedef _Deque_iterator<_Tp, const function _S_buffer_size (line 87) | static size_t _S_buffer_size() { return __deque_buf_size(sizeof(_Tp)); } type random_access_iterator_tag (line 89) | typedef random_access_iterator_tag iterator_category; type _Tp (line 90) | typedef _Tp value_type; type _Ptr (line 91) | typedef _Ptr pointer; type _Ref (line 92) | typedef _Ref reference; type size_type (line 93) | typedef size_t size_type; type difference_type (line 94) | typedef ptrdiff_t difference_type; type _Tp (line 95) | typedef _Tp** _Map_pointer; type _Deque_iterator (line 97) | typedef _Deque_iterator _Self; function pointer (line 114) | pointer operator->() const { return _M_cur; } function reference (line 179) | reference operator[](difference_type __n) const { return *(*this + __n); } function operator (line 181) | bool operator==(const _Self& __x) const { return _M_cur == __x._M_cur; } function operator (line 182) | bool operator!=(const _Self& __x) const { return !(*this == __x); } function operator (line 183) | bool operator<(const _Self& __x) const { function operator (line 187) | bool operator>(const _Self& __x) const { return __x < *this; } function operator (line 188) | bool operator<=(const _Self& __x) const { return !(__x < *this); } function operator (line 189) | bool operator>=(const _Self& __x) const { return !(*this < __x); } function _M_set_node (line 191) | void _M_set_node(_Map_pointer __new_node) { function random_access_iterator_tag (line 208) | random_access_iterator_tag function _Tp (line 215) | _Tp* value_type(const _Deque_iterator<_Tp,_Ref,_Ptr>&) { return 0; } function _Tp (line 251) | _Tp* _M_allocate_node() { function _M_deallocate_node (line 254) | void _M_deallocate_node(_Tp* __p) { function _Tp (line 257) | _Tp** _M_allocate_map(size_t __n) function _M_deallocate_map (line 259) | void _M_deallocate_map(_Tp** __p, size_t __n) type typename (line 271) | typedef typename _Alloc_traits<_Tp,_Alloc>::allocator_type allocator_type; type typename (line 278) | typedef typename _Alloc_traits<_Tp*, _Alloc>::_Alloc_type _Map_alloc_type; function _Tp (line 280) | _Tp* _M_allocate_node() { function _M_deallocate_node (line 283) | void _M_deallocate_node(_Tp* __p) { function _Tp (line 286) | _Tp** _M_allocate_map(size_t __n) function _M_deallocate_map (line 288) | void _M_deallocate_map(_Tp** __p, size_t __n) type typename (line 304) | typedef typename _Base::allocator_type allocator_type; type _Deque_iterator (line 305) | typedef _Deque_iterator<_Tp,_Tp&,_Tp*> iterator; type _Deque_iterator (line 306) | typedef _Deque_iterator<_Tp,const type _Deque_iterator (line 332) | typedef _Deque_iterator<_Tp,const type _Alloc (line 334) | typedef _Alloc allocator_type; type simple_alloc (line 357) | typedef simple_alloc<_Tp, _Alloc> _Node_alloc_type; type simple_alloc (line 358) | typedef simple_alloc<_Tp*, _Alloc> _Map_alloc_type; function _Tp (line 360) | _Tp* _M_allocate_node() function _M_deallocate_node (line 362) | void _M_deallocate_node(_Tp* __p) function _Tp (line 364) | _Tp** _M_allocate_map(size_t __n) function _M_deallocate_map (line 366) | void _M_deallocate_map(_Tp** __p, size_t __n) type _Deque_base (line 433) | typedef _Deque_base<_Tp, _Alloc> _Base; type value_type (line 436) | typedef value_type* pointer; type value_type (line 437) | typedef const value_type* const_pointer; type value_type (line 438) | typedef value_type& reference; type value_type (line 439) | typedef const value_type& const_reference; type size_type (line 440) | typedef size_t size_type; type difference_type (line 441) | typedef ptrdiff_t difference_type; type typename (line 443) | typedef typename _Base::allocator_type allocator_type; type typename (line 447) | typedef typename _Base::iterator iterator; type typename (line 448) | typedef typename _Base::const_iterator const_iterator; type reverse_iterator (line 451) | typedef reverse_iterator const_reverse_iterator; type reverse_iterator (line 452) | typedef reverse_iterator reverse_iterator; type reverse_iterator (line 454) | typedef reverse_iterator function _S_buffer_size (line 463) | static size_t _S_buffer_size() { return __deque_buf_size(sizeof(_Tp)); } function iterator (line 483) | iterator end() { return _M_finish; } function reverse_iterator (line 487) | reverse_iterator rbegin() { return reverse_iterator(_M_finish); } function reverse_iterator (line 488) | reverse_iterator rend() { return reverse_iterator(_M_start); } function reference (line 494) | reference operator[](size_type __n) function const_reference (line 496) | const_reference operator[](size_type __n) const function _M_range_check (line 500) | void _M_range_check(size_type __n) const { function reference (line 505) | reference at(size_type __n) function const_reference (line 507) | const_reference at(size_type __n) const function reference (line 511) | reference front() { return *_M_start; } function reference (line 512) | reference back() { function _Base (line 531) | deque(const deque& __x) : _Base(__x.get_allocator(), __x.size()) function explicit (line 536) | explicit deque(size_type __n) : _Base(allocator_type(), __n) function _Base (line 544) | _Base(__a) { function swap (line 590) | void swap(deque& __x) { function assign (line 614) | void assign(size_type __n, const _Tp& __val) { type typename (line 622) | typedef typename _Is_integer<_InputIterator>::_Integral _Integral; function push_back (line 670) | void push_back() { function push_front (line 679) | void push_front(const value_type& __t) { function push_front (line 688) | void push_front() { function pop_back (line 698) | void pop_back() { function pop_front (line 707) | void pop_front() { function iterator (line 734) | iterator insert(iterator __position) function insert (line 737) | void insert(iterator __pos, size_type __n, const value_type& __x) type typename (line 747) | typedef typename _Is_integer<_InputIterator>::_Integral _Integral; function resize (line 773) | void resize(size_type __new_size, const value_type& __x) { function resize (line 781) | void resize(size_type new_size) { resize(new_size, value_type()); } function iterator (line 865) | iterator _M_reserve_elements_at_front(size_type __n) { function iterator (line 872) | iterator _M_reserve_elements_at_back(size_type __n) { function else (line 933) | else if (__pos._M_cur == _M_finish._M_cur) { function else (line 961) | else if (__pos._M_cur == _M_finish._M_cur) { function else (line 987) | else if (__pos._M_cur == _M_finish._M_cur) { function else (line 1212) | else if (__pos._M_cur == _M_finish._M_cur) { FILE: stl-3.3-source/stl_exception.h function __STL_BEGIN_NAMESPACE (line 39) | __STL_BEGIN_NAMESPACE FILE: stl-3.3-source/stl_function.h type unary_function (line 37) | struct unary_function { type _Arg1 (line 44) | typedef _Arg1 first_argument_type; type _Arg2 (line 45) | typedef _Arg2 second_argument_type; type _Result (line 46) | typedef _Result result_type; function _Tp (line 81) | _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x % __y; } function _Tp (line 87) | _Tp operator()(const _Tp& __x) const { return -__x; } function const (line 93) | bool operator()(const _Tp& __x, const _Tp& __y) const { return __x == __... function const (line 99) | bool operator()(const _Tp& __x, const _Tp& __y) const { return __x != __... function const (line 105) | bool operator()(const _Tp& __x, const _Tp& __y) const { return __x > __y; } function const (line 111) | bool operator()(const _Tp& __x, const _Tp& __y) const { return __x < __y; } function const (line 117) | bool operator()(const _Tp& __x, const _Tp& __y) const { return __x >= __... function const (line 123) | bool operator()(const _Tp& __x, const _Tp& __y) const { return __x <= __... function const (line 129) | bool operator()(const _Tp& __x, const _Tp& __y) const { return __x && __... function const (line 135) | bool operator()(const _Tp& __x, const _Tp& __y) const { return __x || __... function const (line 141) | bool operator()(const _Tp& __x) const { return !__x; } function const (line 151) | bool operator()(const typename _Predicate::argument_type& __x) const { function const (line 172) | bool operator()(const typename _Predicate::first_argument_type& __x, function typename (line 197) | typename _Operation::result_type type typename (line 207) | typedef typename _Operation::first_argument_type _Arg1_type; function typename (line 222) | typename _Operation::result_type type typename (line 232) | typedef typename _Operation::second_argument_type _Arg2_type; function typename (line 249) | typename _Operation1::result_type function typename (line 274) | typename _Operation1::result_type function explicit (line 295) | explicit pointer_to_unary_function(_Result (*__x)(_Arg)) : _M_ptr(__x) {} function _Result (line 296) | _Result operator()(_Arg __x) const { return _M_ptr(__x); } function explicit (line 312) | explicit pointer_to_binary_function(_Result (*__x)(_Arg1, _Arg2)) function _Result (line 314) | _Result operator()(_Arg1 __x, _Arg2 __y) const { function _Arg2 (line 360) | _Arg2 operator()(const _Arg1&, const _Arg2& __y) const { return __y; } type _Result (line 375) | typedef _Result result_type; function _M_val (line 378) | _Constant_void_fun(const result_type& __v) : _M_val(__v) {} type _Argument (line 384) | typedef _Argument argument_type; type _Result (line 385) | typedef _Result result_type; function _M_val (line 388) | _Constant_unary_fun(const result_type& __v) : _M_val(__v) {} function result_type (line 389) | const result_type& operator()(const _Argument&) const { return _M_val; } type _Arg1 (line 394) | typedef _Arg1 first_argument_type; type _Arg2 (line 395) | typedef _Arg2 second_argument_type; type _Result (line 396) | typedef _Result result_type; function _M_val (line 399) | _Constant_binary_fun(const _Result& __v) : _M_val(__v) {} function result_type (line 400) | const result_type& operator()(const _Arg1&, const _Arg2&) const { function _M_initialize (line 464) | void _M_initialize(unsigned int __seed) function _Ret (line 515) | _Ret operator()(_Tp* __p) const { return (__p->*_M_f)(); } function _Ret (line 524) | _Ret operator()(const _Tp* __p) const { return (__p->*_M_f)(); } function _Ret (line 534) | _Ret operator()(_Tp& __r) const { return (__r.*_M_f)(); } function explicit (line 570) | explicit mem_fun1_ref_t(_Ret (_Tp::*__pf)(_Arg)) : _M_f(__pf) {} function _Ret (line 571) | _Ret operator()(_Tp& __r, _Arg __x) const { return (__r.*_M_f)(__x); } function _Ret (line 580) | _Ret operator()(const _Tp& __r, _Arg __x) const { return (__r.*_M_f)(__x... function explicit (line 590) | explicit mem_fun_t(void (_Tp::*__pf)()) : _M_f(__pf) {} function const (line 591) | void operator()(_Tp* __p) const { (__p->*_M_f)(); } function explicit (line 599) | explicit const_mem_fun_t(void (_Tp::*__pf)() const) : _M_f(__pf) {} function const (line 600) | void operator()(const _Tp* __p) const { (__p->*_M_f)(); } function explicit (line 608) | explicit mem_fun_ref_t(void (_Tp::*__pf)()) : _M_f(__pf) {} function const (line 609) | void operator()(_Tp& __r) const { (__r.*_M_f)(); } function explicit (line 617) | explicit const_mem_fun_ref_t(void (_Tp::*__pf)() const) : _M_f(__pf) {} function const (line 618) | void operator()(const _Tp& __r) const { (__r.*_M_f)(); } function explicit (line 626) | explicit mem_fun1_t(void (_Tp::*__pf)(_Arg)) : _M_f(__pf) {} function const (line 627) | void operator()(_Tp* __p, _Arg __x) const { (__p->*_M_f)(__x); } function explicit (line 636) | explicit const_mem_fun1_t(void (_Tp::*__pf)(_Arg) const) : _M_f(__pf) {} function const (line 637) | void operator()(const _Tp* __p, _Arg __x) const { (__p->*_M_f)(__x); } function explicit (line 646) | explicit mem_fun1_ref_t(void (_Tp::*__pf)(_Arg)) : _M_f(__pf) {} function const (line 647) | void operator()(_Tp& __r, _Arg __x) const { (__r.*_M_f)(__x); } function explicit (line 656) | explicit const_mem_fun1_ref_t(void (_Tp::*__pf)(_Arg) const) : _M_f(__pf... function const (line 657) | void operator()(const _Tp& __r, _Arg __x) const { (__r.*_M_f)(__x); } FILE: stl-3.3-source/stl_hash_fun.h function __STL_BEGIN_NAMESPACE (line 36) | __STL_BEGIN_NAMESPACE function __stl_hash_string (line 40) | inline size_t __stl_hash_string(const char* __s) function const (line 51) | size_t operator()(const char* __s) const { return __stl_hash_string(__s); } function const (line 56) | size_t operator()(const char* __s) const { return __stl_hash_string(__s); } function const (line 60) | size_t operator()(char __x) const { return __x; } function const (line 63) | size_t operator()(unsigned char __x) const { return __x; } function const (line 66) | size_t operator()(unsigned char __x) const { return __x; } function const (line 69) | size_t operator()(short __x) const { return __x; } function const (line 72) | size_t operator()(unsigned short __x) const { return __x; } function const (line 75) | size_t operator()(int __x) const { return __x; } function const (line 78) | size_t operator()(unsigned int __x) const { return __x; } function const (line 81) | size_t operator()(long __x) const { return __x; } function const (line 84) | size_t operator()(unsigned long __x) const { return __x; } FILE: stl-3.3-source/stl_hash_map.h type _Tp (line 73) | typedef _Tp data_type; type _Tp (line 74) | typedef _Tp mapped_type; type typename (line 75) | typedef typename _Ht::value_type value_type; type typename (line 76) | typedef typename _Ht::hasher hasher; type typename (line 77) | typedef typename _Ht::key_equal key_equal; type typename (line 79) | typedef typename _Ht::size_type size_type; type typename (line 80) | typedef typename _Ht::difference_type difference_type; type typename (line 81) | typedef typename _Ht::pointer pointer; type typename (line 82) | typedef typename _Ht::const_pointer const_pointer; type typename (line 83) | typedef typename _Ht::reference reference; type typename (line 84) | typedef typename _Ht::const_reference const_reference; type typename (line 86) | typedef typename _Ht::iterator iterator; type typename (line 87) | typedef typename _Ht::const_iterator const_iterator; type typename (line 89) | typedef typename _Ht::allocator_type allocator_type; function explicit (line 97) | explicit hash_map(size_type __n) function swap (line 164) | void swap(hash_map& __hs) { _M_ht.swap(__hs._M_ht); } function iterator (line 176) | iterator begin() { return _M_ht.begin(); } function iterator (line 177) | iterator end() { return _M_ht.end(); } function insert (line 189) | void insert(const value_type* __f, const value_type* __l) { function insert (line 192) | void insert(const_iterator __f, const_iterator __l) function iterator (line 198) | iterator find(const key_type& __key) { return _M_ht.find(__key); } function const_iterator (line 199) | const_iterator find(const key_type& __key) const function size_type (line 206) | size_type count(const key_type& __key) const { return _M_ht.count(__key); } function size_type (line 214) | size_type erase(const key_type& __key) {return _M_ht.erase(__key); } function erase (line 215) | void erase(iterator __it) { _M_ht.erase(__it); } function erase (line 216) | void erase(iterator __f, iterator __l) { _M_ht.erase(__f, __l); } function clear (line 217) | void clear() { _M_ht.clear(); } function resize (line 219) | void resize(size_type __hint) { _M_ht.resize(__hint); } function size_type (line 222) | size_type elems_in_bucket(size_type __n) const type _Tp (line 285) | typedef _Tp data_type; type _Tp (line 286) | typedef _Tp mapped_type; type typename (line 287) | typedef typename _Ht::value_type value_type; type typename (line 288) | typedef typename _Ht::hasher hasher; type typename (line 289) | typedef typename _Ht::key_equal key_equal; type typename (line 291) | typedef typename _Ht::size_type size_type; type typename (line 292) | typedef typename _Ht::difference_type difference_type; type typename (line 293) | typedef typename _Ht::pointer pointer; type typename (line 294) | typedef typename _Ht::const_pointer const_pointer; type typename (line 295) | typedef typename _Ht::reference reference; type typename (line 296) | typedef typename _Ht::const_reference const_reference; type typename (line 298) | typedef typename _Ht::iterator iterator; type typename (line 299) | typedef typename _Ht::const_iterator const_iterator; type typename (line 301) | typedef typename _Ht::allocator_type allocator_type; function explicit (line 309) | explicit hash_multimap(size_type __n) function swap (line 376) | void swap(hash_multimap& __hs) { _M_ht.swap(__hs._M_ht); } function iterator (line 387) | iterator begin() { return _M_ht.begin(); } function iterator (line 388) | iterator end() { return _M_ht.end(); } function insert (line 400) | void insert(const value_type* __f, const value_type* __l) { function insert (line 403) | void insert(const_iterator __f, const_iterator __l) function iterator (line 406) | iterator insert_noresize(const value_type& __obj) function iterator (line 409) | iterator find(const key_type& __key) { return _M_ht.find(__key); } function const_iterator (line 410) | const_iterator find(const key_type& __key) const function size_type (line 413) | size_type count(const key_type& __key) const { return _M_ht.count(__key); } function size_type (line 421) | size_type erase(const key_type& __key) {return _M_ht.erase(__key); } function erase (line 422) | void erase(iterator __it) { _M_ht.erase(__it); } function erase (line 423) | void erase(iterator __f, iterator __l) { _M_ht.erase(__f, __l); } function clear (line 424) | void clear() { _M_ht.clear(); } function size_type (line 430) | size_type elems_in_bucket(size_type __n) const type output_iterator_tag (line 473) | typedef output_iterator_tag iterator_category; type value_type (line 474) | typedef void value_type; type difference_type (line 475) | typedef void difference_type; type pointer (line 476) | typedef void pointer; type reference (line 477) | typedef void reference; type output_iterator_tag (line 500) | typedef output_iterator_tag iterator_category; type value_type (line 501) | typedef void value_type; type difference_type (line 502) | typedef void difference_type; type pointer (line 503) | typedef void pointer; type reference (line 504) | typedef void reference; FILE: stl-3.3-source/stl_hash_set.h type typename (line 72) | typedef typename _Ht::value_type value_type; type typename (line 73) | typedef typename _Ht::hasher hasher; type typename (line 74) | typedef typename _Ht::key_equal key_equal; type typename (line 76) | typedef typename _Ht::size_type size_type; type typename (line 77) | typedef typename _Ht::difference_type difference_type; type typename (line 78) | typedef typename _Ht::const_pointer pointer; type typename (line 79) | typedef typename _Ht::const_pointer const_pointer; type typename (line 80) | typedef typename _Ht::const_reference reference; type typename (line 81) | typedef typename _Ht::const_reference const_reference; type typename (line 83) | typedef typename _Ht::const_iterator iterator; type typename (line 84) | typedef typename _Ht::const_iterator const_iterator; type typename (line 86) | typedef typename _Ht::allocator_type allocator_type; function explicit (line 95) | explicit hash_set(size_type __n) function swap (line 162) | void swap(hash_set& __hs) { _M_ht.swap(__hs._M_ht); } function insert (line 187) | void insert(const value_type* __f, const value_type* __l) { function insert (line 190) | void insert(const_iterator __f, const_iterator __l) function iterator (line 200) | iterator find(const key_type& __key) const { return _M_ht.find(__key); } function size_type (line 202) | size_type count(const key_type& __key) const { return _M_ht.count(__key); } function size_type (line 207) | size_type erase(const key_type& __key) {return _M_ht.erase(__key); } function erase (line 208) | void erase(iterator __it) { _M_ht.erase(__it); } function erase (line 209) | void erase(iterator __f, iterator __l) { _M_ht.erase(__f, __l); } function clear (line 210) | void clear() { _M_ht.clear(); } function size_type (line 216) | size_type elems_in_bucket(size_type __n) const type typename (line 276) | typedef typename _Ht::value_type value_type; type typename (line 277) | typedef typename _Ht::hasher hasher; type typename (line 278) | typedef typename _Ht::key_equal key_equal; type typename (line 280) | typedef typename _Ht::size_type size_type; type typename (line 281) | typedef typename _Ht::difference_type difference_type; type typename (line 282) | typedef typename _Ht::const_pointer pointer; type typename (line 283) | typedef typename _Ht::const_pointer const_pointer; type typename (line 284) | typedef typename _Ht::const_reference reference; type typename (line 285) | typedef typename _Ht::const_reference const_reference; type typename (line 287) | typedef typename _Ht::const_iterator iterator; type typename (line 288) | typedef typename _Ht::const_iterator const_iterator; type typename (line 290) | typedef typename _Ht::allocator_type allocator_type; function explicit (line 299) | explicit hash_multiset(size_type __n) function swap (line 366) | void swap(hash_multiset& hs) { _M_ht.swap(hs._M_ht); } function insert (line 388) | void insert(const value_type* __f, const value_type* __l) { function insert (line 391) | void insert(const_iterator __f, const_iterator __l) function iterator (line 394) | iterator insert_noresize(const value_type& __obj) function iterator (line 397) | iterator find(const key_type& __key) const { return _M_ht.find(__key); } function size_type (line 399) | size_type count(const key_type& __key) const { return _M_ht.count(__key); } function size_type (line 404) | size_type erase(const key_type& __key) {return _M_ht.erase(__key); } function erase (line 405) | void erase(iterator __it) { _M_ht.erase(__it); } function erase (line 406) | void erase(iterator __f, iterator __l) { _M_ht.erase(__f, __l); } function clear (line 407) | void clear() { _M_ht.clear(); } function size_type (line 413) | size_type elems_in_bucket(size_type __n) const type output_iterator_tag (line 455) | typedef output_iterator_tag iterator_category; type value_type (line 456) | typedef void value_type; type difference_type (line 457) | typedef void difference_type; type pointer (line 458) | typedef void pointer; type reference (line 459) | typedef void reference; type output_iterator_tag (line 482) | typedef output_iterator_tag iterator_category; type value_type (line 483) | typedef void value_type; type difference_type (line 484) | typedef void difference_type; type pointer (line 485) | typedef void pointer; type reference (line 486) | typedef void reference; FILE: stl-3.3-source/stl_hashtable.h function __STL_BEGIN_NAMESPACE (line 47) | __STL_BEGIN_NAMESPACE type _Hashtable_iterator (line 73) | typedef _Hashtable_iterator<_Val, _Key, _HashFcn, type _Hashtable_const_iterator (line 76) | typedef _Hashtable_const_iterator<_Val, _Key, _HashFcn, type _Hashtable_node (line 79) | typedef _Hashtable_node<_Val> _Node; type forward_iterator_tag (line 81) | typedef forward_iterator_tag iterator_category; type _Val (line 82) | typedef _Val value_type; type difference_type (line 83) | typedef ptrdiff_t difference_type; type size_type (line 84) | typedef size_t size_type; type _Val (line 85) | typedef _Val& reference; type _Val (line 86) | typedef _Val* pointer; function reference (line 94) | reference operator*() const { return _M_cur->_M_val; } function pointer (line 96) | pointer operator->() const { return &(operator*()); } type _Hashtable_iterator (line 112) | typedef _Hashtable_iterator<_Val,_Key,_HashFcn, type _Hashtable_const_iterator (line 115) | typedef _Hashtable_const_iterator<_Val, _Key, _HashFcn, type _Hashtable_node (line 118) | typedef _Hashtable_node<_Val> _Node; type forward_iterator_tag (line 120) | typedef forward_iterator_tag iterator_category; type _Val (line 121) | typedef _Val value_type; type difference_type (line 122) | typedef ptrdiff_t difference_type; type size_type (line 123) | typedef size_t size_type; type _Val (line 124) | typedef const _Val& reference; type _Val (line 125) | typedef const _Val* pointer; function pointer (line 137) | pointer operator->() const { return &(operator*()); } function __stl_next_prime (line 160) | inline unsigned long __stl_next_prime(unsigned long __n) type _Val (line 191) | typedef _Val value_type; type _HashFcn (line 192) | typedef _HashFcn hasher; type _EqualKey (line 193) | typedef _EqualKey key_equal; type size_type (line 195) | typedef size_t size_type; type difference_type (line 196) | typedef ptrdiff_t difference_type; type value_type (line 197) | typedef value_type* pointer; type value_type (line 198) | typedef const value_type* const_pointer; type value_type (line 199) | typedef value_type& reference; type value_type (line 200) | typedef const value_type& const_reference; function _Node (line 214) | _Node* _M_get_node() { return _M_node_allocator.allocate(1); } function _M_put_node (line 215) | void _M_put_node(_Node* __p) { _M_node_allocator.deallocate(__p, 1); } function _Node (line 223) | _Node* _M_get_node() { return _M_node_allocator_type::allocate(1); } function _M_put_node (line 224) | void _M_put_node(_Node* __p) { _M_node_allocator_type::deallocate(__p, 1... type _Hashtable_const_iterator (line 238) | typedef _Hashtable_const_iterator<_Val,_Key,_HashFcn,_ExtractKey,_EqualKey, function swap (line 308) | void swap(hashtable& __ht) function iterator (line 317) | iterator begin() function iterator (line 325) | iterator end() { return iterator(0, this); } function size_type (line 353) | size_type elems_in_bucket(size_type __bucket) const function iterator (line 367) | iterator insert_equal(const value_type& __obj) function insert_unique (line 428) | void insert_unique(const value_type* __f, const value_type* __l) function insert_equal (line 436) | void insert_equal(const value_type* __f, const value_type* __l) function insert_unique (line 444) | void insert_unique(const_iterator __f, const_iterator __l) function insert_equal (line 453) | void insert_equal(const_iterator __f, const_iterator __l) function iterator (line 465) | iterator find(const key_type& __key) function const_iterator (line 476) | const_iterator find(const key_type& __key) const function size_type (line 487) | size_type count(const key_type& __key) const function _M_initialize_buckets (line 518) | void _M_initialize_buckets(size_type __n) function size_type (line 526) | size_type _M_bkt_num_key(const key_type& __key) const function size_type (line 531) | size_type _M_bkt_num(const value_type& __obj) const function size_type (line 536) | size_type _M_bkt_num_key(const key_type& __key, size_t __n) const function size_type (line 541) | size_type _M_bkt_num(const value_type& __obj, size_t __n) const function _Node (line 546) | _Node* _M_new_node(const value_type& __obj) function _M_delete_node (line 557) | void _M_delete_node(_Node* __n) FILE: stl-3.3-source/stl_heap.h function __push_heap_aux (line 56) | void function push_heap (line 65) | void function __push_heap_aux (line 92) | void function push_heap (line 102) | void function __pop_heap (line 133) | void function __pop_heap_aux (line 142) | void function pop_heap (line 151) | void pop_heap(_RandomAccessIterator __first, function __pop_heap (line 184) | void function __pop_heap_aux (line 195) | void function pop_heap (line 204) | void FILE: stl-3.3-source/stl_iterator.h type output_iterator_tag (line 43) | typedef output_iterator_tag iterator_category; type value_type (line 44) | typedef void value_type; type difference_type (line 45) | typedef void difference_type; type pointer (line 46) | typedef void pointer; type reference (line 47) | typedef void reference; function explicit (line 49) | explicit back_insert_iterator(_Container& __x) : container(&__x) {} type output_iterator_tag (line 82) | typedef output_iterator_tag iterator_category; type value_type (line 83) | typedef void value_type; type difference_type (line 84) | typedef void difference_type; type pointer (line 85) | typedef void pointer; type reference (line 86) | typedef void reference; function explicit (line 88) | explicit front_insert_iterator(_Container& __x) : container(&__x) {} type output_iterator_tag (line 122) | typedef output_iterator_tag iterator_category; type value_type (line 123) | typedef void value_type; type difference_type (line 124) | typedef void difference_type; type pointer (line 125) | typedef void pointer; type reference (line 126) | typedef void reference; type typename (line 156) | typedef typename _Container::iterator __iter; type reverse_bidirectional_iterator (line 168) | typedef reverse_bidirectional_iterator<_BidirectionalIterator, _Tp, type _Tp (line 174) | typedef _Tp value_type; type _Distance (line 175) | typedef _Distance difference_type; type _Tp (line 176) | typedef _Tp* pointer; type _Reference (line 177) | typedef _Reference reference; function explicit (line 180) | explicit reverse_bidirectional_iterator(_BidirectionalIterator __x) function _Reference (line 183) | _Reference operator*() const { function pointer (line 188) | pointer operator->() const { return &(operator*()); } FILE: stl-3.3-source/stl_iterator_base.h function __STL_BEGIN_NAMESPACE (line 40) | __STL_BEGIN_NAMESPACE type output_iterator_tag (line 43) | struct output_iterator_tag {} function input_iterator_tag (line 44) | struct forward_iterator_tag : public input_iterator_tag {} function forward_iterator_tag (line 45) | struct bidirectional_iterator_tag : public forward_iterator_tag {} function bidirectional_iterator_tag (line 46) | struct random_access_iterator_tag : public bidirectional_iterator_tag {} type input_iterator_tag (line 54) | typedef input_iterator_tag iterator_category; type _Tp (line 55) | typedef _Tp value_type; type _Distance (line 56) | typedef _Distance difference_type; type _Tp (line 57) | typedef _Tp* pointer; type _Tp (line 58) | typedef _Tp& reference; type output_iterator (line 61) | struct output_iterator { type forward_iterator_tag (line 70) | typedef forward_iterator_tag iterator_category; type _Tp (line 71) | typedef _Tp value_type; type _Distance (line 72) | typedef _Distance difference_type; type _Tp (line 73) | typedef _Tp* pointer; type _Tp (line 74) | typedef _Tp& reference; type bidirectional_iterator_tag (line 79) | typedef bidirectional_iterator_tag iterator_category; type _Tp (line 80) | typedef _Tp value_type; type _Distance (line 81) | typedef _Distance difference_type; type _Tp (line 82) | typedef _Tp* pointer; type _Tp (line 83) | typedef _Tp& reference; type random_access_iterator_tag (line 87) | typedef random_access_iterator_tag iterator_category; type _Tp (line 88) | typedef _Tp value_type; type _Distance (line 89) | typedef _Distance difference_type; type _Tp (line 90) | typedef _Tp* pointer; type _Tp (line 91) | typedef _Tp& reference; type _Category (line 98) | typedef _Category iterator_category; type _Tp (line 99) | typedef _Tp value_type; type _Distance (line 100) | typedef _Distance difference_type; type _Pointer (line 101) | typedef _Pointer pointer; type _Reference (line 102) | typedef _Reference reference; type typename (line 110) | typedef typename _Iterator::iterator_category iterator_category; type typename (line 111) | typedef typename _Iterator::value_type value_type; type typename (line 112) | typedef typename _Iterator::difference_type difference_type; type typename (line 113) | typedef typename _Iterator::pointer pointer; type typename (line 114) | typedef typename _Iterator::reference reference; type random_access_iterator_tag (line 119) | typedef random_access_iterator_tag iterator_category; type _Tp (line 120) | typedef _Tp value_type; type difference_type (line 121) | typedef ptrdiff_t difference_type; type _Tp (line 122) | typedef _Tp* pointer; type _Tp (line 123) | typedef _Tp& reference; type random_access_iterator_tag (line 128) | typedef random_access_iterator_tag iterator_category; type _Tp (line 129) | typedef _Tp value_type; type difference_type (line 130) | typedef ptrdiff_t difference_type; type _Tp (line 131) | typedef const _Tp* pointer; type _Tp (line 132) | typedef const _Tp& reference; type typename (line 146) | typedef typename iterator_traits<_Iter>::iterator_category _Category; FILE: stl-3.3-source/stl_list.h type _List_node_base (line 43) | struct _List_node_base { function _M_decr (line 53) | struct _List_iterator_base { type _List_iterator (line 76) | typedef _List_iterator<_Tp,_Tp&,_Tp*> iterator; type _List_iterator (line 77) | typedef _List_iterator<_Tp,const type _List_iterator (line 78) | typedef _List_iterator<_Tp,_Ref,_Ptr> _Self; type _Tp (line 80) | typedef _Tp value_type; type _Ptr (line 81) | typedef _Ptr pointer; type _Ref (line 82) | typedef _Ref reference; type _List_node (line 83) | typedef _List_node<_Tp> _Node; function _List_iterator_base (line 85) | _List_iterator_base(__x) {} function _List_iterator_base (line 87) | _List_iterator(const iterator& __x) : _List_iterator_base(__x._M_node) {} function reference (line 89) | reference operator*() const { return ((_Node*) _M_node)->_M_data; } function pointer (line 92) | pointer operator->() const { return &(operator*()); } function bidirectional_iterator_tag (line 117) | inline bidirectional_iterator_tag function _Tp (line 124) | _Tp* function _Node_allocator (line 156) | _List_alloc_base(const allocator_type& __a) : _Node_allocator(__a) {} function _M_put_node (line 161) | void _M_put_node(_List_node<_Tp>* __p) type typename (line 175) | typedef typename _Alloc_traits<_Tp, _Allocator>::allocator_type function _M_put_node (line 185) | void _M_put_node(_List_node<_Tp>* __p) { _Alloc_type::deallocate(__p, 1); } type typename (line 200) | typedef typename _Base::allocator_type allocator_type; function _Base (line 202) | _List_base(const allocator_type& __a) : _Base(__a) { function _M_put_node (line 239) | void _M_put_node(_List_node<_Tp>* __p) { _Alloc_type::deallocate(__p, 1); } type _List_base (line 268) | typedef _List_base<_Tp, _Alloc> _Base; type value_type (line 274) | typedef value_type* pointer; type value_type (line 275) | typedef const value_type* const_pointer; type value_type (line 276) | typedef value_type& reference; type value_type (line 277) | typedef const value_type& const_reference; type _List_node (line 278) | typedef _List_node<_Tp> _Node; type size_type (line 279) | typedef size_t size_type; type difference_type (line 280) | typedef ptrdiff_t difference_type; type typename (line 282) | typedef typename _Base::allocator_type allocator_type; function allocator_type (line 283) | allocator_type get_allocator() const { return _Base::get_allocator(); } function _Node (line 319) | _Node* _M_create_node() function iterator (line 332) | iterator begin() { return (_Node*)(_M_node->_M_next); } function iterator (line 335) | iterator end() { return _M_node; } function reverse_iterator (line 338) | reverse_iterator rbegin() function const_reverse_iterator (line 340) | const_reverse_iterator rbegin() const function size_type (line 349) | size_type size() const { function reference (line 356) | reference front() { return *begin(); } function reference (line 358) | reference back() { return *(--end()); } function swap (line 361) | void swap(list<_Tp, _Alloc>& __x) { __STD::swap(_M_node, __x._M_node); } function iterator (line 363) | iterator insert(iterator __position, const _Tp& __x) { function iterator (line 371) | iterator insert(iterator __position) { return insert(__position, _Tp()); } type typename (line 388) | typedef typename _Is_integer<_InputIterator>::_Integral _Integral; function insert (line 397) | void insert(iterator __pos, size_type __n, const _Tp& __x) function push_front (line 401) | void push_front(const _Tp& __x) { insert(begin(), __x); } function push_front (line 402) | void push_front() {insert(begin());} function push_back (line 403) | void push_back(const _Tp& __x) { insert(end(), __x); } function push_back (line 404) | void push_back() {insert(end());} function iterator (line 406) | iterator erase(iterator __position) { function clear (line 417) | void clear() { _Base::clear(); } function resize (line 420) | void resize(size_type __new_size) { this->resize(__new_size, _Tp()); } function pop_front (line 422) | void pop_front() { erase(begin()); } function pop_back (line 423) | void pop_back() { function explicit (line 431) | explicit list(size_type __n) function _Base (line 442) | _Base(__a) type typename (line 478) | typedef typename _Is_integer<_InputIterator>::_Integral _Integral; function splice (line 513) | void splice(iterator __position, list&, iterator __i) { function splice (line 519) | void splice(iterator __position, list&, iterator __first, iterator __las... type typename (line 541) | typedef typename list<_Tp,_Alloc>::const_iterator const_iterator; function __List_base_reverse (line 757) | inline void __List_base_reverse(_List_node_base* __p) FILE: stl-3.3-source/stl_map.h type _Key (line 68) | typedef _Key key_type; type _Tp (line 69) | typedef _Tp data_type; type _Tp (line 70) | typedef _Tp mapped_type; type pair (line 71) | typedef pair value_type; type _Compare (line 72) | typedef _Compare key_compare; function comp (line 79) | value_compare(_Compare __c) : comp(__c) {} type typename (line 92) | typedef typename _Rep_type::const_pointer const_pointer; type typename (line 93) | typedef typename _Rep_type::reference reference; type typename (line 94) | typedef typename _Rep_type::const_reference const_reference; type typename (line 95) | typedef typename _Rep_type::iterator iterator; type typename (line 96) | typedef typename _Rep_type::const_iterator const_iterator; type typename (line 97) | typedef typename _Rep_type::reverse_iterator reverse_iterator; type typename (line 98) | typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator; type typename (line 99) | typedef typename _Rep_type::size_type size_type; type typename (line 100) | typedef typename _Rep_type::difference_type difference_type; type typename (line 101) | typedef typename _Rep_type::allocator_type allocator_type; function explicit (line 106) | explicit map(const _Compare& __comp, function iterator (line 154) | iterator begin() { return _M_t.begin(); } function iterator (line 156) | iterator end() { return _M_t.end(); } function reverse_iterator (line 158) | reverse_iterator rbegin() { return _M_t.rbegin(); } function reverse_iterator (line 160) | reverse_iterator rend() { return _M_t.rend(); } function swap (line 172) | void swap(map<_Key,_Tp,_Compare,_Alloc>& __x) { _M_t.swap(__x._M_t); } function iterator (line 178) | iterator insert(iterator position, const value_type& __x) function insert (line 186) | void insert(const value_type* __first, const value_type* __last) { function insert (line 189) | void insert(const_iterator __first, const_iterator __last) { function erase (line 194) | void erase(iterator __position) { _M_t.erase(__position); } function size_type (line 195) | size_type erase(const key_type& __x) { return _M_t.erase(__x); } function erase (line 196) | void erase(iterator __first, iterator __last) function clear (line 198) | void clear() { _M_t.clear(); } function iterator (line 202) | iterator find(const key_type& __x) { return _M_t.find(__x); } function const_iterator (line 203) | const_iterator find(const key_type& __x) const { return _M_t.find(__x); } function size_type (line 204) | size_type count(const key_type& __x) const { function iterator (line 207) | iterator lower_bound(const key_type& __x) {return _M_t.lower_bound(__x); } function const_iterator (line 208) | const_iterator lower_bound(const key_type& __x) const { function iterator (line 211) | iterator upper_bound(const key_type& __x) {return _M_t.upper_bound(__x); } function const_iterator (line 212) | const_iterator upper_bound(const key_type& __x) const { FILE: stl-3.3-source/stl_multimap.h type _Tp (line 70) | typedef _Tp data_type; type _Tp (line 71) | typedef _Tp mapped_type; type pair (line 72) | typedef pair value_type; type _Compare (line 73) | typedef _Compare key_compare; function comp (line 79) | value_compare(_Compare __c) : comp(__c) {} type typename (line 92) | typedef typename _Rep_type::const_pointer const_pointer; type typename (line 93) | typedef typename _Rep_type::reference reference; type typename (line 94) | typedef typename _Rep_type::const_reference const_reference; type typename (line 95) | typedef typename _Rep_type::iterator iterator; type typename (line 96) | typedef typename _Rep_type::const_iterator const_iterator; type typename (line 97) | typedef typename _Rep_type::reverse_iterator reverse_iterator; type typename (line 98) | typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator; type typename (line 99) | typedef typename _Rep_type::size_type size_type; type typename (line 100) | typedef typename _Rep_type::difference_type difference_type; type typename (line 101) | typedef typename _Rep_type::allocator_type allocator_type; function explicit (line 106) | explicit multimap(const _Compare& __comp, function iterator (line 152) | iterator begin() { return _M_t.begin(); } function iterator (line 154) | iterator end() { return _M_t.end(); } function reverse_iterator (line 156) | reverse_iterator rbegin() { return _M_t.rbegin(); } function reverse_iterator (line 158) | reverse_iterator rend() { return _M_t.rend(); } function swap (line 163) | void swap(multimap<_Key,_Tp,_Compare,_Alloc>& __x) { _M_t.swap(__x._M_t); } function iterator (line 167) | iterator insert(const value_type& __x) { return _M_t.insert_equal(__x); } function iterator (line 168) | iterator insert(iterator __position, const value_type& __x) { function insert (line 177) | void insert(const value_type* __first, const value_type* __last) { function insert (line 180) | void insert(const_iterator __first, const_iterator __last) { function erase (line 184) | void erase(iterator __position) { _M_t.erase(__position); } function size_type (line 185) | size_type erase(const key_type& __x) { return _M_t.erase(__x); } function erase (line 186) | void erase(iterator __first, iterator __last) function clear (line 188) | void clear() { _M_t.clear(); } function iterator (line 192) | iterator find(const key_type& __x) { return _M_t.find(__x); } function const_iterator (line 193) | const_iterator find(const key_type& __x) const { return _M_t.find(__x); } function size_type (line 194) | size_type count(const key_type& __x) const { return _M_t.count(__x); } function iterator (line 195) | iterator lower_bound(const key_type& __x) {return _M_t.lower_bound(__x); } function const_iterator (line 196) | const_iterator lower_bound(const key_type& __x) const { function iterator (line 199) | iterator upper_bound(const key_type& __x) {return _M_t.upper_bound(__x); } function const_iterator (line 200) | const_iterator upper_bound(const key_type& __x) const { FILE: stl-3.3-source/stl_multiset.h type _Key (line 69) | typedef _Key value_type; type _Compare (line 70) | typedef _Compare key_compare; type _Compare (line 71) | typedef _Compare value_compare; type typename (line 78) | typedef typename _Rep_type::const_pointer const_pointer; type typename (line 79) | typedef typename _Rep_type::const_reference reference; type typename (line 80) | typedef typename _Rep_type::const_reference const_reference; type typename (line 81) | typedef typename _Rep_type::const_iterator iterator; type typename (line 82) | typedef typename _Rep_type::const_iterator const_iterator; type typename (line 83) | typedef typename _Rep_type::const_reverse_iterator reverse_iterator; type typename (line 84) | typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator; type typename (line 85) | typedef typename _Rep_type::size_type size_type; type typename (line 86) | typedef typename _Rep_type::difference_type difference_type; type typename (line 87) | typedef typename _Rep_type::allocator_type allocator_type; function explicit (line 92) | explicit multiset(const _Compare& __comp, function swap (line 151) | void swap(multiset<_Key,_Compare,_Alloc>& __x) { _M_t.swap(__x._M_t); } function iterator (line 154) | iterator insert(const value_type& __x) { function iterator (line 157) | iterator insert(iterator __position, const value_type& __x) { function insert (line 168) | void insert(const value_type* __first, const value_type* __last) { function insert (line 171) | void insert(const_iterator __first, const_iterator __last) { function erase (line 175) | void erase(iterator __position) { function size_type (line 179) | size_type erase(const key_type& __x) { function erase (line 182) | void erase(iterator __first, iterator __last) { function clear (line 186) | void clear() { _M_t.clear(); } function iterator (line 190) | iterator find(const key_type& __x) const { return _M_t.find(__x); } function size_type (line 191) | size_type count(const key_type& __x) const { return _M_t.count(__x); } function iterator (line 192) | iterator lower_bound(const key_type& __x) const { function iterator (line 195) | iterator upper_bound(const key_type& __x) const { FILE: stl-3.3-source/stl_numeric.h function _Tp (line 217) | _Tp __power(_Tp __x, _Integer __n) function _Tp (line 226) | _Tp power(_Tp __x, _Integer __n, _MonoidOperation __opr) function _Tp (line 232) | _Tp power(_Tp __x, _Integer __n) FILE: stl-3.3-source/stl_pair.h type pair (line 37) | struct pair { FILE: stl-3.3-source/stl_queue.h type typename (line 59) | typedef typename _Sequence::value_type _Sequence_value_type; type typename (line 79) | typedef typename _Sequence::size_type size_type; type _Sequence (line 80) | typedef _Sequence container_type; type typename (line 82) | typedef typename _Sequence::reference reference; type typename (line 83) | typedef typename _Sequence::const_reference const_reference; function explicit (line 88) | explicit queue(const _Sequence& __c) : c(__c) {} function reference (line 92) | reference front() { return c.front(); } function reference (line 94) | reference back() { return c.back(); } function push (line 96) | void push(const value_type& __x) { c.push_back(__x); } function pop (line 97) | void pop() { c.pop_front(); } type typename (line 157) | typedef typename _Sequence::value_type _Sequence_value_type; type typename (line 163) | typedef typename _Sequence::size_type size_type; type _Sequence (line 164) | typedef _Sequence container_type; type typename (line 166) | typedef typename _Sequence::reference reference; type typename (line 167) | typedef typename _Sequence::const_reference const_reference; function explicit (line 173) | explicit priority_queue(const _Compare& __x) : c(), comp(__x) {} function push (line 219) | void push(const value_type& __x) { function pop (line 226) | void pop() { FILE: stl-3.3-source/stl_range_errors.h function __STL_BEGIN_NAMESPACE (line 50) | __STL_BEGIN_NAMESPACE function __stl_throw_length_error (line 53) | inline void __stl_throw_length_error(const char* __msg) function __STL_BEGIN_NAMESPACE (line 60) | __STL_BEGIN_NAMESPACE function __stl_throw_length_error (line 62) | inline void __stl_throw_length_error(const char*) {} FILE: stl-3.3-source/stl_raw_storage_iter.h type value_type (line 42) | typedef void value_type; type difference_type (line 43) | typedef void difference_type; type pointer (line 44) | typedef void pointer; type reference (line 45) | typedef void reference; function explicit (line 47) | explicit raw_storage_iterator(_ForwardIterator __x) : _M_iter(__x) {} FILE: stl-3.3-source/stl_rope.h function _CharT (line 49) | _CharT _S_eos(_CharT*) { return _CharT(); } function _S_is_basic_char_type (line 54) | bool _S_is_basic_char_type(_CharT*) { return false; } function _S_is_one_byte_char_type (line 56) | bool _S_is_one_byte_char_type(_CharT*) { return false; } function _S_is_basic_char_type (line 58) | inline bool _S_is_basic_char_type(char*) { return true; } function _S_is_one_byte_char_type (line 59) | inline bool _S_is_one_byte_char_type(char*) { return true; } function _S_is_basic_char_type (line 60) | inline bool _S_is_basic_char_type(wchar_t*) { return true; } type typename (line 110) | typedef typename _Sequence::value_type value_type; type _V (line 112) | typedef _V value_type; function push_back (line 148) | void push_back(value_type __x) function append (line 159) | void append(value_type* __s, size_t __len) type typename (line 413) | typedef typename _Alloc_traits<_CharT,_Allocator>::allocator_type type typename (line 443) | typedef typename _Base::allocator_type allocator_type; function allocator_type (line 456) | static allocator_type get_allocator() { return allocator_type(); } type _Tag (line 483) | enum _Tag {_S_leaf, _S_concat, _S_substringfn, _S_function} type typename (line 494) | typedef typename _Rope_rep_base<_CharT,_Alloc>::allocator_type function _M_unref_nonnil (line 525) | void _M_unref_nonnil() function _M_ref_nonnil (line 529) | void _M_ref_nonnil() function _S_unref (line 533) | static void _S_unref(_Rope_RopeRep* __t) function _S_ref (line 539) | static void _S_ref(_Rope_RopeRep* __t) function _S_free_if_unref (line 543) | static void _S_free_if_unref(_Rope_RopeRep* __t) function _M_unref_nonnil (line 548) | void _M_unref_nonnil() {} function _M_ref_nonnil (line 549) | void _M_ref_nonnil() {} function _S_unref (line 550) | static void _S_unref(_Rope_RopeRep*) {} function _S_ref (line 551) | static void _S_ref(_Rope_RopeRep*) {} function _S_free_if_unref (line 552) | static void _S_free_if_unref(_Rope_RopeRep*) {} function _S_rounded_up_size (line 565) | static size_t _S_rounded_up_size(size_t __n) { type typename (line 586) | typedef typename _Rope_rep_base<_CharT,_Alloc>::allocator_type type typename (line 616) | typedef typename _Rope_rep_base<_CharT,_Alloc>::allocator_type function _S_fn_finalization_proc (line 652) | static void _S_fn_finalization_proc(void * __tree, void *) { type typename (line 656) | typedef typename _Rope_rep_base<_CharT,_Alloc>::allocator_type function virtual (line 697) | virtual void operator()(size_t __start_pos, size_t __req_len, type typename (line 722) | typedef typename _Rope_rep_base<_CharT,_Alloc>::allocator_type function virtual (line 738) | virtual ~_Rope_RopeSubstring() function _M_ptr (line 768) | _M_ptr(__p) {} type _Rope_RopeRep (line 788) | typedef _Rope_RopeRep<_CharT,_Alloc>* _Self_destruct_ptr; type _Rope_self_destruct_ptr (line 790) | typedef _Rope_self_destruct_ptr<_CharT,_Alloc> _Self_destruct_ptr; type _Rope_RopeRep (line 792) | typedef _Rope_RopeRep<_CharT,_Alloc> _RopeRep; type rope (line 793) | typedef rope<_CharT,_Alloc> _My_rope; type _Rope_RopeRep (line 899) | typedef _Rope_RopeRep<_CharT,_Alloc> _RopeRep; type _Rope_RopeRep (line 970) | typedef _Rope_RopeRep<_CharT,_Alloc> _RopeRep; type _CharT (line 982) | typedef const _CharT* pointer; function reference (line 1001) | reference operator*() { function reference (line 1073) | reference operator[](size_t __n) { type _Rope_char_ref_proxy (line 1123) | typedef _Rope_char_ref_proxy<_CharT,_Alloc>* pointer; function reference (line 1155) | reference operator*() { function reference (line 1199) | reference operator[](ptrdiff_t __n) { type typename (line 1266) | typedef typename _Alloc_traits<_CharT,_Allocator>::allocator_type function _M_data_allocator (line 1271) | _Rope_alloc_base(const allocator_type& __a) type typename (line 1296) | typedef typename _Alloc_traits<_CharT,_Allocator>::allocator_type type typename (line 1328) | typedef typename _Base::allocator_type allocator_type; type _Rope_RopeRep (line 1329) | typedef _Rope_RopeRep<_CharT,_Alloc> _RopeRep; function _Base (line 1332) | _Rope_base(const allocator_type& __a) : _Base(__a) {} type _Alloc (line 1341) | typedef _Alloc allocator_type; function allocator_type (line 1342) | static allocator_type get_allocator() { return allocator_type(); } type difference_type (line 1367) | typedef ptrdiff_t difference_type; type size_type (line 1368) | typedef size_t size_type; type _CharT (line 1369) | typedef _CharT const_reference; type _CharT (line 1370) | typedef const _CharT* const_pointer; type _Rope_iterator (line 1371) | typedef _Rope_iterator<_CharT,_Alloc> iterator; type _Rope_const_iterator (line 1372) | typedef _Rope_const_iterator<_CharT,_Alloc> const_iterator; type _Rope_char_ref_proxy (line 1373) | typedef _Rope_char_ref_proxy<_CharT,_Alloc> reference; type _Rope_char_ptr_proxy (line 1374) | typedef _Rope_char_ptr_proxy<_CharT,_Alloc> pointer; type typename (line 1386) | typedef typename _Base::allocator_type allocator_type; type __GC_CONST (line 1390) | typedef __GC_CONST _CharT* _Cstrptr; function _S_is0 (line 1394) | static bool _S_is0(_CharT __c) { return __c == _S_eos((_CharT*)0); } type _Rope_RopeRep (line 1399) | typedef _Rope_RopeRep<_CharT,_Alloc> _RopeRep; type _Rope_RopeConcatenation (line 1400) | typedef _Rope_RopeConcatenation<_CharT,_Alloc> _RopeConcatenation; type _Rope_RopeLeaf (line 1401) | typedef _Rope_RopeLeaf<_CharT,_Alloc> _RopeLeaf; type _Rope_RopeFunction (line 1402) | typedef _Rope_RopeFunction<_CharT,_Alloc> _RopeFunction; type _Rope_RopeSubstring (line 1403) | typedef _Rope_RopeSubstring<_CharT,_Alloc> _RopeSubstring; function _S_unref (line 1426) | static void _S_unref(_RopeRep* __t) function _S_ref (line 1430) | static void _S_ref(_RopeRep* __t) function _S_unref (line 1435) | static void _S_unref(_RopeRep*) {} function _S_ref (line 1436) | static void _S_ref(_RopeRep*) {} type _Rope_RopeRep (line 1441) | typedef _Rope_RopeRep<_CharT,_Alloc>* _Self_destruct_ptr; type _Rope_self_destruct_ptr (line 1443) | typedef _Rope_self_destruct_ptr<_CharT,_Alloc> _Self_destruct_ptr; function _S_allocated_capacity (line 1484) | static size_t _S_allocated_capacity(size_t __n) { function _RopeLeaf (line 1494) | static _RopeLeaf* _S_new_RopeLeaf(__GC_CONST _CharT *__s, function _RopeConcatenation (line 1505) | static _RopeConcatenation* _S_new_RopeConcatenation( function _RopeFunction (line 1517) | static _RopeFunction* _S_new_RopeFunction(char_producer<_CharT>* __f, function _RopeSubstring (line 1528) | static _RopeSubstring* _S_new_RopeSubstring( function _S_is_balanced (line 1616) | static bool _S_is_balanced(_RopeRep* __r) function _S_is_almost_balanced (line 1619) | static bool _S_is_almost_balanced(_RopeRep* __r) function _S_is_roughly_balanced (line 1623) | static bool _S_is_roughly_balanced(_RopeRep* __r) function _RopeRep (line 1628) | static _RopeRep* _S_concat_and_set_balanced(_RopeRep* __left, function compare (line 1662) | int compare(const rope& __y) const { function _Base (line 1717) | _Base(__a) function clear (line 1746) | void clear() function push_back (line 1752) | void push_back(_CharT __x) function pop_back (line 1759) | void pop_back() function push_front (line 1772) | void push_front(_CharT __x) function pop_front (line 1785) | void pop_front() function balance (line 1797) | void balance() function copy (line 1804) | void copy(_CharT* __buffer) const { function size_type (line 1814) | size_type copy(size_type __pos, size_type __n, _CharT* __buffer) const function dump (line 1826) | void dump() { function delete_c_str (line 1841) | void delete_c_str () { function _CharT (line 1855) | _CharT operator[] (size_type __pos) const { function _CharT (line 1859) | _CharT at(size_type __pos) const { type reverse_iterator (line 1897) | typedef reverse_iterator const_reverse_iterator; type reverse_iterator (line 1899) | typedef reverse_iterator reverse_iterator; type reverse_iterator (line 2320) | typedef reverse_iterator crope; type rope (line 2652) | typedef rope wrope; function crope (line 2654) | inline crope::reference __mutable_reference_at(crope& __c, size_t __i) function wrope (line 2659) | inline wrope::reference __mutable_reference_at(wrope& __c, size_t __i) function swap (line 2673) | inline void swap(crope __x, crope __y) { __x.swap(__y); } function swap (line 2674) | inline void swap(wrope __x, wrope __y) { __x.swap(__y); } function const (line 2681) | size_t operator()(const crope& __str) const function const (line 2693) | size_t operator()(const wrope& __str) const FILE: stl-3.3-source/stl_set.h type _Key (line 69) | typedef _Key value_type; type _Compare (line 70) | typedef _Compare key_compare; type _Compare (line 71) | typedef _Compare value_compare; type typename (line 78) | typedef typename _Rep_type::const_pointer const_pointer; type typename (line 79) | typedef typename _Rep_type::const_reference reference; type typename (line 80) | typedef typename _Rep_type::const_reference const_reference; type typename (line 81) | typedef typename _Rep_type::const_iterator iterator; type typename (line 82) | typedef typename _Rep_type::const_iterator const_iterator; type typename (line 83) | typedef typename _Rep_type::const_reverse_iterator reverse_iterator; type typename (line 84) | typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator; type typename (line 85) | typedef typename _Rep_type::size_type size_type; type typename (line 86) | typedef typename _Rep_type::difference_type difference_type; type typename (line 87) | typedef typename _Rep_type::allocator_type allocator_type; function explicit (line 92) | explicit set(const _Compare& __comp, function swap (line 145) | void swap(set<_Key,_Compare,_Alloc>& __x) { _M_t.swap(__x._M_t); } function iterator (line 152) | iterator insert(iterator __position, const value_type& __x) { function insert (line 162) | void insert(const_iterator __first, const_iterator __last) { function insert (line 165) | void insert(const value_type* __first, const value_type* __last) { function erase (line 169) | void erase(iterator __position) { function size_type (line 173) | size_type erase(const key_type& __x) { function erase (line 176) | void erase(iterator __first, iterator __last) { function clear (line 180) | void clear() { _M_t.clear(); } function iterator (line 184) | iterator find(const key_type& __x) const { return _M_t.find(__x); } function size_type (line 185) | size_type count(const key_type& __x) const { function iterator (line 188) | iterator lower_bound(const key_type& __x) const { function iterator (line 191) | iterator upper_bound(const key_type& __x) const { FILE: stl-3.3-source/stl_slist.h type _Slist_node_base (line 31) | struct _Slist_node_base function _Slist_node_base (line 36) | inline _Slist_node_base* function _Slist_node_base (line 45) | inline _Slist_node_base* function _Slist_node_base (line 54) | inline const _Slist_node_base* function __slist_splice_after (line 63) | inline void __slist_splice_after(_Slist_node_base* __pos, function __slist_splice_after (line 76) | inline void function _Slist_node_base (line 88) | inline _Slist_node_base* __slist_reverse(_Slist_node_base* __node) function __slist_size (line 102) | inline size_t __slist_size(_Slist_node_base* __node) type _Slist_iterator_base (line 116) | struct _Slist_iterator_base type _Slist_iterator (line 138) | typedef _Slist_iterator<_Tp, _Tp&, _Tp*> iterator; type _Slist_iterator (line 139) | typedef _Slist_iterator<_Tp, const type _Slist_iterator (line 140) | typedef _Slist_iterator<_Tp, _Ref, _Ptr> _Self; type _Tp (line 142) | typedef _Tp value_type; type _Ptr (line 143) | typedef _Ptr pointer; type _Ref (line 144) | typedef _Ref reference; type _Slist_node (line 145) | typedef _Slist_node<_Tp> _Node; function _Slist_iterator_base (line 147) | _Slist_iterator_base(__x) {} function _Slist_iterator_base (line 149) | _Slist_iterator(const iterator& __x) : _Slist_iterator_base(__x._M_node) {} function reference (line 151) | reference operator*() const { return ((_Node*) _M_node)->_M_data; } function pointer (line 153) | pointer operator->() const { return &(operator*()); } function forward_iterator_tag (line 175) | inline forward_iterator_tag iterator_category(const _Slist_iterator_base... function _Tp (line 180) | _Tp* value_type(const _Slist_iterator<_Tp, _Ref, _Ptr>&) { function _M_node_allocator (line 203) | _Slist_alloc_base(const allocator_type& __a) : _M_node_allocator(__a) {} function _M_put_node (line 208) | void _M_put_node(_Slist_node<_Tp>* __p) type typename (line 221) | typedef typename _Alloc_traits<_Tp,_Allocator>::allocator_type function _M_put_node (line 231) | void _M_put_node(_Slist_node<_Tp>* __p) { _Alloc_type::deallocate(__p, 1... type typename (line 246) | typedef typename _Base::allocator_type allocator_type; function _Base (line 248) | _Slist_base(const allocator_type& __a) type _Alloc (line 270) | typedef _Alloc allocator_type; function _M_put_node (line 279) | void _M_put_node(_Slist_node<_Tp>* __p) { _Alloc_type::deallocate(__p, 1... function _Slist_node_base (line 281) | _Slist_node_base* _M_erase_after(_Slist_node_base* __pos) type value_type (line 324) | typedef value_type* pointer; type value_type (line 325) | typedef const value_type* const_pointer; type value_type (line 326) | typedef value_type& reference; type value_type (line 327) | typedef const value_type& const_reference; type size_type (line 328) | typedef size_t size_type; type difference_type (line 329) | typedef ptrdiff_t difference_type; type _Slist_iterator (line 331) | typedef _Slist_iterator<_Tp, _Tp&, _Tp*> iterator; type _Slist_iterator (line 332) | typedef _Slist_iterator<_Tp, const type typename (line 334) | typedef typename _Base::allocator_type allocator_type; function allocator_type (line 335) | allocator_type get_allocator() const { return _Base::get_allocator(); } function _Node (line 352) | _Node* _M_create_node() { function explicit (line 369) | explicit slist(size_type __n) : _Base(allocator_type()) function _Base (line 377) | _Base(__a) function _Base (line 389) | slist(const slist& __x) : _Base(__x.get_allocator()) type typename (line 412) | typedef typename _Is_integer<_InputIterator>::_Integral _Integral; function iterator (line 432) | iterator end() { return iterator(0); } function iterator (line 442) | iterator before_begin() { return iterator((_Node*) &this->_M_head); } function swap (line 452) | void swap(slist& __x) function push_front (line 460) | void push_front(const value_type& __x) { function push_front (line 463) | void push_front() { __slist_make_link(&this->_M_head, _M_create_node()); } function pop_front (line 464) | void pop_front() { function iterator (line 471) | iterator previous(const_iterator __pos) { function const_iterator (line 474) | const_iterator previous(const_iterator __pos) const { function _Node (line 484) | _Node* _M_insert_after(_Node_base* __pos) { function _M_insert_after_fill (line 488) | void _M_insert_after_fill(_Node_base* __pos, type typename (line 500) | typedef typename _Is_integer<_InIter>::_Integral _Integral; function _M_insert_after_range (line 522) | void _M_insert_after_range(_Node_base* __pos, function _M_insert_after_range (line 529) | void _M_insert_after_range(_Node_base* __pos, function iterator (line 546) | iterator insert_after(iterator __pos) { function insert_after (line 550) | void insert_after(iterator __pos, size_type __n, const value_type& __x) { function insert_after (line 565) | void insert_after(iterator __pos, function insert_after (line 569) | void insert_after(iterator __pos, function iterator (line 576) | iterator insert(iterator __pos, const value_type& __x) { function iterator (line 582) | iterator insert(iterator __pos) { function insert (line 588) | void insert(iterator __pos, size_type __n, const value_type& __x) { function insert (line 605) | void insert(iterator __pos, const_iterator __first, const_iterator __las... function insert (line 609) | void insert(iterator __pos, const value_type* __first, function iterator (line 622) | iterator erase_after(iterator __before_first, iterator __last) { function iterator (line 627) | iterator erase(iterator __pos) { function iterator (line 631) | iterator erase(iterator __first, iterator __last) { function resize (line 637) | void resize(size_type new_size) { resize(new_size, _Tp()); } function clear (line 638) | void clear() { this->_M_erase_after(&this->_M_head, 0); } function splice_after (line 653) | void splice_after(iterator __pos, iterator __prev) function splice_after (line 663) | void splice_after(iterator __pos, slist& __x) function splice (line 669) | void splice(iterator __pos, slist& __x) { function splice (line 676) | void splice(iterator __pos, slist& __x, iterator __i) { function splice (line 684) | void splice(iterator __pos, slist& __x, iterator __first, iterator __last) type typename (line 782) | typedef typename slist<_Tp,_Alloc>::const_iterator const_iterator; type output_iterator_tag (line 1011) | typedef output_iterator_tag iterator_category; type value_type (line 1012) | typedef void value_type; type difference_type (line 1013) | typedef void difference_type; type pointer (line 1014) | typedef void pointer; type reference (line 1015) | typedef void reference; FILE: stl-3.3-source/stl_stack.h type typename (line 58) | typedef typename _Sequence::value_type _Sequence_value_type; type typename (line 78) | typedef typename _Sequence::size_type size_type; type _Sequence (line 79) | typedef _Sequence container_type; type typename (line 81) | typedef typename _Sequence::reference reference; type typename (line 82) | typedef typename _Sequence::const_reference const_reference; function explicit (line 87) | explicit stack(const _Sequence& __s) : c(__s) {} function reference (line 91) | reference top() { return c.back(); } function push (line 93) | void push(const value_type& __x) { c.push_back(__x); } function pop (line 94) | void pop() { c.pop_back(); } FILE: stl-3.3-source/stl_string_fwd.h type basic_string (line 29) | typedef basic_string string; type basic_string (line 30) | typedef basic_string wstring; FILE: stl-3.3-source/stl_tempbuf.h function _M_allocate_buffer (line 85) | void _M_allocate_buffer() { function _M_initialize_buffer (line 100) | void _M_initialize_buffer(const _Tp&, __true_type) {} function _M_initialize_buffer (line 101) | void _M_initialize_buffer(const _Tp& val, __false_type) { function _Tp (line 108) | _Tp* begin() { return _M_buffer; } function _Tp (line 109) | _Tp* end() { return _M_buffer + _M_len; } type typename (line 114) | typedef typename __type_traits<_Tp>::is_POD_type _Trivial; type typename (line 116) | typedef typename __type_traits<_Tp>::has_trivial_default_constructor FILE: stl-3.3-source/stl_threads.h type _Refcount_Base (line 54) | struct _Refcount_Base function _Atomic_swap (line 121) | inline unsigned long _Atomic_swap(unsigned long * __p, unsigned long __q) { function _Atomic_swap (line 129) | inline unsigned long _Atomic_swap(unsigned long * __p, unsigned long __q) { function _Atomic_swap (line 146) | inline unsigned long _Atomic_swap(unsigned long * __p, unsigned long __q) { function _Atomic_swap (line 167) | inline unsigned long _Atomic_swap(unsigned long * __p, unsigned long __q) { function _Atomic_swap (line 194) | inline unsigned long _Atomic_swap(unsigned long * __p, unsigned long __q) { function _Atomic_swap (line 202) | static inline unsigned long _Atomic_swap(unsigned long * __p, unsigned l... function if (line 238) | struct _STL_mutex_lock function _M_release_lock (line 299) | void _M_release_lock() { function _M_initialize (line 320) | void _M_initialize() { pthread_mutex_init(&_M_lock, NULL); } function _M_acquire_lock (line 321) | void _M_acquire_lock() { pthread_mutex_lock(&_M_lock); } function _M_release_lock (line 322) | void _M_release_lock() { pthread_mutex_unlock(&_M_lock); } function _M_initialize (line 325) | void _M_initialize() { mutex_init(&_M_lock, USYNC_THREAD, 0); } function _M_acquire_lock (line 326) | void _M_acquire_lock() { mutex_lock(&_M_lock); } function _M_release_lock (line 327) | void _M_release_lock() { mutex_unlock(&_M_lock); } function _M_initialize (line 329) | void _M_initialize() {} function _M_acquire_lock (line 330) | void _M_acquire_lock() {} function _M_release_lock (line 331) | void _M_release_lock() {} function _STL_auto_lock (line 355) | struct _STL_auto_lock FILE: stl-3.3-source/stl_tree.h type _Rb_tree_Color_type (line 67) | typedef bool _Rb_tree_Color_type; function _S_maximum (line 71) | struct _Rb_tree_node_base function else (line 102) | struct _Rb_tree_base_iterator function _M_decrement (line 127) | void _M_decrement() type _Value (line 152) | typedef _Value value_type; type _Ref (line 153) | typedef _Ref reference; type _Ptr (line 154) | typedef _Ptr pointer; type _Rb_tree_iterator (line 155) | typedef _Rb_tree_iterator<_Value, _Value&, _Value*> type _Rb_tree_iterator (line 157) | typedef _Rb_tree_iterator<_Value, const type _Rb_tree_iterator (line 159) | typedef _Rb_tree_iterator<_Value, _Ref, _Ptr> type _Rb_tree_node (line 161) | typedef _Rb_tree_node<_Value>* _Link_type; function reference (line 167) | reference operator*() const { return _Link_type(_M_node)->_M_value_field; } function pointer (line 169) | pointer operator->() const { return &(operator*()); } function bidirectional_iterator_tag (line 199) | inline bidirectional_iterator_tag function _Rb_tree_base_iterator (line 204) | inline _Rb_tree_base_iterator::difference_type* function _Value (line 210) | _Value* value_type(const _Rb_tree_iterator<_Value, _Ref, _Ptr>&) { function _Rb_tree_rotate_left (line 216) | inline void function _Rb_tree_rotate_right (line 235) | inline void function _Rb_tree_rebalance (line 254) | inline void function _Rb_tree_node_base (line 299) | inline _Rb_tree_node_base* function _M_put_node (line 455) | void _M_put_node(_Rb_tree_node<_Tp>* __p) type typename (line 463) | typedef typename _Alloc_traits<_Tp, _Alloc>::allocator_type allocator_type; function _M_header (line 466) | _Rb_tree_alloc_base(const allocator_type&) : _M_header(0) {} type typename (line 471) | typedef typename _Alloc_traits<_Rb_tree_node<_Tp>, _Alloc>::_Alloc_type function _M_put_node (line 476) | void _M_put_node(_Rb_tree_node<_Tp>* __p) type typename (line 488) | typedef typename _Base::allocator_type allocator_type; function _Base (line 490) | _Rb_tree_base(const allocator_type& __a) type _Alloc (line 501) | typedef _Alloc allocator_type; function _M_header (line 504) | _Rb_tree_base(const allocator_type&) type simple_alloc (line 511) | typedef simple_alloc<_Rb_tree_node<_Tp>, _Alloc> _Alloc_type; function _M_put_node (line 515) | void _M_put_node(_Rb_tree_node<_Tp>* __p) type _Rb_tree_node (line 527) | typedef _Rb_tree_node<_Value> _Rb_tree_node; type _Rb_tree_Color_type (line 528) | typedef _Rb_tree_Color_type _Color_type; type _Value (line 531) | typedef _Value value_type; type value_type (line 532) | typedef value_type* pointer; type value_type (line 533) | typedef const value_type* const_pointer; type value_type (line 534) | typedef value_type& reference; type value_type (line 535) | typedef const value_type& const_reference; type _Rb_tree_node (line 536) | typedef _Rb_tree_node* _Link_type; type size_type (line 537) | typedef size_t size_type; type difference_type (line 538) | typedef ptrdiff_t difference_type; type typename (line 540) | typedef typename _Base::allocator_type allocator_type; function allocator_type (line 541) | allocator_type get_allocator() const { return _Base::get_allocator(); } function _Link_type (line 562) | _Link_type _M_clone_node(_Link_type __x) function destroy_node (line 571) | void destroy_node(_Link_type __p) function _Link_type (line 588) | static _Link_type& _S_left(_Link_type __x) function _Link_type (line 590) | static _Link_type& _S_right(_Link_type __x) function _Link_type (line 592) | static _Link_type& _S_parent(_Link_type __x) function reference (line 594) | static reference _S_value(_Link_type __x) function _Key (line 596) | static const _Key& _S_key(_Link_type __x) function _Color_type (line 598) | static _Color_type& _S_color(_Link_type __x) function _Link_type (line 601) | static _Link_type& _S_left(_Base_ptr __x) function _Link_type (line 603) | static _Link_type& _S_right(_Base_ptr __x) function _Link_type (line 605) | static _Link_type& _S_parent(_Base_ptr __x) function reference (line 607) | static reference _S_value(_Base_ptr __x) function _Key (line 609) | static const _Key& _S_key(_Base_ptr __x) function _Color_type (line 611) | static _Color_type& _S_color(_Base_ptr __x) function _Link_type (line 614) | static _Link_type _S_minimum(_Link_type __x) function _Link_type (line 617) | static _Link_type _S_maximum(_Link_type __x) type _Rb_tree_iterator (line 622) | typedef _Rb_tree_iterator type reverse_iterator (line 626) | typedef reverse_iterator const_reverse_iterator; type reverse_iterator (line 627) | typedef reverse_iterator reverse_iterator; type reverse_bidirectional_iterator (line 629) | typedef reverse_bidirectional_iterator& __t) { function clear (line 732) | void clear() { function else (line 1133) | else function __black_count (line 1289) | inline int type typename (line 1347) | typedef typename _Base::allocator_type allocator_type; FILE: stl-3.3-source/stl_uninitialized.h function _ForwardIter (line 66) | _ForwardIter function _ForwardIter (line 75) | _ForwardIter function wchar_t (line 89) | inline wchar_t* function __uninitialized_fill_aux (line 144) | void function __uninitialized_fill (line 165) | void __uninitialized_fill(_ForwardIter __first, function uninitialized_fill (line 174) | void uninitialized_fill(_ForwardIter __first, function _ForwardIter (line 184) | _ForwardIter function _ForwardIter (line 206) | _ForwardIter function _ForwardIter (line 214) | _ForwardIter function _ForwardIter (line 229) | _ForwardIter function _ForwardIter (line 245) | _ForwardIter function __uninitialized_copy_fill (line 261) | void FILE: stl-3.3-source/stl_vector.h function _Tp (line 69) | _Tp* _M_allocate(size_t __n) function _M_deallocate (line 71) | void _M_deallocate(_Tp* __p, size_t __n) type typename (line 80) | typedef typename _Alloc_traits<_Tp, _Allocator>::allocator_type type typename (line 93) | typedef typename _Alloc_traits<_Tp, _Allocator>::_Alloc_type _Alloc_type; function _Tp (line 94) | _Tp* _M_allocate(size_t __n) function _M_deallocate (line 96) | void _M_deallocate(_Tp* __p, size_t __n) type typename (line 108) | typedef typename _Base::allocator_type allocator_type; function _Base (line 110) | _Vector_base(const allocator_type& __a) : _Base(__a) {} type simple_alloc (line 145) | typedef simple_alloc<_Tp, _Alloc> _M_data_allocator; function _Tp (line 146) | _Tp* _M_allocate(size_t __n) function _M_deallocate (line 148) | void _M_deallocate(_Tp* __p, size_t __n) type value_type (line 165) | typedef value_type* pointer; type value_type (line 166) | typedef const value_type* const_pointer; type value_type (line 167) | typedef value_type* iterator; type value_type (line 168) | typedef const value_type* const_iterator; type value_type (line 169) | typedef value_type& reference; type value_type (line 170) | typedef const value_type& const_reference; type size_type (line 171) | typedef size_t size_type; type difference_type (line 172) | typedef ptrdiff_t difference_type; type typename (line 174) | typedef typename _Base::allocator_type allocator_type; type reverse_iterator (line 178) | typedef reverse_iterator const_reverse_iterator; type reverse_iterator (line 179) | typedef reverse_iterator reverse_iterator; type reverse_iterator (line 181) | typedef reverse_iterator function iterator (line 203) | iterator end() { return _M_finish; } function reverse_iterator (line 206) | reverse_iterator rbegin() function const_reverse_iterator (line 208) | const_reverse_iterator rbegin() const function reference (line 224) | reference operator[](size_type __n) { return *(begin() + __n); } function const_reference (line 225) | const_reference operator[](size_type __n) const { return *(begin() + __n... function _M_range_check (line 228) | void _M_range_check(size_type __n) const { function reference (line 233) | reference at(size_type __n) function const_reference (line 235) | const_reference at(size_type __n) const function _Base (line 240) | _Base(__a) {} function explicit (line 247) | explicit vector(size_type __n) function _Base (line 259) | _Base(__a) { function reserve (line 287) | void reserve(size_type __n) { function assign (line 304) | void assign(size_type __n, const _Tp& __val) { _M_fill_assign(__n, __val... type typename (line 311) | typedef typename _Is_integer<_InputIterator>::_Integral _Integral; function reference (line 333) | reference front() { return *begin(); } function reference (line 335) | reference back() { return *(end() - 1); } function push_back (line 338) | void push_back(const _Tp& __x) { function push_back (line 346) | void push_back() { function swap (line 354) | void swap(vector<_Tp, _Alloc>& __x) { function iterator (line 360) | iterator insert(iterator __position, const _Tp& __x) { function iterator (line 370) | iterator insert(iterator __position) { type typename (line 384) | typedef typename _Is_integer<_InputIterator>::_Integral _Integral; function insert (line 404) | void insert (iterator __pos, size_type __n, const _Tp& __x) function pop_back (line 409) | void pop_back() { function iterator (line 413) | iterator erase(iterator __position) { function iterator (line 420) | iterator erase(iterator __first, iterator __last) { function resize (line 427) | void resize(size_type __new_size, const _Tp& __x) { function resize (line 433) | void resize(size_type __new_size) { resize(__new_size, _Tp()); } function clear (line 434) | void clear() { erase(begin(), end()); } function iterator (line 451) | iterator _M_allocate_and_copy(size_type __n, const_iterator __first, FILE: stl-3.3-source/type_traits.h type __true_type (line 55) | struct __true_type { type __false_type (line 58) | struct __false_type { type __true_type (line 63) | typedef __true_type this_dummy_member_must_be_first; type __false_type (line 81) | typedef __false_type has_trivial_default_constructor; type __false_type (line 82) | typedef __false_type has_trivial_copy_constructor; type __false_type (line 83) | typedef __false_type has_trivial_assignment_operator; type __false_type (line 84) | typedef __false_type has_trivial_destructor; type __false_type (line 85) | typedef __false_type is_POD_type; type __true_type (line 97) | typedef __true_type has_trivial_default_constructor; type __true_type (line 98) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 99) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 100) | typedef __true_type has_trivial_destructor; type __true_type (line 101) | typedef __true_type is_POD_type; type __true_type (line 107) | typedef __true_type has_trivial_default_constructor; type __true_type (line 108) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 109) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 110) | typedef __true_type has_trivial_destructor; type __true_type (line 111) | typedef __true_type is_POD_type; type __true_type (line 115) | typedef __true_type has_trivial_default_constructor; type __true_type (line 116) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 117) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 118) | typedef __true_type has_trivial_destructor; type __true_type (line 119) | typedef __true_type is_POD_type; type __true_type (line 123) | typedef __true_type has_trivial_default_constructor; type __true_type (line 124) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 125) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 126) | typedef __true_type has_trivial_destructor; type __true_type (line 127) | typedef __true_type is_POD_type; type __true_type (line 133) | typedef __true_type has_trivial_default_constructor; type __true_type (line 134) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 135) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 136) | typedef __true_type has_trivial_destructor; type __true_type (line 137) | typedef __true_type is_POD_type; type __true_type (line 143) | typedef __true_type has_trivial_default_constructor; type __true_type (line 144) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 145) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 146) | typedef __true_type has_trivial_destructor; type __true_type (line 147) | typedef __true_type is_POD_type; type __true_type (line 151) | typedef __true_type has_trivial_default_constructor; type __true_type (line 152) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 153) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 154) | typedef __true_type has_trivial_destructor; type __true_type (line 155) | typedef __true_type is_POD_type; type __true_type (line 159) | typedef __true_type has_trivial_default_constructor; type __true_type (line 160) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 161) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 162) | typedef __true_type has_trivial_destructor; type __true_type (line 163) | typedef __true_type is_POD_type; type __true_type (line 167) | typedef __true_type has_trivial_default_constructor; type __true_type (line 168) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 169) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 170) | typedef __true_type has_trivial_destructor; type __true_type (line 171) | typedef __true_type is_POD_type; type __true_type (line 175) | typedef __true_type has_trivial_default_constructor; type __true_type (line 176) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 177) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 178) | typedef __true_type has_trivial_destructor; type __true_type (line 179) | typedef __true_type is_POD_type; type __true_type (line 183) | typedef __true_type has_trivial_default_constructor; type __true_type (line 184) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 185) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 186) | typedef __true_type has_trivial_destructor; type __true_type (line 187) | typedef __true_type is_POD_type; type __true_type (line 193) | typedef __true_type has_trivial_default_constructor; type __true_type (line 194) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 195) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 196) | typedef __true_type has_trivial_destructor; type __true_type (line 197) | typedef __true_type is_POD_type; type __true_type (line 201) | typedef __true_type has_trivial_default_constructor; type __true_type (line 202) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 203) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 204) | typedef __true_type has_trivial_destructor; type __true_type (line 205) | typedef __true_type is_POD_type; type __true_type (line 211) | typedef __true_type has_trivial_default_constructor; type __true_type (line 212) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 213) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 214) | typedef __true_type has_trivial_destructor; type __true_type (line 215) | typedef __true_type is_POD_type; type __true_type (line 219) | typedef __true_type has_trivial_default_constructor; type __true_type (line 220) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 221) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 222) | typedef __true_type has_trivial_destructor; type __true_type (line 223) | typedef __true_type is_POD_type; type __true_type (line 227) | typedef __true_type has_trivial_default_constructor; type __true_type (line 228) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 229) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 230) | typedef __true_type has_trivial_destructor; type __true_type (line 231) | typedef __true_type is_POD_type; type __true_type (line 238) | typedef __true_type has_trivial_default_constructor; type __true_type (line 239) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 240) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 241) | typedef __true_type has_trivial_destructor; type __true_type (line 242) | typedef __true_type is_POD_type; type __true_type (line 248) | typedef __true_type has_trivial_default_constructor; type __true_type (line 249) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 250) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 251) | typedef __true_type has_trivial_destructor; type __true_type (line 252) | typedef __true_type is_POD_type; type __true_type (line 256) | typedef __true_type has_trivial_default_constructor; type __true_type (line 257) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 258) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 259) | typedef __true_type has_trivial_destructor; type __true_type (line 260) | typedef __true_type is_POD_type; type __true_type (line 264) | typedef __true_type has_trivial_default_constructor; type __true_type (line 265) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 266) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 267) | typedef __true_type has_trivial_destructor; type __true_type (line 268) | typedef __true_type is_POD_type; type __true_type (line 272) | typedef __true_type has_trivial_default_constructor; type __true_type (line 273) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 274) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 275) | typedef __true_type has_trivial_destructor; type __true_type (line 276) | typedef __true_type is_POD_type; type __true_type (line 280) | typedef __true_type has_trivial_default_constructor; type __true_type (line 281) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 282) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 283) | typedef __true_type has_trivial_destructor; type __true_type (line 284) | typedef __true_type is_POD_type; type __true_type (line 288) | typedef __true_type has_trivial_default_constructor; type __true_type (line 289) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 290) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 291) | typedef __true_type has_trivial_destructor; type __true_type (line 292) | typedef __true_type is_POD_type; type __false_type (line 302) | typedef __false_type _Integral; type __true_type (line 308) | typedef __true_type _Integral; type __true_type (line 314) | typedef __true_type _Integral; type __true_type (line 318) | typedef __true_type _Integral; type __true_type (line 322) | typedef __true_type _Integral; type __true_type (line 328) | typedef __true_type _Integral; type __true_type (line 334) | typedef __true_type _Integral; type __true_type (line 338) | typedef __true_type _Integral; type __true_type (line 342) | typedef __true_type _Integral; type __true_type (line 346) | typedef __true_type _Integral; type __true_type (line 350) | typedef __true_type _Integral; type __true_type (line 354) | typedef __true_type _Integral; type __true_type (line 360) | typedef __true_type _Integral; type __true_type (line 364) | typedef __true_type _Integral; FILE: stl-gatieme/1-stl_config/1config-inclass-init.cpp class testClass (line 6) | class testClass function main (line 16) | int main() FILE: stl-gatieme/1-stl_config/1config-operator-overloading.cpp class INT (line 5) | class INT method INT (line 10) | INT(int i) : m_i(i) { } method INT (line 14) | INT& operator++() method INT (line 22) | const INT operator++(int) method INT (line 31) | INT& operator--() method INT (line 38) | const INT operator--(int) function ostream (line 54) | ostream& operator<<(ostream& os, const INT& i) function main (line 60) | int main() FILE: stl-gatieme/1-stl_config/1config-template-exp-special.cpp type hash (line 6) | struct hash type hash (line 15) | struct hash type hash (line 24) | struct hash function main (line 32) | int main() FILE: stl-gatieme/1-stl_config/1config-temporary-object.cpp class print (line 8) | class print function main (line 17) | int main() FILE: stl-gatieme/1-stl_config/1config.cpp function test (line 6) | void test(void) function main (line 207) | int main(void) FILE: stl-gatieme/1-stl_config/1config10.cpp class alloc (line 7) | class alloc class deque (line 12) | class deque method deque (line 15) | deque() class stack (line 22) | class stack method stack (line 25) | stack() function main (line 34) | int main() FILE: stl-gatieme/1-stl_config/1config11.cpp class alloc (line 6) | class alloc function __deque_buf_size (line 10) | inline size_t __deque_buf_size(size_t n, size_t sz) type __deque_iterator (line 16) | struct __deque_iterator method buffer_size (line 20) | static size_t buffer_size() class deque (line 27) | class deque function main (line 33) | int main() FILE: stl-gatieme/1-stl_config/1config2.cpp function main (line 7) | int main() FILE: stl-gatieme/1-stl_config/1config3.cpp class testclass (line 6) | class testclass function main (line 15) | int main() FILE: stl-gatieme/1-stl_config/1config5.cpp type testClass (line 6) | struct testClass method testClass (line 8) | testClass() type testClass (line 15) | struct testClass method testClass (line 17) | testClass() type testClass (line 24) | struct testClass method testClass (line 26) | testClass() function main (line 32) | int main() FILE: stl-gatieme/1-stl_config/1config8.cpp class alloc (line 5) | class alloc class vector (line 10) | class vector method insert (line 17) | void insert(iterator position, I first, I last) function main (line 23) | int main() FILE: stl-gatieme/1-stl_config/1functor.cpp type myplus (line 8) | struct myplus method T (line 10) | T operator()(const T& x, const T& y) const type myminus (line 19) | struct myminus method T (line 21) | T operator()(const T& x, const T& y) const function main (line 27) | int main() FILE: stl-gatieme/1-stl_config/1qsort.cpp function main (line 11) | int main( ) function fcmp (line 32) | int fcmp(const void *elem1, const void *elem2) FILE: stl-gatieme/2-defalloc/2jjalloc.h function namespace (line 13) | namespace JJ FILE: stl-gatieme/2-defalloc/defalloc.h function T (line 50) | T* allocate(ptrdiff_t size, T*) { function deallocate (line 62) | void deallocate(T* buffer) { type T (line 70) | typedef T* pointer; type T (line 71) | typedef const T* const_pointer; type T (line 72) | typedef T& reference; type T (line 73) | typedef const T& const_reference; type size_type (line 74) | typedef size_t size_type; type difference_type (line 75) | typedef ptrdiff_t difference_type; function pointer (line 76) | pointer allocate(size_type n) { function deallocate (line 79) | void deallocate(pointer p) { ::deallocate(p); } function pointer (line 80) | pointer address(reference x) { return (pointer)&x; } function const_pointer (line 81) | const_pointer const_address(const_reference x) { function size_type (line 84) | size_type init_page_size() { function class (line 92) | class allocator { FILE: stl-gatieme/2-defalloc/simple_jjallocator.h function namespace (line 9) | namespace JJ FILE: stl-gatieme/2-defalloc/stl_alloc.h function deallocate (line 172) | static void deallocate(void *p, size_t /* n */) type __malloc_alloc_template (line 233) | typedef __malloc_alloc_template<0> malloc_alloc; function T (line 252) | static T *allocate(void) function deallocate (line 254) | static void deallocate(T *p, size_t n) function deallocate (line 256) | static void deallocate(T *p) function deallocate (line 286) | static void deallocate(void *p, size_t n) type malloc_alloc (line 306) | typedef malloc_alloc alloc; type malloc_alloc (line 307) | typedef malloc_alloc single_client_alloc; function ROUND_UP (line 369) | static size_t ROUND_UP(size_t bytes) function FREELIST_INDEX (line 395) | static size_t FREELIST_INDEX(size_t bytes) function class (line 439) | class lock function deallocate (line 478) | static void deallocate(void *p, size_t n) type __default_alloc_template (line 502) | typedef __default_alloc_template<__NODE_ALLOCATOR_THREADS, 0> alloc; type timespec (line 682) | struct timespec FILE: stl-gatieme/2-defalloc/test.cpp function main (line 9) | int main() FILE: stl-gatieme/3-iterator/3autoptr.cpp type AutoPtrRef (line 12) | struct AutoPtrRef method AutoPtrRef (line 16) | AutoPtrRef(U* p) class AutoPtr (line 27) | class AutoPtr method AutoPtr (line 31) | explicit AutoPtr(T *p = NULL) method AutoPtr (line 39) | AutoPtr(AutoPtr &rhs) // Ҫͷrhsָָ ˲Ϊconst method T (line 56) | T* get( ) const method T (line 62) | T* release( ) method reset (line 72) | void reset(T *p) method T (line 86) | T& operator*( ) const method T (line 107) | T* operator->( ) const method AutoPtr (line 113) | AutoPtr& operator=(AutoPtr &ptr) method AutoPtr (line 134) | AutoPtr(AutoPtrRef ref) method AutoPtr (line 141) | AutoPtr& operator=(AutoPtrRef ref) function main (line 169) | int main(void) FILE: stl-gatieme/3-iterator/3find.cpp function main (line 10) | int main() FILE: stl-gatieme/3-iterator/3function_template1.cpp function func_impl (line 7) | void func_impl(Iter iter, T t) function func (line 19) | inline func(Iter iter) function main (line 25) | int main( ) FILE: stl-gatieme/3-iterator/3function_template2.cpp type MyIter (line 8) | struct MyIter method MyIter (line 10) | MyIter(T *p = NULL) method T (line 16) | T& operator*( ) const function func (line 29) | typename Iter::value_type /// һfuncķֵ function main (line 37) | int main(void) FILE: stl-gatieme/3-iterator/3function_template3.cpp type MyIter (line 12) | struct MyIter method MyIter (line 14) | MyIter(T *p = NULL) method T (line 20) | T& operator*( ) const type iterator_traits (line 51) | struct iterator_traits type iterator_traits (line 58) | struct iterator_traits type iterator_traits (line 65) | struct iterator_traits function func (line 73) | typename iterator_traits::value_type function main (line 82) | int main(void) FILE: stl-gatieme/3-iterator/3mylist.h function ListItem (line 20) | ListItem *next( ) const function insert_end (line 40) | void insert_end(T value) FILE: stl-gatieme/3-iterator/3mylist_iter_test.cpp function main (line 15) | int main( ) FILE: stl-gatieme/3-iterator/3tag_test.cpp type B (line 4) | struct B /// B ɱΪInputIterator type D1 (line 9) | struct D1 : public B /// D1 ɱΪForwardIteraor type D2 (line 14) | struct D2 : public D1 // D2 ɱΪBidirectionalIterator function func (line 21) | func(I &p, B) function func (line 27) | func(I &p, D2) function main (line 35) | int main(void) FILE: stl-gatieme/3-iterator/3templatespecial_class.cpp class Compare (line 6) | class Compare method IsEqual (line 9) | static bool IsEqual(const T& lh, const T& rh) class Compare (line 20) | class Compare method IsEqual (line 23) | static bool IsEqual(const float& lh, const float& rh) class Compare (line 33) | class Compare method IsEqual (line 36) | static bool IsEqual(const double& lh, const double& rh) function main (line 48) | int main(void) FILE: stl-gatieme/3-iterator/3templatespecial_func.cpp function compare (line 7) | int compare(const T left, const T right) function compare (line 34) | int compare(char* left, char* right) function main (line 41) | int main( ) FILE: stl-gatieme/3-iterator/3test_typeid.cpp class A (line 13) | class A function main (line 17) | int main( ) FILE: stl-gatieme/3-iterator/test_auto_ptr.cpp class A (line 5) | class A method A (line 8) | A( ) function sink (line 27) | void sink(auto_ptr a) function create (line 33) | auto_ptr create() function main (line 40) | int main(int argc, char *argv[]) FILE: stl-gatieme/3-iterator/test_bad_typeid.cpp class A (line 8) | class A function main (line 15) | int main() FILE: stl-gatieme/3-iterator/typeinfo.h function namespace (line 41) | namespace __cxxabiv1 function namespace (line 78) | namespace std FILE: stl-gatieme/4-sequence-containers/4deque_test.cpp function Print (line 9) | void Print(int a) function main (line 15) | int main( ) FILE: stl-gatieme/4-sequence-containers/4heap_test.cpp function Print (line 8) | void Print(int a) function main (line 14) | int main( ) FILE: stl-gatieme/4-sequence-containers/4queue_test.cpp function main (line 13) | int main( ) FILE: stl-gatieme/4-sequence-containers/4stack_test.cpp function main (line 13) | int main( ) FILE: stl-gatieme/4-sequence-containers/4vector_reset.cpp function main (line 10) | int main( ) FILE: stl-gatieme/4-sequence-containers/4vector_test.cpp function Print (line 8) | void Print(int a) function main (line 14) | int main( ) FILE: stl侯杰源码/algo/accu1.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/adjdiff1.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/adjfind1.cpp function doubled (line 15) | bool doubled (int elem1, int elem2) function main (line 20) | int main() FILE: stl侯杰源码/algo/algostuff.hpp function PRINT_ELEMENTS (line 32) | inline void PRINT_ELEMENTS (const T& coll, const char* optcstr="") function INSERT_ELEMENTS (line 48) | inline void INSERT_ELEMENTS (T& coll, int first, int last) FILE: stl侯杰源码/algo/bounds1.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/bsearch1.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/copy1.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/copy2.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/copy3.cpp function main (line 17) | int main() FILE: stl侯杰源码/algo/count1.cpp function isEven (line 14) | bool isEven (int elem) function main (line 19) | int main() FILE: stl侯杰源码/algo/eqrange1.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/equal1.cpp function bothEvenOrOdd (line 14) | bool bothEvenOrOdd (int elem1, int elem2) function main (line 19) | int main() FILE: stl侯杰源码/algo/fill1.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/find1.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/find2.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/findend1.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/findof1.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/foreach1.cpp function print (line 15) | void print (int elem) function main (line 20) | int main() FILE: stl侯杰源码/algo/foreach2.cpp class AddValue (line 16) | class AddValue { method AddValue (line 21) | AddValue (const T& v) : theValue(v) { function main (line 30) | int main() FILE: stl侯杰源码/algo/foreach3.cpp class MeanValue (line 15) | class MeanValue { method MeanValue (line 21) | MeanValue () : num(0), sum(0) { function main (line 37) | int main() FILE: stl侯杰源码/algo/generate.cpp function main (line 15) | int main() FILE: stl侯杰源码/algo/heap1.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/imerge1.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/includes.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/inner1.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/lexico1.cpp function printCollection (line 14) | void printCollection (const list& l) function lessForCollection (line 19) | bool lessForCollection (const list& l1, const list& l2) function main (line 26) | int main() FILE: stl侯杰源码/algo/merge1.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/minmax1.cpp function absLess (line 15) | bool absLess (int elem1, int elem2) function main (line 20) | int main() FILE: stl侯杰源码/algo/misma1.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/nth1.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/part1.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/partsum1.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/perm1.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/psort1.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/psort2.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/random1.cpp class MyRandom (line 15) | class MyRandom { function main (line 25) | int main() FILE: stl侯杰源码/algo/relabs.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/remove1.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/remove2.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/replace1.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/replace2.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/reverse1.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/rotate1.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/rotate2.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/search1.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/search2.cpp function checkEven (line 15) | bool checkEven (int elem, bool even) function main (line 25) | int main() FILE: stl侯杰源码/algo/searchn1.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/setalgos.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/sort1.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/sort2.cpp function lessLength (line 14) | bool lessLength (const string& s1, const string& s2) function main (line 19) | int main() FILE: stl侯杰源码/algo/swap1.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/transf1.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/transf2.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/unique1.cpp function main (line 14) | int main() FILE: stl侯杰源码/algo/unique2.cpp function differenceOne (line 14) | bool differenceOne (int elem1, int elem2) function main (line 19) | int main() FILE: stl侯杰源码/algo/unique3.cpp function bothSpaces (line 16) | bool bothSpaces (char elem1, char elem2) function main (line 21) | int main() FILE: stl侯杰源码/cont/Queue.hpp class Queue (line 22) | class Queue { class ReadEmptyQueue (line 29) | class ReadEmptyQueue : public std::exception { method size (line 37) | typename std::deque::size_type size() const { method empty (line 42) | bool empty() const { method push (line 47) | void push (const T& elem) { method T (line 52) | T pop () { method T (line 62) | T& front () { FILE: stl侯杰源码/cont/Stack.hpp class Stack (line 22) | class Stack { class ReadEmptyStack (line 29) | class ReadEmptyStack : public std::exception { method size (line 37) | typename std::deque::size_type size() const { method empty (line 42) | bool empty() const { method push (line 47) | void push (const T& elem) { method T (line 52) | T pop () { method T (line 62) | T& top () { FILE: stl侯杰源码/cont/array1.cpp function main (line 17) | int main() FILE: stl侯杰源码/cont/bitset1.cpp function main (line 15) | int main() FILE: stl侯杰源码/cont/bitset2.cpp function main (line 17) | int main() FILE: stl侯杰源码/cont/carray.hpp class carray (line 14) | class carray { method iterator (line 29) | iterator begin() { return v; } method const_iterator (line 30) | const_iterator begin() const { return v; } method iterator (line 31) | iterator end() { return v+thesize; } method const_iterator (line 32) | const_iterator end() const { return v+thesize; } method reference (line 35) | reference operator[](std::size_t i) { return v[i]; } method const_reference (line 36) | const_reference operator[](std::size_t i) const { return v[i]; } method size_type (line 39) | size_type size() const { return thesize; } method size_type (line 40) | size_type max_size() const { return thesize; } method T (line 43) | T* as_array() { return v; } FILE: stl侯杰源码/cont/carray1.cpp function main (line 17) | int main() FILE: stl侯杰源码/cont/countptr.hpp class CountedPtr (line 19) | class CountedPtr { method CountedPtr (line 27) | explicit CountedPtr (T* p=0) method CountedPtr (line 32) | CountedPtr (const CountedPtr& p) throw() method T (line 54) | T& operator*() const throw() { method T (line 57) | T* operator->() const throw() { method dispose (line 62) | void dispose() { FILE: stl侯杰源码/cont/deque1.cpp function main (line 18) | int main() FILE: stl侯杰源码/cont/list1.cpp function printLists (line 17) | void printLists (const list& l1, const list& l2) function main (line 26) | int main() FILE: stl侯杰源码/cont/map1.cpp function main (line 16) | int main() FILE: stl侯杰源码/cont/mapcmp.cpp class RuntimeStringCmp (line 22) | class RuntimeStringCmp { type cmp_mode (line 25) | enum cmp_mode {normal, nocase} method nocase_compare (line 31) | static bool nocase_compare (char c1, char c2) method RuntimeStringCmp (line 38) | RuntimeStringCmp (cmp_mode m=normal) : mode(m) { function main (line 65) | int main() function fillAndPrint (line 79) | void fillAndPrint(StringStringMap& coll) FILE: stl侯杰源码/cont/mapfind.cpp class value_equals (line 19) | class value_equals { method value_equals (line 24) | value_equals (const V& v) function main (line 33) | int main() FILE: stl侯杰源码/cont/mmap1.cpp function main (line 17) | int main() FILE: stl侯杰源码/cont/mset1.cpp function main (line 17) | int main() FILE: stl侯杰源码/cont/newkey.hpp type MyLib (line 11) | namespace MyLib { function replace_key (line 13) | inline FILE: stl侯杰源码/cont/pqueue1.cpp function main (line 15) | int main() FILE: stl侯杰源码/cont/print.hpp function PRINT_ELEMENTS (line 19) | inline void PRINT_ELEMENTS (const T& coll, const char* optcstr="") FILE: stl侯杰源码/cont/queue1.cpp function main (line 16) | int main() FILE: stl侯杰源码/cont/queue2.cpp function main (line 16) | int main() FILE: stl侯杰源码/cont/refsem1.cpp function printCountedPtr (line 18) | void printCountedPtr (CountedPtr elem) function main (line 23) | int main() FILE: stl侯杰源码/cont/set1.cpp function main (line 17) | int main() FILE: stl侯杰源码/cont/set2.cpp function main (line 15) | int main () FILE: stl侯杰源码/cont/setcmp.cpp class RuntimeCmp (line 18) | class RuntimeCmp { type cmp_mode (line 20) | enum cmp_mode {normal, reverse} method RuntimeCmp (line 26) | RuntimeCmp (cmp_mode m=normal) : mode(m) { function main (line 44) | int main() function fill (line 76) | void fill (IntSet& set) FILE: stl侯杰源码/cont/sortset.cpp function main (line 18) | int main() FILE: stl侯杰源码/cont/sortvec.cpp function main (line 18) | int main() FILE: stl侯杰源码/cont/stack1.cpp function main (line 15) | int main() FILE: stl侯杰源码/cont/stack2.cpp function main (line 15) | int main() FILE: stl侯杰源码/cont/vector1.cpp function main (line 18) | int main() FILE: stl侯杰源码/fo/compose1.cpp function main (line 20) | int main() FILE: stl侯杰源码/fo/compose10.hpp class compose_f_g_t (line 17) | class compose_f_g_t method compose_f_g_t (line 25) | compose_f_g_t(const OP1& o1, const OP2& o2) function compose_f_g (line 39) | inline compose_f_g_t FILE: stl侯杰源码/fo/compose11.hpp class compose_f_gx_t (line 16) | class compose_f_gx_t method compose_f_gx_t (line 25) | compose_f_gx_t(const OP1& o1, const OP2& o2) function compose_f_gx (line 39) | inline compose_f_gx_t FILE: stl侯杰源码/fo/compose12.hpp class compose_f_gxy_t (line 16) | class compose_f_gxy_t method compose_f_gxy_t (line 26) | compose_f_gxy_t (const OP1& o1, const OP2& o2) function compose_f_gxy (line 41) | inline compose_f_gxy_t FILE: stl侯杰源码/fo/compose2.cpp function main (line 19) | int main() FILE: stl侯杰源码/fo/compose21.hpp class compose_f_gx_hx_t (line 16) | class compose_f_gx_hx_t method compose_f_gx_hx_t (line 26) | compose_f_gx_hx_t (const OP1& o1, const OP2& o2, const OP3& o3) function compose_f_gx_hx (line 40) | inline compose_f_gx_hx_t FILE: stl侯杰源码/fo/compose22.hpp class compose_f_gx_hy_t (line 16) | class compose_f_gx_hy_t method compose_f_gx_hy_t (line 27) | compose_f_gx_hy_t (const OP1& o1, const OP2& o2, const OP3& o3) function compose_f_gx_hy (line 42) | inline compose_f_gx_hy_t FILE: stl侯杰源码/fo/compose3.cpp function main (line 19) | int main() FILE: stl侯杰源码/fo/compose4.cpp function main (line 21) | int main() FILE: stl侯杰源码/fo/fopow.hpp type fopow (line 15) | struct fopow : public std::binary_function method T1 (line 17) | T1 operator() (T1 base, T2 exp) const { FILE: stl侯杰源码/fo/fopow1.cpp function main (line 20) | int main() FILE: stl侯杰源码/fo/foreach3.cpp class MeanValue (line 17) | class MeanValue { method MeanValue (line 23) | MeanValue () : num(0), sum(0) { method value (line 34) | double value () { function main (line 39) | int main() FILE: stl侯杰源码/fo/genera1.cpp class IntSequence (line 17) | class IntSequence { method IntSequence (line 22) | IntSequence (int initialValue) function main (line 32) | int main() FILE: stl侯杰源码/fo/genera2.cpp class IntSequence (line 17) | class IntSequence { method IntSequence (line 22) | IntSequence (int initialValue) function main (line 32) | int main() FILE: stl侯杰源码/fo/memfun1.cpp class Person (line 19) | class Person { method print (line 24) | void print () const { method printWithPrefix (line 27) | void printWithPrefix (std::string prefix) const { function foo (line 32) | void foo (const std::vector& coll) function ptrfoo (line 50) | void ptrfoo (const std::vector& coll) function main (line 69) | int main() FILE: stl侯杰源码/fo/nullary.hpp type boost (line 11) | namespace boost { type nullary_function (line 18) | struct nullary_function { class pointer_to_nullary_function (line 26) | class pointer_to_nullary_function : public nullary_function method pointer_to_nullary_function (line 31) | pointer_to_nullary_function() { method pointer_to_nullary_function (line 33) | explicit pointer_to_nullary_function(Result (*x)()) : ptr(x) { method Result (line 35) | Result operator()() const { function ptr_fun (line 41) | inline pointer_to_nullary_function ptr_fun(Result (*x)()) FILE: stl侯杰源码/fo/print.hpp function PRINT_ELEMENTS (line 19) | inline void PRINT_ELEMENTS (const T& coll, const char* optcstr="") FILE: stl侯杰源码/fo/removeif.cpp class Nth (line 17) | class Nth { // function object that returns true for the nth call method Nth (line 22) | Nth (int n) : nth(n), count(0) { function main (line 29) | int main() FILE: stl侯杰源码/fo/sort1.cpp class Person (line 21) | class Person { method Person (line 26) | Person() { method Person (line 28) | Person(const string& f, const string& n) function string (line 36) | inline string Person::firstname() const { function string (line 40) | inline string Person::lastname() const { function ostream (line 44) | ostream& operator<< (ostream& s, const Person& p) class PersonSortCriterion (line 54) | class PersonSortCriterion { function main (line 68) | int main() FILE: stl侯杰源码/i18n/loc1.cpp function main (line 15) | int main() FILE: stl侯杰源码/i18n/loc2.cpp function main (line 17) | int main() FILE: stl侯杰源码/i18n/numget.cpp function main (line 16) | int main() FILE: stl侯杰源码/io/cat1.cpp function main (line 19) | int main (int argc, char* argv[]) FILE: stl侯杰源码/io/cat2.cpp function printFileTwice (line 15) | void printFileTwice (const char* filename) function main (line 30) | int main (int argc, char* argv[]) FILE: stl侯杰源码/io/charcat1.cpp function main (line 14) | int main() FILE: stl侯杰源码/io/charcat2.cpp function main (line 15) | int main() FILE: stl侯杰源码/io/charset.cpp function main (line 22) | int main () function writeCharsetToFile (line 28) | void writeCharsetToFile (const string& filename) function outputFile (line 49) | void outputFile (const string& filename) FILE: stl侯杰源码/io/copy1.cpp function main (line 13) | int main () FILE: stl侯杰源码/io/copy2.cpp function main (line 13) | int main () FILE: stl侯杰源码/io/countlines.cpp function main (line 18) | int main (int argc, char* argv[]) function countLines (line 44) | int countLines (std::istream& in) FILE: stl侯杰源码/io/ignore1.cpp function main (line 14) | int main() FILE: stl侯杰源码/io/ignoreparam.hpp class Ignore (line 15) | class Ignore { method Ignore (line 18) | Ignore(int n) : num(n) { function Ignore (line 23) | Ignore ignore(int n) method Ignore (line 18) | Ignore(int n) : num(n) { FILE: stl侯杰源码/io/ignoreparam1.cpp function main (line 14) | int main() FILE: stl侯杰源码/io/inbuf1.cpp function main (line 14) | int main() FILE: stl侯杰源码/io/inbuf1.hpp class inbuf (line 22) | class inbuf : public std::streambuf { method inbuf (line 36) | inbuf() { method int_type (line 43) | virtual int_type underflow () { FILE: stl侯杰源码/io/io1.cpp function main (line 15) | int main() FILE: stl侯杰源码/io/outbuf1.cpp function main (line 14) | int main() FILE: stl侯杰源码/io/outbuf1.hpp class outbuf (line 15) | class outbuf : public std::streambuf method int_type (line 21) | virtual int_type overflow (int_type c) { FILE: stl侯杰源码/io/outbuf1x.cpp function main (line 14) | int main() FILE: stl侯杰源码/io/outbuf1x.hpp class basic_outbuf (line 16) | class basic_outbuf : public std::basic_streambuf method overflow (line 22) | virtual typename traits::int_type FILE: stl侯杰源码/io/outbuf2.cpp function main (line 14) | int main() FILE: stl侯杰源码/io/outbuf2.hpp class fdoutbuf (line 22) | class fdoutbuf : public std::streambuf { method fdoutbuf (line 27) | fdoutbuf (int _fd) : fd(_fd) { method int_type (line 31) | virtual int_type overflow (int_type c) { method xsputn (line 41) | virtual std::streamsize xsputn (const char* s, class fdostream (line 47) | class fdostream : public std::ostream { method fdostream (line 51) | fdostream (int fd) : std::ostream(0), buf(fd) { FILE: stl侯杰源码/io/outbuf3.cpp function main (line 14) | int main() FILE: stl侯杰源码/io/outbuf3.hpp class outbuf (line 21) | class outbuf : public std::streambuf { method outbuf (line 32) | outbuf() { method flushBuffer (line 45) | int flushBuffer () { method int_type (line 57) | virtual int_type overflow (int_type c) { method sync (line 74) | virtual int sync () { FILE: stl侯杰源码/io/rdbuf1.cpp function main (line 15) | int main() FILE: stl侯杰源码/io/rdbuf2.cpp function hexMultiplicationTable (line 14) | void hexMultiplicationTable (std::streambuf* buffer, int num) function main (line 28) | int main() FILE: stl侯杰源码/io/redirect.cpp function main (line 17) | int main() function redirect (line 26) | void redirect (ostream& strm) FILE: stl侯杰源码/io/rw1.cpp function main (line 15) | int main() FILE: stl侯杰源码/io/sstr1.cpp function main (line 16) | int main() FILE: stl侯杰源码/io/sum1.cpp type MyLib (line 14) | namespace MyLib { function readAndProcessSum (line 46) | double readAndProcessSum (std::istream& strm) function main (line 18) | int main() type MyLib (line 45) | namespace MyLib { function readAndProcessSum (line 46) | double readAndProcessSum (std::istream& strm) FILE: stl侯杰源码/io/sum2.cpp type MyLib (line 14) | namespace MyLib { function readAndProcessSum (line 46) | double readAndProcessSum (std::istream& strm) function main (line 18) | int main() type MyLib (line 45) | namespace MyLib { function readAndProcessSum (line 46) | double readAndProcessSum (std::istream& strm) FILE: stl侯杰源码/iter/advance1.cpp function main (line 16) | int main() FILE: stl侯杰源码/iter/advance2.cpp function main (line 17) | int main() FILE: stl侯杰源码/iter/assoiter.cpp function main (line 20) | int main() FILE: stl侯杰源码/iter/assoiter.hpp class asso_insert_iterator (line 16) | class asso_insert_iterator method asso_insert_iterator (line 25) | explicit asso_insert_iterator (Container& c) : container(c) { function asso_inserter (line 53) | inline asso_insert_iterator asso_inserter (Container& c) FILE: stl侯杰源码/iter/backins.cpp function main (line 17) | int main() FILE: stl侯杰源码/iter/distance.cpp function main (line 16) | int main() FILE: stl侯杰源码/iter/distance.hpp function distance (line 12) | inline long distance (Iterator pos1, Iterator pos2) FILE: stl侯杰源码/iter/frontins.cpp function main (line 18) | int main() FILE: stl侯杰源码/iter/inserter.cpp function main (line 18) | int main() FILE: stl侯杰源码/iter/istriter.cpp function main (line 15) | int main() FILE: stl侯杰源码/iter/itercat.cpp function main (line 15) | int main() FILE: stl侯杰源码/iter/ostriter.cpp function main (line 17) | int main() FILE: stl侯杰源码/iter/print.hpp function PRINT_ELEMENTS (line 19) | inline void PRINT_ELEMENTS (const T& coll, const char* optcstr="") FILE: stl侯杰源码/iter/reviter1.cpp function print (line 16) | void print (int elem) function main (line 21) | int main() FILE: stl侯杰源码/iter/reviter2.cpp function main (line 16) | int main() FILE: stl侯杰源码/iter/reviter3.cpp function print (line 16) | void print (int elem) function main (line 21) | int main() FILE: stl侯杰源码/iter/reviter4.cpp function main (line 16) | int main() FILE: stl侯杰源码/iter/swap1.cpp function main (line 17) | int main() FILE: stl侯杰源码/memory/myalloc.hpp type MyLib (line 14) | namespace MyLib { class MyAlloc (line 16) | class MyAlloc { type rebind (line 29) | struct rebind { method pointer (line 34) | pointer address (reference value) const { method const_pointer (line 37) | const_pointer address (const_reference value) const { method MyAlloc (line 44) | MyAlloc() throw() { method MyAlloc (line 46) | MyAlloc(const MyAlloc&) throw() { method MyAlloc (line 49) | MyAlloc (const MyAlloc&) throw() { method size_type (line 55) | size_type max_size () const throw() { method pointer (line 60) | pointer allocate (size_type num, const void* = 0) { method construct (line 70) | void construct (pointer p, const T& value) { method destroy (line 76) | void destroy (pointer p) { method deallocate (line 82) | void deallocate (pointer p, size_type num) { FILE: stl侯杰源码/memory/myalloc1.cpp function main (line 14) | int main() FILE: stl侯杰源码/num/complex1.cpp function main (line 15) | int main() FILE: stl侯杰源码/num/complex2.cpp function main (line 17) | int main() FILE: stl侯杰源码/num/gslice1.cpp function printValarray3D (line 17) | void printValarray3D (const valarray& va, int dim1, int dim2) function main (line 31) | int main() FILE: stl侯杰源码/num/indi1.cpp function printValarray (line 17) | void printValarray (const valarray& va, int num) function main (line 28) | int main() FILE: stl侯杰源码/num/masked1.cpp function printValarray (line 17) | void printValarray (const valarray& va, int num) function main (line 28) | int main() FILE: stl侯杰源码/num/slice1.cpp function printValarray (line 17) | void printValarray (const valarray& va, int num) function main (line 28) | int main() FILE: stl侯杰源码/num/val1.cpp function printValarray (line 17) | void printValarray (const valarray& va) function main (line 25) | int main() FILE: stl侯杰源码/num/val2.cpp function printValarray (line 17) | void printValarray (const valarray& va) function main (line 25) | int main() FILE: stl侯杰源码/stl/add1.cpp class AddValue (line 18) | class AddValue { method AddValue (line 23) | AddValue(int v) : theValue(v) { function main (line 32) | int main() FILE: stl侯杰源码/stl/algo1.cpp function main (line 16) | int main() FILE: stl侯杰源码/stl/copy1.cpp function main (line 17) | int main() FILE: stl侯杰源码/stl/copy2.cpp function main (line 18) | int main() FILE: stl侯杰源码/stl/copy3.cpp function main (line 19) | int main() FILE: stl侯杰源码/stl/deque1.cpp function main (line 15) | int main() FILE: stl侯杰源码/stl/find1.cpp function main (line 16) | int main() FILE: stl侯杰源码/stl/fo1.cpp function main (line 18) | int main() FILE: stl侯杰源码/stl/foreach1.cpp function print (line 17) | void print (int elem) function main (line 22) | int main() FILE: stl侯杰源码/stl/foreach2.cpp class PrintInt (line 17) | class PrintInt { function main (line 24) | int main() FILE: stl侯杰源码/stl/ioiter1.cpp function main (line 18) | int main() FILE: stl侯杰源码/stl/iterbug1.cpp function main (line 16) | int main() FILE: stl侯杰源码/stl/list1.cpp function main (line 15) | int main() FILE: stl侯杰源码/stl/list2.cpp function main (line 15) | int main() FILE: stl侯杰源码/stl/map1.cpp function main (line 16) | int main() FILE: stl侯杰源码/stl/mmap1.cpp function main (line 16) | int main() FILE: stl侯杰源码/stl/prime1.cpp function isPrime (line 18) | bool isPrime (int number) function main (line 38) | int main() FILE: stl侯杰源码/stl/print.hpp function PRINT_ELEMENTS (line 19) | inline void PRINT_ELEMENTS (const T& coll, const char* optcstr="") FILE: stl侯杰源码/stl/remove1.cpp function main (line 17) | int main() FILE: stl侯杰源码/stl/remove2.cpp function main (line 17) | int main() FILE: stl侯杰源码/stl/remove3.cpp function main (line 17) | int main() FILE: stl侯杰源码/stl/remove4.cpp function main (line 16) | int main() FILE: stl侯杰源码/stl/riter1.cpp function main (line 17) | int main() FILE: stl侯杰源码/stl/set1.cpp function main (line 14) | int main() FILE: stl侯杰源码/stl/sort1.cpp class Person (line 21) | class Person { method Person (line 26) | Person() { method Person (line 28) | Person(const string& f, const string& n) function string (line 36) | inline string Person::firstname() const { function string (line 40) | inline string Person::lastname() const { function ostream (line 44) | ostream& operator<< (ostream& s, const Person& p) function personSortCriterion (line 54) | bool personSortCriterion (const Person& p1, const Person& p2) function main (line 65) | int main() FILE: stl侯杰源码/stl/transform1.cpp function square (line 17) | int square (int value) function main (line 22) | int main() FILE: stl侯杰源码/stl/vector1.cpp function main (line 15) | int main() FILE: stl侯杰源码/string/icstring.hpp type ignorecase_traits (line 21) | struct ignorecase_traits : public std::char_traits { method eq (line 23) | static bool eq(const char& c1, const char& c2) { method lt (line 27) | static bool lt(const char& c1, const char& c2) { method compare (line 31) | static int compare(const char* s1, const char* s2, FILE: stl侯杰源码/string/icstring1.cpp function main (line 13) | int main() FILE: stl侯杰源码/string/iter1.cpp function main (line 17) | int main() FILE: stl侯杰源码/string/iter2.cpp function nocase_compare (line 16) | bool nocase_compare (char c1, char c2) function main (line 21) | int main() FILE: stl侯杰源码/string/iter3.cpp function main (line 16) | int main() FILE: stl侯杰源码/string/string1.cpp function main (line 15) | int main (int argc, char* argv[]) FILE: stl侯杰源码/string/string2.cpp function main (line 15) | int main (int argc, char** argv) FILE: stl侯杰源码/string/unique.cpp class bothWhiteSpaces (line 18) | class bothWhiteSpaces { method bothWhiteSpaces (line 25) | bothWhiteSpaces (const locale& l) : loc(l) { function main (line 35) | int main() FILE: stl侯杰源码/util/autoptr.hpp type std (line 14) | namespace std { type auto_ptr_ref (line 17) | struct auto_ptr_ref { method auto_ptr_ref (line 19) | auto_ptr_ref (Y* rhs) class auto_ptr (line 25) | class auto_ptr { method auto_ptr (line 32) | explicit auto_ptr (T* ptr = 0) throw() method auto_ptr (line 38) | auto_ptr (auto_ptr& rhs) throw() method auto_ptr (line 42) | auto_ptr (auto_ptr& rhs) throw() method auto_ptr (line 48) | auto_ptr& operator= (auto_ptr& rhs) throw() { method auto_ptr (line 53) | auto_ptr& operator= (auto_ptr& rhs) throw() { method T (line 64) | T* get() const throw() { method T (line 67) | T& operator*() const throw() { method T (line 70) | T* operator->() const throw() { method T (line 75) | T* release() throw() { method reset (line 82) | void reset (T* ptr=0) throw() { method auto_ptr (line 91) | auto_ptr(auto_ptr_ref rhs) throw() method auto_ptr (line 94) | auto_ptr& operator= (auto_ptr_ref rhs) throw() { // new FILE: stl侯杰源码/util/autoptr1.cpp function ostream (line 19) | ostream& operator<< (ostream& strm, const auto_ptr& p) function main (line 31) | int main() FILE: stl侯杰源码/util/autoptr2.cpp function ostream (line 19) | ostream& operator<< (ostream& strm, const auto_ptr& p) function main (line 31) | int main() FILE: stl侯杰源码/util/defalloc.hpp type std (line 11) | namespace std { class allocator (line 13) | class allocator { type rebind (line 26) | struct rebind { method pointer (line 31) | pointer address (reference value) const { method const_pointer (line 34) | const_pointer address (const_reference value) const { method allocator (line 41) | allocator() throw() { method allocator (line 43) | allocator(const allocator&) throw() { method allocator (line 46) | allocator (const allocator&) throw() { method size_type (line 52) | size_type max_size () const throw() { method pointer (line 57) | pointer allocate (size_type num, method construct (line 64) | void construct (pointer p, const T& value) { method destroy (line 70) | void destroy (pointer p) { method deallocate (line 76) | void deallocate (pointer p, size_type num) { FILE: stl侯杰源码/util/limits1.cpp function main (line 16) | int main() FILE: stl侯杰源码/util/minmax1.cpp function int_ptr_less (line 16) | bool int_ptr_less (int* a, int* b) function main (line 21) | int main() FILE: tass-sgi-stl-2.91.57-source/PlotFile.h function class (line 48) | class PlotFile : public ofstream FILE: tass-sgi-stl-2.91.57-source/SFile.h function class (line 35) | class SFile: public fstream FILE: tass-sgi-stl-2.91.57-source/builtinbuf.h function class (line 39) | class builtinbuf : public streambuf { FILE: tass-sgi-stl-2.91.57-source/defalloc.h function T (line 37) | T* allocate(ptrdiff_t size, T*) { function deallocate (line 49) | void deallocate(T* buffer) { type T (line 57) | typedef T* pointer; type T (line 58) | typedef const T* const_pointer; type T (line 59) | typedef T& reference; type T (line 60) | typedef const T& const_reference; type size_type (line 61) | typedef size_t size_type; type difference_type (line 62) | typedef ptrdiff_t difference_type; function pointer (line 63) | pointer allocate(size_type n) { function deallocate (line 66) | void deallocate(pointer p) { ::deallocate(p); } function pointer (line 67) | pointer address(reference x) { return (pointer)&x; } function const_pointer (line 68) | const_pointer const_address(const_reference x) { function size_type (line 71) | size_type init_page_size() { function class (line 79) | class allocator { FILE: tass-sgi-stl-2.91.57-source/editbuf.h type mark_pointer (line 36) | typedef unsigned long mark_pointer; type buf_char (line 39) | typedef /*unsigned*/ char buf_char; type buf_index (line 42) | typedef long buf_index; type buf_offset (line 45) | typedef long buf_offset; type buf_cookie (line 48) | struct buf_cookie { type edit_buffer (line 56) | struct edit_buffer type edit_mark (line 57) | struct edit_mark type edit_string (line 63) | struct edit_string { type edit_string (line 75) | struct edit_string function streambuf (line 78) | struct edit_streambuf : public streambuf { type edit_mark (line 109) | struct edit_mark { function index_in_buffer (line 113) | long index_in_buffer(struct edit_buffer *) type edit_buffer (line 115) | struct edit_buffer type edit_string (line 118) | struct edit_string type edit_buffer (line 136) | struct edit_buffer { type edit_streambuf (line 145) | struct edit_streambuf type edit_mark (line 146) | struct edit_mark type edit_mark (line 147) | struct edit_mark function buf_offset (line 149) | inline buf_offset gap_end_pos() { return __gap_end_pos; } type edit_mark (line 150) | struct edit_mark type edit_mark (line 151) | struct edit_mark function buf_char (line 155) | inline buf_char *gap_end() { return data + gap_end_pos(); } function gap_size (line 156) | inline int gap_size() { return gap_end() - gap_start(); } function size1 (line 157) | inline int size1() { return gap_start() - data; } function size2 (line 158) | inline int size2() { return buf_size - gap_end_pos(); } type edit_mark (line 159) | struct edit_mark function move_gap (line 162) | void move_gap (buf_char *pos) { move_gap(pos - data); } type edit_mark (line 168) | struct edit_mark type edit_mark (line 168) | struct edit_mark type edit_string (line 171) | struct edit_string function buf_char (line 175) | inline buf_char *edit_mark::ptr(struct edit_buffer *buf) function flush_to_buffer (line 178) | inline void edit_streambuf::flush_to_buffer() FILE: tass-sgi-stl-2.91.57-source/fstream.h function class (line 33) | class fstreambase : virtual public ios { function fstreambase (line 62) | ifstream(int fd) : fstreambase(fd) { } function fstreambase (line 73) | ofstream(int fd) : fstreambase(fd) { } function fstreambase (line 84) | fstream(int fd) : fstreambase(fd) { } FILE: tass-sgi-stl-2.91.57-source/indstream.h function class (line 52) | class indirectbuf : public streambuf { FILE: tass-sgi-stl-2.91.57-source/iolibio.h type obstack (line 36) | struct obstack type obstack (line 37) | struct obstack type obstack (line 39) | struct obstack FILE: tass-sgi-stl-2.91.57-source/iostdio.h type _IO_FILE (line 37) | typedef _IO_FILE FILE; FILE: tass-sgi-stl-2.91.57-source/iostream.h function class (line 44) | class ostream : virtual public ios function streambuf (line 110) | streambuf* ostreambuf() const { return _strbuf; } function class (line 114) | class istream : virtual public ios function class (line 233) | class _IO_istream_withassign : public istream { function class (line 240) | class _IO_ostream_withassign : public ostream { type Iostream_init (line 262) | struct Iostream_init { } FILE: tass-sgi-stl-2.91.57-source/libio.h type _IO_jump_t (line 152) | struct _IO_jump_t type _IO_FILE (line 152) | struct _IO_FILE type _IO_lock_t (line 168) | typedef void _IO_lock_t; type _IO_lock_t (line 172) | struct _IO_lock_t { void *ptr; short int field1; short int field2; } type _IO_lock_t (line 175) | typedef void _IO_lock_t; type _IO_marker (line 183) | struct _IO_marker { type _IO_FILE (line 202) | struct _IO_FILE { type _IO_FILE (line 251) | typedef struct _IO_FILE _IO_FILE; type _IO_FILE_plus (line 260) | struct _IO_FILE_plus type _IO_FILE_plus (line 261) | struct _IO_FILE_plus type _IO_cookie_io_functions_t (line 268) | typedef struct type _IO_cookie_file (line 277) | struct _IO_cookie_file FILE: tass-sgi-stl-2.91.57-source/libioP.h type _IO_size_t (line 125) | typedef _IO_size_t (*_IO_xsputn_t) type _IO_size_t (line 132) | typedef _IO_size_t (*_IO_xsgetn_t) type _IO_fpos64_t (line 142) | typedef _IO_fpos64_t (*_IO_seekoff_t) type _IO_fpos_t (line 145) | typedef _IO_fpos_t (*_IO_seekoff_t) type _IO_fpos64_t (line 156) | typedef _IO_fpos64_t (*_IO_seekpos_t) type _IO_fpos_t (line 158) | typedef _IO_fpos_t (*_IO_seekpos_t) type _IO_FILE (line 164) | typedef _IO_FILE* (*_IO_setbuf_t) type _IO_ssize_t (line 194) | typedef _IO_ssize_t (*_IO_read_t) type _IO_ssize_t (line 201) | typedef _IO_ssize_t (*_IO_write_t) type _IO_fpos64_t (line 209) | typedef _IO_fpos64_t (*_IO_seek_t) type _IO_fpos_t (line 211) | typedef _IO_fpos_t (*_IO_seek_t) type _IO_jump_t (line 246) | struct _IO_jump_t type _IO_FILE_plus (line 285) | struct _IO_FILE_plus type _IO_marker (line 317) | struct _IO_marker type _IO_marker (line 318) | struct _IO_marker type _IO_marker (line 319) | struct _IO_marker type _IO_marker (line 320) | struct _IO_marker type _IO_marker (line 321) | struct _IO_marker type _IO_marker (line 322) | struct _IO_marker type _IO_jump_t (line 356) | struct _IO_jump_t type _IO_jump_t (line 357) | struct _IO_jump_t type _IO_jump_t (line 358) | struct _IO_jump_t type _IO_jump_t (line 359) | struct _IO_jump_t type stat (line 527) | struct stat type stat (line 532) | struct stat type _IO_fake_stdiobuf (line 616) | struct _IO_fake_stdiobuf FILE: tass-sgi-stl-2.91.57-source/parsestream.h function class (line 43) | class parsebuf : public streambuf { function class (line 83) | class string_parsebuf : public parsebuf { function class (line 114) | class func_parsebuf : public parsebuf { function class (line 129) | class general_parsebuf : public parsebuf { function class (line 142) | class parsestream : public istream { FILE: tass-sgi-stl-2.91.57-source/pfstream.h function class (line 42) | class ipfstream : public ifstream { function class (line 53) | class opfstream : public ofstream { FILE: tass-sgi-stl-2.91.57-source/procbuf.h function class (line 36) | class procbuf : public filebuf { FILE: tass-sgi-stl-2.91.57-source/ropeimpl.h function o (line 815) | o(writer) {} function __rope_fill (line 908) | inline void __rope_fill(ostream& o, size_t n) function rotate (line 1507) | inline void rotate(__rope_iterator first, function rotate (line 1521) | inline void rotate(__rope_iterator first, FILE: tass-sgi-stl-2.91.57-source/std/bastring.cc function charT (line 68) | charT * basic_string ::Rep:: function istream (line 432) | istream & function ostream (line 467) | ostream & function istream (line 474) | istream& FILE: tass-sgi-stl-2.91.57-source/std/bastring.h type Rep (line 69) | struct Rep { function charT (line 75) | charT* grab () { if (selfish) return clone (); ++ref; return data (); } function release (line 76) | void release () { if (--ref == 0) delete this; } type typename (line 97) | typedef typename traits::char_type value_type; type Allocator (line 98) | typedef Allocator allocator_type; type size_type (line 100) | typedef size_t size_type; type difference_type (line 101) | typedef ptrdiff_t difference_type; type charT (line 102) | typedef charT& reference; type charT (line 103) | typedef const charT& const_reference; type charT (line 104) | typedef charT* pointer; type charT (line 105) | typedef const charT* const_pointer; type pointer (line 106) | typedef pointer iterator; type const_pointer (line 107) | typedef const_pointer const_iterator; type reverse_iterator (line 108) | typedef ::reverse_iterator reverse_iterator; type reverse_iterator (line 109) | typedef ::reverse_iterator const_reverse_iterator; function repup (line 114) | void repup (Rep *p) { rep ()->release (); dat = p->data (); } function explicit (line 137) | explicit basic_string (): dat (nilRep.grab ()) { } function dat (line 143) | basic_string (const charT* s) function swap (line 158) | void swap (basic_string &s) { charT *d = dat; dat = s.dat; s.dat = d; } function iterator (line 215) | iterator insert(iterator p, charT c) function iterator (line 219) | iterator insert(iterator p, size_type n, charT c) function insert (line 227) | void insert(iterator p, const_iterator first, const_iterator last) function iterator (line 233) | iterator erase(iterator p) function iterator (line 237) | iterator erase(iterator f, iterator l) function unique (line 270) | void unique () { if (rep ()->ref > 1) alloc (length (), true); } function selfish (line 271) | void selfish () { unique (); rep ()->selfish = true; } function reference (line 281) | reference operator[] (size_type pos) function reference (line 284) | reference at (size_type pos) function const_reference (line 289) | const_reference at (size_type pos) const function resize (line 303) | void resize (size_type n) function reserve (line 305) | void reserve (size_type) { } function size_type (line 316) | size_type rfind (const basic_string& str, size_type pos = npos) const function size_type (line 319) | size_type rfind (const charT* s, size_type pos = npos) const function size_type (line 331) | size_type find_last_of (const basic_string& str, size_type pos = npos) c... function size_type (line 334) | size_type find_last_of (const charT* s, size_type pos = npos) const function size_type (line 336) | size_type find_last_of (charT c, size_type pos = npos) const function size_type (line 346) | size_type find_last_not_of (const basic_string& str, size_type pos = npo... function size_type (line 349) | size_type find_last_not_of (const charT* s, size_type pos = npos) const function iterator (line 362) | iterator begin () { selfish (); return &(*this)[0]; } function iterator (line 363) | iterator end () { selfish (); return &(*this)[length ()]; } function reverse_iterator (line 373) | reverse_iterator rbegin() { return reverse_iterator (end ()); } function const_reverse_iterator (line 374) | const_reverse_iterator rbegin() const FILE: tass-sgi-stl-2.91.57-source/std/complext.cc function cos (line 31) | complex function cosh (line 38) | complex function exp (line 45) | complex function log (line 51) | complex function pow (line 57) | complex function pow (line 67) | complex function pow (line 73) | complex function sin (line 79) | complex function sinh (line 86) | complex function istream (line 95) | istream& function ostream (line 123) | ostream& function pow (line 229) | complex function sqrt (line 252) | complex FILE: tass-sgi-stl-2.91.57-source/std/complext.h function _FLT (line 135) | _FLT function _FLT (line 144) | _FLT function _FLT (line 319) | _FLT function _FLT (line 328) | _FLT function _FLT (line 355) | _FLT FILE: tass-sgi-stl-2.91.57-source/std/dcomplex.h function class (line 36) | class complex function complex (line 86) | inline complex::complex (const complex& r) FILE: tass-sgi-stl-2.91.57-source/std/fcomplex.h function class (line 36) | class complex FILE: tass-sgi-stl-2.91.57-source/std/ldcomplex.h function class (line 36) | class complex function complex (line 86) | inline complex::complex (const complex& r) function complex (line 90) | inline complex::complex (const complex& r) FILE: tass-sgi-stl-2.91.57-source/std/straits.h type charT (line 41) | typedef charT char_type; function assign (line 45) | static void assign (char_type& c1, const char_type& c2) function eq (line 47) | static bool eq (const char_type& c1, const char_type& c2) function ne (line 49) | static bool ne (const char_type& c1, const char_type& c2) function lt (line 51) | static bool lt (const char_type& c1, const char_type& c2) function char_type (line 53) | static char_type eos () { return char_type(); } function is_del (line 54) | static bool is_del(char_type a) { return 0; } function compare (line 59) | static int compare (const char_type* s1, const char_type* s2, size_t n) function length (line 69) | static size_t length (const char_type* s) function char_type (line 77) | static char_type* copy (char_type* s1, const char_type* s2, size_t n) function char_type (line 84) | static char_type* move (char_type* s1, const char_type* s2, size_t n) function char_type (line 95) | static char_type* set (char_type* s1, const char_type& c, size_t n) function char (line 108) | struct string_char_traits { type string_char_traits (line 136) | struct string_char_traits type wchar_t (line 137) | typedef wchar_t char_type; function assign (line 139) | static void assign (char_type& c1, const char_type& c2) function eq (line 141) | static bool eq (const char_type & c1, const char_type& c2) function ne (line 143) | static bool ne (const char_type& c1, const char_type& c2) function lt (line 145) | static bool lt (const char_type& c1, const char_type& c2) function char_type (line 147) | static char_type eos () { return 0; } function is_del (line 148) | static bool is_del(char_type a) { return iswspace(a); } function compare (line 150) | static int compare (const char_type* s1, const char_type* s2, size_t n) function length (line 152) | static size_t length (const char_type* s) function char_type (line 154) | static char_type* copy (char_type* s1, const char_type* s2, size_t n) function char_type (line 156) | static char_type* set (char_type* s1, const char_type& c, size_t n) FILE: tass-sgi-stl-2.91.57-source/stdiostream.h function class (line 38) | class stdiobuf : public filebuf { function class (line 56) | class istdiostream : public istream function class (line 67) | class ostdiostream : public ostream FILE: tass-sgi-stl-2.91.57-source/stl_algo.h function ForwardIterator1 (line 193) | ForwardIterator1 search(ForwardIterator1 first1, ForwardIterator1 last1, function ForwardIterator1 (line 234) | ForwardIterator1 search(ForwardIterator1 first1, ForwardIterator1 last1, function OutputIterator (line 431) | OutputIterator __unique_copy(InputIterator first, InputIterator last, function OutputIterator (line 438) | OutputIterator unique_copy(InputIterator first, InputIterator last, function OutputIterator (line 470) | OutputIterator __unique_copy(InputIterator first, InputIterator last, function OutputIterator (line 478) | OutputIterator unique_copy(InputIterator first, InputIterator last, function reverse (line 516) | void reverse(BidirectionalIterator first, BidirectionalIterator last) { function RandomAccessIterator (line 732) | RandomAccessIterator function RandomAccessIterator (line 741) | RandomAccessIterator function ForwardIterator (line 835) | ForwardIterator __stable_partition_aux(ForwardIterator first, function ForwardIterator (line 849) | ForwardIterator stable_partition(ForwardIterator first, function __linear_insert (line 916) | void __linear_insert(RandomAccessIterator first, function __linear_insert (line 928) | void __linear_insert(RandomAccessIterator first, function __unguarded_insertion_sort (line 976) | void __unguarded_insertion_sort(RandomAccessIterator first, function Size (line 1005) | Size __lg(Size n) { function sort (line 1048) | void sort(RandomAccessIterator first, RandomAccessIterator last) { function sort (line 1056) | void sort(RandomAccessIterator first, RandomAccessIterator last, function stable_sort (line 1255) | void stable_sort(RandomAccessIterator first, function partial_sort (line 1289) | void partial_sort(RandomAccessIterator first, function RandomAccessIterator (line 1321) | RandomAccessIterator function RandomAccessIterator (line 1356) | RandomAccessIterator function nth_element (line 1401) | void nth_element(RandomAccessIterator first, RandomAccessIterator nth, function ForwardIterator (line 1452) | ForwardIterator lower_bound(ForwardIterator first, ForwardIterator last, function ForwardIterator (line 1505) | ForwardIterator lower_bound(ForwardIterator first, ForwardIterator last, function ForwardIterator (line 1557) | ForwardIterator upper_bound(ForwardIterator first, ForwardIterator last, function ForwardIterator (line 1610) | ForwardIterator upper_bound(ForwardIterator first, ForwardIterator last, function else (line 1990) | else if (len2 <= buffer_size) { function __inplace_merge_aux (line 2022) | void __inplace_merge_aux(BidirectionalIterator first, function __inplace_merge_aux (line 2039) | void __inplace_merge_aux(BidirectionalIterator first, function inplace_merge (line 2058) | void inplace_merge(BidirectionalIterator first, function inplace_merge (line 2067) | void inplace_merge(BidirectionalIterator first, type reverse_iterator (line 2504) | typedef reverse_iterator reviter2; type reverse_iterator (line 2528) | typedef reverse_iterator reviter2; function ForwardIterator1 (line 2548) | ForwardIterator1 function ForwardIterator1 (line 2566) | ForwardIterator1 FILE: tass-sgi-stl-2.91.57-source/stl_algobase.h function iter_swap (line 69) | void iter_swap(ForwardIterator1 a, ForwardIterator2 b) { function OutputIterator (line 108) | OutputIterator __copy(InputIterator first, InputIterator last, function OutputIterator (line 117) | OutputIterator function OutputIterator (line 127) | OutputIterator function OutputIterator (line 137) | OutputIterator operator()(InputIterator first, InputIterator last, function T (line 146) | T* __copy_t(const T* first, const T* last, T* result, __true_type) { function T (line 152) | T* __copy_t(const T* first, const T* last, T* result, __false_type) { type typename (line 160) | typedef typename __type_traits::has_trivial_assignment_operator t; type typename (line 169) | typedef typename __type_traits::has_trivial_assignment_operator t; function OutputIterator (line 177) | OutputIterator copy(InputIterator first, InputIterator last, function wchar_t (line 188) | inline wchar_t* copy(const wchar_t* first, const wchar_t* last, function BidirectionalIterator2 (line 195) | BidirectionalIterator2 __copy_backward(BidirectionalIterator1 first, function BidirectionalIterator2 (line 206) | BidirectionalIterator2 operator()(BidirectionalIterator1 first, function T (line 216) | T* __copy_backward_t(const T* first, const T* last, T* result, function T (line 224) | T* __copy_backward_t(const T* first, const T* last, T* result, type typename (line 233) | typedef typename __type_traits::has_trivial_assignment_operator t; type typename (line 242) | typedef typename __type_traits::has_trivial_assignment_operator t; function BidirectionalIterator2 (line 250) | BidirectionalIterator2 copy_backward(BidirectionalIterator1 first, function equal (line 321) | bool equal(InputIterator1 first1, InputIterator1 last1, function equal (line 330) | bool equal(InputIterator1 first1, InputIterator1 last1, function lexicographical_compare (line 363) | inline bool function lexicographical_compare (line 375) | inline bool lexicographical_compare(const char* first1, const char* last1, function lexicographical_compare_3way (line 407) | inline int function lexicographical_compare_3way (line 419) | inline int lexicographical_compare_3way(const char* first1, const char* ... FILE: tass-sgi-stl-2.91.57-source/stl_alloc.h function deallocate (line 156) | static void deallocate(void *p, size_t /* n */) type __malloc_alloc_template (line 214) | typedef __malloc_alloc_template<0> malloc_alloc; function T (line 222) | static T *allocate(void) function deallocate (line 224) | static void deallocate(T *p, size_t n) function deallocate (line 226) | static void deallocate(T *p) function deallocate (line 253) | static void deallocate(void *p, size_t n) type malloc_alloc (line 276) | typedef malloc_alloc alloc; type malloc_alloc (line 277) | typedef malloc_alloc single_client_alloc; function ROUND_UP (line 324) | static size_t ROUND_UP(size_t bytes) { function FREELIST_INDEX (line 339) | static size_t FREELIST_INDEX(size_t bytes) { function class (line 380) | class lock { function deallocate (line 416) | static void deallocate(void *p, size_t n) type __default_alloc_template (line 440) | typedef __default_alloc_template<__NODE_ALLOCATOR_THREADS, 0> alloc; type timespec (line 603) | struct timespec FILE: tass-sgi-stl-2.91.57-source/stl_bvector.h type __bit_reference (line 42) | struct __bit_reference { function flip (line 64) | void flip() { *p ^= mask; } function swap (line 67) | inline void swap(__bit_reference x, __bit_reference y) { type __bit_iterator (line 73) | struct __bit_iterator type __bit_reference (line 74) | typedef __bit_reference reference; type __bit_reference (line 75) | typedef __bit_reference* pointer; type __bit_iterator (line 76) | typedef __bit_iterator iterator; function bump_up (line 80) | void bump_up() { function bump_down (line 86) | void bump_down() { function reference (line 140) | reference operator[](difference_type i) { return *(*this + i); } function operator (line 147) | bool operator<(iterator x) const { type __bit_const_iterator (line 152) | struct __bit_const_iterator type const_reference (line 156) | typedef bool const_reference; type __bit_const_iterator (line 158) | typedef __bit_const_iterator const_iterator; function bump_up (line 162) | void bump_up() { function bump_down (line 168) | void bump_down() { function const_reference (line 225) | const_reference operator[](difference_type i) { function const_iterator (line 234) | bool operator<(const_iterator x) const { type data_allocator (line 263) | typedef simple_alloc data_allocator; type data_allocator (line 265) | typedef simple_alloc data_allocator; type size_type (line 269) | typedef size_t size_type; type difference_type (line 270) | typedef ptrdiff_t difference_type; type __bit_reference (line 271) | typedef __bit_reference reference; type const_reference (line 272) | typedef bool const_reference; type __bit_reference (line 273) | typedef __bit_reference* pointer; type __bit_iterator (line 276) | typedef __bit_iterator iterator; type __bit_const_iterator (line 277) | typedef __bit_const_iterator const_iterator; type reverse_iterator (line 280) | typedef reverse_iterator const_reverse_iterator; type reverse_iterator (line 281) | typedef reverse_iterator reverse_iterator; type reverse_iterator (line 283) | typedef reverse_iterator function deallocate (line 296) | void deallocate() { function initialize (line 300) | void initialize(size_type n) { function insert_aux (line 306) | void insert_aux(iterator position, bool x) { function iterator (line 384) | iterator end() { return finish; } function reverse_iterator (line 387) | reverse_iterator rbegin() { return reverse_iterator(end()); } function reverse_iterator (line 391) | reverse_iterator rend() { return reverse_iterator(begin()); } function reference (line 402) | reference operator[](size_type n) { function const_reference (line 405) | const_reference operator[](size_type n) const { function explicit (line 421) | explicit __BVECTOR(size_type n) { function reserve (line 461) | void reserve(size_type n) { function reference (line 470) | reference front() { return *begin(); } function reference (line 472) | reference back() { return *(end() - 1); } function push_back (line 474) | void push_back(bool x) { function swap (line 480) | void swap(__BVECTOR& x) { function iterator (line 485) | iterator insert(iterator position, bool x = bool()) { function insert (line 501) | void insert(iterator position, const_iterator first, function insert (line 523) | void insert(iterator position, const bool* first, const bool* last) { function insert (line 545) | void insert(iterator position, size_type n, bool x) { function insert (line 564) | void insert(iterator pos, int n, bool x) { insert(pos, (size_type)n, x); } function insert (line 565) | void insert(iterator pos, long n, bool x) { insert(pos, (size_type)n, x); } function pop_back (line 567) | void pop_back() { --finish; } function iterator (line 568) | iterator erase(iterator position) { function iterator (line 574) | iterator erase(iterator first, iterator last) { function resize (line 578) | void resize(size_type new_size, bool x = bool()) { function clear (line 584) | void clear() { erase(begin(), end()); } type vector (line 589) | typedef vector bit_vector; FILE: tass-sgi-stl-2.91.57-source/stl_construct.h function destroy (line 39) | inline void destroy(T* pointer) { function construct (line 44) | void construct(T1* p, const T2& value) { function __destroy_aux (line 49) | void function __destroy_aux (line 56) | void __destroy_aux(ForwardIterator, ForwardIterator, __true_type) {} function __destroy (line 59) | void __destroy(ForwardIterator first, ForwardIterator last, T*) { function destroy (line 65) | void destroy(ForwardIterator first, ForwardIterator last) { function destroy (line 69) | inline void destroy(char*, char*) {} function destroy (line 70) | inline void destroy(wchar_t*, wchar_t*) {} FILE: tass-sgi-stl-2.91.57-source/stl_deque.h function __deque_buf_size (line 90) | inline size_t __deque_buf_size(size_t n, size_t sz) type __deque_iterator (line 98) | typedef __deque_iterator iterator; type __deque_iterator (line 99) | typedef __deque_iterator iterator; type __deque_iterator (line 105) | typedef __deque_iterator() const { return &(operator*()); } function reference (line 194) | reference operator[](difference_type n) const { return *(*this + n); } function operator (line 196) | bool operator==(const self& x) const { return cur == x.cur; } function operator (line 197) | bool operator!=(const self& x) const { return !(*this == x); } function operator (line 198) | bool operator<(const self& x) const { function set_node (line 202) | void set_node(map_pointer new_node) { function random_access_iterator_tag (line 214) | random_access_iterator_tag function T (line 220) | T* value_type(const __deque_iterator&) { function random_access_iterator_tag (line 232) | random_access_iterator_tag function T (line 238) | T* value_type(const __deque_iterator&) { return 0; } type value_type (line 256) | typedef value_type* pointer; type value_type (line 257) | typedef const value_type* const_pointer; type value_type (line 258) | typedef value_type& reference; type value_type (line 259) | typedef const value_type& const_reference; type size_type (line 260) | typedef size_t size_type; type difference_type (line 261) | typedef ptrdiff_t difference_type; type __deque_iterator (line 265) | typedef __deque_iterator iterator; type __deque_iterator (line 266) | typedef __deque_iterator iterator; type __deque_iterator (line 269) | typedef __deque_iterator const_reverse_iterator; type reverse_iterator (line 274) | typedef reverse_iterator reverse_iterator; type reverse_iterator (line 276) | typedef reverse_iterator type simple_alloc (line 285) | typedef simple_alloc data_allocator; type simple_alloc (line 286) | typedef simple_alloc map_allocator; function size_type (line 288) | static size_type buffer_size() { function size_type (line 291) | static size_type initial_map_size() { return 8; } function iterator (line 302) | iterator end() { return finish; } function reverse_iterator (line 306) | reverse_iterator rbegin() { return reverse_iterator(finish); } function reverse_iterator (line 307) | reverse_iterator rend() { return reverse_iterator(start); } function reference (line 315) | reference operator[](size_type n) { return start[difference_type(n)]; } function const_reference (line 316) | const_reference operator[](size_type n) const { function reference (line 320) | reference front() { return *start; } function reference (line 321) | reference back() { function swap (line 430) | void swap(deque& x) { function push_front (line 448) | void push_front(const value_type& t) { function pop_back (line 457) | void pop_back() { function pop_front (line 466) | void pop_front() { function iterator (line 493) | iterator insert(iterator position) { return insert(position, value_type(... function insert (line 497) | void insert(iterator pos, int n, const value_type& x) { function insert (line 500) | void insert(iterator pos, long n, const value_type& x) { function resize (line 518) | void resize(size_type new_size, const value_type& x) { function resize (line 526) | void resize(size_type new_size) { resize(new_size, value_type()); } function iterator (line 606) | iterator reserve_elements_at_front(size_type n) { function iterator (line 613) | iterator reserve_elements_at_back(size_type n) { function pointer (line 644) | pointer allocate_node() { return data_allocator::allocate(buffer_size()); } function deallocate_node (line 645) | void deallocate_node(pointer n) { FILE: tass-sgi-stl-2.91.57-source/stl_function.h type unary_function (line 37) | struct unary_function { type Arg1 (line 44) | typedef Arg1 first_argument_type; type Arg2 (line 45) | typedef Arg2 second_argument_type; type Result (line 46) | typedef Result result_type; function T (line 75) | T operator()(const T& x, const T& y) const { return x % y; } function T (line 80) | T operator()(const T& x) const { return -x; } function const (line 85) | bool operator()(const T& x, const T& y) const { return x == y; } function const (line 90) | bool operator()(const T& x, const T& y) const { return x != y; } function const (line 95) | bool operator()(const T& x, const T& y) const { return x > y; } function const (line 100) | bool operator()(const T& x, const T& y) const { return x < y; } function const (line 105) | bool operator()(const T& x, const T& y) const { return x >= y; } function const (line 110) | bool operator()(const T& x, const T& y) const { return x <= y; } function const (line 115) | bool operator()(const T& x, const T& y) const { return x && y; } function const (line 120) | bool operator()(const T& x, const T& y) const { return x || y; } function const (line 125) | bool operator()(const T& x) const { return !x; } function const (line 135) | bool operator()(const typename Predicate::argument_type& x) const { function const (line 154) | bool operator()(const typename Predicate::first_argument_type& x, function typename (line 176) | typename Operation::result_type type typename (line 184) | typedef typename Operation::first_argument_type arg1_type; function typename (line 199) | typename Operation::result_type type typename (line 207) | typedef typename Operation::second_argument_type arg2_type; function typename (line 219) | typename Operation1::result_type function typename (line 242) | typename Operation1::result_type function explicit (line 260) | explicit pointer_to_unary_function(Result (*x)(Arg)) : ptr(x) {} function Result (line 261) | Result operator()(Arg x) const { return ptr(x); } function explicit (line 275) | explicit pointer_to_binary_function(Result (*x)(Arg1, Arg2)) : ptr(x) {} function Result (line 276) | Result operator()(Arg1 x, Arg2 y) const { return ptr(x, y); } function Arg2 (line 313) | Arg2 operator()(const Arg1&, const Arg2& y) const { return y; } type Result (line 319) | typedef Result result_type; function val (line 321) | constant_void_fun(const result_type& v) : val(v) {} function val (line 332) | constant_unary_fun(const Result& v) : val(v) {} function Result (line 333) | const Result& operator()(const Argument&) const { return val; } function val (line 343) | constant_binary_fun(const Result& v) : val(v) {} function Result (line 344) | const Result& operator()(const Arg1&, const Arg2&) const { function initialize (line 381) | void initialize(unsigned int seed) function S (line 434) | S operator()(T* p) const { return (p->*f)(); } function S (line 443) | S operator()(const T* p) const { return (p->*f)(); } function S (line 453) | S operator()(T& r) const { return (r.*f)(); } function S (line 462) | S operator()(const T& r) const { return (r.*f)(); } function S (line 480) | S operator()(const T* p, A x) const { return (p->*f)(x); } function explicit (line 488) | explicit mem_fun1_ref_t(S (T::*pf)(A)) : f(pf) {} function S (line 489) | S operator()(T& r, A x) const { return (r.*f)(x); } function S (line 498) | S operator()(const T& r, A x) const { return (r.*f)(x); } function explicit (line 508) | explicit mem_fun_t(void (T::*pf)()) : f(pf) {} function const (line 509) | void operator()(T* p) const { (p->*f)(); } function explicit (line 517) | explicit const_mem_fun_t(void (T::*pf)() const) : f(pf) {} function const (line 518) | void operator()(const T* p) const { (p->*f)(); } function explicit (line 526) | explicit mem_fun_ref_t(void (T::*pf)()) : f(pf) {} function const (line 527) | void operator()(T& r) const { (r.*f)(); } function explicit (line 535) | explicit const_mem_fun_ref_t(void (T::*pf)() const) : f(pf) {} function const (line 536) | void operator()(const T& r) const { (r.*f)(); } function explicit (line 544) | explicit mem_fun1_t(void (T::*pf)(A)) : f(pf) {} function const (line 545) | void operator()(T* p, A x) const { (p->*f)(x); } function explicit (line 553) | explicit const_mem_fun1_t(void (T::*pf)(A) const) : f(pf) {} function const (line 554) | void operator()(const T* p, A x) const { (p->*f)(x); } function explicit (line 562) | explicit mem_fun1_ref_t(void (T::*pf)(A)) : f(pf) {} function const (line 563) | void operator()(T& r, A x) const { (r.*f)(x); } function explicit (line 571) | explicit const_mem_fun1_ref_t(void (T::*pf)(A) const) : f(pf) {} function const (line 572) | void operator()(const T& r, A x) const { (r.*f)(x); } FILE: tass-sgi-stl-2.91.57-source/stl_hash_fun.h function __STL_BEGIN_NAMESPACE (line 36) | __STL_BEGIN_NAMESPACE function __stl_hash_string (line 40) | inline size_t __stl_hash_string(const char* s) function const (line 51) | size_t operator()(const char* s) const { return __stl_hash_string(s); } function const (line 56) | size_t operator()(const char* s) const { return __stl_hash_string(s); } function const (line 60) | size_t operator()(char x) const { return x; } function const (line 63) | size_t operator()(unsigned char x) const { return x; } function const (line 66) | size_t operator()(unsigned char x) const { return x; } function const (line 69) | size_t operator()(short x) const { return x; } function const (line 72) | size_t operator()(unsigned short x) const { return x; } function const (line 75) | size_t operator()(int x) const { return x; } function const (line 78) | size_t operator()(unsigned int x) const { return x; } function const (line 81) | size_t operator()(long x) const { return x; } function const (line 84) | size_t operator()(unsigned long x) const { return x; } FILE: tass-sgi-stl-2.91.57-source/stl_hash_map.h type T (line 58) | typedef T data_type; type T (line 59) | typedef T mapped_type; type typename (line 60) | typedef typename ht::value_type value_type; type typename (line 61) | typedef typename ht::hasher hasher; type typename (line 62) | typedef typename ht::key_equal key_equal; type typename (line 64) | typedef typename ht::size_type size_type; type typename (line 65) | typedef typename ht::difference_type difference_type; type typename (line 66) | typedef typename ht::pointer pointer; type typename (line 67) | typedef typename ht::const_pointer const_pointer; type typename (line 68) | typedef typename ht::reference reference; type typename (line 69) | typedef typename ht::const_reference const_reference; type typename (line 71) | typedef typename ht::iterator iterator; type typename (line 72) | typedef typename ht::const_iterator const_iterator; function explicit (line 79) | explicit hash_map(size_type n) : rep(n, hasher(), key_equal()) {} function swap (line 128) | void swap(hash_map& hs) { rep.swap(hs.rep); } function iterator (line 132) | iterator begin() { return rep.begin(); } function iterator (line 133) | iterator end() { return rep.end(); } function insert (line 144) | void insert(const value_type* f, const value_type* l) { function insert (line 147) | void insert(const_iterator f, const_iterator l) { rep.insert_unique(f, l... function iterator (line 152) | iterator find(const key_type& key) { return rep.find(key); } function const_iterator (line 153) | const_iterator find(const key_type& key) const { return rep.find(key); } function size_type (line 159) | size_type count(const key_type& key) const { return rep.count(key); } function size_type (line 166) | size_type erase(const key_type& key) {return rep.erase(key); } function erase (line 167) | void erase(iterator it) { rep.erase(it); } function erase (line 168) | void erase(iterator f, iterator l) { rep.erase(f, l); } function clear (line 169) | void clear() { rep.clear(); } function size_type (line 175) | size_type elems_in_bucket(size_type n) const type T (line 214) | typedef T data_type; type T (line 215) | typedef T mapped_type; type typename (line 216) | typedef typename ht::value_type value_type; type typename (line 217) | typedef typename ht::hasher hasher; type typename (line 218) | typedef typename ht::key_equal key_equal; type typename (line 220) | typedef typename ht::size_type size_type; type typename (line 221) | typedef typename ht::difference_type difference_type; type typename (line 222) | typedef typename ht::pointer pointer; type typename (line 223) | typedef typename ht::const_pointer const_pointer; type typename (line 224) | typedef typename ht::reference reference; type typename (line 225) | typedef typename ht::const_reference const_reference; type typename (line 227) | typedef typename ht::iterator iterator; type typename (line 228) | typedef typename ht::const_iterator const_iterator; function explicit (line 235) | explicit hash_multimap(size_type n) : rep(n, hasher(), key_equal()) {} function swap (line 284) | void swap(hash_multimap& hs) { rep.swap(hs.rep); } function iterator (line 288) | iterator begin() { return rep.begin(); } function iterator (line 289) | iterator end() { return rep.end(); } function insert (line 299) | void insert(const value_type* f, const value_type* l) { function insert (line 302) | void insert(const_iterator f, const_iterator l) { rep.insert_equal(f, l); } function iterator (line 304) | iterator insert_noresize(const value_type& obj) function iterator (line 307) | iterator find(const key_type& key) { return rep.find(key); } function const_iterator (line 308) | const_iterator find(const key_type& key) const { return rep.find(key); } function size_type (line 310) | size_type count(const key_type& key) const { return rep.count(key); } function size_type (line 317) | size_type erase(const key_type& key) {return rep.erase(key); } function erase (line 318) | void erase(iterator it) { rep.erase(it); } function erase (line 319) | void erase(iterator f, iterator l) { rep.erase(f, l); } function clear (line 320) | void clear() { rep.clear(); } function size_type (line 326) | size_type elems_in_bucket(size_type n) const FILE: tass-sgi-stl-2.91.57-source/stl_hash_set.h type typename (line 56) | typedef typename ht::value_type value_type; type typename (line 57) | typedef typename ht::hasher hasher; type typename (line 58) | typedef typename ht::key_equal key_equal; type typename (line 60) | typedef typename ht::size_type size_type; type typename (line 61) | typedef typename ht::difference_type difference_type; type typename (line 62) | typedef typename ht::const_pointer pointer; type typename (line 63) | typedef typename ht::const_pointer const_pointer; type typename (line 64) | typedef typename ht::const_reference reference; type typename (line 65) | typedef typename ht::const_reference const_reference; type typename (line 67) | typedef typename ht::const_iterator iterator; type typename (line 68) | typedef typename ht::const_iterator const_iterator; function explicit (line 75) | explicit hash_set(size_type n) : rep(n, hasher(), key_equal()) {} function swap (line 124) | void swap(hash_set& hs) { rep.swap(hs.rep); } function insert (line 141) | void insert(const value_type* f, const value_type* l) { function insert (line 144) | void insert(const_iterator f, const_iterator l) {rep.insert_unique(f, l); } function iterator (line 152) | iterator find(const key_type& key) const { return rep.find(key); } function size_type (line 154) | size_type count(const key_type& key) const { return rep.count(key); } function size_type (line 159) | size_type erase(const key_type& key) {return rep.erase(key); } function erase (line 160) | void erase(iterator it) { rep.erase(it); } function erase (line 161) | void erase(iterator f, iterator l) { rep.erase(f, l); } function clear (line 162) | void clear() { rep.clear(); } function size_type (line 168) | size_type elems_in_bucket(size_type n) const type typename (line 206) | typedef typename ht::value_type value_type; type typename (line 207) | typedef typename ht::hasher hasher; type typename (line 208) | typedef typename ht::key_equal key_equal; type typename (line 210) | typedef typename ht::size_type size_type; type typename (line 211) | typedef typename ht::difference_type difference_type; type typename (line 212) | typedef typename ht::const_pointer pointer; type typename (line 213) | typedef typename ht::const_pointer const_pointer; type typename (line 214) | typedef typename ht::const_reference reference; type typename (line 215) | typedef typename ht::const_reference const_reference; type typename (line 217) | typedef typename ht::const_iterator iterator; type typename (line 218) | typedef typename ht::const_iterator const_iterator; function explicit (line 225) | explicit hash_multiset(size_type n) : rep(n, hasher(), key_equal()) {} function swap (line 274) | void swap(hash_multiset& hs) { rep.swap(hs.rep); } function insert (line 287) | void insert(const value_type* f, const value_type* l) { function insert (line 290) | void insert(const_iterator f, const_iterator l) { rep.insert_equal(f, l); } function iterator (line 292) | iterator insert_noresize(const value_type& obj) function iterator (line 295) | iterator find(const key_type& key) const { return rep.find(key); } function size_type (line 297) | size_type count(const key_type& key) const { return rep.count(key); } function size_type (line 302) | size_type erase(const key_type& key) {return rep.erase(key); } function erase (line 303) | void erase(iterator it) { rep.erase(it); } function erase (line 304) | void erase(iterator f, iterator l) { rep.erase(f, l); } function clear (line 305) | void clear() { rep.clear(); } function size_type (line 311) | size_type elems_in_bucket(size_type n) const FILE: tass-sgi-stl-2.91.57-source/stl_hashtable.h function __STL_BEGIN_NAMESPACE (line 47) | __STL_BEGIN_NAMESPACE type __hashtable_iterator (line 73) | typedef __hashtable_iterator node; type forward_iterator_tag (line 81) | typedef forward_iterator_tag iterator_category; type Value (line 82) | typedef Value value_type; type difference_type (line 83) | typedef ptrdiff_t difference_type; type size_type (line 84) | typedef size_t size_type; type Value (line 85) | typedef Value& reference; type Value (line 86) | typedef Value* pointer; function reference (line 93) | reference operator*() const { return cur->val; } function pointer (line 95) | pointer operator->() const { return &(operator*()); } type __hashtable_iterator (line 109) | typedef __hashtable_iterator node; type forward_iterator_tag (line 117) | typedef forward_iterator_tag iterator_category; type Value (line 118) | typedef Value value_type; type difference_type (line 119) | typedef ptrdiff_t difference_type; type size_type (line 120) | typedef size_t size_type; type Value (line 121) | typedef const Value& reference; type Value (line 122) | typedef const Value* pointer; function pointer (line 133) | pointer operator->() const { return &(operator*()); } function __stl_next_prime (line 153) | inline unsigned long __stl_next_prime(unsigned long n) type Value (line 168) | typedef Value value_type; type HashFcn (line 169) | typedef HashFcn hasher; type EqualKey (line 170) | typedef EqualKey key_equal; type size_type (line 172) | typedef size_t size_type; type difference_type (line 173) | typedef ptrdiff_t difference_type; type value_type (line 174) | typedef value_type* pointer; type value_type (line 175) | typedef const value_type* const_pointer; type value_type (line 176) | typedef value_type& reference; type value_type (line 177) | typedef const value_type& const_reference; type __hashtable_node (line 187) | typedef __hashtable_node node; type simple_alloc (line 188) | typedef simple_alloc node_allocator; type __hashtable_const_iterator (line 198) | typedef __hashtable_const_iterator::iterator_category category; type value_type (line 350) | typedef void value_type; type difference_type (line 351) | typedef void difference_type; type pointer (line 352) | typedef void pointer; type reference (line 353) | typedef void reference; function explicit (line 355) | explicit front_insert_iterator(Container& x) : container(&x) {} type value_type (line 389) | typedef void value_type; type difference_type (line 390) | typedef void difference_type; type pointer (line 391) | typedef void pointer; type reference (line 392) | typedef void reference; type typename (line 420) | typedef typename Container::iterator iter; type reverse_bidirectional_iterator (line 432) | typedef reverse_bidirectional_iterator() const { return &(operator*()); } type typename (line 529) | typedef typename iterator_traits::value_type type typename (line 531) | typedef typename iterator_traits::difference_type type typename (line 533) | typedef typename iterator_traits::pointer type typename (line 535) | typedef typename iterator_traits::reference type Iterator (line 538) | typedef Iterator iterator_type; type reverse_iterator (line 539) | typedef reverse_iterator self; function explicit (line 543) | explicit reverse_iterator(iterator_type x) : current(x) {} function current (line 545) | reverse_iterator(const self& x) : current(x.current) {} function reference (line 552) | reference operator*() const { function pointer (line 557) | pointer operator->() const { return &(operator*()); } type reverse_iterator (line 635) | typedef reverse_iterator type T (line 641) | typedef T value_type; type Distance (line 642) | typedef Distance difference_type; type T (line 643) | typedef T* pointer; type Reference (line 644) | typedef Reference reference; function explicit (line 647) | explicit reverse_iterator(RandomAccessIterator x) : current(x) {} function Reference (line 649) | Reference operator*() const { return *(current - 1); } function pointer (line 651) | pointer operator->() const { return &(operator*()); } function read (line 749) | void read() { type T (line 756) | typedef T value_type; type Distance (line 757) | typedef Distance difference_type; type T (line 758) | typedef const T* pointer; type T (line 759) | typedef const T& reference; type value_type (line 810) | typedef void value_type; type difference_type (line 811) | typedef void difference_type; type pointer (line 812) | typedef void pointer; type reference (line 813) | typedef void reference; FILE: tass-sgi-stl-2.91.57-source/stl_list.h type __list_iterator (line 50) | typedef __list_iterator iterator; type __list_iterator (line 51) | typedef __list_iterator self; type bidirectional_iterator_tag (line 54) | typedef bidirectional_iterator_tag iterator_category; type T (line 55) | typedef T value_type; type Ptr (line 56) | typedef Ptr pointer; type Ref (line 57) | typedef Ref reference; type __list_node (line 58) | typedef __list_node* link_type; type size_type (line 59) | typedef size_t size_type; type difference_type (line 60) | typedef ptrdiff_t difference_type; function node (line 64) | __list_iterator(link_type x) : node(x) {} function node (line 66) | __list_iterator(const iterator& x) : node(x.node) {} function operator (line 68) | bool operator==(const self& x) const { return node == x.node; } function operator (line 69) | bool operator!=(const self& x) const { return node != x.node; } function reference (line 70) | reference operator*() const { return (*node).data; } function pointer (line 73) | pointer operator->() const { return &(operator*()); } function bidirectional_iterator_tag (line 99) | bidirectional_iterator_tag function T (line 105) | T* type __list_node (line 122) | typedef __list_node list_node; type simple_alloc (line 123) | typedef simple_alloc list_node_allocator; type value_type (line 126) | typedef value_type* pointer; type value_type (line 127) | typedef const value_type* const_pointer; type value_type (line 128) | typedef value_type& reference; type value_type (line 129) | typedef const value_type& const_reference; type list_node (line 130) | typedef list_node* link_type; type size_type (line 131) | typedef size_t size_type; type difference_type (line 132) | typedef ptrdiff_t difference_type; type __list_iterator (line 136) | typedef __list_iterator const_reverse_iterator; type reverse_iterator (line 140) | typedef reverse_iterator reverse_iterator; type reverse_bidirectional_iterator (line 142) | typedef reverse_bidirectional_iterator& x) { __STD::swap(node, x.node); } function iterator (line 238) | iterator insert(iterator position, const T& x) { function iterator (line 246) | iterator insert(iterator position) { return insert(position, T()); } function insert (line 256) | void insert(iterator pos, int n, const T& x) { function insert (line 259) | void insert(iterator pos, long n, const T& x) { function push_front (line 263) | void push_front(const T& x) { insert(begin(), x); } function push_back (line 264) | void push_back(const T& x) { insert(end(), x); } function iterator (line 265) | iterator erase(iterator position) { function resize (line 275) | void resize(size_type new_size) { resize(new_size, T()); } function pop_front (line 278) | void pop_front() { erase(begin()); } function pop_back (line 279) | void pop_back() { function explicit (line 286) | explicit list(size_type n) { fill_initialize(n, T()); } function splice (line 327) | void splice(iterator position, list&, iterator i) { function splice (line 333) | void splice(iterator position, list&, iterator first, iterator last) { type typename (line 355) | typedef typename list::link_type link_type; FILE: tass-sgi-stl-2.91.57-source/stl_map.h type Key (line 50) | typedef Key key_type; type T (line 51) | typedef T data_type; type T (line 52) | typedef T mapped_type; type pair (line 53) | typedef pair value_type; type Compare (line 54) | typedef Compare key_compare; function comp (line 61) | value_compare(Compare c) : comp(c) {} type typename (line 74) | typedef typename rep_type::const_pointer const_pointer; type typename (line 75) | typedef typename rep_type::reference reference; type typename (line 76) | typedef typename rep_type::const_reference const_reference; type typename (line 77) | typedef typename rep_type::iterator iterator; type typename (line 78) | typedef typename rep_type::const_iterator const_iterator; type typename (line 79) | typedef typename rep_type::reverse_iterator reverse_iterator; type typename (line 80) | typedef typename rep_type::const_reverse_iterator const_reverse_iterator; type typename (line 81) | typedef typename rep_type::size_type size_type; type typename (line 82) | typedef typename rep_type::difference_type difference_type; function t (line 86) | t(Compare()) {} function explicit (line 87) | explicit map(const Compare& comp) : t(comp) {} function t (line 92) | t(Compare()) { t.insert_unique(first, last); } function t (line 96) | t(comp) { t.insert_unique(first, last); } function iterator (line 120) | iterator begin() { return t.begin(); } function iterator (line 122) | iterator end() { return t.end(); } function reverse_iterator (line 124) | reverse_iterator rbegin() { return t.rbegin(); } function reverse_iterator (line 126) | reverse_iterator rend() { return t.rend(); } function swap (line 134) | void swap(map& x) { t.swap(x.t); } function iterator (line 139) | iterator insert(iterator position, const value_type& x) { function insert (line 148) | void insert(const value_type* first, const value_type* last) { function insert (line 151) | void insert(const_iterator first, const_iterator last) { function erase (line 156) | void erase(iterator position) { t.erase(position); } function size_type (line 157) | size_type erase(const key_type& x) { return t.erase(x); } function erase (line 158) | void erase(iterator first, iterator last) { t.erase(first, last); } function clear (line 159) | void clear() { t.clear(); } function iterator (line 163) | iterator find(const key_type& x) { return t.find(x); } function const_iterator (line 164) | const_iterator find(const key_type& x) const { return t.find(x); } function size_type (line 165) | size_type count(const key_type& x) const { return t.count(x); } function iterator (line 166) | iterator lower_bound(const key_type& x) {return t.lower_bound(x); } function const_iterator (line 167) | const_iterator lower_bound(const key_type& x) const { function iterator (line 170) | iterator upper_bound(const key_type& x) {return t.upper_bound(x); } function const_iterator (line 171) | const_iterator upper_bound(const key_type& x) const { FILE: tass-sgi-stl-2.91.57-source/stl_multimap.h type Key (line 50) | typedef Key key_type; type T (line 51) | typedef T data_type; type T (line 52) | typedef T mapped_type; type pair (line 53) | typedef pair value_type; type Compare (line 54) | typedef Compare key_compare; function comp (line 60) | value_compare(Compare c) : comp(c) {} type typename (line 73) | typedef typename rep_type::const_pointer const_pointer; type typename (line 74) | typedef typename rep_type::reference reference; type typename (line 75) | typedef typename rep_type::const_reference const_reference; type typename (line 76) | typedef typename rep_type::iterator iterator; type typename (line 77) | typedef typename rep_type::const_iterator const_iterator; type typename (line 78) | typedef typename rep_type::reverse_iterator reverse_iterator; type typename (line 79) | typedef typename rep_type::const_reverse_iterator const_reverse_iterator; type typename (line 80) | typedef typename rep_type::size_type size_type; type typename (line 81) | typedef typename rep_type::difference_type difference_type; function t (line 85) | t(Compare()) { } function explicit (line 86) | explicit multimap(const Compare& comp) : t(comp) { } function t (line 91) | t(Compare()) { t.insert_equal(first, last); } function t (line 95) | t(comp) { t.insert_equal(first, last); } function iterator (line 120) | iterator begin() { return t.begin(); } function iterator (line 122) | iterator end() { return t.end(); } function reverse_iterator (line 124) | reverse_iterator rbegin() { return t.rbegin(); } function reverse_iterator (line 126) | reverse_iterator rend() { return t.rend(); } function swap (line 131) | void swap(multimap& x) { t.swap(x.t); } function iterator (line 135) | iterator insert(const value_type& x) { return t.insert_equal(x); } function iterator (line 136) | iterator insert(iterator position, const value_type& x) { function insert (line 145) | void insert(const value_type* first, const value_type* last) { function insert (line 148) | void insert(const_iterator first, const_iterator last) { function erase (line 152) | void erase(iterator position) { t.erase(position); } function size_type (line 153) | size_type erase(const key_type& x) { return t.erase(x); } function erase (line 154) | void erase(iterator first, iterator last) { t.erase(first, last); } function clear (line 155) | void clear() { t.clear(); } function iterator (line 159) | iterator find(const key_type& x) { return t.find(x); } function const_iterator (line 160) | const_iterator find(const key_type& x) const { return t.find(x); } function size_type (line 161) | size_type count(const key_type& x) const { return t.count(x); } function iterator (line 162) | iterator lower_bound(const key_type& x) {return t.lower_bound(x); } function const_iterator (line 163) | const_iterator lower_bound(const key_type& x) const { function iterator (line 166) | iterator upper_bound(const key_type& x) {return t.upper_bound(x); } function const_iterator (line 167) | const_iterator upper_bound(const key_type& x) const { FILE: tass-sgi-stl-2.91.57-source/stl_multiset.h type Key (line 50) | typedef Key value_type; type Compare (line 51) | typedef Compare key_compare; type Compare (line 52) | typedef Compare value_compare; type typename (line 59) | typedef typename rep_type::const_pointer const_pointer; type typename (line 60) | typedef typename rep_type::const_reference reference; type typename (line 61) | typedef typename rep_type::const_reference const_reference; type typename (line 62) | typedef typename rep_type::const_iterator iterator; type typename (line 63) | typedef typename rep_type::const_iterator const_iterator; type typename (line 64) | typedef typename rep_type::const_reverse_iterator reverse_iterator; type typename (line 65) | typedef typename rep_type::const_reverse_iterator const_reverse_iterator; type typename (line 66) | typedef typename rep_type::size_type size_type; type typename (line 67) | typedef typename rep_type::difference_type difference_type; function t (line 71) | t(Compare()) {} function explicit (line 72) | explicit multiset(const Compare& comp) : t(comp) {} function t (line 77) | t(Compare()) { t.insert_equal(first, last); } function t (line 80) | t(comp) { t.insert_equal(first, last); } function swap (line 112) | void swap(multiset& x) { t.swap(x.t); } function iterator (line 115) | iterator insert(const value_type& x) { function iterator (line 118) | iterator insert(iterator position, const value_type& x) { function insert (line 129) | void insert(const value_type* first, const value_type* last) { function insert (line 132) | void insert(const_iterator first, const_iterator last) { function erase (line 136) | void erase(iterator position) { function size_type (line 140) | size_type erase(const key_type& x) { function erase (line 143) | void erase(iterator first, iterator last) { function clear (line 147) | void clear() { t.clear(); } function iterator (line 151) | iterator find(const key_type& x) const { return t.find(x); } function size_type (line 152) | size_type count(const key_type& x) const { return t.count(x); } function iterator (line 153) | iterator lower_bound(const key_type& x) const { function iterator (line 156) | iterator upper_bound(const key_type& x) const { FILE: tass-sgi-stl-2.91.57-source/stl_numeric.h function T (line 180) | T power(T x, Integer n) { FILE: tass-sgi-stl-2.91.57-source/stl_pair.h type pair (line 37) | struct pair { FILE: tass-sgi-stl-2.91.57-source/stl_queue.h type typename (line 46) | typedef typename Sequence::size_type size_type; type typename (line 47) | typedef typename Sequence::reference reference; type typename (line 48) | typedef typename Sequence::const_reference const_reference; function reference (line 54) | reference front() { return c.front(); } function reference (line 56) | reference back() { return c.back(); } function push (line 58) | void push(const value_type& x) { c.push_back(x); } function pop (line 59) | void pop() { c.pop_front(); } type typename (line 81) | typedef typename Sequence::size_type size_type; type typename (line 82) | typedef typename Sequence::reference reference; type typename (line 83) | typedef typename Sequence::const_reference const_reference; function explicit (line 89) | explicit priority_queue(const Compare& x) : c(), comp(x) {} function push (line 110) | void push(const value_type& x) { function pop (line 117) | void pop() { FILE: tass-sgi-stl-2.91.57-source/stl_raw_storage_iter.h type value_type (line 42) | typedef void value_type; type difference_type (line 43) | typedef void difference_type; type pointer (line 44) | typedef void pointer; type reference (line 45) | typedef void reference; function explicit (line 47) | explicit raw_storage_iterator(ForwardIterator x) : iter(x) {} FILE: tass-sgi-stl-2.91.57-source/stl_rope.h function charT (line 39) | charT __eos(charT*) { return charT(); } function __is_basic_char_type (line 44) | bool __is_basic_char_type(charT *) { return false; } function __is_one_byte_char_type (line 46) | bool __is_one_byte_char_type(charT *) { return false; } function __is_basic_char_type (line 48) | inline bool __is_basic_char_type(char *) { return true; } function __is_one_byte_char_type (line 49) | inline bool __is_one_byte_char_type(char *) { return true; } function __is_basic_char_type (line 50) | inline bool __is_basic_char_type(wchar_t *) { return true; } type typename (line 105) | typedef typename sequence::value_type value_type; type v (line 107) | typedef v value_type; function push_back (line 143) | void push_back(value_type x) function append (line 154) | void append(value_type *s, size_t len) type rope (line 240) | typedef rope my_rope; type simple_alloc (line 241) | typedef simple_alloc DataAlloc; type simple_alloc (line 242) | typedef simple_alloc<__rope_RopeConcatenation, Alloc> CAlloc; type simple_alloc (line 243) | typedef simple_alloc<__rope_RopeLeaf, Alloc> LAlloc; type simple_alloc (line 244) | typedef simple_alloc<__rope_RopeFunction, Alloc> FAlloc; type simple_alloc (line 245) | typedef simple_alloc<__rope_RopeSubstring, Alloc> SAlloc; function init_refcount_lock (line 290) | void init_refcount_lock() {} function incr_refcount (line 291) | void incr_refcount () function decr_refcount (line 295) | size_t decr_refcount () function init_refcount_lock (line 300) | void init_refcount_lock() {} function incr_refcount (line 301) | void incr_refcount () function decr_refcount (line 305) | size_t decr_refcount () function init_refcount_lock (line 314) | void init_refcount_lock() { function incr_refcount (line 317) | void incr_refcount () function decr_refcount (line 323) | size_t decr_refcount () function init_refcount_lock (line 332) | void init_refcount_lock() {} function incr_refcount (line 333) | void incr_refcount () function decr_refcount (line 337) | size_t decr_refcount () function incr_refcount (line 344) | void incr_refcount () {} function unref_nonnil (line 357) | void unref_nonnil() function ref_nonnil (line 361) | void ref_nonnil() function unref (line 365) | static void unref(__rope_RopeBase* t) function ref (line 371) | static void ref(__rope_RopeBase* t) function free_if_unref (line 375) | static void free_if_unref(__rope_RopeBase* t) function unref_nonnil (line 380) | void unref_nonnil() {} function ref_nonnil (line 381) | void ref_nonnil() {} function unref (line 382) | static void unref(__rope_RopeBase* t) {} function ref (line 383) | static void ref(__rope_RopeBase* t) {} function free_if_unref (line 385) | static void free_if_unref(__rope_RopeBase* t) {} function rounded_up_size (line 392) | static size_t rounded_up_size(size_t n) { function virtual (line 455) | virtual ~__rope_RopeSubstring() {} function virtual (line 456) | virtual void operator()(size_t start_pos, size_t req_len, function ptr (line 516) | ptr(p) {} type __rope_RopeBase (line 536) | typedef __rope_RopeBase * self_destruct_ptr; type __rope_self_destruct_ptr (line 538) | typedef __rope_self_destruct_ptr self_destruct_ptr; type __rope_RopeBase (line 540) | typedef __rope_RopeBase RopeBase; type rope (line 541) | typedef rope my_rope; type charT (line 694) | typedef const charT* pointer; function reference (line 713) | reference operator*() { function reference (line 769) | reference operator[](size_t n) { type __rope_charT_ref_proxy (line 803) | typedef __rope_charT_ref_proxy* pointer; function reference (line 834) | reference operator*() { function reference (line 877) | reference operator[](ptrdiff_t n) { type difference_type (line 909) | typedef ptrdiff_t difference_type; type size_type (line 910) | typedef size_t size_type; type charT (line 911) | typedef charT const_reference; type charT (line 912) | typedef const charT* const_pointer; type __rope_iterator (line 913) | typedef __rope_iterator iterator; type __rope_const_iterator (line 914) | typedef __rope_const_iterator const_iterator; type __rope_charT_ref_proxy (line 915) | typedef __rope_charT_ref_proxy reference; type __rope_charT_ptr_proxy (line 916) | typedef __rope_charT_ptr_proxy pointer; function cstrptr (line 929) | static cstrptr atomic_swap(cstrptr *p, cstrptr q) { function cstrptr (line 939) | static cstrptr atomic_swap(cstrptr *p, cstrptr q) { function cstrptr (line 947) | static cstrptr atomic_swap(cstrptr *p, cstrptr q) { function cstrptr (line 955) | static cstrptr atomic_swap(cstrptr *p, cstrptr q) { type simple_alloc (line 964) | typedef simple_alloc DataAlloc; type simple_alloc (line 965) | typedef simple_alloc<__rope_RopeConcatenation, Alloc> CAlloc; type simple_alloc (line 966) | typedef simple_alloc<__rope_RopeLeaf, Alloc> LAlloc; type simple_alloc (line 967) | typedef simple_alloc<__rope_RopeFunction, Alloc> FAlloc; type simple_alloc (line 968) | typedef simple_alloc<__rope_RopeSubstring, Alloc> SAlloc; function is0 (line 969) | static bool is0(charT c) { return c == __eos((charT *)0); } type __rope_RopeBase (line 974) | typedef __rope_RopeBase RopeBase; type __rope_RopeConcatenation (line 975) | typedef __rope_RopeConcatenation RopeConcatenation; type __rope_RopeLeaf (line 976) | typedef __rope_RopeLeaf RopeLeaf; type __rope_RopeFunction (line 977) | typedef __rope_RopeFunction RopeFunction; type __rope_RopeSubstring (line 978) | typedef __rope_RopeSubstring RopeSubstring; function unref (line 1004) | static void unref(RopeBase* t) function ref (line 1008) | static void ref(RopeBase* t) function unref (line 1013) | static void unref(RopeBase* t) {} function ref (line 1014) | static void ref(RopeBase* t) {} type __rope_RopeBase (line 1019) | typedef __rope_RopeBase * self_destruct_ptr; type __rope_self_destruct_ptr (line 1021) | typedef __rope_self_destruct_ptr self_destruct_ptr; function allocated_capacity (line 1062) | static size_t allocated_capacity(size_t n) { function charT (line 1072) | static charT * alloc_copy(const charT *s, size_t size) function RopeLeaf (line 1092) | static RopeLeaf * RopeLeaf_from_unowned_char_ptr(const charT *s, type concat_fn (line 1132) | struct concat_fn type concat_fn (line 1135) | struct concat_fn function friend (line 1143) | friend rope identity_element(concat_fn) { return rope(); } function tree_ptr (line 1148) | tree_ptr(t) { } function is_balanced (line 1164) | static bool is_balanced(RopeBase *r) function is_almost_balanced (line 1167) | static bool is_almost_balanced(RopeBase *r) function is_roughly_balanced (line 1171) | static bool is_roughly_balanced(RopeBase *r) function RopeBase (line 1176) | static RopeBase * concat_and_set_balanced(RopeBase *left, function compare (line 1210) | int compare(const rope &y) const { function push_back (line 1315) | void push_back(charT x) function pop_back (line 1322) | void pop_back() function push_front (line 1334) | void push_front(charT x) function pop_front (line 1348) | void pop_front() function balance (line 1360) | void balance() function copy (line 1367) | void copy(charT * buffer) const { function size_type (line 1377) | size_type copy(size_type pos, size_type n, charT *buffer) const { function dump (line 1388) | void dump() { function delete_c_str (line 1403) | void delete_c_str () { function charT (line 1416) | charT operator[] (size_type pos) const { function charT (line 1420) | charT at(size_type pos) const { type reverse_iterator (line 1458) | typedef reverse_iterator const_reverse_iterator; type reverse_iterator (line 1460) | typedef reverse_iterator reverse_iterator; type reverse_iterator (line 1831) | typedef reverse_iterator crope; type rope (line 2051) | typedef rope wrope; function crope (line 2053) | inline crope::reference __mutable_reference_at(crope& c, size_t i) function wrope (line 2058) | inline wrope::reference __mutable_reference_at(wrope& c, size_t i) function swap (line 2072) | inline void swap(crope x, crope y) { x.swap(y); } function swap (line 2073) | inline void swap(wrope x, wrope y) { x.swap(y); } function const (line 2080) | size_t operator()(const crope& str) const function const (line 2092) | size_t operator()(const wrope& str) const FILE: tass-sgi-stl-2.91.57-source/stl_set.h type Key (line 50) | typedef Key value_type; type Compare (line 51) | typedef Compare key_compare; type Compare (line 52) | typedef Compare value_compare; type typename (line 59) | typedef typename rep_type::const_pointer const_pointer; type typename (line 60) | typedef typename rep_type::const_reference reference; type typename (line 61) | typedef typename rep_type::const_reference const_reference; type typename (line 62) | typedef typename rep_type::const_iterator iterator; type typename (line 63) | typedef typename rep_type::const_iterator const_iterator; type typename (line 64) | typedef typename rep_type::const_reverse_iterator reverse_iterator; type typename (line 65) | typedef typename rep_type::const_reverse_iterator const_reverse_iterator; type typename (line 66) | typedef typename rep_type::size_type size_type; type typename (line 67) | typedef typename rep_type::difference_type difference_type; function t (line 71) | t(Compare()) {} function explicit (line 72) | explicit set(const Compare& comp) : t(comp) {} function t (line 77) | t(Compare()) { t.insert_unique(first, last); } function t (line 81) | t(comp) { t.insert_unique(first, last); } function swap (line 111) | void swap(set& x) { t.swap(x.t); } type pair (line 114) | typedef pair pair_iterator_bool; function iterator (line 119) | iterator insert(iterator position, const value_type& x) { function insert (line 129) | void insert(const_iterator first, const_iterator last) { function insert (line 132) | void insert(const value_type* first, const value_type* last) { function erase (line 136) | void erase(iterator position) { function size_type (line 140) | size_type erase(const key_type& x) { function erase (line 143) | void erase(iterator first, iterator last) { function clear (line 147) | void clear() { t.clear(); } function iterator (line 151) | iterator find(const key_type& x) const { return t.find(x); } function size_type (line 152) | size_type count(const key_type& x) const { return t.count(x); } function iterator (line 153) | iterator lower_bound(const key_type& x) const { function iterator (line 156) | iterator upper_bound(const key_type& x) const { FILE: tass-sgi-stl-2.91.57-source/stl_slist.h type __slist_node_base (line 29) | struct __slist_node_base function __slist_node_base (line 34) | inline __slist_node_base* __slist_make_link(__slist_node_base* prev_node, function __slist_node_base (line 42) | inline __slist_node_base* __slist_previous(__slist_node_base* head, function __slist_node_base (line 50) | inline const __slist_node_base* __slist_previous(const __slist_node_base... function __slist_splice_after (line 58) | inline void __slist_splice_after(__slist_node_base* pos, function __slist_node_base (line 71) | inline __slist_node_base* __slist_reverse(__slist_node_base* node) type __slist_iterator_base (line 91) | struct __slist_iterator_base type __slist_iterator (line 113) | typedef __slist_iterator iterator; type __slist_iterator (line 114) | typedef __slist_iterator self; type T (line 117) | typedef T value_type; type Ptr (line 118) | typedef Ptr pointer; type Ref (line 119) | typedef Ref reference; type __slist_node (line 120) | typedef __slist_node list_node; function __slist_iterator_base (line 122) | __slist_iterator_base(x) {} function __slist_iterator_base (line 124) | __slist_iterator(const iterator& x) : __slist_iterator_base(x.node) {} function reference (line 126) | reference operator*() const { return ((list_node*) node)->data; } function pointer (line 128) | pointer operator->() const { return &(operator*()); } function forward_iterator_tag (line 152) | inline forward_iterator_tag function T (line 159) | T* function __slist_size (line 166) | inline size_t __slist_size(__slist_node_base* node) type value_type (line 179) | typedef value_type* pointer; type value_type (line 180) | typedef const value_type* const_pointer; type value_type (line 181) | typedef value_type& reference; type value_type (line 182) | typedef const value_type& const_reference; type size_type (line 183) | typedef size_t size_type; type difference_type (line 184) | typedef ptrdiff_t difference_type; type __slist_iterator (line 186) | typedef __slist_iterator iterator; type __slist_iterator (line 187) | typedef __slist_iterator list_node_allocator; function list_node (line 195) | static list_node* create_node(const value_type& x) { function destroy_node (line 205) | static void destroy_node(list_node* node) { function fill_initialize (line 210) | void fill_initialize(size_type n, const value_type& x) { function range_initialize (line 228) | void range_initialize(const value_type* first, const value_type* last) { function range_initialize (line 235) | void range_initialize(const_iterator first, const_iterator last) { function explicit (line 253) | explicit slist(size_type n) { fill_initialize(n, value_type()); } function iterator (line 281) | iterator end() { return iterator(0); } function swap (line 290) | void swap(slist& L) function push_front (line 305) | void push_front(const value_type& x) { function pop_front (line 308) | void pop_front() { function iterator (line 314) | iterator previous(const_iterator pos) { function const_iterator (line 317) | const_iterator previous(const_iterator pos) const { function _insert_after_fill (line 326) | void _insert_after_fill(list_node_base* pos, function _insert_after_range (line 341) | void _insert_after_range(list_node_base* pos, function _insert_after_range (line 348) | void _insert_after_range(list_node_base* pos, function list_node_base (line 357) | list_node_base* erase_after(list_node_base* pos) { function list_node_base (line 365) | list_node_base* erase_after(list_node_base* before_first, function iterator (line 384) | iterator insert_after(iterator pos) { function insert_after (line 388) | void insert_after(iterator pos, size_type n, const value_type& x) { function insert_after (line 391) | void insert_after(iterator pos, int n, const value_type& x) { function insert_after (line 394) | void insert_after(iterator pos, long n, const value_type& x) { function insert_after (line 404) | void insert_after(iterator pos, const_iterator first, const_iterator las... function insert_after (line 407) | void insert_after(iterator pos, function iterator (line 413) | iterator insert(iterator pos, const value_type& x) { function iterator (line 417) | iterator insert(iterator pos) { function insert (line 422) | void insert(iterator pos, size_type n, const value_type& x) { function insert (line 425) | void insert(iterator pos, int n, const value_type& x) { function insert (line 428) | void insert(iterator pos, long n, const value_type& x) { function insert (line 438) | void insert(iterator pos, const_iterator first, const_iterator last) { function insert (line 441) | void insert(iterator pos, const value_type* first, const value_type* las... function iterator (line 451) | iterator erase_after(iterator before_first, iterator last) { function iterator (line 455) | iterator erase(iterator pos) { function iterator (line 458) | iterator erase(iterator first, iterator last) { function resize (line 464) | void resize(size_type new_size) { resize(new_size, T()); } function clear (line 465) | void clear() { erase_after(&head, 0); } function splice_after (line 479) | void splice_after(iterator pos, iterator prev) function splice (line 486) | void splice(iterator pos, slist& L) { function splice (line 494) | void splice(iterator pos, slist& L, iterator i) { function splice (line 502) | void splice(iterator pos, slist& L, iterator first, iterator last) type typename (line 551) | typedef typename slist::list_node list_node; FILE: tass-sgi-stl-2.91.57-source/stl_stack.h type typename (line 46) | typedef typename Sequence::size_type size_type; type typename (line 47) | typedef typename Sequence::reference reference; type typename (line 48) | typedef typename Sequence::const_reference const_reference; function reference (line 54) | reference top() { return c.back(); } function push (line 56) | void push(const value_type& x) { c.push_back(x); } function pop (line 57) | void pop() { c.pop_back(); } FILE: tass-sgi-stl-2.91.57-source/stl_tempbuf.h function class (line 63) | class temporary_buffer { FILE: tass-sgi-stl-2.91.57-source/stl_tree.h function maximum (line 67) | struct __rb_tree_node_base function else (line 98) | struct __rb_tree_base_iterator function decrement (line 123) | void decrement() type Value (line 148) | typedef Value value_type; type Ref (line 149) | typedef Ref reference; type Ptr (line 150) | typedef Ptr pointer; type __rb_tree_iterator (line 151) | typedef __rb_tree_iterator iterator; type __rb_tree_iterator (line 152) | typedef __rb_tree_iterator self; type __rb_tree_node (line 154) | typedef __rb_tree_node* link_type; function reference (line 160) | reference operator*() const { return link_type(node)->value_field; } function pointer (line 162) | pointer operator->() const { return &(operator*()); } function bidirectional_iterator_tag (line 192) | inline bidirectional_iterator_tag function __rb_tree_base_iterator (line 197) | inline __rb_tree_base_iterator::difference_type* function Value (line 203) | Value* value_type(const __rb_tree_iterator&) { function __rb_tree_rotate_left (line 209) | inline void function __rb_tree_rotate_right (line 228) | inline void function __rb_tree_rebalance (line 247) | inline void function __rb_tree_node_base (line 292) | inline __rb_tree_node_base* type __rb_tree_node_base (line 423) | typedef __rb_tree_node_base* base_ptr; type __rb_tree_node (line 424) | typedef __rb_tree_node rb_tree_node; type simple_alloc (line 425) | typedef simple_alloc rb_tree_node_allocator; type __rb_tree_color_type (line 426) | typedef __rb_tree_color_type color_type; type Value (line 429) | typedef Value value_type; type value_type (line 430) | typedef value_type* pointer; type value_type (line 431) | typedef const value_type* const_pointer; type value_type (line 432) | typedef value_type& reference; type value_type (line 433) | typedef const value_type& const_reference; type rb_tree_node (line 434) | typedef rb_tree_node* link_type; type size_type (line 435) | typedef size_t size_type; type difference_type (line 436) | typedef ptrdiff_t difference_type; function put_node (line 439) | void put_node(link_type p) { rb_tree_node_allocator::deallocate(p); } function link_type (line 441) | link_type create_node(const value_type& x) { function link_type (line 450) | link_type clone_node(link_type x) { function destroy_node (line 458) | void destroy_node(link_type p) { function link_type (line 472) | static link_type& left(link_type x) { return (link_type&)(x->left); } function link_type (line 473) | static link_type& right(link_type x) { return (link_type&)(x->right); } function link_type (line 474) | static link_type& parent(link_type x) { return (link_type&)(x->parent); } function reference (line 475) | static reference value(link_type x) { return x->value_field; } function Key (line 476) | static const Key& key(link_type x) { return KeyOfValue()(value(x)); } function color_type (line 477) | static color_type& color(link_type x) { return (color_type&)(x->color); } function link_type (line 479) | static link_type& left(base_ptr x) { return (link_type&)(x->left); } function link_type (line 480) | static link_type& right(base_ptr x) { return (link_type&)(x->right); } function link_type (line 481) | static link_type& parent(base_ptr x) { return (link_type&)(x->parent); } function reference (line 482) | static reference value(base_ptr x) { return ((link_type)x)->value_field; } function Key (line 483) | static const Key& key(base_ptr x) { return KeyOfValue()(value(link_type(... function color_type (line 484) | static color_type& color(base_ptr x) { return (color_type&)(link_type(x)... function link_type (line 486) | static link_type minimum(link_type x) { function link_type (line 489) | static link_type maximum(link_type x) { type __rb_tree_iterator (line 495) | typedef __rb_tree_iterator type reverse_iterator (line 499) | typedef reverse_iterator const_reverse_iterator; type reverse_iterator (line 500) | typedef reverse_iterator reverse_iterator; type reverse_bidirectional_iterator (line 502) | typedef reverse_bidirectional_iterator& t) { function clear (line 602) | void clear() { function else (line 756) | else if (position.node == header) // end() function else (line 919) | else function __black_count (line 1044) | inline int __black_count(__rb_tree_node_base* node, __rb_tree_node_base*... FILE: tass-sgi-stl-2.91.57-source/stl_uninitialized.h function ForwardIterator (line 62) | ForwardIterator function ForwardIterator (line 70) | ForwardIterator function wchar_t (line 82) | inline wchar_t* uninitialized_copy(const wchar_t* first, const wchar_t* ... function __uninitialized_fill_aux (line 122) | void function __uninitialized_fill (line 143) | void __uninitialized_fill(ForwardIterator first, ForwardIterator last, function uninitialized_fill (line 151) | void uninitialized_fill(ForwardIterator first, ForwardIterator last, function ForwardIterator (line 159) | ForwardIterator function ForwardIterator (line 179) | ForwardIterator __uninitialized_fill_n(ForwardIterator first, Size n, function ForwardIterator (line 187) | ForwardIterator uninitialized_fill_n(ForwardIterator first, Size n, function ForwardIterator (line 197) | ForwardIterator function ForwardIterator (line 211) | ForwardIterator function __uninitialized_copy_fill (line 225) | void FILE: tass-sgi-stl-2.91.57-source/stl_vector.h type value_type (line 44) | typedef value_type* pointer; type value_type (line 45) | typedef const value_type* const_pointer; type value_type (line 46) | typedef value_type* iterator; type value_type (line 47) | typedef const value_type* const_iterator; type value_type (line 48) | typedef value_type& reference; type value_type (line 49) | typedef const value_type& const_reference; type size_type (line 50) | typedef size_t size_type; type difference_type (line 51) | typedef ptrdiff_t difference_type; type reverse_iterator (line 54) | typedef reverse_iterator const_reverse_iterator; type reverse_iterator (line 55) | typedef reverse_iterator reverse_iterator; type reverse_iterator (line 57) | typedef reverse_iterator function deallocate (line 68) | void deallocate() { function fill_initialize (line 72) | void fill_initialize(size_type n, const T& value) { function iterator (line 80) | iterator end() { return finish; } function reverse_iterator (line 82) | reverse_iterator rbegin() { return reverse_iterator(end()); } function reverse_iterator (line 86) | reverse_iterator rend() { return reverse_iterator(begin()); } function reference (line 94) | reference operator[](size_type n) { return *(begin() + n); } function const_reference (line 95) | const_reference operator[](size_type n) const { return *(begin() + n); } function explicit (line 101) | explicit vector(size_type n) { fill_initialize(n, T()); } function reserve (line 129) | void reserve(size_type n) { function reference (line 140) | reference front() { return *begin(); } function reference (line 142) | reference back() { return *(end() - 1); } function push_back (line 144) | void push_back(const T& x) { function swap (line 152) | void swap(vector& x) { function iterator (line 157) | iterator insert(iterator position, const T& x) { function iterator (line 167) | iterator insert(iterator position) { return insert(position, T()); } function insert (line 179) | void insert (iterator pos, int n, const T& x) { function insert (line 182) | void insert (iterator pos, long n, const T& x) { function pop_back (line 186) | void pop_back() { function iterator (line 190) | iterator erase(iterator position) { function iterator (line 197) | iterator erase(iterator first, iterator last) { function resize (line 203) | void resize(size_type new_size, const T& x) { function resize (line 209) | void resize(size_type new_size) { resize(new_size, T()); } function clear (line 210) | void clear() { erase(begin(), end()); } function iterator (line 234) | iterator allocate_and_copy(size_type n, FILE: tass-sgi-stl-2.91.57-source/streambuf.h type _IO_off64_t (line 74) | typedef _IO_off64_t streamoff; type _IO_fpos64_t (line 75) | typedef _IO_fpos64_t streampos; type _IO_off_t (line 77) | typedef _IO_off_t streamoff; type _IO_fpos_t (line 78) | typedef _IO_fpos_t streampos; type _IO_ssize_t (line 80) | typedef _IO_ssize_t streamsize; type __fmtflags (line 82) | typedef unsigned long __fmtflags; type __iostate (line 83) | typedef unsigned char __iostate; type _ios_fields (line 85) | struct _ios_fields type state_value (line 114) | enum state_value { type open_mode (line 119) | enum open_mode { function class (line 126) | class ios : public _ios_fields { function set (line 213) | void set(iostate flag) { _state |= flag; function setstate (line 215) | void setstate(iostate flag) { _state |= flag; // ANSI function operator (line 222) | operator void*() const { return fail() ? (void*)0 : (void*)(-1); } function unset (line 243) | void unset(state_value flag) { _state &= ~flag; } function class (line 251) | class Init { type _seek_dir (line 263) | typedef int _seek_dir; type ios (line 265) | typedef ios::seek_dir _seek_dir; function class (line 276) | class streammarker : private _IO_marker { function _IO_FILE (line 287) | struct streambuf : public _IO_FILE { // protected?? function unbuffered (line 374) | int unbuffered() { return _flags & _IO_UNBUFFERED ? 1 : 0; } function linebuffered (line 375) | int linebuffered() { return _flags & _IO_LINE_BUF ? 1 : 0; } function unbuffered (line 376) | void unbuffered(int i) function linebuffered (line 378) | void linebuffered(int i) function allocate (line 380) | int allocate() { // For AT&T compatibility function allocbuf (line 384) | void allocbuf() { if (base() == NULL) doallocbuf(); } function in_avail (line 386) | int in_avail() { return _IO_read_end - _IO_read_ptr; } function out_waiting (line 387) | int out_waiting() { return _IO_write_ptr - _IO_write_base; } function streamsize (line 388) | streamsize sputn(const char* s, streamsize n) { return xsputn(s, n); } function streamsize (line 389) | streamsize padn(char pad, streamsize n) { return _IO_padn(this, pad, n); } function streamsize (line 390) | streamsize sgetn(char* s, streamsize n) { return _IO_sgetn(this, s, n); } function sputc (line 395) | int sputc(int c) { return _IO_putc(c, this); } function sbumpc (line 396) | int sbumpc() { return _IO_getc(this); } function sgetc (line 397) | int sgetc() { return _IO_peekc(this); } function snextc (line 398) | int snextc() { function stossc (line 402) | void stossc() { if (_IO_read_ptr < _IO_read_end) _IO_read_ptr++; } function class (line 425) | class filebuf : public streambuf { function init (line 469) | inline void ios::init(streambuf* sb, ostream* tie_to) { function ios (line 479) | inline ios::ios(streambuf* sb, ostream* tie_to) { init(sb, tie_to); } function ios (line 481) | inline ios::~ios() { FILE: tass-sgi-stl-2.91.57-source/strfile.h type _IO_str_fields (line 34) | struct _IO_str_fields type _IO_streambuf (line 45) | struct _IO_streambuf type _IO_strfile (line 51) | typedef struct _IO_strfile_ FILE: tass-sgi-stl-2.91.57-source/strstream.h function class (line 36) | class strstreambuf : public streambuf function frozen (line 68) | int frozen() { return _flags & _IO_USER_BUF ? 1 : 0; } function class (line 77) | class strstreambase : virtual public ios { function _IO_ssize_t (line 96) | _IO_ssize_t pcount() { return ((strstreambuf*)_strbuf)->pcount(); } function frozen (line 99) | int frozen() { return ((strstreambuf*)_strbuf)->frozen(); } function _IO_ssize_t (line 106) | _IO_ssize_t pcount() { return ((strstreambuf*)_strbuf)->pcount(); } function frozen (line 109) | int frozen() { return ((strstreambuf*)_strbuf)->frozen(); } FILE: tass-sgi-stl-2.91.57-source/type_traits.h type __true_type (line 54) | struct __true_type { type __false_type (line 57) | struct __false_type { type __true_type (line 62) | typedef __true_type this_dummy_member_must_be_first; type __false_type (line 80) | typedef __false_type has_trivial_default_constructor; type __false_type (line 81) | typedef __false_type has_trivial_copy_constructor; type __false_type (line 82) | typedef __false_type has_trivial_assignment_operator; type __false_type (line 83) | typedef __false_type has_trivial_destructor; type __false_type (line 84) | typedef __false_type is_POD_type; type __true_type (line 94) | typedef __true_type has_trivial_default_constructor; type __true_type (line 95) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 96) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 97) | typedef __true_type has_trivial_destructor; type __true_type (line 98) | typedef __true_type is_POD_type; type __true_type (line 102) | typedef __true_type has_trivial_default_constructor; type __true_type (line 103) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 104) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 105) | typedef __true_type has_trivial_destructor; type __true_type (line 106) | typedef __true_type is_POD_type; type __true_type (line 110) | typedef __true_type has_trivial_default_constructor; type __true_type (line 111) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 112) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 113) | typedef __true_type has_trivial_destructor; type __true_type (line 114) | typedef __true_type is_POD_type; type __true_type (line 118) | typedef __true_type has_trivial_default_constructor; type __true_type (line 119) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 120) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 121) | typedef __true_type has_trivial_destructor; type __true_type (line 122) | typedef __true_type is_POD_type; type __true_type (line 126) | typedef __true_type has_trivial_default_constructor; type __true_type (line 127) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 128) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 129) | typedef __true_type has_trivial_destructor; type __true_type (line 130) | typedef __true_type is_POD_type; type __true_type (line 134) | typedef __true_type has_trivial_default_constructor; type __true_type (line 135) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 136) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 137) | typedef __true_type has_trivial_destructor; type __true_type (line 138) | typedef __true_type is_POD_type; type __true_type (line 142) | typedef __true_type has_trivial_default_constructor; type __true_type (line 143) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 144) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 145) | typedef __true_type has_trivial_destructor; type __true_type (line 146) | typedef __true_type is_POD_type; type __true_type (line 150) | typedef __true_type has_trivial_default_constructor; type __true_type (line 151) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 152) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 153) | typedef __true_type has_trivial_destructor; type __true_type (line 154) | typedef __true_type is_POD_type; type __true_type (line 158) | typedef __true_type has_trivial_default_constructor; type __true_type (line 159) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 160) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 161) | typedef __true_type has_trivial_destructor; type __true_type (line 162) | typedef __true_type is_POD_type; type __true_type (line 166) | typedef __true_type has_trivial_default_constructor; type __true_type (line 167) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 168) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 169) | typedef __true_type has_trivial_destructor; type __true_type (line 170) | typedef __true_type is_POD_type; type __true_type (line 174) | typedef __true_type has_trivial_default_constructor; type __true_type (line 175) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 176) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 177) | typedef __true_type has_trivial_destructor; type __true_type (line 178) | typedef __true_type is_POD_type; type __true_type (line 182) | typedef __true_type has_trivial_default_constructor; type __true_type (line 183) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 184) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 185) | typedef __true_type has_trivial_destructor; type __true_type (line 186) | typedef __true_type is_POD_type; type __true_type (line 193) | typedef __true_type has_trivial_default_constructor; type __true_type (line 194) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 195) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 196) | typedef __true_type has_trivial_destructor; type __true_type (line 197) | typedef __true_type is_POD_type; function char (line 202) | struct __type_traits { type __type_traits (line 210) | struct __type_traits type __true_type (line 211) | typedef __true_type has_trivial_default_constructor; type __true_type (line 212) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 213) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 214) | typedef __true_type has_trivial_destructor; type __true_type (line 215) | typedef __true_type is_POD_type; type __type_traits (line 218) | struct __type_traits type __true_type (line 219) | typedef __true_type has_trivial_default_constructor; type __true_type (line 220) | typedef __true_type has_trivial_copy_constructor; type __true_type (line 221) | typedef __true_type has_trivial_assignment_operator; type __true_type (line 222) | typedef __true_type has_trivial_destructor; type __true_type (line 223) | typedef __true_type is_POD_type;