---
name: "Namespace___gnu_cxx"
section: "3"
platform: "linux"
package: "libstdc++6-4.1-doc"
version: "4.1.2-25"
release: "Debian 5.0 (Lenny)"
platforms: ["linux"]
url: "https://new.carta.tech/Namespace___gnu_cxx"
---

# Namespace\_\_\_gnu\_cxx(3)

## NAME

\_\_gnu\_cxx -

## SYNOPSIS

### Classes

struct **\_\_common\_pool\_policy**\
 *Policy for shared \_\_pool objects.*  class **\_\_mt\_alloc**\
 *This is a fixed size (power of 2) allocator which - when compiled with thread support - will maintain one freelist per size per thread plus a 'global' one. Steps are taken to limit the per thread freelist sizes (by returning excess back to the 'global' list).*  class **\_\_mt\_alloc\_base**\
 *Base class for \_Tp dependent member functions.*  struct **\_\_per\_type\_pool\_policy**\
 *Policy for individual \_\_pool objects.*  class **\_\_pool\< false \>**\
 *Specialization for single thread.*  class **\_\_pool\< true \>**\
 *Specialization for thread enabled, via gthreads.h.*  class **\_\_pool\_alloc**\
 *class* **\_\_pool\_alloc***.*  class **\_\_pool\_alloc\_base**\
 *Base class for* **\_\_pool\_alloc***.*  struct **\_\_pool\_base**\
 *Base class for pool object.*  class **\_\_versa\_string**\
 *Managing sequences of characters and character-like objects.*  class **\_Auto\_Lock**\
 **\_Auto\_Lock** *locks the associated mutex on construction, and unlocks on destruction.*  struct **\_Char\_types**\
 *Mapping from* **character** *type to associated types.*  class **\_Lock**\
 **\_Lock** *is a simple manual locking class which allows you to manually* **lock** *and unlock a mutex associated with the* **lock***.*  class **\_Mutex**\
 **\_Mutex** *is an OO-Wrapper for \_\_gthread\_mutex\_t.*  class **array\_allocator**\
 *An allocator that uses previously allocated memory. This memory can be externally, globally, or otherwise allocated.*  class **array\_allocator\_base**\
 *Base class.*  class **binary\_compose**\
 *An* **SGI extension** *.*  struct **char\_traits**\
 *Base class used to implement* **std::char\_traits***.*  struct **character**\
 *A POD class that serves as a* **character** *abstraction class.*  struct **constant\_binary\_fun**\
 *An* **SGI extension** *.*  struct **constant\_unary\_fun**\
 *An* **SGI extension** *.*  struct **constant\_void\_fun**\
 *An* **SGI extension** *.*  class **debug\_allocator**\
 *A meta-allocator with debugging bits, as per \[20.4\].*  struct **encoding\_char\_traits**\
 **encoding\_char\_traits***.*  class **encoding\_state**\
 *Extension to use icov for dealing with* **character** *encodings.*  class **free\_list**\
 *The free list class for managing chunks of memory to be given to and returned by the bitmap\_allocator.*  class **hash\_map**\
 class **hash\_multimap**\
 class **hash\_multiset**\
 class **hash\_set**\
 class **lock**\
 *Scoped* **lock** *idiom.*  class **malloc\_allocator**\
 *An allocator that uses malloc.*  class **new\_allocator**\
 *An allocator that uses global new, as per \[20.4\].*  struct **project1st**\
 *An* **SGI extension** *.*  struct **project2nd**\
 *An* **SGI extension** *.*  class **rope**\
 struct **select1st**\
 *An* **SGI extension** *.*  struct **select2nd**\
 *An* **SGI extension** *.*  class **slist**\
 class **stdio\_filebuf**\
 *Provides a layer of compatibility for C/POSIX.*  class **stdio\_sync\_filebuf**\
 *class* **stdio\_sync\_filebuf***.*  class **subtractive\_rng**\
 struct **temporary\_buffer**\
 class **unary\_compose**\
 *An* **SGI extension** *.*

### Namespaces

namespace **balloc**\

### Typedefs

typedef void(\* **\_\_destroy\_handler** )(void \*)\
 typedef **\_\_versa\_string**\< char, **std::char\_traits**\< char \>, **std::allocator**\< char \>, \_\_rc\_string\_base \> **\_\_rc\_string**\
 typedef **\_\_vstring** **\_\_sso\_string**\
 typedef **\_\_versa\_string**\< char \> **\_\_vstring**\
 typedef **\_\_versa\_string**\< wchar\_t, **std::char\_traits**\< wchar\_t \>, **std::allocator**\< wchar\_t \>, \_\_rc\_string\_base \> **\_\_wrc\_string**\
 typedef **\_\_wvstring** **\_\_wsso\_string**\
 typedef **\_\_versa\_string**\< wchar\_t \> **\_\_wvstring**\
 typedef **rope**\< char \> **crope**\
 typedef \_\_glibcxx\_mutex\_type **mutex\_type**\
 typedef **rope**\< wchar\_t \> **wrope**\

### Enumerations

enum { **\_S\_num\_primes** }\

### Functions

