sgi stl.searchresults

SGI STL源码

Sequence_concepts.h:  static void
Sequence_concepts.h:  static void
Sequence_concepts.h:  static void
Sequence_concepts.h:  static void
Sequence_concepts.h:  static void
Sequence_concepts.h:  static void
Sequence_concepts.h:  static void
Sequence_concepts.h:  static void
Sequence_concepts.h:  static void
Sequence_concepts.h:  static void
Sequence_concepts.h:  static void
Sequence_concepts.h:  static void
Sequence_concepts.h:  static void
Sequence_concepts.h:  static void
Sequence_concepts.h:  static void
Sequence_concepts.h:  static void
Sequence_concepts.h:static void
Sequence_concepts.h:static void
Sequence_concepts.h:static void
Stl_algobase.h:  static _OutputIter copy(_InputIter __first, _InputIter __last,
Stl_algobase.h:  static _Tp* copy(const _Tp* __first, const _Tp* __last, _Tp* __result) {
Stl_algobase.h:  static _Tp* copy(const _Tp* __first, const _Tp* __last, _Tp* __result) {
Stl_algobase.h:  static _BidirectionalIter2 copy(_BidirectionalIter1 __first, 
Stl_algobase.h:  static _Tp* copy(const _Tp* __first, const _Tp* __last, _Tp* __result) {
Stl_algobase.h:  static _Tp* copy(const _Tp* __first, const _Tp* __last, _Tp* __result) {
Stl_alloc.h:  static void* _S_oom_malloc(size_t);
Stl_alloc.h:  static void* _S_oom_realloc(void*, size_t);
Stl_alloc.h:  static void (* __malloc_alloc_oom_handler)();
Stl_alloc.h:  static void* allocate(size_t __n)
Stl_alloc.h:  static void deallocate(void* __p, size_t /* __n */)
Stl_alloc.h:  static void* reallocate(void* __p, size_t /* old_sz */, size_t __new_sz)
Stl_alloc.h:  static void (* __set_malloc_handler(void (*__f)()))()
Stl_alloc.h:    static _Tp* allocate(size_t __n)
Stl_alloc.h:    static _Tp* allocate(void)
Stl_alloc.h:    static void deallocate(_Tp* __p, size_t __n)
Stl_alloc.h:    static void deallocate(_Tp* __p)
Stl_alloc.h:  static void* allocate(size_t __n)
Stl_alloc.h:  static void deallocate(void* __p, size_t __n)
Stl_alloc.h:  static void* reallocate(void* __p, size_t __old_sz, size_t __new_sz)
Stl_alloc.h:  static size_t
Stl_alloc.h:    static _Obj* __STL_VOLATILE _S_free_list[]; 
Stl_alloc.h:    static _Obj* __STL_VOLATILE _S_free_list[_NFREELISTS]; 
Stl_alloc.h:  static  size_t _S_freelist_index(size_t __bytes) {
Stl_alloc.h:  static void* _S_refill(size_t __n);
Stl_alloc.h:  static char* _S_chunk_alloc(size_t __size, int& __nobjs);
Stl_alloc.h:  static char* _S_start_free;
Stl_alloc.h:  static char* _S_end_free;
Stl_alloc.h:  static size_t _S_heap_size;
Stl_alloc.h:    static _STL_mutex_lock _S_node_allocator_lock;
Stl_alloc.h:  static void* allocate(size_t __n)
Stl_alloc.h:  static void deallocate(void* __p, size_t __n)
Stl_alloc.h:  static void* reallocate(void* __p, size_t __old_sz, size_t __new_sz);
Stl_alloc.h:  static const bool _S_instanceless = false;
Stl_alloc.h:  static const bool _S_instanceless = true;
Stl_alloc.h:  static const bool _S_instanceless = true;
Stl_alloc.h:  static const bool _S_instanceless = true;
Stl_alloc.h:  static const bool _S_instanceless = true;
Stl_alloc.h:  static const bool _S_instanceless = true;
Stl_alloc.h:  static const bool _S_instanceless = true;
Stl_alloc.h:  static const bool _S_instanceless = true;
Stl_bvector.h:static const int __WORD_BIT = int(CHAR_BIT*sizeof(unsigned int));
Stl_deque.h:  static size_t _S_buffer_size() { return __deque_buf_size(sizeof(_Tp)); }
Stl_deque.h:  static size_t _S_buffer_size() { return __deque_buf_size(sizeof(_Tp)); }
Stl_hashtable.h:static const unsigned long __stl_prime_list[__stl_num_primes] =
Stl_rope.h:        static _Tp* __name##_allocate(size_t __n) \
Stl_rope.h:#define __STATIC_IF_SGI_ALLOC static
Stl_rope.h:  static allocator_type get_allocator() { return allocator_type(); }
Stl_rope.h:        static _Tp* __name##_allocate(size_t __n) \
Stl_rope.h:        static void __name##_deallocate(_Tp* __p, size_t __n) \
Stl_rope.h:        static void _S_free_string(__GC_CONST _CharT*, size_t __len,
Stl_rope.h:        static void _S_free_string(__GC_CONST _CharT*, size_t __len);
Stl_rope.h:          static void _S_unref(_Rope_RopeRep* __t)
Stl_rope.h:          static void _S_ref(_Rope_RopeRep* __t)
Stl_rope.h:          static void _S_free_if_unref(_Rope_RopeRep* __t)
Stl_rope.h:          static void _S_unref(_Rope_RopeRep*) {}
Stl_rope.h:          static void _S_ref(_Rope_RopeRep*) {}
Stl_rope.h:          static void _S_free_if_unref(_Rope_RopeRep*) {}
Stl_rope.h:    static size_t _S_rounded_up_size(size_t __n) {
Stl_rope.h:      static void _S_fn_finalization_proc(void * __tree, void *) {
Stl_rope.h:    static void _S_setbuf(_Rope_iterator_base& __x);
Stl_rope.h:    static void _S_setcache(_Rope_iterator_base& __x);
Stl_rope.h:    static void _S_setcache_for_incr(_Rope_iterator_base& __x);
Stl_rope.h:        static _Tp* __name##_allocate(size_t __n) \
Stl_rope.h:        static void __name##_deallocate(_Tp *__p, size_t __n) \
Stl_rope.h:  static allocator_type get_allocator() { return allocator_type(); }
Stl_rope.h:        static _Tp* __name##_allocate(size_t __n) \
Stl_rope.h:        static void __name##_deallocate(_Tp *__p, size_t __n) \
Stl_rope.h:        static _CharT _S_empty_c_str[1];
Stl_rope.h:        static bool _S_is0(_CharT __c) { return __c == _S_eos((_CharT*)0); }
Stl_rope.h:        static _CharT _S_fetch(_RopeRep* __r, size_type __pos);
Stl_rope.h:            static _CharT* _S_fetch_ptr(_RopeRep* __r, size_type __pos);
Stl_rope.h:        static bool _S_apply_to_pieces(
Stl_rope.h:          static void _S_unref(_RopeRep* __t)
Stl_rope.h:          static void _S_ref(_RopeRep* __t)
Stl_rope.h:          static void _S_unref(_RopeRep*) {}
Stl_rope.h:          static void _S_ref(_RopeRep*) {}
Stl_rope.h:        static _RopeRep* _S_substring(_RopeRep* __base,
Stl_rope.h:        static _RopeRep* _S_concat_char_iter(_RopeRep* __r,
Stl_rope.h:        static _RopeRep* _S_destr_concat_char_iter(_RopeRep* __r,
Stl_rope.h:        static _RopeRep* _S_concat(_RopeRep* __left, _RopeRep* __right);
Stl_rope.h:        static size_t _S_rounded_up_size(size_t __n) {
Stl_rope.h:        static size_t _S_allocated_capacity(size_t __n) {
Stl_rope.h:        static _RopeLeaf* _S_new_RopeLeaf(__GC_CONST _CharT *__s,
Stl_rope.h:        static _RopeConcatenation* _S_new_RopeConcatenation(
Stl_rope.h:        static _RopeFunction* _S_new_RopeFunction(char_producer<_CharT>* __f,
Stl_rope.h:        static _RopeSubstring* _S_new_RopeSubstring(
Stl_rope.h:          static
Stl_rope.h:          static
Stl_rope.h:        static _RopeRep*
Stl_rope.h:        static _RopeLeaf*
Stl_rope.h:          static _RopeLeaf* _S_destr_leaf_concat_char_iter
Stl_rope.h:        static size_t _S_char_ptr_len(const _CharT* __s);
Stl_rope.h:        static _CharT* _S_flatten(_RopeRep* __r, _CharT* __buffer);
Stl_rope.h:        static _CharT* _S_flatten(_RopeRep* __r,
Stl_rope.h:        static const unsigned long 
Stl_rope.h:        static bool _S_is_balanced(_RopeRep* __r)
Stl_rope.h:        static bool _S_is_almost_balanced(_RopeRep* __r)
Stl_rope.h:        static bool _S_is_roughly_balanced(_RopeRep* __r)
Stl_rope.h:        static _RopeRep* _S_concat_and_set_balanced(_RopeRep* __left,
Stl_rope.h:        static _RopeRep* _S_balance(_RopeRep* __r);
Stl_rope.h:        static void _S_add_to_forest(_RopeRep*__r, _RopeRep** __forest);
Stl_rope.h:        static void _S_add_leaf_to_forest(_RopeRep* __r, _RopeRep** __forest);
Stl_rope.h:        static void _S_dump(_RopeRep* __r, int __indent = 0);
Stl_rope.h:        static int _S_compare(const _RopeRep* __x, const _RopeRep* __y);
Stl_rope.h:        static _RopeRep* replace(_RopeRep* __old, size_t __pos1,
Stl_rope.h:        static const size_type npos;
Stl_string_fwd.h:static const char* __get_c_string(const string&);
Stl_threads.h:        static pthread_mutex_t _S_swap_lock;
Stl_threads.h:        static mutex_t _S_swap_lock;
Stl_threads.h:        static mutex_t _S_swap_lock;
Stl_threads.h:    static inline unsigned long _Atomic_swap(unsigned long * __p, unsigned long __q) {
Stl_threads.h:  static unsigned __max;
Stl_threads.h:  static unsigned __last;
Stl_threads.h:  static void _S_nsec_sleep(int __log_nsec) {
Stl_tree.h:  static _Base_ptr _S_minimum(_Base_ptr __x)
Stl_tree.h:  static _Base_ptr _S_maximum(_Base_ptr __x)
Stl_tree.h:  static _Link_type& _S_left(_Link_type __x)
Stl_tree.h:  static _Link_type& _S_right(_Link_type __x)
Stl_tree.h:  static _Link_type& _S_parent(_Link_type __x)
Stl_tree.h:  static reference _S_value(_Link_type __x)
Stl_tree.h:  static const _Key& _S_key(_Link_type __x)
Stl_tree.h:  static _Color_type& _S_color(_Link_type __x)
Stl_tree.h:  static _Link_type& _S_left(_Base_ptr __x)
Stl_tree.h:  static _Link_type& _S_right(_Base_ptr __x)
Stl_tree.h:  static _Link_type& _S_parent(_Base_ptr __x)
Stl_tree.h:  static reference _S_value(_Base_ptr __x)
Stl_tree.h:  static const _Key& _S_key(_Base_ptr __x)
Stl_tree.h:  static _Color_type& _S_color(_Base_ptr __x)
Stl_tree.h:  static _Link_type _S_minimum(_Link_type __x) 
Stl_tree.h:  static _Link_type _S_maximum(_Link_type __x)
String:  static const size_type npos;
String:  static _CharT _M_null() {
String:  static int _M_compare(const _CharT* __f1, const _CharT* __l1,