headers/cpp/ropeimpl.h

1061

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

1063

rope<_CharT,_Alloc>::_S_min_len[

headers/cpp/ropeimpl.h

1064

_Rope_RopeRep<_CharT,_Alloc>::_S_max_rope_depth + 1] = {

headers/cpp/ropeimpl.h

1078

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

1079

rope<_CharT,_Alloc>::_RopeRep*

headers/cpp/ropeimpl.h

1080

rope<_CharT,_Alloc>::_S_balance(_RopeRep* __r)

headers/cpp/ropeimpl.h

1114

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

1116

rope<_CharT,_Alloc>::_S_add_to_forest(_RopeRep* __r, _RopeRep** __forest)

headers/cpp/ropeimpl.h

1132

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

1134

rope<_CharT,_Alloc>::_S_add_leaf_to_forest(_RopeRep* __r, _RopeRep** __forest)

headers/cpp/ropeimpl.h

116

_Rope_RopeConcatenation<_CharT,_Alloc>* __c =

headers/cpp/ropeimpl.h

117

(_Rope_RopeConcatenation<_CharT,_Alloc>*)__curr_rope;

headers/cpp/ropeimpl.h

1182

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

1184

rope<_CharT,_Alloc>::_S_fetch(_RopeRep* __r, size_type __i)

headers/cpp/ropeimpl.h

1227

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

1229

rope<_CharT,_Alloc>::_S_fetch_ptr(_RopeRep* __r, size_type __i)

headers/cpp/ropeimpl.h

1277

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

1279

rope<_CharT,_Alloc>::_S_compare (const _RopeRep* __left,

headers/cpp/ropeimpl.h

1322

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

1323

_Rope_char_ref_proxy<_CharT, _Alloc>&

headers/cpp/ropeimpl.h

1324

_Rope_char_ref_proxy<_CharT, _Alloc>::operator= (_CharT __c) {

headers/cpp/ropeimpl.h

1355

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

1356

inline _Rope_char_ref_proxy<_CharT, _Alloc>::operator _CharT () const

headers/cpp/ropeimpl.h

1364

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

1365

_Rope_char_ptr_proxy<_CharT, _Alloc>

headers/cpp/ropeimpl.h

1366

_Rope_char_ref_proxy<_CharT, _Alloc>::operator& () const {

headers/cpp/ropeimpl.h

1367

return _Rope_char_ptr_proxy<_CharT, _Alloc>(*this);

headers/cpp/ropeimpl.h

1370

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

1371

rope<_CharT, _Alloc>::rope(size_t __n, _CharT __c,

headers/cpp/ropeimpl.h

1375

rope<_CharT,_Alloc> __result;

headers/cpp/ropeimpl.h

1381

rope<_CharT,_Alloc> __remainder_rope;

headers/cpp/ropeimpl.h

1434

template<class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

1435

_CharT rope<_CharT,_Alloc>::_S_empty_c_str[1];

headers/cpp/ropeimpl.h

1438

template<class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

1440

rope<_CharT,_Alloc>::_S_swap_lock = PTHREAD_MUTEX_INITIALIZER;

headers/cpp/ropeimpl.h

1443

template<class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

1444

const _CharT* rope<_CharT,_Alloc>::c_str() const {

headers/cpp/ropeimpl.h

1471

template<class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

1472

const _CharT* rope<_CharT,_Alloc>::replace_with_c_str() {

headers/cpp/ropeimpl.h

1494

template<class _CharT,class _Alloc>

headers/cpp/ropeimpl.h

1496

_Rope_rotate(_Rope_iterator<_CharT,_Alloc> __first,

headers/cpp/ropeimpl.h

1497

_Rope_iterator<_CharT,_Alloc> __middle,

headers/cpp/ropeimpl.h

1498

_Rope_iterator<_CharT,_Alloc> __last)

headers/cpp/ropeimpl.h

1502

rope<_CharT,_Alloc>& __r(__first.container());

headers/cpp/ropeimpl.h

1503

rope<_CharT,_Alloc> __prefix = __r.substr(0, __first.index());

headers/cpp/ropeimpl.h

1504

rope<_CharT,_Alloc> __suffix =

headers/cpp/ropeimpl.h

1506

rope<_CharT,_Alloc> __part1 =

headers/cpp/ropeimpl.h

1508

rope<_CharT,_Alloc> __part2 =

headers/cpp/ropeimpl.h

151

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

152

void _Rope_iterator_base<_CharT,_Alloc>::_S_setcache_for_incr

headers/cpp/ropeimpl.h

153

(_Rope_iterator_base<_CharT,_Alloc>& __x)

headers/cpp/ropeimpl.h

160

_Rope_RopeConcatenation<_CharT,_Alloc>* __c;

headers/cpp/ropeimpl.h

174

__c = (_Rope_RopeConcatenation<_CharT,_Alloc>*)__current_node;

headers/cpp/ropeimpl.h

186

__c = (_Rope_RopeConcatenation<_CharT,_Alloc>*)__current_node;

headers/cpp/ropeimpl.h

204

((_Rope_RopeConcatenation<_CharT,_Alloc>*)__current_node)->_M_left;

headers/cpp/ropeimpl.h

215

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

216

void _Rope_iterator_base<_CharT,_Alloc>::_M_incr(size_t __n) {

headers/cpp/ropeimpl.h

231

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

232

void _Rope_iterator_base<_CharT,_Alloc>::_M_decr(size_t __n) {

headers/cpp/ropeimpl.h

244

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

245

void _Rope_iterator<_CharT,_Alloc>::_M_check() {

headers/cpp/ropeimpl.h

255

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

257

_Rope_const_iterator<_CharT, _Alloc>::_Rope_const_iterator(

headers/cpp/ropeimpl.h

258

const _Rope_iterator<_CharT,_Alloc>& __x)

headers/cpp/ropeimpl.h

259

: _Rope_iterator_base<_CharT,_Alloc>(__x)

headers/cpp/ropeimpl.h

262

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

263

inline _Rope_iterator<_CharT,_Alloc>::_Rope_iterator(

headers/cpp/ropeimpl.h

264

rope<_CharT,_Alloc>& __r, size_t __pos)

headers/cpp/ropeimpl.h

265

: _Rope_iterator_base<_CharT,_Alloc>(__r._M_tree_ptr, __pos),

headers/cpp/ropeimpl.h

271

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

273

rope<_CharT,_Alloc>::_S_char_ptr_len(const _CharT* __s)

headers/cpp/ropeimpl.h

284

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

285

inline void _Rope_RopeRep<_CharT,_Alloc>::_M_free_c_string()

headers/cpp/ropeimpl.h

296

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

298

inline void _Rope_RopeRep<_CharT,_Alloc>::_S_free_string(_CharT* __s,

headers/cpp/ropeimpl.h

302

inline void _Rope_RopeRep<_CharT,_Alloc>::_S_free_string(_CharT* __s,

headers/cpp/ropeimpl.h

31

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

312

__s, _Rope_RopeLeaf<_CharT,_Alloc>::_S_rounded_up_size(__n));

headers/cpp/ropeimpl.h

315

__s, _Rope_RopeLeaf<_CharT,_Alloc>::_S_rounded_up_size(__n));

headers/cpp/ropeimpl.h

32

void _Rope_iterator_base<_CharT,_Alloc>::_S_setbuf(

headers/cpp/ropeimpl.h

326

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

327

void _Rope_RopeRep<_CharT,_Alloc>::_M_free_tree()

headers/cpp/ropeimpl.h

33

_Rope_iterator_base<_CharT,_Alloc>& __x)

headers/cpp/ropeimpl.h

332

_Rope_RopeLeaf<_CharT,_Alloc>* __l

headers/cpp/ropeimpl.h

333

= (_Rope_RopeLeaf<_CharT,_Alloc>*)this;

headers/cpp/ropeimpl.h

334

__l->_Rope_RopeLeaf<_CharT,_Alloc>::~_Rope_RopeLeaf();

headers/cpp/ropeimpl.h

340

_Rope_RopeConcatenation<_CharT,_Alloc>* __c

headers/cpp/ropeimpl.h

341

= (_Rope_RopeConcatenation<_CharT,_Alloc>*)this;

headers/cpp/ropeimpl.h

342

__c->_Rope_RopeConcatenation<_CharT,_Alloc>::

headers/cpp/ropeimpl.h

349

_Rope_RopeFunction<_CharT,_Alloc>* __f

headers/cpp/ropeimpl.h

350

= (_Rope_RopeFunction<_CharT,_Alloc>*)this;

headers/cpp/ropeimpl.h

351

__f->_Rope_RopeFunction<_CharT,_Alloc>::~_Rope_RopeFunction();

headers/cpp/ropeimpl.h

357

_Rope_RopeSubstring<_CharT,_Alloc>* __ss =

headers/cpp/ropeimpl.h

358

(_Rope_RopeSubstring<_CharT,_Alloc>*)this;

headers/cpp/ropeimpl.h

359

__ss->_Rope_RopeSubstring<_CharT,_Alloc>::

headers/cpp/ropeimpl.h

368

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

370

inline void _Rope_RopeRep<_CharT,_Alloc>::_S_free_string

headers/cpp/ropeimpl.h

373

inline void _Rope_RopeRep<_CharT,_Alloc>::_S_free_string

headers/cpp/ropeimpl.h

383

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

384

rope<_CharT,_Alloc>::_RopeLeaf*

headers/cpp/ropeimpl.h

385

rope<_CharT,_Alloc>::_S_leaf_concat_char_iter

headers/cpp/ropeimpl.h

407

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

408

rope<_CharT,_Alloc>::_RopeLeaf*

headers/cpp/ropeimpl.h

409

rope<_CharT,_Alloc>::_S_destr_leaf_concat_char_iter

headers/cpp/ropeimpl.h

42

((_Rope_RopeLeaf<_CharT,_Alloc>*)__leaf)->_M_data;

headers/cpp/ropeimpl.h

442

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

443

rope<_CharT,_Alloc>::_RopeRep*

headers/cpp/ropeimpl.h

444

rope<_CharT,_Alloc>::_S_tree_concat (_RopeRep* __left, _RopeRep* __right)

headers/cpp/ropeimpl.h

478

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

479

rope<_CharT,_Alloc>::_RopeRep* rope<_CharT,_Alloc>::_S_concat_char_iter

headers/cpp/ropeimpl.h

53

((_Rope_RopeFunction<_CharT,_Alloc>*)__leaf)->_M_fn;

headers/cpp/ropeimpl.h

531

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

532

rope<_CharT,_Alloc>::_RopeRep*

headers/cpp/ropeimpl.h

533

rope<_CharT,_Alloc>::_S_destr_concat_char_iter(

headers/cpp/ropeimpl.h

589

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

590

rope<_CharT,_Alloc>::_RopeRep*

headers/cpp/ropeimpl.h

591

rope<_CharT,_Alloc>::_S_concat(_RopeRep* __left, _RopeRep* __right)

headers/cpp/ropeimpl.h

634

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

635

rope<_CharT,_Alloc>::_RopeRep*

headers/cpp/ropeimpl.h

636

rope<_CharT,_Alloc>::_S_substring(_RopeRep* __base,

headers/cpp/ropeimpl.h

77

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

78

void _Rope_iterator_base<_CharT,_Alloc>::_S_setcache

headers/cpp/ropeimpl.h

79

(_Rope_iterator_base<_CharT,_Alloc>& __x)

headers/cpp/ropeimpl.h

833

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

834

bool rope<_CharT, _Alloc>::_S_apply_to_pieces(

headers/cpp/ropeimpl.h

905

template<class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

906

ostream& operator<< (ostream& __o, const rope<_CharT, _Alloc>& __r)

headers/cpp/ropeimpl.h

936

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

938

rope<_CharT,_Alloc>::_S_flatten(_RopeRep* __r,

headers/cpp/ropeimpl.h

947

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

949

rope<_CharT,_Alloc>::find(_CharT __pattern, size_t __start) const

headers/cpp/ropeimpl.h

960

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

962

rope<_CharT,_Alloc>::_S_flatten(_RopeRep* __r, _CharT* __buffer)

headers/cpp/ropeimpl.h

997

template <class _CharT, class _Alloc>

headers/cpp/ropeimpl.h

999

rope<_CharT,_Alloc>::_S_dump(_RopeRep* __r, int __indent)

headers/cpp/stl_alloc.h

1004

template <class _Tp, class _Alloc>

headers/cpp/stl_alloc.h

1005

struct _Alloc_traits<_Tp, debug_alloc<_Alloc> >

headers/cpp/stl_alloc.h

1008

typedef simple_alloc<_Tp, debug_alloc<_Alloc> > _Alloc_type;

headers/cpp/stl_alloc.h

1009

typedef __allocator<_Tp, debug_alloc<_Alloc> > allocator_type;

headers/cpp/stl_alloc.h

1038

template <class _Tp, class _Tp1, class _Alloc>

headers/cpp/stl_alloc.h

1039

struct _Alloc_traits<_Tp, __allocator<_Tp1, debug_alloc<_Alloc> > >

headers/cpp/stl_alloc.h

1042

typedef simple_alloc<_Tp, debug_alloc<_Alloc> > _Alloc_type;

headers/cpp/stl_alloc.h

1043

typedef __allocator<_Tp, debug_alloc<_Alloc> > allocator_type;

headers/cpp/stl_alloc.h

227

template<class _Tp, class _Alloc>

headers/cpp/stl_alloc.h

232

{ return 0 == __n ? 0 : (_Tp*) _Alloc::allocate(__n * sizeof (_Tp)); }

headers/cpp/stl_alloc.h

234

{ return (_Tp*) _Alloc::allocate(sizeof (_Tp)); }

headers/cpp/stl_alloc.h

236

{ if (0 != __n) _Alloc::deallocate(__p, __n * sizeof (_Tp)); }

headers/cpp/stl_alloc.h

238

{ _Alloc::deallocate(__p, sizeof (_Tp)); }

headers/cpp/stl_alloc.h

246

template <class _Alloc>

headers/cpp/stl_alloc.h

259

char* __result = (char*)_Alloc::allocate(__n + _S_extra);

headers/cpp/stl_alloc.h

268

_Alloc::deallocate(__real_p, __n + _S_extra);

headers/cpp/stl_alloc.h

276

_Alloc::reallocate(__real_p, __old_sz + _S_extra, __new_sz + _S_extra);

headers/cpp/stl_alloc.h

759

return __n != 0 ? static_cast<_Tp*>(_Alloc::allocate(__n * sizeof(_Tp)))

headers/cpp/stl_alloc.h

765

{ _Alloc::deallocate(__p, __n * sizeof(_Tp)); }

headers/cpp/stl_alloc.h

807

template <class _Tp, class _Alloc>

headers/cpp/stl_alloc.h

809

_Alloc __underlying_alloc;

headers/cpp/stl_alloc.h

820

typedef __allocator<_Tp1, _Alloc> other;

headers/cpp/stl_alloc.h

827

__allocator(const __allocator<_Tp1, _Alloc>& __a) __STL_NOTHROW

headers/cpp/stl_alloc.h

852

template <class _Alloc>

headers/cpp/stl_alloc.h

853

class __allocator<void, _Alloc> {

headers/cpp/stl_alloc.h

861

typedef __allocator<_Tp1, _Alloc> other;

headers/cpp/stl_alloc.h

865

template <class _Tp, class _Alloc>

headers/cpp/stl_alloc.h

866

inline bool operator==(const __allocator<_Tp, _Alloc>& __a1,

headers/cpp/stl_alloc.h

867

const __allocator<_Tp, _Alloc>& __a2)

headers/cpp/stl_alloc.h

873

template <class _Tp, class _Alloc>

headers/cpp/stl_alloc.h

874

inline bool operator!=(const __allocator<_Tp, _Alloc>& __a1,

headers/cpp/stl_alloc.h

875

const __allocator<_Tp, _Alloc>& __a2)

headers/cpp/stl_alloc.h

919

template <class _Alloc>

headers/cpp/stl_alloc.h

920

inline bool operator==(const debug_alloc<_Alloc>&,

headers/cpp/stl_alloc.h

921

const debug_alloc<_Alloc>&) {

headers/cpp/stl_alloc.h

926

template <class _Alloc>

headers/cpp/stl_alloc.h

927

inline bool operator!=(const debug_alloc<_Alloc>&,

headers/cpp/stl_alloc.h

928

const debug_alloc<_Alloc>&) {

headers/cpp/stl_bvector.h

304

template <class _Alloc>

headers/cpp/stl_bvector.h

306

: public _Bvector_alloc_base<_Alloc,

headers/cpp/stl_bvector.h

307

_Alloc_traits<bool, _Alloc>::_S_instanceless>

headers/cpp/stl_bvector.h

310

_Alloc_traits<bool, _Alloc>::_S_instanceless>

headers/cpp/stl_bvector.h

321

template <class _Alloc>

headers/cpp/stl_bvector.h

325

typedef _Alloc allocator_type;

headers/cpp/stl_bvector.h

333

typedef simple_alloc<unsigned int, _Alloc> _Alloc_type;

headers/cpp/stl_bvector.h

367

template<class _Alloc> class vector<bool,_Alloc>

headers/cpp/stl_bvector.h

368

: public _Bvector_base<_Alloc>

headers/cpp/stl_bvector.h

375

typedef _Bvector_base<_Alloc> _Base;

headers/cpp/stl_deque.h

1011

template <class _Tp, class _Alloc, size_t __bufsize>

headers/cpp/stl_deque.h

1012

void deque<_Tp,_Alloc,__bufsize>::insert(iterator __pos,

headers/cpp/stl_deque.h

1040

template <class _Tp, class _Alloc, size_t __bufsize>

headers/cpp/stl_deque.h

1041

deque<_Tp,_Alloc,__bufsize>::iterator

headers/cpp/stl_deque.h

1042

deque<_Tp,_Alloc,__bufsize>::erase(iterator __first, iterator __last)

headers/cpp/stl_deque.h

1069

template <class _Tp, class _Alloc, size_t __bufsize>

headers/cpp/stl_deque.h

1070

void deque<_Tp,_Alloc,__bufsize>::clear()

headers/cpp/stl_deque.h

1092

template <class _Tp, class _Alloc, size_t __bufsize>

headers/cpp/stl_deque.h

1094

deque<_Tp,_Alloc,__bufsize>::_M_fill_initialize(const value_type& __value) {

headers/cpp/stl_deque.h

1106

template <class _Tp, class _Alloc, size_t __bufsize>

headers/cpp/stl_deque.h

1109

deque<_Tp,_Alloc,__bufsize>::_M_range_initialize(_InputIterator __first,

headers/cpp/stl_deque.h

1118

template <class _Tp, class _Alloc, size_t __bufsize>

headers/cpp/stl_deque.h

1121

deque<_Tp,_Alloc,__bufsize>::_M_range_initialize(_ForwardIterator __first,

headers/cpp/stl_deque.h

1147

template <class _Tp, class _Alloc, size_t __bufsize>

headers/cpp/stl_deque.h

1149

deque<_Tp,_Alloc,__bufsize>::_M_push_back_aux(const value_type& __t)

headers/cpp/stl_deque.h

1163

template <class _Tp, class _Alloc, size_t __bufsize>

headers/cpp/stl_deque.h

1165

deque<_Tp,_Alloc,__bufsize>::_M_push_back_aux()

headers/cpp/stl_deque.h

1178

template <class _Tp, class _Alloc, size_t __bufsize>

headers/cpp/stl_deque.h

1180

deque<_Tp,_Alloc,__bufsize>::_M_push_front_aux(const value_type& __t)

headers/cpp/stl_deque.h

1194

template <class _Tp, class _Alloc, size_t __bufsize>

headers/cpp/stl_deque.h

1196

deque<_Tp,_Alloc,__bufsize>::_M_push_front_aux()

headers/cpp/stl_deque.h

1209

template <class _Tp, class _Alloc, size_t __bufsize>

headers/cpp/stl_deque.h

1211

deque<_Tp,_Alloc,__bufsize>::_M_pop_back_aux()

headers/cpp/stl_deque.h

1223

template <class _Tp, class _Alloc, size_t __bufsize>

headers/cpp/stl_deque.h

1225

deque<_Tp,_Alloc,__bufsize>::_M_pop_front_aux()

headers/cpp/stl_deque.h

1235

template <class _Tp, class _Alloc, size_t __bufsize>

headers/cpp/stl_deque.h

1238

deque<_Tp,_Alloc,__bufsize>::insert(iterator __pos,

headers/cpp/stl_deque.h

1246

template <class _Tp, class _Alloc, size_t __bufsize>

headers/cpp/stl_deque.h

1249

deque<_Tp,_Alloc,__bufsize>::insert(iterator __pos,

headers/cpp/stl_deque.h

1278

template <class _Tp, class _Alloc, size_t __bufsize>

headers/cpp/stl_deque.h

1279

typename deque<_Tp, _Alloc, __bufsize>::iterator

headers/cpp/stl_deque.h

1280

deque<_Tp,_Alloc,__bufsize>::_M_insert_aux(iterator __pos,

headers/cpp/stl_deque.h

1309

template <class _Tp, class _Alloc, size_t __bufsize>

headers/cpp/stl_deque.h

1310

typename deque<_Tp,_Alloc,__bufsize>::iterator

headers/cpp/stl_deque.h

1311

deque<_Tp,_Alloc,__bufsize>::_M_insert_aux(iterator __pos)

headers/cpp/stl_deque.h

1338

template <class _Tp, class _Alloc, size_t __bufsize>

headers/cpp/stl_deque.h

1340

deque<_Tp,_Alloc,__bufsize>::_M_insert_aux(iterator __pos,

headers/cpp/stl_deque.h

1396

template <class _Tp, class _Alloc, size_t __bufsize>

headers/cpp/stl_deque.h

1399

deque<_Tp,_Alloc,__bufsize>::_M_insert_aux(iterator __pos,

headers/cpp/stl_deque.h

1458

template <class _Tp, class _Alloc, size_t __bufsize>

headers/cpp/stl_deque.h

1460

deque<_Tp,_Alloc,__bufsize>::_M_insert_aux(iterator __pos,

headers/cpp/stl_deque.h

1516

template <class _Tp, class _Alloc, size_t __bufsize>

headers/cpp/stl_deque.h

1518

deque<_Tp,_Alloc,__bufsize>::_M_insert_aux(iterator __pos,

headers/cpp/stl_deque.h

1574

template <class _Tp, class _Alloc, size_t __bufsize>

headers/cpp/stl_deque.h

1576

deque<_Tp,_Alloc,__bufsize>::_M_new_elements_at_front(size_type __new_elems)

headers/cpp/stl_deque.h

1595

template <class _Tp, class _Alloc, size_t __bufsize>

headers/cpp/stl_deque.h

1597

deque<_Tp,_Alloc,__bufsize>::_M_new_elements_at_back(size_type __new_elems)

headers/cpp/stl_deque.h

1616

template <class _Tp, class _Alloc, size_t __bufsize>

headers/cpp/stl_deque.h

1618

deque<_Tp,_Alloc,__bufsize>::_M_reallocate_map(size_type __nodes_to_add,

headers/cpp/stl_deque.h

1657

template <class _Tp, class _Alloc, size_t __bufsiz>

headers/cpp/stl_deque.h

1658

bool operator==(const deque<_Tp, _Alloc, __bufsiz>& __x,

headers/cpp/stl_deque.h

1659

const deque<_Tp, _Alloc, __bufsiz>& __y)

headers/cpp/stl_deque.h

1665

template <class _Tp, class _Alloc, size_t __bufsiz>

headers/cpp/stl_deque.h

1666

bool operator<(const deque<_Tp, _Alloc, __bufsiz>& __x,

headers/cpp/stl_deque.h

1667

const deque<_Tp, _Alloc, __bufsiz>& __y)

headers/cpp/stl_deque.h

1678

template <class _Tp, class _Alloc, size_t __bufsiz>

headers/cpp/stl_deque.h

1680

swap(deque<_Tp,_Alloc,__bufsiz>& __x, deque<_Tp,_Alloc,__bufsiz>& __y)

headers/cpp/stl_deque.h

273

template <class _Tp, class _Alloc, size_t __bufsiz, bool __is_static>

headers/cpp/stl_deque.h

276

typedef typename _Alloc_traits<_Tp,_Alloc>::allocator_type allocator_type;

headers/cpp/stl_deque.h

284

typedef typename _Alloc_traits<_Tp*, _Alloc>::allocator_type

headers/cpp/stl_deque.h

306

template <class _Tp, class _Alloc, size_t __bufsiz>

headers/cpp/stl_deque.h

307

class _Deque_alloc_base<_Tp, _Alloc, __bufsiz, true>

headers/cpp/stl_deque.h

310

typedef typename _Alloc_traits<_Tp,_Alloc>::allocator_type allocator_type;

headers/cpp/stl_deque.h

316

typedef typename _Alloc_traits<_Tp, _Alloc>::_Alloc_type _Node_alloc_type;

headers/cpp/stl_deque.h

317

typedef typename _Alloc_traits<_Tp*, _Alloc>::_Alloc_type _Map_alloc_type;

headers/cpp/stl_deque.h

334

template <class _Tp, class _Alloc, size_t __bufsiz>

headers/cpp/stl_deque.h

336

: public _Deque_alloc_base<_Tp,_Alloc,__bufsiz,

headers/cpp/stl_deque.h

337

_Alloc_traits<_Tp, _Alloc>::_S_instanceless>

headers/cpp/stl_deque.h

341

_Alloc_traits<_Tp, _Alloc>::_S_instanceless>

headers/cpp/stl_deque.h

367

template <class _Tp, class _Alloc, size_t __bufsiz>

headers/cpp/stl_deque.h

378

typedef _Alloc allocator_type;

headers/cpp/stl_deque.h

401

typedef simple_alloc<_Tp, _Alloc> _Node_alloc_type;

headers/cpp/stl_deque.h

402

typedef simple_alloc<_Tp*, _Alloc> _Map_alloc_type;

headers/cpp/stl_deque.h

420

template <class _Tp, class _Alloc, size_t __bufsiz>

headers/cpp/stl_deque.h

421

_Deque_base<_Tp,_Alloc,__bufsiz>::~_Deque_base() {

headers/cpp/stl_deque.h

428

template <class _Tp, class _Alloc, size_t __bufsiz>

headers/cpp/stl_deque.h

430

_Deque_base<_Tp,_Alloc,__bufsiz>::_M_initialize_map(size_t __num_elements)

headers/cpp/stl_deque.h

453

template <class _Tp, class _Alloc, size_t __bufsiz>

headers/cpp/stl_deque.h

455

_Deque_base<_Tp,_Alloc,__bufsiz>::_M_create_nodes(_Tp** __nstart,

headers/cpp/stl_deque.h

466

template <class _Tp, class _Alloc, size_t __bufsiz>

headers/cpp/stl_deque.h

468

_Deque_base<_Tp,_Alloc,__bufsiz>::_M_destroy_nodes(_Tp** __nstart,

headers/cpp/stl_deque.h

478

template <class _Tp, class _Alloc = __STL_DEFAULT_ALLOCATOR(_Tp),

headers/cpp/stl_deque.h

480

class deque : protected _Deque_base<_Tp, _Alloc, __bufsiz> {

headers/cpp/stl_deque.h

932

bool operator==(const deque<_Tp,_Alloc,0>& __x) const {

headers/cpp/stl_deque.h

935

bool operator!=(const deque<_Tp,_Alloc,0>& __x) const {

headers/cpp/stl_deque.h

938

bool operator<(const deque<_Tp,_Alloc,0>& __x) const {

headers/cpp/stl_deque.h

948

template <class _Tp, class _Alloc, size_t __bufsize>

headers/cpp/stl_deque.h

950

void deque<_Tp, _Alloc, __bufsize>

headers/cpp/stl_deque.h

964

template <class _Tp, class _Alloc, size_t __bufsize>

headers/cpp/stl_deque.h

966

deque<_Tp, _Alloc, __bufsize>::insert(iterator __pos,

headers/cpp/stl_deque.h

985

template <class _Tp, class _Alloc, size_t __bufsize>

headers/cpp/stl_deque.h

986

void deque<_Tp, _Alloc, __bufsize>::insert(iterator __pos,

headers/cpp/stl_hash_map.h

204

template <class _Key, class _Tp, class _HashFcn, class _EqlKey, class _Alloc>

headers/cpp/stl_hash_map.h

206

operator==(const hash_map<_Key,_Tp,_HashFcn,_EqlKey,_Alloc>& __hm1,

headers/cpp/stl_hash_map.h

207

const hash_map<_Key,_Tp,_HashFcn,_EqlKey,_Alloc>& __hm2)

headers/cpp/stl_hash_map.h

214

template <class _Key, class _Tp, class _HashFcn, class _EqlKey, class _Alloc>

headers/cpp/stl_hash_map.h

216

swap(hash_map<_Key,_Tp,_HashFcn,_EqlKey,_Alloc>& __hm1,

headers/cpp/stl_hash_map.h

217

hash_map<_Key,_Tp,_HashFcn,_EqlKey,_Alloc>& __hm2)

headers/cpp/stl_hash_map.h

227

class _Alloc = __STL_DEFAULT_ALLOCATOR(_Tp) >

headers/cpp/stl_hash_map.h

230

class _Alloc = __STL_DEFAULT_ALLOCATOR(_Tp) >

headers/cpp/stl_hash_map.h

236

_Select1st<pair<const _Key, _Tp> >, _EqualKey, _Alloc>

headers/cpp/stl_hash_map.h

385

template <class _Key, class _Tp, class _HF, class _EqKey, class _Alloc>

headers/cpp/stl_hash_map.h

387

operator==(const hash_multimap<_Key,_Tp,_HF,_EqKey,_Alloc>& __hm1,

headers/cpp/stl_hash_map.h

388

const hash_multimap<_Key,_Tp,_HF,_EqKey,_Alloc>& __hm2)

headers/cpp/stl_hash_map.h

395

template <class _Key, class _Tp, class _HashFcn, class _EqlKey, class _Alloc>

headers/cpp/stl_hash_map.h

397

swap(hash_multimap<_Key,_Tp,_HashFcn,_EqlKey,_Alloc>& __hm1,

headers/cpp/stl_hash_map.h

398

hash_multimap<_Key,_Tp,_HashFcn,_EqlKey,_Alloc>& __hm2)

headers/cpp/stl_hash_map.h

45

class _Alloc = __STL_DEFAULT_ALLOCATOR(_Tp) >

headers/cpp/stl_hash_map.h

48

class _Alloc = __STL_DEFAULT_ALLOCATOR(_Tp) >

headers/cpp/stl_hash_map.h

54

_Select1st<pair<const _Key,_Tp> >,_EqualKey,_Alloc> _Ht;

headers/cpp/stl_hash_set.h

199

template <class _Value, class _HashFcn, class _EqualKey, class _Alloc>

headers/cpp/stl_hash_set.h

201

operator==(const hash_set<_Value,_HashFcn,_EqualKey,_Alloc>& __hs1,

headers/cpp/stl_hash_set.h

202

const hash_set<_Value,_HashFcn,_EqualKey,_Alloc>& __hs2)

headers/cpp/stl_hash_set.h

209

template <class _Val, class _HashFcn, class _EqualKey, class _Alloc>

headers/cpp/stl_hash_set.h

211

swap(hash_set<_Val,_HashFcn,_EqualKey,_Alloc>& __hs1,

headers/cpp/stl_hash_set.h

212

hash_set<_Val,_HashFcn,_EqualKey,_Alloc>& __hs2)

headers/cpp/stl_hash_set.h

223

class _Alloc = __STL_DEFAULT_ALLOCATOR(_Value) >

headers/cpp/stl_hash_set.h

226

class _Alloc = __STL_DEFAULT_ALLOCATOR(_Value) >

headers/cpp/stl_hash_set.h

232

_EqualKey, _Alloc> _Ht;

headers/cpp/stl_hash_set.h

371

template <class _Val, class _HashFcn, class _EqualKey, class _Alloc>

headers/cpp/stl_hash_set.h

373

operator==(const hash_multiset<_Val,_HashFcn,_EqualKey,_Alloc>& __hs1,

headers/cpp/stl_hash_set.h

374

const hash_multiset<_Val,_HashFcn,_EqualKey,_Alloc>& __hs2)

headers/cpp/stl_hash_set.h

381

template <class _Val, class _HashFcn, class _EqualKey, class _Alloc>

headers/cpp/stl_hash_set.h

383

swap(hash_multiset<_Val,_HashFcn,_EqualKey,_Alloc>& __hs1,

headers/cpp/stl_hash_set.h

384

hash_multiset<_Val,_HashFcn,_EqualKey,_Alloc>& __hs2) {

headers/cpp/stl_hash_set.h

44

class _Alloc = __STL_DEFAULT_ALLOCATOR(_Value) >

headers/cpp/stl_hash_set.h

47

class _Alloc = __STL_DEFAULT_ALLOCATOR(_Value) >

headers/cpp/stl_hash_set.h

53

_EqualKey, _Alloc> _Ht;

headers/cpp/stl_hashtable.h

108

class _ExtractKey, class _EqualKey, class _Alloc>

headers/cpp/stl_hashtable.h

110

typedef hashtable<_Val,_Key,_HashFcn,_ExtractKey,_EqualKey,_Alloc>

headers/cpp/stl_hashtable.h

113

_ExtractKey,_EqualKey,_Alloc>

headers/cpp/stl_hashtable.h

116

_ExtractKey, _EqualKey, _Alloc>

headers/cpp/stl_hashtable.h

186

class _ExtractKey, class _EqualKey, class _Alloc>

headers/cpp/stl_hashtable.h

209

typedef typename _Alloc_traits<_Val,_Alloc>::allocator_type allocator_type;

headers/cpp/stl_hashtable.h

212

typename _Alloc_traits<_Node, _Alloc>::allocator_type _M_node_allocator;

headers/cpp/stl_hashtable.h

218

typedef _Alloc allocator_type;

headers/cpp/stl_hashtable.h

221

typedef simple_alloc<_Node, _Alloc> _M_node_allocator_type;

headers/cpp/stl_hashtable.h

231

vector<_Node*,_Alloc> _M_buckets;

headers/cpp/stl_hashtable.h

235

typedef _Hashtable_iterator<_Val,_Key,_HashFcn,_ExtractKey,_EqualKey,_Alloc>

headers/cpp/stl_hashtable.h

238

_Alloc>

headers/cpp/stl_hashtable.h

242

_Hashtable_iterator<_Val,_Key,_HashFcn,_ExtractKey,_EqualKey,_Alloc>;

headers/cpp/stl_hashtable.h

244

_Hashtable_const_iterator<_Val,_Key,_HashFcn,_ExtractKey,_EqualKey,_Alloc>;

headers/cpp/stl_hashtable.h

57

class _ExtractKey, class _EqualKey, class _Alloc = alloc>

headers/cpp/stl_hashtable.h

61

class _ExtractKey, class _EqualKey, class _Alloc>

headers/cpp/stl_hashtable.h

65

class _ExtractKey, class _EqualKey, class _Alloc>

headers/cpp/stl_hashtable.h

69

class _ExtractKey, class _EqualKey, class _Alloc>

headers/cpp/stl_hashtable.h

71

typedef hashtable<_Val,_Key,_HashFcn,_ExtractKey,_EqualKey,_Alloc>

headers/cpp/stl_hashtable.h

74

_ExtractKey, _EqualKey, _Alloc>

headers/cpp/stl_hashtable.h

77

_ExtractKey, _EqualKey, _Alloc>

headers/cpp/stl_list.h

175

template <class _Tp, class _Alloc>

headers/cpp/stl_list.h

177

: public _List_alloc_base<_Tp, _Alloc,

headers/cpp/stl_list.h

178

_Alloc_traits<_Tp, _Alloc>::_S_instanceless>

headers/cpp/stl_list.h

182

_Alloc_traits<_Tp, _Alloc>::_S_instanceless>

headers/cpp/stl_list.h

201

template <class _Tp, class _Alloc>

headers/cpp/stl_list.h

205

typedef _Alloc allocator_type;

headers/cpp/stl_list.h

221

typedef simple_alloc<_List_node<_Tp>, _Alloc> _Alloc_type;

headers/cpp/stl_list.h

231

template <class _Tp, class _Alloc>

headers/cpp/stl_list.h

233

_List_base<_Tp,_Alloc>::clear()

headers/cpp/stl_list.h

246

template <class _Tp, class _Alloc = __STL_DEFAULT_ALLOCATOR(_Tp) >

headers/cpp/stl_list.h

247

class list : protected _List_base<_Tp, _Alloc> {

headers/cpp/stl_list.h

248

typedef _List_base<_Tp, _Alloc> _Base;

headers/cpp/stl_list.h

341

void swap(list<_Tp, _Alloc>& __x) { __STD::swap(_M_node, __x._M_node); }

headers/cpp/stl_list.h

434

list(const list<_Tp, _Alloc>& __x) : _Base(__x.get_allocator())

headers/cpp/stl_list.h

439

list<_Tp, _Alloc>& operator=(const list<_Tp, _Alloc>& __x);

headers/cpp/stl_list.h

515

template <class _Tp, class _Alloc>

headers/cpp/stl_list.h

516

inline bool operator==(const list<_Tp,_Alloc>& __x,

headers/cpp/stl_list.h

517

const list<_Tp,_Alloc>& __y)

headers/cpp/stl_list.h

519

typedef typename list<_Tp,_Alloc>::_Node _Node;

headers/cpp/stl_list.h

531

template <class _Tp, class _Alloc>

headers/cpp/stl_list.h

532

inline bool operator<(const list<_Tp,_Alloc>& __x,

headers/cpp/stl_list.h

533

const list<_Tp,_Alloc>& __y)

headers/cpp/stl_list.h

541

template <class _Tp, class _Alloc>

headers/cpp/stl_list.h

543

swap(list<_Tp, _Alloc>& __x, list<_Tp, _Alloc>& __y)

headers/cpp/stl_list.h

552

template <class _Tp, class _Alloc> template <class _InputIter>

headers/cpp/stl_list.h

554

list<_Tp, _Alloc>::_M_insert_dispatch(iterator __position,

headers/cpp/stl_list.h

564

template <class _Tp, class _Alloc>

headers/cpp/stl_list.h

566

list<_Tp, _Alloc>::insert(iterator __position,

headers/cpp/stl_list.h

573

template <class _Tp, class _Alloc>

headers/cpp/stl_list.h

575

list<_Tp, _Alloc>::insert(iterator __position,

headers/cpp/stl_list.h

584

template <class _Tp, class _Alloc>

headers/cpp/stl_list.h

586

list<_Tp, _Alloc>::insert(iterator __position, size_type __n, const _Tp& __x)

headers/cpp/stl_list.h

592

template <class _Tp, class _Alloc>

headers/cpp/stl_list.h

593

list<_Tp,_Alloc>::iterator list<_Tp, _Alloc>::erase(iterator __first,

headers/cpp/stl_list.h

601

template <class _Tp, class _Alloc>

headers/cpp/stl_list.h

602

void list<_Tp, _Alloc>::resize(size_type __new_size, const _Tp& __x)

headers/cpp/stl_list.h

614

template <class _Tp, class _Alloc>

headers/cpp/stl_list.h

615

list<_Tp, _Alloc>& list<_Tp, _Alloc>::operator=(const list<_Tp, _Alloc>& __x)

headers/cpp/stl_list.h

632

template <class _Tp, class _Alloc>

headers/cpp/stl_list.h

633

void list<_Tp, _Alloc>::assign(size_type __n, const _Tp& __val) {

headers/cpp/stl_list.h

645

template <class _Tp, class _Alloc> template <class _InputIter>

headers/cpp/stl_list.h

647

list<_Tp, _Alloc>::_M_assign_dispatch(_InputIter __first2, _InputIter __last2,

headers/cpp/stl_list.h

662

template <class _Tp, class _Alloc>

headers/cpp/stl_list.h

663

void list<_Tp, _Alloc>::remove(const _Tp& __value)

headers/cpp/stl_list.h

675

template <class _Tp, class _Alloc>

headers/cpp/stl_list.h

676

void list<_Tp, _Alloc>::unique()

headers/cpp/stl_list.h

691

template <class _Tp, class _Alloc>

headers/cpp/stl_list.h

692

void list<_Tp, _Alloc>::merge(list<_Tp, _Alloc>& __x)

headers/cpp/stl_list.h

709

template <class _Tp, class _Alloc>

headers/cpp/stl_list.h

710

void list<_Tp, _Alloc>::reverse()

headers/cpp/stl_list.h

725

template <class _Tp, class _Alloc>

headers/cpp/stl_list.h

726

void list<_Tp, _Alloc>::sort()

headers/cpp/stl_list.h

731

list<_Tp, _Alloc> __carry;

headers/cpp/stl_list.h

732

list<_Tp, _Alloc> __counter[64];

headers/cpp/stl_list.h

753

template <class _Tp, class _Alloc> template <class _Predicate>

headers/cpp/stl_list.h

754

void list<_Tp, _Alloc>::remove_if(_Predicate __pred)

headers/cpp/stl_list.h

766

template <class _Tp, class _Alloc> template <class _BinaryPredicate>

headers/cpp/stl_list.h

767

void list<_Tp, _Alloc>::unique(_BinaryPredicate __binary_pred)

headers/cpp/stl_list.h

782

template <class _Tp, class _Alloc> template <class _StrictWeakOrdering>

headers/cpp/stl_list.h

783

void list<_Tp, _Alloc>::merge(list<_Tp, _Alloc>& __x,

headers/cpp/stl_list.h

801

template <class _Tp, class _Alloc> template <class _StrictWeakOrdering>

headers/cpp/stl_list.h

802

void list<_Tp, _Alloc>::sort(_StrictWeakOrdering __comp)

headers/cpp/stl_list.h

807

list<_Tp, _Alloc> __carry;

headers/cpp/stl_list.h

808

list<_Tp, _Alloc> __counter[64];

headers/cpp/stl_map.h

125

map(const map<_Key,_Tp,_Compare,_Alloc>& __x) : _M_t(__x._M_t) {}

headers/cpp/stl_map.h

126

map<_Key,_Tp,_Compare,_Alloc>&

headers/cpp/stl_map.h

127

operator=(const map<_Key, _Tp, _Compare, _Alloc>& __x)

headers/cpp/stl_map.h

157

void swap(map<_Key,_Tp,_Compare,_Alloc>& __x) { _M_t.swap(__x._M_t); }

headers/cpp/stl_map.h

209

template <class _Key, class _Tp, class _Compare, class _Alloc>

headers/cpp/stl_map.h

210

inline bool operator==(const map<_Key,_Tp,_Compare,_Alloc>& __x,

headers/cpp/stl_map.h

211

const map<_Key,_Tp,_Compare,_Alloc>& __y) {

headers/cpp/stl_map.h

215

template <class _Key, class _Tp, class _Compare, class _Alloc>

headers/cpp/stl_map.h

216

inline bool operator<(const map<_Key,_Tp,_Compare,_Alloc>& __x,

headers/cpp/stl_map.h

217

const map<_Key,_Tp,_Compare,_Alloc>& __y) {

headers/cpp/stl_map.h

223

template <class _Key, class _Tp, class _Compare, class _Alloc>

headers/cpp/stl_map.h

224

inline void swap(map<_Key,_Tp,_Compare,_Alloc>& __x,

headers/cpp/stl_map.h

225

map<_Key,_Tp,_Compare,_Alloc>& __y) {

headers/cpp/stl_map.h

43

class _Alloc = __STL_DEFAULT_ALLOCATOR(_Tp) >

headers/cpp/stl_map.h

46

class _Alloc = __STL_DEFAULT_ALLOCATOR(_Tp) >

headers/cpp/stl_map.h

61

friend class map<_Key,_Tp,_Compare,_Alloc>;

headers/cpp/stl_map.h

73

_Select1st<value_type>, key_compare, _Alloc> _Rep_type;

headers/cpp/stl_multimap.h

123

multimap(const multimap<_Key,_Tp,_Compare,_Alloc>& __x) : _M_t(__x._M_t) { }

headers/cpp/stl_multimap.h

124

multimap<_Key,_Tp,_Compare,_Alloc>&

headers/cpp/stl_multimap.h

125

operator=(const multimap<_Key,_Tp,_Compare,_Alloc>& __x) {

headers/cpp/stl_multimap.h

147

void swap(multimap<_Key,_Tp,_Compare,_Alloc>& __x) { _M_t.swap(__x._M_t); }

headers/cpp/stl_multimap.h

199

template <class _Key, class _Tp, class _Compare, class _Alloc>

headers/cpp/stl_multimap.h

200

inline bool operator==(const multimap<_Key,_Tp,_Compare,_Alloc>& __x,

headers/cpp/stl_multimap.h

201

const multimap<_Key,_Tp,_Compare,_Alloc>& __y) {

headers/cpp/stl_multimap.h

205

template <class _Key, class _Tp, class _Compare, class _Alloc>

headers/cpp/stl_multimap.h

206

inline bool operator<(const multimap<_Key,_Tp,_Compare,_Alloc>& __x,

headers/cpp/stl_multimap.h

207

const multimap<_Key,_Tp,_Compare,_Alloc>& __y) {

headers/cpp/stl_multimap.h

213

template <class _Key, class _Tp, class _Compare, class _Alloc>

headers/cpp/stl_multimap.h

214

inline void swap(multimap<_Key,_Tp,_Compare,_Alloc>& __x,

headers/cpp/stl_multimap.h

215

multimap<_Key,_Tp,_Compare,_Alloc>& __y) {

headers/cpp/stl_multimap.h

43

class _Alloc = __STL_DEFAULT_ALLOCATOR(_Tp) >

headers/cpp/stl_multimap.h

46

class _Alloc = __STL_DEFAULT_ALLOCATOR(_Tp) >

headers/cpp/stl_multimap.h

60

friend class multimap<_Key,_Tp,_Compare,_Alloc>;

headers/cpp/stl_multimap.h

72

_Select1st<value_type>, key_compare, _Alloc> _Rep_type;

headers/cpp/stl_multiset.h

115

multiset(const multiset<_Key,_Compare,_Alloc>& __x) : _M_t(__x._M_t) {}

headers/cpp/stl_multiset.h

116

multiset<_Key,_Compare,_Alloc>&

headers/cpp/stl_multiset.h

117

operator=(const multiset<_Key,_Compare,_Alloc>& __x) {

headers/cpp/stl_multiset.h

135

void swap(multiset<_Key,_Compare,_Alloc>& __x) { _M_t.swap(__x._M_t); }

headers/cpp/stl_multiset.h

191

template <class _Key, class _Compare, class _Alloc>

headers/cpp/stl_multiset.h

192

inline bool operator==(const multiset<_Key,_Compare,_Alloc>& __x,

headers/cpp/stl_multiset.h

193

const multiset<_Key,_Compare,_Alloc>& __y) {

headers/cpp/stl_multiset.h

197

template <class _Key, class _Compare, class _Alloc>

headers/cpp/stl_multiset.h

198

inline bool operator<(const multiset<_Key,_Compare,_Alloc>& __x,

headers/cpp/stl_multiset.h

199

const multiset<_Key,_Compare,_Alloc>& __y) {

headers/cpp/stl_multiset.h

205

template <class _Key, class _Compare, class _Alloc>

headers/cpp/stl_multiset.h

206

inline void swap(multiset<_Key,_Compare,_Alloc>& __x,

headers/cpp/stl_multiset.h

207

multiset<_Key,_Compare,_Alloc>& __y) {

headers/cpp/stl_multiset.h

43

class _Alloc = __STL_DEFAULT_ALLOCATOR(_Key) >

headers/cpp/stl_multiset.h

46

class _Alloc = __STL_DEFAULT_ALLOCATOR(_Key) >

headers/cpp/stl_multiset.h

58

_Identity<value_type>, key_compare, _Alloc> _Rep_type;

headers/cpp/stl_rope.h

1006

return _Rope_const_iterator<_CharT,_Alloc>(_M_root, __old_pos);

headers/cpp/stl_rope.h

1008

friend _Rope_const_iterator<_CharT,_Alloc> operator- __STL_NULL_TMPL_ARGS

headers/cpp/stl_rope.h

1009

(const _Rope_const_iterator<_CharT,_Alloc>& __x,

headers/cpp/stl_rope.h

1011

friend _Rope_const_iterator<_CharT,_Alloc> operator+ __STL_NULL_TMPL_ARGS

headers/cpp/stl_rope.h

1012

(const _Rope_const_iterator<_CharT,_Alloc>& __x,

headers/cpp/stl_rope.h

1014

friend _Rope_const_iterator<_CharT,_Alloc> operator+ __STL_NULL_TMPL_ARGS

headers/cpp/stl_rope.h

1016

const _Rope_const_iterator<_CharT,_Alloc>& __x);

headers/cpp/stl_rope.h

1018

return rope<_CharT,_Alloc>::_S_fetch(_M_root, _M_current_pos + __n);

headers/cpp/stl_rope.h

1021

(const _Rope_const_iterator<_CharT,_Alloc>& __x,

headers/cpp/stl_rope.h

1022

const _Rope_const_iterator<_CharT,_Alloc>& __y);

headers/cpp/stl_rope.h

1024

(const _Rope_const_iterator<_CharT,_Alloc>& __x,

headers/cpp/stl_rope.h

1025

const _Rope_const_iterator<_CharT,_Alloc>& __y);

headers/cpp/stl_rope.h

1027

(const _Rope_const_iterator<_CharT,_Alloc>& __x,

headers/cpp/stl_rope.h

1028

const _Rope_const_iterator<_CharT,_Alloc>& __y);

headers/cpp/stl_rope.h

1031

template<class _CharT, class _Alloc>

headers/cpp/stl_rope.h

1032

class _Rope_iterator : public _Rope_iterator_base<_CharT,_Alloc> {

headers/cpp/stl_rope.h

1033

friend class rope<_CharT,_Alloc>;

headers/cpp/stl_rope.h

1035

rope<_CharT,_Alloc>* _M_root_rope;

headers/cpp/stl_rope.h

1043

_Rope_iterator(rope<_CharT,_Alloc>* __r, size_t __pos)

headers/cpp/stl_rope.h

1044

: _Rope_iterator_base<_CharT,_Alloc>(__r->_M_tree_ptr, __pos),

headers/cpp/stl_rope.h

1050

typedef _Rope_char_ref_proxy<_CharT,_Alloc> reference;

headers/cpp/stl_rope.h

1051

typedef _Rope_char_ref_proxy<_CharT,_Alloc>* pointer;

headers/cpp/stl_rope.h

1054

rope<_CharT,_Alloc>& container() { return *_M_root_rope; }

headers/cpp/stl_rope.h

1059

_Rope_iterator_base<_CharT,_Alloc>(__x) {

headers/cpp/stl_rope.h

1063

_Rope_iterator(rope<_CharT,_Alloc>& __r, size_t __pos);

headers/cpp/stl_rope.h

1073

*(static_cast<_Rope_iterator_base<_CharT,_Alloc>*>(this)) = __x;

headers/cpp/stl_rope.h

1086

return _Rope_char_ref_proxy<_CharT,_Alloc>(

headers/cpp/stl_rope.h

1089

return _Rope_char_ref_proxy<_CharT,_Alloc>(

headers/cpp/stl_rope.h

1120

return _Rope_iterator<_CharT,_Alloc>(_M_root_rope, __old_pos);

headers/cpp/stl_rope.h

1125

return _Rope_iterator<_CharT,_Alloc>(_M_root_rope, __old_pos);

headers/cpp/stl_rope.h

1128

return _Rope_char_ref_proxy<_CharT,_Alloc>(

headers/cpp/stl_rope.h

1132

(const _Rope_iterator<_CharT,_Alloc>& __x,

headers/cpp/stl_rope.h

1133

const _Rope_iterator<_CharT,_Alloc>& __y);

headers/cpp/stl_rope.h

1135

(const _Rope_iterator<_CharT,_Alloc>& __x,

headers/cpp/stl_rope.h

1136

const _Rope_iterator<_CharT,_Alloc>& __y);

headers/cpp/stl_rope.h

1138

(const _Rope_iterator<_CharT,_Alloc>& __x,

headers/cpp/stl_rope.h

1139

const _Rope_iterator<_CharT,_Alloc>& __y);

headers/cpp/stl_rope.h

1140

friend _Rope_iterator<_CharT,_Alloc> operator- __STL_NULL_TMPL_ARGS

headers/cpp/stl_rope.h

1141

(const _Rope_iterator<_CharT,_Alloc>& __x,

headers/cpp/stl_rope.h

1143

friend _Rope_iterator<_CharT,_Alloc> operator+ __STL_NULL_TMPL_ARGS

headers/cpp/stl_rope.h

1144

(const _Rope_iterator<_CharT,_Alloc>& __x,

headers/cpp/stl_rope.h

1146

friend _Rope_iterator<_CharT,_Alloc> operator+ __STL_NULL_TMPL_ARGS

headers/cpp/stl_rope.h

1148

const _Rope_iterator<_CharT,_Alloc>& __x);

headers/cpp/stl_rope.h

1221

template <class _CharT, class _Alloc>

headers/cpp/stl_rope.h

1223

: public _Rope_alloc_base<_CharT,_Alloc,

headers/cpp/stl_rope.h

1224

_Alloc_traits<_CharT,_Alloc>::_S_instanceless>

headers/cpp/stl_rope.h

1227

_Alloc_traits<_CharT,_Alloc>::_S_instanceless>

headers/cpp/stl_rope.h

1236

template <class _CharT, class _Alloc>

headers/cpp/stl_rope.h

1239

typedef _Rope_RopeRep<_CharT, _Alloc> _RopeRep;

headers/cpp/stl_rope.h

1240

typedef _Alloc allocator_type;

headers/cpp/stl_rope.h

1250

typedef simple_alloc<_Tp, _Alloc> __name##Alloc; \

headers/cpp/stl_rope.h

1255

__ROPE_DEFINE_ALLOCS(_Alloc)

headers/cpp/stl_rope.h

1262

template <class _CharT, class _Alloc>

headers/cpp/stl_rope.h

1263

class rope : public _Rope_base<_CharT,_Alloc> {

headers/cpp/stl_rope.h

1270

typedef _Rope_iterator<_CharT,_Alloc> iterator;

headers/cpp/stl_rope.h

1271

typedef _Rope_const_iterator<_CharT,_Alloc> const_iterator;

headers/cpp/stl_rope.h

1272

typedef _Rope_char_ref_proxy<_CharT,_Alloc> reference;

headers/cpp/stl_rope.h

1273

typedef _Rope_char_ptr_proxy<_CharT,_Alloc> pointer;

headers/cpp/stl_rope.h

1275

friend class _Rope_iterator<_CharT,_Alloc>;

headers/cpp/stl_rope.h

1276

friend class _Rope_const_iterator<_CharT,_Alloc>;

headers/cpp/stl_rope.h

1277

friend struct _Rope_RopeRep<_CharT,_Alloc>;

headers/cpp/stl_rope.h

1278

friend class _Rope_iterator_base<_CharT,_Alloc>;

headers/cpp/stl_rope.h

1279

friend class _Rope_char_ptr_proxy<_CharT,_Alloc>;

headers/cpp/stl_rope.h

1280

friend class _Rope_char_ref_proxy<_CharT,_Alloc>;

headers/cpp/stl_rope.h

1281

friend struct _Rope_RopeSubstring<_CharT,_Alloc>;

headers/cpp/stl_rope.h

1284

typedef _Rope_base<_CharT,_Alloc> _Base;

headers/cpp/stl_rope.h

1332

typedef _Rope_RopeRep<_CharT,_Alloc> _RopeRep;

headers/cpp/stl_rope.h

1333

typedef _Rope_RopeConcatenation<_CharT,_Alloc> _RopeConcatenation;

headers/cpp/stl_rope.h

1334

typedef _Rope_RopeLeaf<_CharT,_Alloc> _RopeLeaf;

headers/cpp/stl_rope.h

1335

typedef _Rope_RopeFunction<_CharT,_Alloc> _RopeFunction;

headers/cpp/stl_rope.h

1336

typedef _Rope_RopeSubstring<_CharT,_Alloc> _RopeSubstring;

headers/cpp/stl_rope.h

1374

typedef _Rope_RopeRep<_CharT,_Alloc>* _Self_destruct_ptr;

headers/cpp/stl_rope.h

1376

typedef _Rope_self_destruct_ptr<_CharT,_Alloc> _Self_destruct_ptr;

headers/cpp/stl_rope.h

1462

_Rope_RopeRep<_CharT,_Alloc>* __b, size_t __s,

headers/cpp/stl_rope.h

1530

: public binary_function<rope<_CharT,_Alloc>,

headers/cpp/stl_rope.h

1531

rope<_CharT,_Alloc>,

headers/cpp/stl_rope.h

1532

rope<_CharT,_Alloc> > {

headers/cpp/stl_rope.h

1541

{ return rope<_CharT,_Alloc>(); }

headers/cpp/stl_rope.h

1861

friend rope<_CharT,_Alloc>

headers/cpp/stl_rope.h

1862

operator+ __STL_NULL_TMPL_ARGS (const rope<_CharT,_Alloc>& __left,

headers/cpp/stl_rope.h

1863

const rope<_CharT,_Alloc>& __right);

headers/cpp/stl_rope.h

1865

friend rope<_CharT,_Alloc>

headers/cpp/stl_rope.h

1866

operator+ __STL_NULL_TMPL_ARGS (const rope<_CharT,_Alloc>& __left,

headers/cpp/stl_rope.h

1869

friend rope<_CharT,_Alloc>

headers/cpp/stl_rope.h

1870

operator+ __STL_NULL_TMPL_ARGS (const rope<_CharT,_Alloc>& __left,

headers/cpp/stl_rope.h

1936

rope<_CharT,_Alloc> __last(__n, __c);

headers/cpp/stl_rope.h

1985

rope<_CharT,_Alloc> __r(__n,__c);

headers/cpp/stl_rope.h

2191

return rope<_CharT,_Alloc>(

headers/cpp/stl_rope.h

2196

return rope<_CharT,_Alloc>(

headers/cpp/stl_rope.h

220

template<class _CharT, class _Alloc=__STL_DEFAULT_ALLOCATOR(_CharT)> class rope;

headers/cpp/stl_rope.h

2202

return rope<_CharT,_Alloc>(

headers/cpp/stl_rope.h

2209

return rope<_CharT,_Alloc>(

headers/cpp/stl_rope.h

221

template<class _CharT, class _Alloc> struct _Rope_RopeConcatenation;

headers/cpp/stl_rope.h

2213

rope<_CharT,_Alloc> substr(const_iterator __start) {

headers/cpp/stl_rope.h

2215

return rope<_CharT,_Alloc>(

headers/cpp/stl_rope.h

222

template<class _CharT, class _Alloc> struct _Rope_RopeLeaf;

headers/cpp/stl_rope.h

223

template<class _CharT, class _Alloc> struct _Rope_RopeFunction;

headers/cpp/stl_rope.h

224

template<class _CharT, class _Alloc> struct _Rope_RopeSubstring;

headers/cpp/stl_rope.h

225

template<class _CharT, class _Alloc> class _Rope_iterator;

headers/cpp/stl_rope.h

226

template<class _CharT, class _Alloc> class _Rope_const_iterator;

headers/cpp/stl_rope.h

227

template<class _CharT, class _Alloc> class _Rope_char_ref_proxy;

headers/cpp/stl_rope.h

228

template<class _CharT, class _Alloc> class _Rope_char_ptr_proxy;

headers/cpp/stl_rope.h

2307

template <class _CharT, class _Alloc>

headers/cpp/stl_rope.h

2308

const rope<_CharT, _Alloc>::size_type rope<_CharT, _Alloc>::npos =

headers/cpp/stl_rope.h

2311

template <class _CharT, class _Alloc>

headers/cpp/stl_rope.h

2312

inline bool operator== (const _Rope_const_iterator<_CharT,_Alloc>& __x,

headers/cpp/stl_rope.h

2313

const _Rope_const_iterator<_CharT,_Alloc>& __y) {

headers/cpp/stl_rope.h

2318

template <class _CharT, class _Alloc>

headers/cpp/stl_rope.h

2319

inline bool operator< (const _Rope_const_iterator<_CharT,_Alloc>& __x,

headers/cpp/stl_rope.h

2320

const _Rope_const_iterator<_CharT,_Alloc>& __y) {

headers/cpp/stl_rope.h

2324

template <class _CharT, class _Alloc>

headers/cpp/stl_rope.h

2325

inline ptrdiff_t operator-(const _Rope_const_iterator<_CharT,_Alloc>& __x,

headers/cpp/stl_rope.h

2326

const _Rope_const_iterator<_CharT,_Alloc>& __y) {

headers/cpp/stl_rope.h

2330

template <class _CharT, class _Alloc>

headers/cpp/stl_rope.h

2331

inline _Rope_const_iterator<_CharT,_Alloc>

headers/cpp/stl_rope.h

2332

operator-(const _Rope_const_iterator<_CharT,_Alloc>& __x, ptrdiff_t __n) {

headers/cpp/stl_rope.h

2333

return _Rope_const_iterator<_CharT,_Alloc>(

headers/cpp/stl_rope.h

2337

template <class _CharT, class _Alloc>

headers/cpp/stl_rope.h

2338

inline _Rope_const_iterator<_CharT,_Alloc>

headers/cpp/stl_rope.h

2339

operator+(const _Rope_const_iterator<_CharT,_Alloc>& __x, ptrdiff_t __n) {

headers/cpp/stl_rope.h

2340

return _Rope_const_iterator<_CharT,_Alloc>(

headers/cpp/stl_rope.h

2344

template <class _CharT, class _Alloc>

headers/cpp/stl_rope.h

2345

inline _Rope_const_iterator<_CharT,_Alloc>

headers/cpp/stl_rope.h

2346

operator+(ptrdiff_t __n, const _Rope_const_iterator<_CharT,_Alloc>& __x) {

headers/cpp/stl_rope.h

2347

return _Rope_const_iterator<_CharT,_Alloc>(

headers/cpp/stl_rope.h

2351

template <class _CharT, class _Alloc>

headers/cpp/stl_rope.h

2352

inline bool operator== (const _Rope_iterator<_CharT,_Alloc>& __x,

headers/cpp/stl_rope.h

2353

const _Rope_iterator<_CharT,_Alloc>& __y) {

headers/cpp/stl_rope.h

2358

template <class _CharT, class _Alloc>

headers/cpp/stl_rope.h

2359

inline bool operator< (const _Rope_iterator<_CharT,_Alloc>& __x,

headers/cpp/stl_rope.h

2360

const _Rope_iterator<_CharT,_Alloc>& __y) {

headers/cpp/stl_rope.h

2364

template <class _CharT, class _Alloc>

headers/cpp/stl_rope.h

2365

inline ptrdiff_t operator-(const _Rope_iterator<_CharT,_Alloc>& __x,

headers/cpp/stl_rope.h

2366

const _Rope_iterator<_CharT,_Alloc>& __y) {

headers/cpp/stl_rope.h

2370

template <class _CharT, class _Alloc>

headers/cpp/stl_rope.h

2371

inline _Rope_iterator<_CharT,_Alloc>

headers/cpp/stl_rope.h

2372

operator-(const _Rope_iterator<_CharT,_Alloc>& __x,

headers/cpp/stl_rope.h

2374

return _Rope_iterator<_CharT,_Alloc>(

headers/cpp/stl_rope.h

2378

template <class _CharT, class _Alloc>

headers/cpp/stl_rope.h

2379

inline _Rope_iterator<_CharT,_Alloc>

headers/cpp/stl_rope.h

2380

operator+(const _Rope_iterator<_CharT,_Alloc>& __x,

headers/cpp/stl_rope.h

2382

return _Rope_iterator<_CharT,_Alloc>(

headers/cpp/stl_rope.h

2386

template <class _CharT, class _Alloc>

headers/cpp/stl_rope.h

2387

inline _Rope_iterator<_CharT,_Alloc>

headers/cpp/stl_rope.h

2388

operator+(ptrdiff_t __n, const _Rope_iterator<_CharT,_Alloc>& __x) {

headers/cpp/stl_rope.h

2389

return _Rope_iterator<_CharT,_Alloc>(

headers/cpp/stl_rope.h

2393

template <class _CharT, class _Alloc>

headers/cpp/stl_rope.h

2395

rope<_CharT,_Alloc>

headers/cpp/stl_rope.h

2396

operator+ (const rope<_CharT,_Alloc>& __left,

headers/cpp/stl_rope.h

2397

const rope<_CharT,_Alloc>& __right)

headers/cpp/stl_rope.h

2402

return rope<_CharT,_Alloc>(

headers/cpp/stl_rope.h

2403

rope<_CharT,_Alloc>::_S_concat(__left._M_tree_ptr, __right._M_tree_ptr));

headers/cpp/stl_rope.h

2408

template <class _CharT, class _Alloc>

headers/cpp/stl_rope.h

2410

rope<_CharT,_Alloc>&

headers/cpp/stl_rope.h

2411

operator+= (rope<_CharT,_Alloc>& __left,

headers/cpp/stl_rope.h

2412

const rope<_CharT,_Alloc>& __right)

headers/cpp/stl_rope.h

2418

template <class _CharT, class _Alloc>

headers/cpp/stl_rope.h

2420

rope<_CharT,_Alloc>

headers/cpp/stl_rope.h

2421

operator+ (const rope<_CharT,_Alloc>& __left,

headers/cpp/stl_rope.h

2423

size_t __rlen = rope<_CharT,_Alloc>::_S_char_ptr_len(__right);

headers/cpp/stl_rope.h

2424

return rope<_CharT,_Alloc>(

headers/cpp/stl_rope.h

2425

rope<_CharT,_Alloc>::_S_concat_char_iter(

headers/cpp/stl_rope.h

2429

template <class _CharT, class _Alloc>

headers/cpp/stl_rope.h

2431

rope<_CharT,_Alloc>&

headers/cpp/stl_rope.h

2432

operator+= (rope<_CharT,_Alloc>& __left,

headers/cpp/stl_rope.h

2438

template <class _CharT, class _Alloc>

headers/cpp/stl_rope.h

2440

rope<_CharT,_Alloc>

headers/cpp/stl_rope.h

2441

operator+ (const rope<_CharT,_Alloc>& __left, _CharT __right) {

headers/cpp/stl_rope.h

2442

return rope<_CharT,_Alloc>(

headers/cpp/stl_rope.h

2443

rope<_CharT,_Alloc>::_S_concat_char_iter(

headers/cpp/stl_rope.h

2447

template <class _CharT, class _Alloc>

headers/cpp/stl_rope.h

2449

rope<_CharT,_Alloc>&

headers/cpp/stl_rope.h

2450

operator+= (rope<_CharT,_Alloc>& __left, _CharT __right) {

headers/cpp/stl_rope.h

2455

template <class _CharT, class _Alloc>

headers/cpp/stl_rope.h

2457

operator< (const rope<_CharT,_Alloc>& __left,

headers/cpp/stl_rope.h

2458

const rope<_CharT,_Alloc>& __right) {

headers/cpp/stl_rope.h

2462

template <class _CharT, class _Alloc>

headers/cpp/stl_rope.h

2464

operator== (const rope<_CharT,_Alloc>& __left,

headers/cpp/stl_rope.h

2465

const rope<_CharT,_Alloc>& __right) {

headers/cpp/stl_rope.h

2469

template <class _CharT, class _Alloc>

headers/cpp/stl_rope.h

2470

inline bool operator== (const _Rope_char_ptr_proxy<_CharT,_Alloc>& __x,

headers/cpp/stl_rope.h

2471

const _Rope_char_ptr_proxy<_CharT,_Alloc>& __y) {

headers/cpp/stl_rope.h

2475

template<class _CharT, class _Alloc>

headers/cpp/stl_rope.h

2476

ostream& operator<< (ostream& __o, const rope<_CharT,_Alloc>& __r);

headers/cpp/stl_rope.h

2493

template <class _CharT, class _Alloc>

headers/cpp/stl_rope.h

2494

inline void swap(rope<_CharT,_Alloc>& __x, rope<_CharT,_Alloc>& __y) {

headers/cpp/stl_rope.h

331

template <class _CharT, class _Alloc>

headers/cpp/stl_rope.h

333

: public _Rope_rep_alloc_base<_CharT,_Alloc,

headers/cpp/stl_rope.h

334

_Alloc_traits<_CharT,_Alloc>::_S_instanceless>

headers/cpp/stl_rope.h

337

_Alloc_traits<_CharT,_Alloc>::_S_instanceless>

headers/cpp/stl_rope.h

348

template <class _CharT, class _Alloc>

headers/cpp/stl_rope.h

351

typedef _Alloc allocator_type;

headers/cpp/stl_rope.h

359

typedef simple_alloc<_Tp, _Alloc> __name##Alloc; \

headers/cpp/stl_rope.h

364

__ROPE_DEFINE_ALLOCS(_Alloc);

headers/cpp/stl_rope.h

371

template<class _CharT, class _Alloc>

headers/cpp/stl_rope.h

372

struct _Rope_RopeRep : public _Rope_rep_base<_CharT,_Alloc> {

headers/cpp/stl_rope.h

386

typedef _Rope_rep_base<_CharT,_Alloc>::allocator_type allocator_type;

headers/cpp/stl_rope.h

389

: _Rope_rep_base<_CharT,_Alloc>(__size, __a),

headers/cpp/stl_rope.h

534

template<class _CharT, class _Alloc>

headers/cpp/stl_rope.h

535

struct _Rope_RopeLeaf : public _Rope_RopeRep<_CharT,_Alloc> {

headers/cpp/stl_rope.h

563

typedef _Rope_rep_base<_CharT,_Alloc>::allocator_type allocator_type;

headers/cpp/stl_rope.h

565

: _Rope_RopeRep<_CharT,_Alloc>(_S_leaf, 0, true, __size, __a),

headers/cpp/stl_rope.h

587

template<class _CharT, class _Alloc>

headers/cpp/stl_rope.h

588

struct _Rope_RopeConcatenation : public _Rope_RopeRep<_CharT,_Alloc> {

headers/cpp/stl_rope.h

590

_Rope_RopeRep<_CharT,_Alloc>* _M_left;

headers/cpp/stl_rope.h

591

_Rope_RopeRep<_CharT,_Alloc>* _M_right;

headers/cpp/stl_rope.h

592

typedef _Rope_rep_base<_CharT,_Alloc>::allocator_type allocator_type;

headers/cpp/stl_rope.h

593

_Rope_RopeConcatenation(_Rope_RopeRep<_CharT,_Alloc>* __l,

headers/cpp/stl_rope.h

594

_Rope_RopeRep<_CharT,_Alloc>* __r,

headers/cpp/stl_rope.h

596

: _Rope_RopeRep<_CharT,_Alloc>(

headers/cpp/stl_rope.h

610

template<class _CharT, class _Alloc>

headers/cpp/stl_rope.h

611

struct _Rope_RopeFunction : public _Rope_RopeRep<_CharT,_Alloc> {

headers/cpp/stl_rope.h

629

typedef _Rope_rep_base<_CharT,_Alloc>::allocator_type allocator_type;

headers/cpp/stl_rope.h

632

:_Rope_RopeRep<_CharT,_Alloc>(_S_function, 0, true, __size, __a),

headers/cpp/stl_rope.h

662

template<class _CharT, class _Alloc>

headers/cpp/stl_rope.h

663

struct _Rope_RopeSubstring : public _Rope_RopeFunction<_CharT,_Alloc>,

headers/cpp/stl_rope.h

667

_Rope_RopeRep<_CharT,_Alloc>* _M_base; // not 0

headers/cpp/stl_rope.h

676

((_Rope_RopeFunction<_CharT,_Alloc>*)_M_base)->_M_fn;

headers/cpp/stl_rope.h

685

((_Rope_RopeLeaf<_CharT,_Alloc>*)_M_base)->_M_data;

headers/cpp/stl_rope.h

694

typedef _Rope_rep_base<_CharT,_Alloc>::allocator_type allocator_type;

headers/cpp/stl_rope.h

695

_Rope_RopeSubstring(_Rope_RopeRep<_CharT,_Alloc>* __b, size_t __s,

headers/cpp/stl_rope.h

697

: _Rope_RopeFunction<_CharT,_Alloc>(this, __l, false, __a), _M_base(__b)

headers/cpp/stl_rope.h

727

template<class _CharT, class _Alloc>

headers/cpp/stl_rope.h

729

_Rope_RopeRep<_CharT,_Alloc>* _M_ptr;

headers/cpp/stl_rope.h

731

{ _Rope_RopeRep<_CharT,_Alloc>::_S_unref(_M_ptr); }

headers/cpp/stl_rope.h

737

_Rope_self_destruct_ptr(_Rope_RopeRep<_CharT,_Alloc>* __p) : _M_ptr(__p) {}

headers/cpp/stl_rope.h

738

_Rope_RopeRep<_CharT,_Alloc>& operator*() { return *_M_ptr; }

headers/cpp/stl_rope.h

739

_Rope_RopeRep<_CharT,_Alloc>* operator->() { return _M_ptr; }

headers/cpp/stl_rope.h

740

operator _Rope_RopeRep<_CharT,_Alloc>*() { return _M_ptr; }

headers/cpp/stl_rope.h

741

_Rope_self_destruct_ptr& operator= (_Rope_RopeRep<_CharT,_Alloc>* __x)

headers/cpp/stl_rope.h

751

template<class _CharT, class _Alloc>

headers/cpp/stl_rope.h

753

friend class rope<_CharT,_Alloc>;

headers/cpp/stl_rope.h

754

friend class _Rope_iterator<_CharT,_Alloc>;

headers/cpp/stl_rope.h

755

friend class _Rope_char_ptr_proxy<_CharT,_Alloc>;

headers/cpp/stl_rope.h

757

typedef _Rope_RopeRep<_CharT,_Alloc>* _Self_destruct_ptr;

headers/cpp/stl_rope.h

759

typedef _Rope_self_destruct_ptr<_CharT,_Alloc> _Self_destruct_ptr;

headers/cpp/stl_rope.h

761

typedef _Rope_RopeRep<_CharT,_Alloc> _RopeRep;

headers/cpp/stl_rope.h

762

typedef rope<_CharT,_Alloc> _My_rope;

headers/cpp/stl_rope.h

781

_Rope_char_ptr_proxy<_CharT,_Alloc> operator& () const;

headers/cpp/stl_rope.h

814

template<class _CharT, class _Alloc>

headers/cpp/stl_rope.h

817

friend class _Rope_char_ref_proxy<_CharT,_Alloc>;

headers/cpp/stl_rope.h

819

rope<_CharT,_Alloc>* _M_root; // The whole rope.

headers/cpp/stl_rope.h

821

_Rope_char_ptr_proxy(const _Rope_char_ref_proxy<_CharT,_Alloc>& __x)

headers/cpp/stl_rope.h

836

(const _Rope_char_ptr_proxy<_CharT,_Alloc>& __x,

headers/cpp/stl_rope.h

837

const _Rope_char_ptr_proxy<_CharT,_Alloc>& __y);

headers/cpp/stl_rope.h

839

_Rope_char_ref_proxy<_CharT,_Alloc> operator*() const {

headers/cpp/stl_rope.h

840

return _Rope_char_ref_proxy<_CharT,_Alloc>(_M_root, _M_pos);

headers/cpp/stl_rope.h

858

template<class _CharT, class _Alloc>

headers/cpp/stl_rope.h

861

friend class rope<_CharT,_Alloc>;

headers/cpp/stl_rope.h

863

typedef _Rope_RopeRep<_CharT,_Alloc> _RopeRep;

headers/cpp/stl_rope.h

927

template<class _CharT, class _Alloc> class _Rope_iterator;

headers/cpp/stl_rope.h

929

template<class _CharT, class _Alloc>

headers/cpp/stl_rope.h

930

class _Rope_const_iterator : public _Rope_iterator_base<_CharT,_Alloc> {

headers/cpp/stl_rope.h

931

friend class rope<_CharT,_Alloc>;

headers/cpp/stl_rope.h

934

_Rope_iterator_base<_CharT,_Alloc>(

headers/cpp/stl_rope.h

947

_Rope_iterator_base<_CharT,_Alloc>(__x) { }

headers/cpp/stl_rope.h

948

_Rope_const_iterator(const _Rope_iterator<_CharT,_Alloc>& __x);

headers/cpp/stl_rope.h

949

_Rope_const_iterator(const rope<_CharT,_Alloc>& __r, size_t __pos) :

headers/cpp/stl_rope.h

950

_Rope_iterator_base<_CharT,_Alloc>(__r._M_tree_ptr, __pos) {}

headers/cpp/stl_rope.h

953

*(static_cast<_Rope_iterator_base<_CharT,_Alloc>*>(this)) = __x;

headers/cpp/stl_rope.h

998

return _Rope_const_iterator<_CharT,_Alloc>(_M_root, __old_pos);

headers/cpp/stl_set.h

109

set(const set<_Key,_Compare,_Alloc>& __x) : _M_t(__x._M_t) {}

headers/cpp/stl_set.h

110

set<_Key,_Compare,_Alloc>& operator=(const set<_Key, _Compare, _Alloc>& __x)

headers/cpp/stl_set.h

129

void swap(set<_Key,_Compare,_Alloc>& __x) { _M_t.swap(__x._M_t); }

headers/cpp/stl_set.h

183

template <class _Key, class _Compare, class _Alloc>

headers/cpp/stl_set.h

184

inline bool operator==(const set<_Key,_Compare,_Alloc>& __x,

headers/cpp/stl_set.h

185

const set<_Key,_Compare,_Alloc>& __y) {

headers/cpp/stl_set.h

189

template <class _Key, class _Compare, class _Alloc>

headers/cpp/stl_set.h

190

inline bool operator<(const set<_Key,_Compare,_Alloc>& __x,

headers/cpp/stl_set.h

191

const set<_Key,_Compare,_Alloc>& __y) {

headers/cpp/stl_set.h

197

template <class _Key, class _Compare, class _Alloc>

headers/cpp/stl_set.h

198

inline void swap(set<_Key,_Compare,_Alloc>& __x,

headers/cpp/stl_set.h

199

set<_Key,_Compare,_Alloc>& __y) {

headers/cpp/stl_set.h

43

class _Alloc = __STL_DEFAULT_ALLOCATOR(_Key) >

headers/cpp/stl_set.h

46

class _Alloc = __STL_DEFAULT_ALLOCATOR(_Key) >

headers/cpp/stl_set.h

58

_Identity<value_type>, key_compare, _Alloc> _Rep_type;

headers/cpp/stl_slist.h

225

template <class _Tp, class _Alloc>

headers/cpp/stl_slist.h

227

: public _Slist_alloc_base<_Tp, _Alloc,

headers/cpp/stl_slist.h

228

_Alloc_traits<_Tp, _Alloc>::_S_instanceless>

headers/cpp/stl_slist.h

231

_Alloc_traits<_Tp, _Alloc>::_S_instanceless>

headers/cpp/stl_slist.h

254

template <class _Tp, class _Alloc>

headers/cpp/stl_slist.h

256

typedef _Alloc allocator_type;

headers/cpp/stl_slist.h

263

typedef simple_alloc<_Slist_node<_Tp>, _Alloc> _Alloc_type;

headers/cpp/stl_slist.h

284

template <class _Tp, class _Alloc>

headers/cpp/stl_slist.h

286

_Slist_base<_Tp,_Alloc>::_M_erase_after(_Slist_node_base* __before_first,

headers/cpp/stl_slist.h

299

template <class _Tp, class _Alloc = __STL_DEFAULT_ALLOCATOR(_Tp) >

headers/cpp/stl_slist.h

300

class slist : private _Slist_base<_Tp,_Alloc>

headers/cpp/stl_slist.h

303

typedef _Slist_base<_Tp,_Alloc> _Base;

headers/cpp/stl_slist.h

430

friend bool operator== __STL_NULL_TMPL_ARGS (const slist<_Tp,_Alloc>& _SL1,

headers/cpp/stl_slist.h

431

const slist<_Tp,_Alloc>& _SL2);

headers/cpp/stl_slist.h

684

template <class _Tp, class _Alloc>

headers/cpp/stl_slist.h

685

slist<_Tp,_Alloc>& slist<_Tp,_Alloc>::operator=(const slist<_Tp,_Alloc>& __x)

headers/cpp/stl_slist.h

706

template <class _Tp, class _Alloc>

headers/cpp/stl_slist.h

707

void slist<_Tp, _Alloc>::assign(size_type __n, const _Tp& __val) {

headers/cpp/stl_slist.h

723

template <class _Tp, class _Alloc> template <class _InputIter>

headers/cpp/stl_slist.h

725

slist<_Tp, _Alloc>::_M_assign_dispatch(_InputIter __first, _InputIter __last,

headers/cpp/stl_slist.h

744

template <class _Tp, class _Alloc>

headers/cpp/stl_slist.h

746

operator==(const slist<_Tp,_Alloc>& _SL1, const slist<_Tp,_Alloc>& _SL2)

headers/cpp/stl_slist.h

748

typedef typename slist<_Tp,_Alloc>::_Node _Node;

headers/cpp/stl_slist.h

758

template <class _Tp, class _Alloc>

headers/cpp/stl_slist.h

759

inline bool operator<(const slist<_Tp,_Alloc>& _SL1,

headers/cpp/stl_slist.h

760

const slist<_Tp,_Alloc>& _SL2)

headers/cpp/stl_slist.h

768

template <class _Tp, class _Alloc>

headers/cpp/stl_slist.h

769

inline void swap(slist<_Tp,_Alloc>& __x, slist<_Tp,_Alloc>& __y) {

headers/cpp/stl_slist.h

776

template <class _Tp, class _Alloc>

headers/cpp/stl_slist.h

777

void slist<_Tp,_Alloc>::resize(size_type __len, const _Tp& __x)

headers/cpp/stl_slist.h

790

template <class _Tp, class _Alloc>

headers/cpp/stl_slist.h

791

void slist<_Tp,_Alloc>::remove(const _Tp& __val)

headers/cpp/stl_slist.h

802

template <class _Tp, class _Alloc>

headers/cpp/stl_slist.h

803

void slist<_Tp,_Alloc>::unique()

headers/cpp/stl_slist.h

817

template <class _Tp, class _Alloc>

headers/cpp/stl_slist.h

818

void slist<_Tp,_Alloc>::merge(slist<_Tp,_Alloc>& __x)

headers/cpp/stl_slist.h

833

template <class _Tp, class _Alloc>

headers/cpp/stl_slist.h

834

void slist<_Tp,_Alloc>::sort()

headers/cpp/stl_slist.h

861

template <class _Tp, class _Alloc>

headers/cpp/stl_slist.h

863

void slist<_Tp,_Alloc>::remove_if(_Predicate __pred)

headers/cpp/stl_slist.h

874

template <class _Tp, class _Alloc> template <class _BinaryPredicate>

headers/cpp/stl_slist.h

875

void slist<_Tp,_Alloc>::unique(_BinaryPredicate __pred)

headers/cpp/stl_slist.h

889

template <class _Tp, class _Alloc> template <class _StrictWeakOrdering>

headers/cpp/stl_slist.h

890

void slist<_Tp,_Alloc>::merge(slist<_Tp,_Alloc>& __x,

headers/cpp/stl_slist.h

906

template <class _Tp, class _Alloc> template <class _StrictWeakOrdering>

headers/cpp/stl_slist.h

907

void slist<_Tp,_Alloc>::sort(_StrictWeakOrdering __comp)

headers/cpp/stl_tree.h

1004

template <class _Key, class _Val, class _KoV, class _Cmp, class _Alloc>

headers/cpp/stl_tree.h

1006

_Rb_tree<_Key,_Val,_KoV,_Cmp,_Alloc>

headers/cpp/stl_tree.h

1013

template <class _Key, class _Val, class _KoV, class _Cmp, class _Alloc>

headers/cpp/stl_tree.h

1014

void _Rb_tree<_Key,_Val,_KoV,_Cmp,_Alloc>

headers/cpp/stl_tree.h

1024

class _Compare, class _Alloc>

headers/cpp/stl_tree.h

1025

inline void _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>

headers/cpp/stl_tree.h

1038

class _Compare, class _Alloc>

headers/cpp/stl_tree.h

1039

typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::size_type

headers/cpp/stl_tree.h

1040

_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::erase(const _Key& __x)

headers/cpp/stl_tree.h

1049

template <class _Key, class _Val, class _KoV, class _Compare, class _Alloc>

headers/cpp/stl_tree.h

1050

typename _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::_Link_type

headers/cpp/stl_tree.h

1051

_Rb_tree<_Key,_Val,_KoV,_Compare,_Alloc>

headers/cpp/stl_tree.h

1080

class _Compare, class _Alloc>

headers/cpp/stl_tree.h

1081

void _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>

headers/cpp/stl_tree.h

1094

class _Compare, class _Alloc>

headers/cpp/stl_tree.h

1095

void _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>

headers/cpp/stl_tree.h

1105

class _Compare, class _Alloc>

headers/cpp/stl_tree.h

1106

void _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>

headers/cpp/stl_tree.h

1113

class _Compare, class _Alloc>

headers/cpp/stl_tree.h

1114

typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::iterator

headers/cpp/stl_tree.h

1115

_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::find(const _Key& __k)

headers/cpp/stl_tree.h

1132

class _Compare, class _Alloc>

headers/cpp/stl_tree.h

1133

typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::const_iterator

headers/cpp/stl_tree.h

1134

_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::find(const _Key& __k) const

headers/cpp/stl_tree.h

1151

class _Compare, class _Alloc>

headers/cpp/stl_tree.h

1152

typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::size_type

headers/cpp/stl_tree.h

1153

_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>

headers/cpp/stl_tree.h

1163

class _Compare, class _Alloc>

headers/cpp/stl_tree.h

1164

typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::iterator

headers/cpp/stl_tree.h

1165

_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>

headers/cpp/stl_tree.h

1181

class _Compare, class _Alloc>

headers/cpp/stl_tree.h

1182

typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::const_iterator

headers/cpp/stl_tree.h

1183

_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>

headers/cpp/stl_tree.h

1199

class _Compare, class _Alloc>

headers/cpp/stl_tree.h

1200

typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::iterator

headers/cpp/stl_tree.h

1201

_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>

headers/cpp/stl_tree.h

1217

class _Compare, class _Alloc>

headers/cpp/stl_tree.h

1218

typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::const_iterator

headers/cpp/stl_tree.h

1219

_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>

headers/cpp/stl_tree.h

1235

class _Compare, class _Alloc>

headers/cpp/stl_tree.h

1237

pair<typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::iterator,

headers/cpp/stl_tree.h

1238

typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::iterator>

headers/cpp/stl_tree.h

1239

_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>

headers/cpp/stl_tree.h

1245

template <class _Key, class _Value, class _KoV, class _Compare, class _Alloc>

headers/cpp/stl_tree.h

1247

pair<typename _Rb_tree<_Key, _Value, _KoV, _Compare, _Alloc>::const_iterator,

headers/cpp/stl_tree.h

1248

typename _Rb_tree<_Key, _Value, _KoV, _Compare, _Alloc>::const_iterator>

headers/cpp/stl_tree.h

1249

_Rb_tree<_Key, _Value, _KoV, _Compare, _Alloc>

headers/cpp/stl_tree.h

1271

class _Compare, class _Alloc>

headers/cpp/stl_tree.h

1272

bool _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::__rb_verify() const

headers/cpp/stl_tree.h

1310

class _Alloc = __STL_DEFAULT_ALLOCATOR(_Value) >

headers/cpp/stl_tree.h

1311

struct rb_tree : public _Rb_tree<_Key, _Value, _KeyOfValue, _Compare, _Alloc>

headers/cpp/stl_tree.h

1313

typedef _Rb_tree<_Key, _Value, _KeyOfValue, _Compare, _Alloc> _Base;

headers/cpp/stl_tree.h

439

template <class _Tp, class _Alloc, bool _S_instanceless>

headers/cpp/stl_tree.h

442

typedef typename _Alloc_traits<_Tp, _Alloc>::allocator_type allocator_type;

headers/cpp/stl_tree.h

449

typename _Alloc_traits<_Rb_tree_node<_Tp>, _Alloc>::allocator_type

headers/cpp/stl_tree.h

460

template <class _Tp, class _Alloc>

headers/cpp/stl_tree.h

461

class _Rb_tree_alloc_base<_Tp, _Alloc, true> {

headers/cpp/stl_tree.h

463

typedef typename _Alloc_traits<_Tp, _Alloc>::allocator_type allocator_type;

headers/cpp/stl_tree.h

471

typedef typename _Alloc_traits<_Rb_tree_node<_Tp>, _Alloc>::_Alloc_type

headers/cpp/stl_tree.h

480

template <class _Tp, class _Alloc>

headers/cpp/stl_tree.h

482

: public _Rb_tree_alloc_base<_Tp, _Alloc,

headers/cpp/stl_tree.h

483

_Alloc_traits<_Tp, _Alloc>::_S_instanceless>

headers/cpp/stl_tree.h

486

_Alloc_traits<_Tp, _Alloc>::_S_instanceless>

headers/cpp/stl_tree.h

498

template <class _Tp, class _Alloc>

headers/cpp/stl_tree.h

501

typedef _Alloc allocator_type;

headers/cpp/stl_tree.h

511

typedef simple_alloc<_Rb_tree_node<_Tp>, _Alloc> _Alloc_type;

headers/cpp/stl_tree.h

522

class _Alloc = __STL_DEFAULT_ALLOCATOR(_Value) >

headers/cpp/stl_tree.h

523

class _Rb_tree : protected _Rb_tree_base<_Value, _Alloc> {

headers/cpp/stl_tree.h

524

typedef _Rb_tree_base<_Value, _Alloc> _Base;

headers/cpp/stl_tree.h

656

_Rb_tree(const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x)

headers/cpp/stl_tree.h

671

_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>&

headers/cpp/stl_tree.h

672

operator=(const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x);

headers/cpp/stl_tree.h

702

void swap(_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __t) {

headers/cpp/stl_tree.h

760

class _Compare, class _Alloc>

headers/cpp/stl_tree.h

762

operator==(const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x,

headers/cpp/stl_tree.h

763

const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __y)

headers/cpp/stl_tree.h

770

class _Compare, class _Alloc>

headers/cpp/stl_tree.h

772

operator<(const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x,

headers/cpp/stl_tree.h

773

const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __y)

headers/cpp/stl_tree.h

782

class _Compare, class _Alloc>

headers/cpp/stl_tree.h

784

swap(_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x,

headers/cpp/stl_tree.h

785

_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __y)

headers/cpp/stl_tree.h

794

class _Compare, class _Alloc>

headers/cpp/stl_tree.h

795

_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>&

headers/cpp/stl_tree.h

796

_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>

headers/cpp/stl_tree.h

797

::operator=(const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x)

headers/cpp/stl_tree.h

820

class _Compare, class _Alloc>

headers/cpp/stl_tree.h

821

typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::iterator

headers/cpp/stl_tree.h

822

_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>

headers/cpp/stl_tree.h

856

class _Compare, class _Alloc>

headers/cpp/stl_tree.h

857

typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::iterator

headers/cpp/stl_tree.h

858

_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>

headers/cpp/stl_tree.h

873

class _Compare, class _Alloc>

headers/cpp/stl_tree.h

874

pair<typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::iterator,

headers/cpp/stl_tree.h

876

_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>

headers/cpp/stl_tree.h

900

class _Compare, class _Alloc>

headers/cpp/stl_tree.h

901

typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator

headers/cpp/stl_tree.h

902

_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>

headers/cpp/stl_tree.h

933

class _Compare, class _Alloc>

headers/cpp/stl_tree.h

934

typename _Rb_tree<_Key,_Val,_KeyOfValue,_Compare,_Alloc>::iterator

headers/cpp/stl_tree.h

935

_Rb_tree<_Key,_Val,_KeyOfValue,_Compare,_Alloc>

headers/cpp/stl_tree.h

967

template <class _Key, class _Val, class _KoV, class _Cmp, class _Alloc>

headers/cpp/stl_tree.h

969

void _Rb_tree<_Key,_Val,_KoV,_Cmp,_Alloc>

headers/cpp/stl_tree.h

976

template <class _Key, class _Val, class _KoV, class _Cmp, class _Alloc>

headers/cpp/stl_tree.h

978

void _Rb_tree<_Key,_Val,_KoV,_Cmp,_Alloc>

headers/cpp/stl_tree.h

986

template <class _Key, class _Val, class _KoV, class _Cmp, class _Alloc>

headers/cpp/stl_tree.h

988

_Rb_tree<_Key,_Val,_KoV,_Cmp,_Alloc>

headers/cpp/stl_tree.h

995

template <class _Key, class _Val, class _KoV, class _Cmp, class _Alloc>

headers/cpp/stl_tree.h

997

_Rb_tree<_Key,_Val,_KoV,_Cmp,_Alloc>

headers/cpp/stl_vector.h

100

template <class _Tp, class _Alloc>

headers/cpp/stl_vector.h

102

: public _Vector_alloc_base<_Tp, _Alloc,

headers/cpp/stl_vector.h

103

_Alloc_traits<_Tp, _Alloc>::_S_instanceless>

headers/cpp/stl_vector.h

106

_Alloc_traits<_Tp, _Alloc>::_S_instanceless>

headers/cpp/stl_vector.h

122

template <class _Tp, class _Alloc>

headers/cpp/stl_vector.h

125

typedef _Alloc allocator_type;

headers/cpp/stl_vector.h

128

_Vector_base(const _Alloc&)

headers/cpp/stl_vector.h

130

_Vector_base(size_t __n, const _Alloc&)

headers/cpp/stl_vector.h

145

typedef simple_alloc<_Tp, _Alloc> _M_data_allocator;

headers/cpp/stl_vector.h

154

template <class _Tp, class _Alloc = __STL_DEFAULT_ALLOCATOR(_Tp) >

headers/cpp/stl_vector.h

155

class vector : protected _Vector_base<_Tp, _Alloc>

headers/cpp/stl_vector.h

158

typedef _Vector_base<_Tp, _Alloc> _Base;

headers/cpp/stl_vector.h

247

vector(const vector<_Tp, _Alloc>& __x)

headers/cpp/stl_vector.h

282

vector<_Tp, _Alloc>& operator=(const vector<_Tp, _Alloc>& __x);

headers/cpp/stl_vector.h

349

void swap(vector<_Tp, _Alloc>& __x) {

headers/cpp/stl_vector.h

491

template <class _Tp, class _Alloc>

headers/cpp/stl_vector.h

493

operator==(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)

headers/cpp/stl_vector.h

499

template <class _Tp, class _Alloc>

headers/cpp/stl_vector.h

501

operator<(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)

headers/cpp/stl_vector.h

509

template <class _Tp, class _Alloc>

headers/cpp/stl_vector.h

510

inline void swap(vector<_Tp, _Alloc>& __x, vector<_Tp, _Alloc>& __y)

headers/cpp/stl_vector.h

517

template <class _Tp, class _Alloc>

headers/cpp/stl_vector.h

518

vector<_Tp,_Alloc>&

headers/cpp/stl_vector.h

519

vector<_Tp,_Alloc>::operator=(const vector<_Tp, _Alloc>& __x)

headers/cpp/stl_vector.h

543

template <class _Tp, class _Alloc>

headers/cpp/stl_vector.h

544

void vector<_Tp, _Alloc>::assign(size_t __n, const value_type& __val) {

headers/cpp/stl_vector.h

546

vector<_Tp, _Alloc> __tmp(__n, __val, get_allocator());

headers/cpp/stl_vector.h

559

template <class _Tp, class _Alloc> template <class _InputIter>

headers/cpp/stl_vector.h

560

void vector<_Tp, _Alloc>::_M_assign_aux(_InputIter __first, _InputIter __last,

headers/cpp/stl_vector.h

571

template <class _Tp, class _Alloc> template <class _ForwardIter>

headers/cpp/stl_vector.h

573

vector<_Tp, _Alloc>::_M_assign_aux(_ForwardIter __first, _ForwardIter __last,

headers/cpp/stl_vector.h

600

template <class _Tp, class _Alloc>

headers/cpp/stl_vector.h

602

vector<_Tp, _Alloc>::_M_insert_aux(iterator __position, const _Tp& __x)

headers/cpp/stl_vector.h

632

template <class _Tp, class _Alloc>

headers/cpp/stl_vector.h

634

vector<_Tp, _Alloc>::_M_insert_aux(iterator __position)

headers/cpp/stl_vector.h

663

template <class _Tp, class _Alloc>

headers/cpp/stl_vector.h

664

void vector<_Tp, _Alloc>::insert(iterator __position, size_type __n,

headers/cpp/stl_vector.h

710

template <class _Tp, class _Alloc> template <class _InputIterator>

headers/cpp/stl_vector.h

712

vector<_Tp, _Alloc>::_M_range_insert(iterator __pos,

headers/cpp/stl_vector.h

723

template <class _Tp, class _Alloc> template <class _ForwardIterator>

headers/cpp/stl_vector.h

725

vector<_Tp, _Alloc>::_M_range_insert(iterator __position,

headers/cpp/stl_vector.h

776

template <class _Tp, class _Alloc>

headers/cpp/stl_vector.h

778

vector<_Tp, _Alloc>::insert(iterator __position,