\_Atomic\_word **\_\_attribute\_\_** ((\_\_unused\_\_)) \_\_exchange\_and\_add(volatile \_Atomic\_word \*\_\_mem\
 template\<class \_Tp\> void **\_\_aux\_require\_boolean\_expr** (const \_Tp &\_\_t)\
 template\<typename \_RAIterator, typename \_Size, typename \_OutputIterator\> **pair**\< \_RAIterator, \_OutputIterator \> **\_\_copy\_n** (\_RAIterator \_\_first, \_Size \_\_count, \_OutputIterator \_\_result, **random\_access\_iterator\_tag**)\
 template\<typename \_InputIterator, typename \_Size, typename \_OutputIterator\> **pair**\< \_InputIterator, \_OutputIterator \> **\_\_copy\_n** (\_InputIterator \_\_first, \_Size \_\_count, \_OutputIterator \_\_result, **input\_iterator\_tag**)\
 void **\_\_error\_type\_must\_be\_a\_signed\_integer\_type** ()\
 void **\_\_error\_type\_must\_be\_an\_integer\_type** ()\
 void **\_\_error\_type\_must\_be\_an\_unsigned\_integer\_type** ()\
 template\<class \_Concept\> void **\_\_function\_requires** ()\
 int **\_\_lexicographical\_compare\_3way** (const char \*\_\_first1, const char \*\_\_last1, const char \*\_\_first2, const char \*\_\_last2)\
 int **\_\_lexicographical\_compare\_3way** (const unsigned char \*\_\_first1, const unsigned char \*\_\_last1, const unsigned char \*\_\_first2, const unsigned char \*\_\_last2)\
 template\<typename \_InputIterator1, typename \_InputIterator2\> int **\_\_lexicographical\_compare\_3way** (\_InputIterator1 \_\_first1, \_InputIterator1 \_\_last1, \_InputIterator2 \_\_first2, \_InputIterator2 \_\_last2)\
 crope::reference **\_\_mutable\_reference\_at** (**crope** &\_\_c, size\_t \_\_i)\
 template\<typename \_Tp, typename \_Integer\> \_Tp **\_\_power** (\_Tp \_\_x, \_Integer \_\_n)\
 template\<typename \_Tp, typename \_Integer, typename \_MonoidOperation\> \_Tp **\_\_power** (\_Tp \_\_x, \_Integer \_\_n, \_MonoidOperation \_\_monoid\_op)\
 template\<typename \_InputIterator, typename \_RandomAccessIterator, typename \_RandomNumberGenerator, typename \_Distance\> \_RandomAccessIterator **\_\_random\_sample** (\_InputIterator \_\_first, \_InputIterator \_\_last, \_RandomAccessIterator \_\_out, \_RandomNumberGenerator &\_\_rand, const \_Distance \_\_n)\
 template\<typename \_InputIterator, typename \_RandomAccessIterator, typename \_Distance\> \_RandomAccessIterator **\_\_random\_sample** (\_InputIterator \_\_first, \_InputIterator \_\_last, \_RandomAccessIterator \_\_out, const \_Distance \_\_n)\
 \_Slist\_node\_base \* **\_\_slist\_make\_link** (\_Slist\_node\_base \*\_\_prev\_node, \_Slist\_node\_base \*\_\_new\_node)\
 const \_Slist\_node\_base \* **\_\_slist\_previous** (const \_Slist\_node\_base \*\_\_head, const \_Slist\_node\_base \*\_\_node)\
 \_Slist\_node\_base \* **\_\_slist\_previous** (\_Slist\_node\_base \*\_\_head, const \_Slist\_node\_base \*\_\_node)\
 \_Slist\_node\_base \* **\_\_slist\_reverse** (\_Slist\_node\_base \*\_\_node)\
 size\_t **\_\_slist\_size** (\_Slist\_node\_base \*\_\_node)\
 void **\_\_slist\_splice\_after** (\_Slist\_node\_base \*\_\_pos, \_Slist\_node\_base \*\_\_head)\
 void **\_\_slist\_splice\_after** (\_Slist\_node\_base \*\_\_pos, \_Slist\_node\_base \*\_\_before\_first, \_Slist\_node\_base \*\_\_before\_last)\
 size\_t **\_\_stl\_hash\_string** (const char \*\_\_s)\
 unsigned long **\_\_stl\_next\_prime** (unsigned long \_\_n)\
 template\<typename \_InputIter, typename \_Size, typename \_ForwardIter\> **pair**\< \_InputIter, \_ForwardIter \> **\_\_uninitialized\_copy\_n** (\_InputIter \_\_first, \_Size \_\_count, \_ForwardIter \_\_result)\
 template\<typename \_RandomAccessIter, typename \_Size, typename \_ForwardIter\> **pair**\< \_RandomAccessIter, \_ForwardIter \> **\_\_uninitialized\_copy\_n** (\_RandomAccessIter \_\_first, \_Size \_\_count, \_ForwardIter \_\_result, **std::random\_access\_iterator\_tag**)\
 template\<typename \_InputIter, typename \_Size, typename \_ForwardIter\> **pair**\< \_InputIter, \_ForwardIter \> **\_\_uninitialized\_copy\_n** (\_InputIter \_\_first, \_Size \_\_count, \_ForwardIter \_\_result, **std::input\_iterator\_tag**)\
 template\<typename \_InputIter, typename \_Size, typename \_ForwardIter, typename \_Tp\> **pair**\< \_InputIter, \_ForwardIter \> **\_\_uninitialized\_copy\_n\_a** (\_InputIter \_\_first, \_Size \_\_count, \_ForwardIter \_\_result, **std::allocator**\< \_Tp \>)\
 template\<typename \_InputIter, typename \_Size, typename \_ForwardIter, typename \_Allocator\> **pair**\< \_InputIter, \_ForwardIter \> **\_\_uninitialized\_copy\_n\_a** (\_InputIter \_\_first, \_Size \_\_count, \_ForwardIter \_\_result, \_Allocator \_\_alloc)\
 void **\_\_verbose\_terminate\_handler** ()\
 size\_t **\_Bit\_scan\_forward** (size\_t \_\_num)\
 **\_GLIBCXX\_DEFINE\_BINARY\_OPERATOR\_CONSTRAINT** (%, \_ModOpConcept)\
 **\_GLIBCXX\_DEFINE\_BINARY\_OPERATOR\_CONSTRAINT** (-, \_SubtractOpConcept)\
 **\_GLIBCXX\_DEFINE\_BINARY\_OPERATOR\_CONSTRAINT** (/, \_DivideOpConcept)\
 **\_GLIBCXX\_DEFINE\_BINARY\_OPERATOR\_CONSTRAINT** (+, \_PlusOpConcept)\
 **\_GLIBCXX\_DEFINE\_BINARY\_PREDICATE\_OP\_CONSTRAINT** (\>=, \_GreaterEqualOpConcept)\
 **\_GLIBCXX\_DEFINE\_BINARY\_PREDICATE\_OP\_CONSTRAINT** (\>, \_GreaterThanOpConcept)\
 **\_GLIBCXX\_DEFINE\_BINARY\_PREDICATE\_OP\_CONSTRAINT** (\<=, \_LessEqualOpConcept)\
 **\_GLIBCXX\_DEFINE\_BINARY\_PREDICATE\_OP\_CONSTRAINT** (\<, \_LessThanOpConcept)\
 **\_GLIBCXX\_DEFINE\_BINARY\_PREDICATE\_OP\_CONSTRAINT** (!=, \_NotEqualOpConcept)\
 **\_GLIBCXX\_DEFINE\_BINARY\_PREDICATE\_OP\_CONSTRAINT** (==, \_EqualOpConcept)\
 template\<class \_CharT, class \_Traits\> void **\_Rope\_fill** (**basic\_ostream**\< \_CharT, \_Traits \> &\_\_o, size\_t \_\_n)\
 bool **\_Rope\_is\_simple** (wchar\_t \*)\
 bool **\_Rope\_is\_simple** (char \*)\
 template\<class \_CharT\> bool **\_Rope\_is\_simple** (\_CharT \*)\
 template\<class \_Rope\_iterator\> void **\_Rope\_rotate** (\_Rope\_iterator \_\_first, \_Rope\_iterator \_\_middle, \_Rope\_iterator \_\_last)\
 void **\_S\_cond\_store\_eos** (wchar\_t &\_\_c)\
 void **\_S\_cond\_store\_eos** (char &\_\_c)\
 template\<class \_CharT\> void **\_S\_cond\_store\_eos** (\_CharT &)\
 template\<class \_CharT\> \_CharT **\_S\_eos** (\_CharT \*)\
 bool **\_S\_is\_basic\_char\_type** (wchar\_t \*)\
 bool **\_S\_is\_basic\_char\_type** (char \*)\
 template\<class \_CharT\> bool **\_S\_is\_basic\_char\_type** (\_CharT \*)\
 bool **\_S\_is\_one\_byte\_char\_type** (char \*)\
 template\<class \_CharT\> bool **\_S\_is\_one\_byte\_char\_type** (\_CharT \*)\
 template\<class \_Operation1, class \_Operation2\> **unary\_compose**\< \_Operation1, \_Operation2 \> **compose1** (const \_Operation1 &\_\_fn1, const \_Operation2 &\_\_fn2)\
 template\<class \_Operation1, class \_Operation2, class \_Operation3\> **binary\_compose**\< \_Operation1, \_Operation2, \_Operation3 \> **compose2** (const \_Operation1 &\_\_fn1, const \_Operation2 &\_\_fn2, const \_Operation3 &\_\_fn3)\
 template\<class \_Result\> **constant\_void\_fun**\< \_Result \> **constant0** (const \_Result &\_\_val)\
 template\<class \_Result\> **constant\_unary\_fun**\< \_Result, \_Result \> **constant1** (const \_Result &\_\_val)\
 template\<class \_Result\> **constant\_binary\_fun**\< \_Result, \_Result, \_Result \> **constant2** (const \_Result &\_\_val)\
 template\<typename \_InputIterator, typename \_Size, typename \_OutputIterator\> **pair**\< \_InputIterator, \_OutputIterator \> **copy\_n** (\_InputIterator \_\_first, \_Size \_\_count, \_OutputIterator \_\_result)\
 template\<typename \_InputIterator, typename \_Tp, typename \_Size\> void **count** (\_InputIterator \_\_first, \_InputIterator \_\_last, const \_Tp &\_\_value, \_Size &\_\_n)\
 template\<typename \_InputIterator, typename \_Predicate, typename \_Size\> void **count\_if** (\_InputIterator \_\_first, \_InputIterator \_\_last, \_Predicate \_\_pred, \_Size &\_\_n)\
 template\<class \_Tp\> \_Tp **identity\_element** (**std::multiplies**\< \_Tp \>)\
 template\<class \_Tp\> \_Tp **identity\_element** (**std::plus**\< \_Tp \>)\
 template\<typename \_ForwardIter, typename \_Tp\> void **iota** (\_ForwardIter \_\_first, \_ForwardIter \_\_last, \_Tp \_\_value)\
 template\<typename \_RandomAccessIterator, typename \_StrictWeakOrdering\> bool **is\_heap** (\_RandomAccessIterator \_\_first, \_RandomAccessIterator \_\_last, \_StrictWeakOrdering \_\_comp)\
 template\<typename \_RandomAccessIterator\> bool **is\_heap** (\_RandomAccessIterator \_\_first, \_RandomAccessIterator \_\_last)\
 template\<typename \_ForwardIterator, typename \_StrictWeakOrdering\> bool **is\_sorted** (\_ForwardIterator \_\_first, \_ForwardIterator \_\_last, \_StrictWeakOrdering \_\_comp)\
 template\<typename \_ForwardIterator\> bool **is\_sorted** (\_ForwardIterator \_\_first, \_ForwardIterator \_\_last)\
 template\<typename \_InputIterator1, typename \_InputIterator2\> int **lexicographical\_compare\_3way** (\_InputIterator1 \_\_first1, \_InputIterator1 \_\_last1, \_InputIterator2 \_\_first2, \_InputIterator2 \_\_last2)\
 template\<class \_Ret, class \_Tp, class \_Arg\> **mem\_fun1\_t**\< \_Ret, \_Tp, \_Arg \> **mem\_fun1** (\_Ret(\_Tp::\*\_\_f)(\_Arg))\
 template\<class \_Ret, class \_Tp, class \_Arg\> **mem\_fun1\_ref\_t**\< \_Ret, \_Tp, \_Arg \> **mem\_fun1\_ref** (\_Ret(\_Tp::\*\_\_f)(\_Arg))\
 template\<class \_Tp, class \_Alloc\> bool **operator!=** (const **slist**\< \_Tp, \_Alloc \> &\_SL1, const **slist**\< \_Tp, \_Alloc \> &\_SL2)\
 template\<class \_CharT, class \_Alloc\> bool **operator!=** (const \_Rope\_char\_ptr\_proxy\< \_CharT, \_Alloc \> &\_\_x, const \_Rope\_char\_ptr\_proxy\< \_CharT, \_Alloc \> &\_\_y)\
 template\<class \_CharT, class \_Alloc\> bool **operator!=** (const **rope**\< \_CharT, \_Alloc \> &\_\_x, const **rope**\< \_CharT, \_Alloc \> &\_\_y)\
 template\<class \_CharT, class \_Alloc\> bool **operator!=** (const \_Rope\_iterator\< \_CharT, \_Alloc \> &\_\_x, const \_Rope\_iterator\< \_CharT, \_Alloc \> &\_\_y)\
 template\<class \_CharT, class \_Alloc\> bool **operator!=** (const \_Rope\_const\_iterator\< \_CharT, \_Alloc \> &\_\_x, const \_Rope\_const\_iterator\< \_CharT, \_Alloc \> &\_\_y)\
 template\<class \_Val, class \_HashFcn, class \_EqualKey, class \_Alloc\> bool **operator!=** (const **hash\_multiset**\< \_Val, \_HashFcn, \_EqualKey, \_Alloc \> &\_\_hs1, const **hash\_multiset**\< \_Val, \_HashFcn, \_EqualKey, \_Alloc \> &\_\_hs2)\
 template\<class \_Value, class \_HashFcn, class \_EqualKey, class \_Alloc\> bool **operator!=** (const **hash\_set**\< \_Value, \_HashFcn, \_EqualKey, \_Alloc \> &\_\_hs1, const **hash\_set**\< \_Value, \_HashFcn, \_EqualKey, \_Alloc \> &\_\_hs2)\
 template\<class \_Key, class \_Tp, class \_HF, class \_EqKey, class \_Alloc\> bool **operator!=** (const **hash\_multimap**\< \_Key, \_Tp, \_HF, \_EqKey, \_Alloc \> &\_\_hm1, const **hash\_multimap**\< \_Key, \_Tp, \_HF, \_EqKey, \_Alloc \> &\_\_hm2)\
 template\<class \_Key, class \_Tp, class \_HashFcn, class \_EqlKey, class \_Alloc\> bool **operator!=** (const **hash\_map**\< \_Key, \_Tp, \_HashFcn, \_EqlKey, \_Alloc \> &\_\_hm1, const **hash\_map**\< \_Key, \_Tp, \_HashFcn, \_EqlKey, \_Alloc \> &\_\_hm2)\
 template\<typename \_CharT, typename \_Traits, typename \_Alloc, template\< typename, typename, typename \> class \_Base\> bool **operator!=** (const **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_lhs, const \_CharT \*\_\_rhs)\
 template\<typename \_CharT, typename \_Traits, typename \_Alloc, template\< typename, typename, typename \> class \_Base\> bool **operator!=** (const \_CharT \*\_\_lhs, const **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_rhs)\
 template\<typename \_CharT, typename \_Traits, typename \_Alloc, template\< typename, typename, typename \> class \_Base\> bool **operator!=** (const **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_lhs, const **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_rhs)\
 template\<typename \_Tp\> bool **operator!=** (const **\_\_pool\_alloc**\< \_Tp \> &, const **\_\_pool\_alloc**\< \_Tp \> &)\
 template\<typename \_Tp\> bool **operator!=** (const **new\_allocator**\< \_Tp \> &, const **new\_allocator**\< \_Tp \> &)\
 template\<typename \_Tp, typename \_Poolp\> bool **operator!=** (const **\_\_mt\_alloc**\< \_Tp, \_Poolp \> &, const **\_\_mt\_alloc**\< \_Tp, \_Poolp \> &)\
 template\<typename \_Tp\> bool **operator!=** (const **malloc\_allocator**\< \_Tp \> &, const **malloc\_allocator**\< \_Tp \> &)\
 template\<class \_Val, class \_Key, class \_HF, class \_Ex, class \_Eq, class \_All\> bool **operator!=** (const hashtable\< \_Val, \_Key, \_HF, \_Ex, \_Eq, \_All \> &\_\_ht1, const hashtable\< \_Val, \_Key, \_HF, \_Ex, \_Eq, \_All \> &\_\_ht2)\
 template\<typename \_Tp1, typename \_Tp2\> bool **operator!=** (const bitmap\_allocator\< \_Tp1 \> &, const bitmap\_allocator\< \_Tp2 \> &)  throw ()\
 template\<typename \_Tp, typename \_Array\> bool **operator!=** (const **array\_allocator**\< \_Tp, \_Array \> &, const **array\_allocator**\< \_Tp, \_Array \> &)\
 template\<typename \_Iterator, typename \_Container\> bool **operator!=** (const \_\_normal\_iterator\< \_Iterator, \_Container \> &\_\_lhs, const \_\_normal\_iterator\< \_Iterator, \_Container \> &\_\_rhs)\
 template\<typename \_IteratorL, typename \_IteratorR, typename \_Container\> bool **operator!=** (const \_\_normal\_iterator\< \_IteratorL, \_Container \> &\_\_lhs, const \_\_normal\_iterator\< \_IteratorR, \_Container \> &\_\_rhs)\
 template\<class \_CharT, class \_Alloc\> **rope**\< \_CharT, \_Alloc \> **operator+** (const **rope**\< \_CharT, \_Alloc \> &\_\_left, \_CharT \_\_right)\
 template\<class \_CharT, class \_Alloc\> **rope**\< \_CharT, \_Alloc \> **operator+** (const **rope**\< \_CharT, \_Alloc \> &\_\_left, const \_CharT \*\_\_right)\
 template\<class \_CharT, class \_Alloc\> **rope**\< \_CharT, \_Alloc \> **operator+** (const **rope**\< \_CharT, \_Alloc \> &\_\_left, const **rope**\< \_CharT, \_Alloc \> &\_\_right)\
 template\<class \_CharT, class \_Alloc\> \_Rope\_iterator\< \_CharT, \_Alloc \> **operator+** (ptrdiff\_t \_\_n, const \_Rope\_iterator\< \_CharT, \_Alloc \> &\_\_x)\
 template\<class \_CharT, class \_Alloc\> \_Rope\_iterator\< \_CharT, \_Alloc \> **operator+** (const \_Rope\_iterator\< \_CharT, \_Alloc \> &\_\_x, ptrdiff\_t \_\_n)\
 template\<class \_CharT, class \_Alloc\> \_Rope\_const\_iterator\< \_CharT, \_Alloc \> **operator+** (ptrdiff\_t \_\_n, const \_Rope\_const\_iterator\< \_CharT, \_Alloc \> &\_\_x)\
 template\<class \_CharT, class \_Alloc\> \_Rope\_const\_iterator\< \_CharT, \_Alloc \> **operator+** (const \_Rope\_const\_iterator\< \_CharT, \_Alloc \> &\_\_x, ptrdiff\_t \_\_n)\
 template\<typename \_CharT, typename \_Traits, typename \_Alloc, template\< typename, typename, typename \> class \_Base\> **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> **operator+** (const **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_lhs, \_CharT \_\_rhs)\
 template\<typename \_CharT, typename \_Traits, typename \_Alloc, template\< typename, typename, typename \> class \_Base\> **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> **operator+** (const **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_lhs, const \_CharT \*\_\_rhs)\
 template\<typename \_CharT, typename \_Traits, typename \_Alloc, template\< typename, typename, typename \> class \_Base\> **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> **operator+** (\_CharT \_\_lhs, const **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_rhs)\
 template\<typename \_CharT, typename \_Traits, typename \_Alloc, template\< typename, typename, typename \> class \_Base\> **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> **operator+** (const \_CharT \*\_\_lhs, const **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_rhs)\
 template\<typename \_CharT, typename \_Traits, typename \_Alloc, template\< typename, typename, typename \> class \_Base\> **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> **operator+** (const **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_lhs, const **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_rhs)\
 template\<typename \_Iterator, typename \_Container\> \_\_normal\_iterator\< \_Iterator, \_Container \> **operator+** (typename \_\_normal\_iterator\< \_Iterator, \_Container \>::difference\_type \_\_n, const \_\_normal\_iterator\< \_Iterator, \_Container \> &\_\_i)\
 template\<class \_CharT, class \_Alloc\> **rope**\< \_CharT, \_Alloc \> & **operator+=** (**rope**\< \_CharT, \_Alloc \> &\_\_left, \_CharT \_\_right)\
 template\<class \_CharT, class \_Alloc\> **rope**\< \_CharT, \_Alloc \> & **operator+=** (**rope**\< \_CharT, \_Alloc \> &\_\_left, const \_CharT \*\_\_right)\
 template\<class \_CharT, class \_Alloc\> **rope**\< \_CharT, \_Alloc \> & **operator+=** (**rope**\< \_CharT, \_Alloc \> &\_\_left, const **rope**\< \_CharT, \_Alloc \> &\_\_right)\
 template\<class \_CharT, class \_Alloc\> ptrdiff\_t **operator-** (const \_Rope\_iterator\< \_CharT, \_Alloc \> &\_\_x, const \_Rope\_iterator\< \_CharT, \_Alloc \> &\_\_y)\
 template\<class \_CharT, class \_Alloc\> \_Rope\_iterator\< \_CharT, \_Alloc \> **operator-** (const \_Rope\_iterator\< \_CharT, \_Alloc \> &\_\_x, ptrdiff\_t \_\_n)\
 template\<class \_CharT, class \_Alloc\> ptrdiff\_t **operator-** (const \_Rope\_const\_iterator\< \_CharT, \_Alloc \> &\_\_x, const \_Rope\_const\_iterator\< \_CharT, \_Alloc \> &\_\_y)\
 template\<class \_CharT, class \_Alloc\> \_Rope\_const\_iterator\< \_CharT, \_Alloc \> **operator-** (const \_Rope\_const\_iterator\< \_CharT, \_Alloc \> &\_\_x, ptrdiff\_t \_\_n)\
 template\<typename \_IteratorL, typename \_IteratorR, typename \_Container\> \_\_normal\_iterator\< \_IteratorL, \_Container \>::difference\_type **operator-** (const \_\_normal\_iterator\< \_IteratorL, \_Container \> &\_\_lhs, const \_\_normal\_iterator\< \_IteratorR, \_Container \> &\_\_rhs)\
 template\<class \_Tp, class \_Alloc\> bool **operator\<** (const **slist**\< \_Tp, \_Alloc \> &\_SL1, const **slist**\< \_Tp, \_Alloc \> &\_SL2)\
 template\<class \_CharT, class \_Alloc\> bool **operator\<** (const **rope**\< \_CharT, \_Alloc \> &\_\_left, const **rope**\< \_CharT, \_Alloc \> &\_\_right)\
 template\<class \_CharT, class \_Alloc\> bool **operator\<** (const \_Rope\_iterator\< \_CharT, \_Alloc \> &\_\_x, const \_Rope\_iterator\< \_CharT, \_Alloc \> &\_\_y)\
 template\<class \_CharT, class \_Alloc\> bool **operator\<** (const \_Rope\_const\_iterator\< \_CharT, \_Alloc \> &\_\_x, const \_Rope\_const\_iterator\< \_CharT, \_Alloc \> &\_\_y)\
 template\<typename \_CharT, typename \_Traits, typename \_Alloc, template\< typename, typename, typename \> class \_Base\> bool **operator\<** (const \_CharT \*\_\_lhs, const **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_rhs)\
 template\<typename \_CharT, typename \_Traits, typename \_Alloc, template\< typename, typename, typename \> class \_Base\> bool **operator\<** (const **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_lhs, const \_CharT \*\_\_rhs)\
 template\<typename \_CharT, typename \_Traits, typename \_Alloc, template\< typename, typename, typename \> class \_Base\> bool **operator\<** (const **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_lhs, const **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_rhs)\
 template\<typename V, typename I, typename S\> bool **operator\<** (const **character**\< V, I, S \> &lhs, const **character**\< V, I, S \> &rhs)\
 template\<typename \_Iterator, typename \_Container\> bool **operator\<** (const \_\_normal\_iterator\< \_Iterator, \_Container \> &\_\_lhs, const \_\_normal\_iterator\< \_Iterator, \_Container \> &\_\_rhs)\
 template\<typename \_IteratorL, typename \_IteratorR, typename \_Container\> bool **operator\<** (const \_\_normal\_iterator\< \_IteratorL, \_Container \> &\_\_lhs, const \_\_normal\_iterator\< \_IteratorR, \_Container \> &\_\_rhs)\
 template\<class \_CharT, class \_Traits, class \_Alloc\> **basic\_ostream**\< \_CharT, \_Traits \> & **operator\<\<** (**basic\_ostream**\< \_CharT, \_Traits \> &\_\_o, const **rope**\< \_CharT, \_Alloc \> &\_\_r)\
 template\<class \_Tp, class \_Alloc\> bool **operator\<=** (const **slist**\< \_Tp, \_Alloc \> &\_SL1, const **slist**\< \_Tp, \_Alloc \> &\_SL2)\
 template\<class \_CharT, class \_Alloc\> bool **operator\<=** (const **rope**\< \_CharT, \_Alloc \> &\_\_x, const **rope**\< \_CharT, \_Alloc \> &\_\_y)\
 template\<class \_CharT, class \_Alloc\> bool **operator\<=** (const \_Rope\_iterator\< \_CharT, \_Alloc \> &\_\_x, const \_Rope\_iterator\< \_CharT, \_Alloc \> &\_\_y)\
 template\<class \_CharT, class \_Alloc\> bool **operator\<=** (const \_Rope\_const\_iterator\< \_CharT, \_Alloc \> &\_\_x, const \_Rope\_const\_iterator\< \_CharT, \_Alloc \> &\_\_y)\
 template\<typename \_CharT, typename \_Traits, typename \_Alloc, template\< typename, typename, typename \> class \_Base\> bool **operator\<=** (const \_CharT \*\_\_lhs, const **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_rhs)\
 template\<typename \_CharT, typename \_Traits, typename \_Alloc, template\< typename, typename, typename \> class \_Base\> bool **operator\<=** (const **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_lhs, const \_CharT \*\_\_rhs)\
 template\<typename \_CharT, typename \_Traits, typename \_Alloc, template\< typename, typename, typename \> class \_Base\> bool **operator\<=** (const **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_lhs, const **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_rhs)\
 template\<typename \_Iterator, typename \_Container\> bool **operator\<=** (const \_\_normal\_iterator\< \_Iterator, \_Container \> &\_\_lhs, const \_\_normal\_iterator\< \_Iterator, \_Container \> &\_\_rhs)\
 template\<typename \_IteratorL, typename \_IteratorR, typename \_Container\> bool **operator\<=** (const \_\_normal\_iterator\< \_IteratorL, \_Container \> &\_\_lhs, const \_\_normal\_iterator\< \_IteratorR, \_Container \> &\_\_rhs)\
 template\<class \_Tp, class \_Alloc\> bool **operator==** (const **slist**\< \_Tp, \_Alloc \> &\_SL1, const **slist**\< \_Tp, \_Alloc \> &\_SL2)\
 template\<class \_CharT, class \_Alloc\> bool **operator==** (const **rope**\< \_CharT, \_Alloc \> &\_\_left, const **rope**\< \_CharT, \_Alloc \> &\_\_right)\
 template\<class \_CharT, class \_Alloc\> bool **operator==** (const \_Rope\_iterator\< \_CharT, \_Alloc \> &\_\_x, const \_Rope\_iterator\< \_CharT, \_Alloc \> &\_\_y)\
 template\<class \_CharT, class \_Alloc\> bool **operator==** (const \_Rope\_const\_iterator\< \_CharT, \_Alloc \> &\_\_x, const \_Rope\_const\_iterator\< \_CharT, \_Alloc \> &\_\_y)\
 template\<class \_CharT, class \_Alloc\> bool **operator==** (const \_Rope\_char\_ptr\_proxy\< \_CharT, \_Alloc \> &\_\_x, const \_Rope\_char\_ptr\_proxy\< \_CharT, \_Alloc \> &\_\_y)\
 template\<class \_Val, class \_HashFcn, class \_EqualKey, class \_Alloc\> bool **operator==** (const **hash\_multiset**\< \_Val, \_HashFcn, \_EqualKey, \_Alloc \> &\_\_hs1, const **hash\_multiset**\< \_Val, \_HashFcn, \_EqualKey, \_Alloc \> &\_\_hs2)\
 template\<class \_Value, class \_HashFcn, class \_EqualKey, class \_Alloc\> bool **operator==** (const **hash\_set**\< \_Value, \_HashFcn, \_EqualKey, \_Alloc \> &\_\_hs1, const **hash\_set**\< \_Value, \_HashFcn, \_EqualKey, \_Alloc \> &\_\_hs2)\
 template\<class \_Key, class \_Tp, class \_HF, class \_EqKey, class \_Alloc\> bool **operator==** (const **hash\_multimap**\< \_Key, \_Tp, \_HF, \_EqKey, \_Alloc \> &\_\_hm1, const **hash\_multimap**\< \_Key, \_Tp, \_HF, \_EqKey, \_Alloc \> &\_\_hm2)\
 template\<class \_Key, class \_Tp, class \_HashFcn, class \_EqlKey, class \_Alloc\> bool **operator==** (const **hash\_map**\< \_Key, \_Tp, \_HashFcn, \_EqlKey, \_Alloc \> &\_\_hm1, const **hash\_map**\< \_Key, \_Tp, \_HashFcn, \_EqlKey, \_Alloc \> &\_\_hm2)\
 template\<class \_Key, class \_Tp, class \_HashFn, class \_EqKey, class \_Alloc\> bool **operator==** (const **hash\_map**\< \_Key, \_Tp, \_HashFn, \_EqKey, \_Alloc \> &, const **hash\_map**\< \_Key, \_Tp, \_HashFn, \_EqKey, \_Alloc \> &)\
 template\<typename \_CharT, typename \_Traits, typename \_Alloc, template\< typename, typename, typename \> class \_Base\> bool **operator==** (const **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_lhs, const \_CharT \*\_\_rhs)\
 template\<typename \_CharT, typename \_Traits, typename \_Alloc, template\< typename, typename, typename \> class \_Base\> bool **operator==** (const \_CharT \*\_\_lhs, const **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_rhs)\
 template\<typename \_CharT, typename \_Traits, typename \_Alloc, template\< typename, typename, typename \> class \_Base\> bool **operator==** (const **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_lhs, const **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_rhs)\
 template\<typename \_Tp\> bool **operator==** (const **\_\_pool\_alloc**\< \_Tp \> &, const **\_\_pool\_alloc**\< \_Tp \> &)\
 template\<typename V, typename I, typename S\> bool **operator==** (const **character**\< V, I, S \> &lhs, const **character**\< V, I, S \> &rhs)\
 template\<typename \_Tp\> bool **operator==** (const **new\_allocator**\< \_Tp \> &, const **new\_allocator**\< \_Tp \> &)\
 template\<typename \_Tp, typename \_Poolp\> bool **operator==** (const **\_\_mt\_alloc**\< \_Tp, \_Poolp \> &, const **\_\_mt\_alloc**\< \_Tp, \_Poolp \> &)\
 template\<typename \_Tp\> bool **operator==** (const **malloc\_allocator**\< \_Tp \> &, const **malloc\_allocator**\< \_Tp \> &)\
 template\<class \_Val, class \_Key, class \_HF, class \_Ex, class \_Eq, class \_All\> bool **operator==** (const hashtable\< \_Val, \_Key, \_HF, \_Ex, \_Eq, \_All \> &\_\_ht1, const hashtable\< \_Val, \_Key, \_HF, \_Ex, \_Eq, \_All \> &\_\_ht2)\
 template\<typename \_Tp1, typename \_Tp2\> bool **operator==** (const bitmap\_allocator\< \_Tp1 \> &, const bitmap\_allocator\< \_Tp2 \> &)  throw ()\
 template\<typename \_Tp, typename \_Array\> bool **operator==** (const **array\_allocator**\< \_Tp, \_Array \> &, const **array\_allocator**\< \_Tp, \_Array \> &)\
 template\<typename \_Iterator, typename \_Container\> bool **operator==** (const \_\_normal\_iterator\< \_Iterator, \_Container \> &\_\_lhs, const \_\_normal\_iterator\< \_Iterator, \_Container \> &\_\_rhs)\
 template\<typename \_IteratorL, typename \_IteratorR, typename \_Container\> bool **operator==** (const \_\_normal\_iterator\< \_IteratorL, \_Container \> &\_\_lhs, const \_\_normal\_iterator\< \_IteratorR, \_Container \> &\_\_rhs)\
 template\<class \_Tp, class \_Alloc\> bool **operator\>** (const **slist**\< \_Tp, \_Alloc \> &\_SL1, const **slist**\< \_Tp, \_Alloc \> &\_SL2)\
 template\<class \_CharT, class \_Alloc\> bool **operator\>** (const **rope**\< \_CharT, \_Alloc \> &\_\_x, const **rope**\< \_CharT, \_Alloc \> &\_\_y)\
 template\<class \_CharT, class \_Alloc\> bool **operator\>** (const \_Rope\_iterator\< \_CharT, \_Alloc \> &\_\_x, const \_Rope\_iterator\< \_CharT, \_Alloc \> &\_\_y)\
 template\<class \_CharT, class \_Alloc\> bool **operator\>** (const \_Rope\_const\_iterator\< \_CharT, \_Alloc \> &\_\_x, const \_Rope\_const\_iterator\< \_CharT, \_Alloc \> &\_\_y)\
 template\<typename \_CharT, typename \_Traits, typename \_Alloc, template\< typename, typename, typename \> class \_Base\> bool **operator\>** (const \_CharT \*\_\_lhs, const **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_rhs)\
 template\<typename \_CharT, typename \_Traits, typename \_Alloc, template\< typename, typename, typename \> class \_Base\> bool **operator\>** (const **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_lhs, const \_CharT \*\_\_rhs)\
 template\<typename \_CharT, typename \_Traits, typename \_Alloc, template\< typename, typename, typename \> class \_Base\> bool **operator\>** (const **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_lhs, const **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_rhs)\
 template\<typename \_Iterator, typename \_Container\> bool **operator\>** (const \_\_normal\_iterator\< \_Iterator, \_Container \> &\_\_lhs, const \_\_normal\_iterator\< \_Iterator, \_Container \> &\_\_rhs)\
 template\<typename \_IteratorL, typename \_IteratorR, typename \_Container\> bool **operator\>** (const \_\_normal\_iterator\< \_IteratorL, \_Container \> &\_\_lhs, const \_\_normal\_iterator\< \_IteratorR, \_Container \> &\_\_rhs)\
 template\<class \_Tp, class \_Alloc\> bool **operator\>=** (const **slist**\< \_Tp, \_Alloc \> &\_SL1, const **slist**\< \_Tp, \_Alloc \> &\_SL2)\
 template\<class \_CharT, class \_Alloc\> bool **operator\>=** (const **rope**\< \_CharT, \_Alloc \> &\_\_x, const **rope**\< \_CharT, \_Alloc \> &\_\_y)\
 template\<class \_CharT, class \_Alloc\> bool **operator\>=** (const \_Rope\_iterator\< \_CharT, \_Alloc \> &\_\_x, const \_Rope\_iterator\< \_CharT, \_Alloc \> &\_\_y)\
 template\<class \_CharT, class \_Alloc\> bool **operator\>=** (const \_Rope\_const\_iterator\< \_CharT, \_Alloc \> &\_\_x, const \_Rope\_const\_iterator\< \_CharT, \_Alloc \> &\_\_y)\
 template\<typename \_CharT, typename \_Traits, typename \_Alloc, template\< typename, typename, typename \> class \_Base\> bool **operator\>=** (const \_CharT \*\_\_lhs, const **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_rhs)\
 template\<typename \_CharT, typename \_Traits, typename \_Alloc, template\< typename, typename, typename \> class \_Base\> bool **operator\>=** (const **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_lhs, const \_CharT \*\_\_rhs)\
 template\<typename \_CharT, typename \_Traits, typename \_Alloc, template\< typename, typename, typename \> class \_Base\> bool **operator\>=** (const **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_lhs, const **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_rhs)\
 template\<typename \_Iterator, typename \_Container\> bool **operator\>=** (const \_\_normal\_iterator\< \_Iterator, \_Container \> &\_\_lhs, const \_\_normal\_iterator\< \_Iterator, \_Container \> &\_\_rhs)\
 template\<typename \_IteratorL, typename \_IteratorR, typename \_Container\> bool **operator\>=** (const \_\_normal\_iterator\< \_IteratorL, \_Container \> &\_\_lhs, const \_\_normal\_iterator\< \_IteratorR, \_Container \> &\_\_rhs)\
 template\<typename \_Tp, typename \_Integer\> \_Tp **power** (\_Tp \_\_x, \_Integer \_\_n)\
 template\<typename \_Tp, typename \_Integer, typename \_MonoidOperation\> \_Tp **power** (\_Tp \_\_x, \_Integer \_\_n, \_MonoidOperation \_\_monoid\_op)\
 template\<typename \_InputIterator, typename \_RandomAccessIterator, typename \_RandomNumberGenerator\> \_RandomAccessIterator **random\_sample** (\_InputIterator \_\_first, \_InputIterator \_\_last, \_RandomAccessIterator \_\_out\_first, \_RandomAccessIterator \_\_out\_last, \_RandomNumberGenerator &\_\_rand)\
 template\<typename \_InputIterator, typename \_RandomAccessIterator\> \_RandomAccessIterator **random\_sample** (\_InputIterator \_\_first, \_InputIterator \_\_last, \_RandomAccessIterator \_\_out\_first, \_RandomAccessIterator \_\_out\_last)\
 template\<typename \_ForwardIterator, typename \_OutputIterator, typename \_Distance, typename \_RandomNumberGenerator\> \_OutputIterator **random\_sample\_n** (\_ForwardIterator \_\_first, \_ForwardIterator \_\_last, \_OutputIterator \_\_out, const \_Distance \_\_n, \_RandomNumberGenerator &\_\_rand)\
 template\<typename \_ForwardIterator, typename \_OutputIterator, typename \_Distance\> \_OutputIterator **random\_sample\_n** (\_ForwardIterator \_\_first, \_ForwardIterator \_\_last, \_OutputIterator \_\_out, const \_Distance \_\_n)\
 void **rotate** (\_Rope\_iterator\< char, \_\_STL\_DEFAULT\_ALLOCATOR(char)\> \_\_first, \_Rope\_iterator\< char, \_\_STL\_DEFAULT\_ALLOCATOR(char)\> \_\_middle, \_Rope\_iterator\< char, \_\_STL\_DEFAULT\_ALLOCATOR(char)\> \_\_last)\
 template\<class \_Tp, class \_Alloc\> void **swap** (**slist**\< \_Tp, \_Alloc \> &\_\_x, **slist**\< \_Tp, \_Alloc \> &\_\_y)\
 template\<class \_CharT, class \_Alloc\> void **swap** (**rope**\< \_CharT, \_Alloc \> &\_\_x, **rope**\< \_CharT, \_Alloc \> &\_\_y)\
 template\<class \_CharT, class \_\_Alloc\> void **swap** (\_Rope\_char\_ref\_proxy\< \_CharT, \_\_Alloc \> \_\_a, \_Rope\_char\_ref\_proxy\< \_CharT, \_\_Alloc \> \_\_b)\
 template\<class \_Val, class \_HashFcn, class \_EqualKey, class \_Alloc\> void **swap** (**hash\_multiset**\< \_Val, \_HashFcn, \_EqualKey, \_Alloc \> &\_\_hs1, **hash\_multiset**\< \_Val, \_HashFcn, \_EqualKey, \_Alloc \> &\_\_hs2)\
 template\<class \_Val, class \_HashFcn, class \_EqualKey, class \_Alloc\> void **swap** (**hash\_set**\< \_Val, \_HashFcn, \_EqualKey, \_Alloc \> &\_\_hs1, **hash\_set**\< \_Val, \_HashFcn, \_EqualKey, \_Alloc \> &\_\_hs2)\
 template\<class \_Key, class \_Tp, class \_HashFcn, class \_EqlKey, class \_Alloc\> void **swap** (**hash\_multimap**\< \_Key, \_Tp, \_HashFcn, \_EqlKey, \_Alloc \> &\_\_hm1, **hash\_multimap**\< \_Key, \_Tp, \_HashFcn, \_EqlKey, \_Alloc \> &\_\_hm2)\
 template\<class \_Key, class \_Tp, class \_HashFcn, class \_EqlKey, class \_Alloc\> void **swap** (**hash\_map**\< \_Key, \_Tp, \_HashFcn, \_EqlKey, \_Alloc \> &\_\_hm1, **hash\_map**\< \_Key, \_Tp, \_HashFcn, \_EqlKey, \_Alloc \> &\_\_hm2)\
 template\<typename \_CharT, typename \_Traits, typename \_Alloc, template\< typename, typename, typename \> class \_Base\> void **swap** (**\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_lhs, **\_\_versa\_string**\< \_CharT, \_Traits, \_Alloc, \_Base \> &\_\_rhs)\
 template\<class \_Val, class \_Key, class \_HF, class \_Extract, class \_EqKey, class \_All\> void **swap** (hashtable\< \_Val, \_Key, \_HF, \_Extract, \_EqKey, \_All \> &\_\_ht1, hashtable\< \_Val, \_Key, \_HF, \_Extract, \_EqKey, \_All \> &\_\_ht2)\
 template\<typename \_InputIter, typename \_Size, typename \_ForwardIter\> **pair**\< \_InputIter, \_ForwardIter \> **uninitialized\_copy\_n** (\_InputIter \_\_first, \_Size \_\_count, \_ForwardIter \_\_result)\

### Variables

static const unsigned long **\_\_stl\_prime\_list** \[\_S\_num\_primes\]\
 bool const **\_\_threads\_enabled**\
 \_Atomic\_word int **\_\_val**\
 \_GLIBCXX\_DEFINE\_BINARY\_OPERATOR\_CONSTRAINT \* **\_TimesOpConcept**\
 **rope**\< \_CharT, \_Alloc \> **identity\_element** (\_Rope\_Concat\_fn\< \_CharT, \_Alloc \>)\

## Function Documentation

### void \_\_gnu\_cxx::\_\_verbose\_terminate\_handler ()

A replacement for the standard terminate\_handler which prints more information about the terminating exception (if any) on stderr. Call

```
        std::set_terminate (__gnu_cxx::__verbose_terminate_handler)
```

 to use. For more info, see http://gcc.gnu.org/onlinedocs/libstdc++/19\_diagnostics/howto.html#4

In 3.4 and later, this is on by default.

### size\_t \_\_gnu\_cxx::\_Bit\_scan\_forward (size\_t \_\_num)` [inline]`

Generic Version of the bsf instruction.

Definition at line 698 of file bitmap\_allocator.h.

### bool \_\_gnu\_cxx::operator!= (const \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_lhs, const \_CharT \* \_\_rhs)` [inline]`

Test difference of string and C string.

**Parameters:**

*lhs* String. \
 *rhs* C string.

**Returns:**

True if *lhs.compare*(*rhs*) != 0. False otherwise.

Definition at line 1934 of file vstring.h.

References \_\_versa\_string::compare().

### bool \_\_gnu\_cxx::operator!= (const \_CharT \* \_\_lhs, const \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_rhs)` [inline]`

Test difference of C string and string.

**Parameters:**

*lhs* C string. \
 *rhs* String.

**Returns:**

True if *rhs.compare*(*lhs*) != 0. False otherwise.

Definition at line 1921 of file vstring.h.

References \_\_versa\_string::compare().

### bool \_\_gnu\_cxx::operator!= (const \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_lhs, const \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_rhs)` [inline]`

Test difference of two strings.

**Parameters:**

*lhs* First string. \
 *rhs* Second string.

**Returns:**

True if *lhs.compare*(*rhs*) != 0. False otherwise.

Definition at line 1908 of file vstring.h.

References \_\_versa\_string::compare().

### \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> operator+ (const \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_lhs, \_CharT \_\_rhs)` [inline]`

Concatenate string and **character**.

**Parameters:**

*lhs* First string. \
 *rhs* Last string.

**Returns:**

New string with *lhs* followed by *rhs*.

Definition at line 242 of file vstring.tcc.

References \_\_versa\_string::append(), \_\_versa\_string::push\_back(), \_\_versa\_string::reserve(), and \_\_versa\_string::size().

### \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> operator+ (const \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_lhs, const \_CharT \* \_\_rhs)` [inline]`

Concatenate string and C string.

**Parameters:**

*lhs* First string. \
 *rhs* Last string.

**Returns:**

New string with *lhs* followed by *rhs*.

Definition at line 225 of file vstring.tcc.

References \_\_versa\_string::size().

### \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> operator+ (\_CharT \_\_lhs, const \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_rhs)` [inline]`

Concatenate **character** and string.

**Parameters:**

*lhs* First string. \
 *rhs* Last string.

**Returns:**

New string with *lhs* followed by *rhs*.

Definition at line 212 of file vstring.tcc.

References \_\_versa\_string::append(), \_\_versa\_string::push\_back(), \_\_versa\_string::reserve(), and \_\_versa\_string::size().

### \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> operator+ (const \_CharT \* \_\_lhs, const \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_rhs)` [inline]`

Concatenate C string and string.

**Parameters:**

*lhs* First string. \
 *rhs* Last string.

**Returns:**

New string with value of *lhs* followed by *rhs*.

Definition at line 195 of file vstring.tcc.

References \_\_versa\_string::size().

### \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> operator+ (const \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_lhs, const \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_rhs)` [inline]`

Concatenate two strings.

**Parameters:**

*lhs* First string. \
 *rhs* Last string.

**Returns:**

New string with value of *lhs* followed by *rhs*.

Definition at line 182 of file vstring.tcc.

References \_\_versa\_string::append(), \_\_versa\_string::reserve(), and \_\_versa\_string::size().

### bool \_\_gnu\_cxx::operator\< (const \_CharT \* \_\_lhs, const \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_rhs)` [inline]`

Test if C string precedes string.

**Parameters:**

*lhs* C string. \
 *rhs* String.

**Returns:**

True if *lhs* precedes *rhs*. False otherwise.

Definition at line 1974 of file vstring.h.

References \_\_versa\_string::compare().

### bool \_\_gnu\_cxx::operator\< (const \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_lhs, const \_CharT \* \_\_rhs)` [inline]`

Test if string precedes C string.

**Parameters:**

*lhs* String. \
 *rhs* C string.

**Returns:**

True if *lhs* precedes *rhs*. False otherwise.

Definition at line 1961 of file vstring.h.

### bool \_\_gnu\_cxx::operator\< (const \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_lhs, const \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_rhs)` [inline]`

Test if string precedes string.

**Parameters:**

*lhs* First string. \
 *rhs* Second string.

**Returns:**

True if *lhs* precedes *rhs*. False otherwise.

Definition at line 1948 of file vstring.h.

### bool \_\_gnu\_cxx::operator\<= (const \_CharT \* \_\_lhs, const \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_rhs)` [inline]`

Test if C string doesn't follow string.

**Parameters:**

*lhs* C string. \
 *rhs* String.

**Returns:**

True if *lhs* doesn't follow *rhs*. False otherwise.

Definition at line 2054 of file vstring.h.

References \_\_versa\_string::compare().

### bool \_\_gnu\_cxx::operator\<= (const \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_lhs, const \_CharT \* \_\_rhs)` [inline]`

Test if string doesn't follow C string.

**Parameters:**

*lhs* String. \
 *rhs* C string.

**Returns:**

True if *lhs* doesn't follow *rhs*. False otherwise.

Definition at line 2041 of file vstring.h.

### bool \_\_gnu\_cxx::operator\<= (const \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_lhs, const \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_rhs)` [inline]`

Test if string doesn't follow string.

**Parameters:**

*lhs* First string. \
 *rhs* Second string.

**Returns:**

True if *lhs* doesn't follow *rhs*. False otherwise.

Definition at line 2028 of file vstring.h.

### bool \_\_gnu\_cxx::operator== (const \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_lhs, const \_CharT \* \_\_rhs)` [inline]`

Test equivalence of string and C string.

**Parameters:**

*lhs* String. \
 *rhs* C string.

**Returns:**

True if *lhs.compare*(*rhs*) == 0. False otherwise.

Definition at line 1894 of file vstring.h.

References \_\_versa\_string::compare().

### bool \_\_gnu\_cxx::operator== (const \_CharT \* \_\_lhs, const \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_rhs)` [inline]`

Test equivalence of C string and string.

**Parameters:**

*lhs* C string. \
 *rhs* String.

**Returns:**

True if *rhs.compare*(*lhs*) == 0. False otherwise.

Definition at line 1881 of file vstring.h.

References \_\_versa\_string::compare().

### bool \_\_gnu\_cxx::operator== (const \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_lhs, const \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_rhs)` [inline]`

Test equivalence of two strings.

**Parameters:**

*lhs* First string. \
 *rhs* Second string.

**Returns:**

True if *lhs.compare*(*rhs*) == 0. False otherwise.

Definition at line 1868 of file vstring.h.

References \_\_versa\_string::compare().

### bool \_\_gnu\_cxx::operator\> (const \_CharT \* \_\_lhs, const \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_rhs)` [inline]`

Test if C string follows string.

**Parameters:**

*lhs* C string. \
 *rhs* String.

**Returns:**

True if *lhs* follows *rhs*. False otherwise.

Definition at line 2014 of file vstring.h.

References \_\_versa\_string::compare().

### bool \_\_gnu\_cxx::operator\> (const \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_lhs, const \_CharT \* \_\_rhs)` [inline]`

Test if string follows C string.

**Parameters:**

*lhs* String. \
 *rhs* C string.

**Returns:**

True if *lhs* follows *rhs*. False otherwise.

Definition at line 2001 of file vstring.h.

References \_\_versa\_string::compare().

### bool \_\_gnu\_cxx::operator\> (const \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_lhs, const \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_rhs)` [inline]`

Test if string follows string.

**Parameters:**

*lhs* First string. \
 *rhs* Second string.

**Returns:**

True if *lhs* follows *rhs*. False otherwise.

Definition at line 1988 of file vstring.h.

References \_\_versa\_string::compare().

### bool \_\_gnu\_cxx::operator\>= (const \_CharT \* \_\_lhs, const \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_rhs)` [inline]`

Test if C string doesn't precede string.

**Parameters:**

*lhs* C string. \
 *rhs* String.

**Returns:**

True if *lhs* doesn't precede *rhs*. False otherwise.

Definition at line 2094 of file vstring.h.

References \_\_versa\_string::compare().

### bool \_\_gnu\_cxx::operator\>= (const \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_lhs, const \_CharT \* \_\_rhs)` [inline]`

Test if string doesn't precede C string.

**Parameters:**

*lhs* String. \
 *rhs* C string.

**Returns:**

True if *lhs* doesn't precede *rhs*. False otherwise.

Definition at line 2081 of file vstring.h.

References \_\_versa\_string::compare().

### bool \_\_gnu\_cxx::operator\>= (const \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_lhs, const \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_rhs)` [inline]`

Test if string doesn't precede string.

**Parameters:**

*lhs* First string. \
 *rhs* Second string.

**Returns:**

True if *lhs* doesn't precede *rhs*. False otherwise.

Definition at line 2068 of file vstring.h.

References \_\_versa\_string::compare().

### void \_\_gnu\_cxx::swap (\_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_lhs, \_\_versa\_string\< \_CharT, \_Traits, \_Alloc, \_Base \> & \_\_rhs)` [inline]`

Swap contents of two strings.

**Parameters:**

*lhs* First string. \
 *rhs* Second string.

Exchanges the contents of *lhs* and *rhs* in constant time.

Definition at line 2108 of file vstring.h.

References \_\_versa\_string::swap().

## Variable Documentation

### bool const \_\_threads\_enabled` [static]`

If true, then the application being compiled will be using threads, so use mutexes as a synchronization primitive, else do no use any synchronization primitives.

Definition at line 81 of file bitmap\_allocator.h.

## Author

Generated automatically by Doxygen for libstdc++ from the source code.