New members These members are not defined in the Random Access Container requirements, but are specific to rope:
| Function | Description |
rope(const charT* s) | Constructs a rope from a C string. The rope consists of the sequence of characters starting with *s up to, but not including, the first null character. |
rope(const charT* s, size_t n) | Constructs a rope from an array of charT. The rope consists of the characters in the range [s, s + n) . Note that this range is permitted to contain embedded null characters. |
rope(charT c) | Constructs a rope consisting of the single character c. |
rope(char_producer<charT>* cp, size_t n, bool destroy) | Constructs a rope of size n, whose characters are computed as needed by cp. The object *cp must be valid as long as any reference to the resulting rope, or a rope derived from it, may be used. If destroy is true, then delete cp will be executed automatically once cp is no longer needed. Typically destroy will be true unless cp is a pointer to statically allocated storage. It is rarely safe to allocate *cp on the stack. |
size_type length() const | Synonym for size |
iterator mutable_begin() | Returns an iterator pointing to the beginning of the rope. This member function exists because mutable rope iterators are much more expensive than constant rope iterators. |
iterator mutable_end() | Returns an iterator pointing to the end of the rope. This member function exists because mutable rope iterators are much more expensive than constant rope iterators. |
iterator mutable_rbegin() | Returns a reverse_iterator pointing to the beginning of the reversed rope. This member function exists because mutable rope iterators are much more expensive than constant rope iterators. |
iterator mutable_rend() | Returns a reverse_iterator pointing to the end of the reversed rope. This member function exists because mutable rope iterators are much more expensive than constant rope iterators. |
reference mutable_reference_at(size_type n) | Returns a reference to the n th element. This member function exists because mutable references to rope elements have fairly high overhead. |
int compare(const rope& x) | Three-way comparison, much like the function strcmp from the standard C library. Returns a negative number if *this is lexicographically less than x, a positive number if *this is lexicographically greater than x, and zero if neither rope is lexicographically less than the other. |
iterator insert(const iterator& p, const rope& x) | Inserts the contents of the ropex immediately before the position p. |
iterator insert(const iterator& p, const charT* s) | Inserts a C string immediately before the position p. The elements that are inserted are the sequence of characters starting with *s and up to, but not including, the first null character. |
iterator insert(const iterator& p, const charT* s, size_t n) | Inserts an array of charT. The elements that are inserted are the range [s, s + n). Note that this range is permitted to contain embedded null characters. |
