1 // Copyright 2012-2017 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
11 //! Unicode string slices.
13 //! The `&str` type is one of the two main string types, the other being `String`.
14 //! Unlike its `String` counterpart, its contents are borrowed.
18 //! A basic string declaration of `&str` type:
21 //! let hello_world = "Hello, World!";
24 //! Here we have declared a string literal, also known as a string slice.
25 //! String literals have a static lifetime, which means the string `hello_world`
26 //! is guaranteed to be valid for the duration of the entire program.
27 //! We can explicitly specify `hello_world`'s lifetime as well:
30 //! let hello_world: &'static str = "Hello, world!";
33 //! *[See also the `str` primitive type](../../std/primitive.str.html).*
35 #![stable(feature = "rust1", since = "1.0.0")]
37 // Many of the usings in this module are only used in the test configuration.
38 // It's cleaner to just turn off the unused_imports warning than to fix them.
39 #![allow(unused_imports)]
42 use core
::str as core_str
;
43 use core
::str::pattern
::Pattern
;
44 use core
::str::pattern
::{Searcher, ReverseSearcher, DoubleEndedSearcher}
;
46 use core
::iter
::FusedIterator
;
47 use std_unicode
::str::{UnicodeStr, Utf16Encoder}
;
49 use vec_deque
::VecDeque
;
50 use borrow
::{Borrow, ToOwned}
;
54 use slice
::{SliceConcatExt, SliceIndex}
;
57 #[stable(feature = "rust1", since = "1.0.0")]
58 pub use core
::str::{FromStr, Utf8Error}
;
60 #[stable(feature = "rust1", since = "1.0.0")]
61 pub use core
::str::{Lines, LinesAny}
;
62 #[stable(feature = "rust1", since = "1.0.0")]
63 pub use core
::str::{Split, RSplit}
;
64 #[stable(feature = "rust1", since = "1.0.0")]
65 pub use core
::str::{SplitN, RSplitN}
;
66 #[stable(feature = "rust1", since = "1.0.0")]
67 pub use core
::str::{SplitTerminator, RSplitTerminator}
;
68 #[stable(feature = "rust1", since = "1.0.0")]
69 pub use core
::str::{Matches, RMatches}
;
70 #[stable(feature = "rust1", since = "1.0.0")]
71 pub use core
::str::{MatchIndices, RMatchIndices}
;
72 #[stable(feature = "rust1", since = "1.0.0")]
73 pub use core
::str::{from_utf8, from_utf8_mut, Chars, CharIndices, Bytes}
;
74 #[stable(feature = "rust1", since = "1.0.0")]
75 pub use core
::str::{from_utf8_unchecked, from_utf8_unchecked_mut, ParseBoolError}
;
76 #[stable(feature = "rust1", since = "1.0.0")]
77 pub use std_unicode
::str::SplitWhitespace
;
78 #[stable(feature = "rust1", since = "1.0.0")]
79 pub use core
::str::pattern
;
82 #[unstable(feature = "slice_concat_ext",
83 reason
= "trait should not have to exist",
85 impl<S
: Borrow
<str>> SliceConcatExt
<str> for [S
] {
88 fn concat(&self) -> String
{
93 // `len` calculation may overflow but push_str will check boundaries
94 let len
= self.iter().map(|s
| s
.borrow().len()).sum();
95 let mut result
= String
::with_capacity(len
);
98 result
.push_str(s
.borrow())
104 fn join(&self, sep
: &str) -> String
{
106 return String
::new();
111 return self.concat();
114 // this is wrong without the guarantee that `self` is non-empty
115 // `len` calculation may overflow but push_str but will check boundaries
116 let len
= sep
.len() * (self.len() - 1) +
117 self.iter().map(|s
| s
.borrow().len()).sum
::<usize>();
118 let mut result
= String
::with_capacity(len
);
119 let mut first
= true;
125 result
.push_str(sep
);
127 result
.push_str(s
.borrow());
132 fn connect(&self, sep
: &str) -> String
{
137 /// An iterator of [`u16`] over the string encoded as UTF-16.
139 /// [`u16`]: ../../std/primitive.u16.html
141 /// This struct is created by the [`encode_utf16`] method on [`str`].
142 /// See its documentation for more.
144 /// [`encode_utf16`]: ../../std/primitive.str.html#method.encode_utf16
145 /// [`str`]: ../../std/primitive.str.html
147 #[stable(feature = "encode_utf16", since = "1.8.0")]
148 pub struct EncodeUtf16
<'a
> {
149 encoder
: Utf16Encoder
<Chars
<'a
>>,
152 #[stable(feature = "collection_debug", since = "1.17.0")]
153 impl<'a
> fmt
::Debug
for EncodeUtf16
<'a
> {
154 fn fmt(&self, f
: &mut fmt
::Formatter
) -> fmt
::Result
{
155 f
.pad("EncodeUtf16 { .. }")
159 #[stable(feature = "encode_utf16", since = "1.8.0")]
160 impl<'a
> Iterator
for EncodeUtf16
<'a
> {
164 fn next(&mut self) -> Option
<u16> {
169 fn size_hint(&self) -> (usize, Option
<usize>) {
170 self.encoder
.size_hint()
174 #[unstable(feature = "fused", issue = "35602")]
175 impl<'a
> FusedIterator
for EncodeUtf16
<'a
> {}
177 #[stable(feature = "rust1", since = "1.0.0")]
178 impl Borrow
<str> for String
{
180 fn borrow(&self) -> &str {
185 #[stable(feature = "rust1", since = "1.0.0")]
186 impl ToOwned
for str {
188 fn to_owned(&self) -> String
{
189 unsafe { String::from_utf8_unchecked(self.as_bytes().to_owned()) }
192 fn clone_into(&self, target
: &mut String
) {
193 let mut b
= mem
::replace(target
, String
::new()).into_bytes();
194 self.as_bytes().clone_into(&mut b
);
195 *target
= unsafe { String::from_utf8_unchecked(b) }
199 /// Methods for string slices.
203 /// Returns the length of `self`.
205 /// This length is in bytes, not [`char`]s or graphemes. In other words,
206 /// it may not be what a human considers the length of the string.
208 /// [`char`]: primitive.char.html
215 /// let len = "foo".len();
216 /// assert_eq!(3, len);
218 /// let len = "ƒoo".len(); // fancy f!
219 /// assert_eq!(4, len);
221 #[stable(feature = "rust1", since = "1.0.0")]
223 pub fn len(&self) -> usize {
224 core_str
::StrExt
::len(self)
227 /// Returns `true` if `self` has a length of zero bytes.
235 /// assert!(s.is_empty());
237 /// let s = "not empty";
238 /// assert!(!s.is_empty());
241 #[stable(feature = "rust1", since = "1.0.0")]
242 pub fn is_empty(&self) -> bool
{
243 core_str
::StrExt
::is_empty(self)
246 /// Checks that `index`-th byte lies at the start and/or end of a
247 /// UTF-8 code point sequence.
249 /// The start and end of the string (when `index == self.len()`) are
253 /// Returns `false` if `index` is greater than `self.len()`.
258 /// let s = "Löwe 老虎 Léopard";
259 /// assert!(s.is_char_boundary(0));
261 /// assert!(s.is_char_boundary(6));
262 /// assert!(s.is_char_boundary(s.len()));
264 /// // second byte of `ö`
265 /// assert!(!s.is_char_boundary(2));
267 /// // third byte of `老`
268 /// assert!(!s.is_char_boundary(8));
270 #[stable(feature = "is_char_boundary", since = "1.9.0")]
272 pub fn is_char_boundary(&self, index
: usize) -> bool
{
273 core_str
::StrExt
::is_char_boundary(self, index
)
276 /// Converts a string slice to a byte slice. To convert the byte slice back
277 /// into a string slice, use the [`str::from_utf8`] function.
279 /// [`str::from_utf8`]: ./str/fn.from_utf8.html
286 /// let bytes = "bors".as_bytes();
287 /// assert_eq!(b"bors", bytes);
289 #[stable(feature = "rust1", since = "1.0.0")]
291 pub fn as_bytes(&self) -> &[u8] {
292 core_str
::StrExt
::as_bytes(self)
295 /// Converts a mutable string slice to a mutable byte slice. To convert the
296 /// mutable byte slice back into a mutable string slice, use the
297 /// [`str::from_utf8_mut`] function.
299 /// [`str::from_utf8_mut`]: ./str/fn.from_utf8_mut.html
300 #[stable(feature = "str_mut_extras", since = "1.20.0")]
302 pub unsafe fn as_bytes_mut(&mut self) -> &mut [u8] {
303 core_str
::StrExt
::as_bytes_mut(self)
306 /// Converts a string slice to a raw pointer.
308 /// As string slices are a slice of bytes, the raw pointer points to a
309 /// [`u8`]. This pointer will be pointing to the first byte of the string
312 /// [`u8`]: primitive.u8.html
320 /// let ptr = s.as_ptr();
322 #[stable(feature = "rust1", since = "1.0.0")]
324 pub fn as_ptr(&self) -> *const u8 {
325 core_str
::StrExt
::as_ptr(self)
328 /// Returns a subslice of `str`.
330 /// This is the non-panicking alternative to indexing the `str`. Returns
331 /// [`None`] whenever equivalent indexing operation would panic.
333 /// [`None`]: option/enum.Option.html#variant.None
338 /// let mut v = String::from("🗻∈🌏");
340 /// assert_eq!(Some("🗻"), v.get(0..4));
342 /// // indices not on UTF-8 sequence boundaries
343 /// assert!(v.get_mut(1..).is_none());
344 /// assert!(v.get_mut(..8).is_none());
347 /// assert!(v.get_mut(..42).is_none());
349 #[stable(feature = "str_checked_slicing", since = "1.20.0")]
351 pub fn get
<I
: SliceIndex
<str>>(&self, i
: I
) -> Option
<&I
::Output
> {
352 core_str
::StrExt
::get(self, i
)
355 /// Returns a mutable subslice of `str`.
357 /// This is the non-panicking alternative to indexing the `str`. Returns
358 /// [`None`] whenever equivalent indexing operation would panic.
360 /// [`None`]: option/enum.Option.html#variant.None
365 /// let mut v = String::from("🗻∈🌏");
367 /// assert_eq!(Some("🗻"), v.get_mut(0..4).map(|v| &*v));
369 /// // indices not on UTF-8 sequence boundaries
370 /// assert!(v.get_mut(1..).is_none());
371 /// assert!(v.get_mut(..8).is_none());
374 /// assert!(v.get_mut(..42).is_none());
376 #[stable(feature = "str_checked_slicing", since = "1.20.0")]
378 pub fn get_mut
<I
: SliceIndex
<str>>(&mut self, i
: I
) -> Option
<&mut I
::Output
> {
379 core_str
::StrExt
::get_mut(self, i
)
382 /// Returns a unchecked subslice of `str`.
384 /// This is the unchecked alternative to indexing the `str`.
388 /// Callers of this function are responsible that these preconditions are
391 /// * The starting index must come before the ending index;
392 /// * Indexes must be within bounds of the original slice;
393 /// * Indexes must lie on UTF-8 sequence boundaries.
395 /// Failing that, the returned string slice may reference invalid memory or
396 /// violate the invariants communicated by the `str` type.
403 /// assert_eq!("🗻", v.get_unchecked(0..4));
404 /// assert_eq!("∈", v.get_unchecked(4..7));
405 /// assert_eq!("🌏", v.get_unchecked(7..11));
408 #[stable(feature = "str_checked_slicing", since = "1.20.0")]
410 pub unsafe fn get_unchecked
<I
: SliceIndex
<str>>(&self, i
: I
) -> &I
::Output
{
411 core_str
::StrExt
::get_unchecked(self, i
)
414 /// Returns a mutable, unchecked subslice of `str`.
416 /// This is the unchecked alternative to indexing the `str`.
420 /// Callers of this function are responsible that these preconditions are
423 /// * The starting index must come before the ending index;
424 /// * Indexes must be within bounds of the original slice;
425 /// * Indexes must lie on UTF-8 sequence boundaries.
427 /// Failing that, the returned string slice may reference invalid memory or
428 /// violate the invariants communicated by the `str` type.
433 /// let mut v = String::from("🗻∈🌏");
435 /// assert_eq!("🗻", v.get_unchecked_mut(0..4));
436 /// assert_eq!("∈", v.get_unchecked_mut(4..7));
437 /// assert_eq!("🌏", v.get_unchecked_mut(7..11));
440 #[stable(feature = "str_checked_slicing", since = "1.20.0")]
442 pub unsafe fn get_unchecked_mut
<I
: SliceIndex
<str>>(&mut self, i
: I
) -> &mut I
::Output
{
443 core_str
::StrExt
::get_unchecked_mut(self, i
)
446 /// Creates a string slice from another string slice, bypassing safety
449 /// This is generally not recommended, use with caution! For a safe
450 /// alternative see [`str`] and [`Index`].
452 /// [`str`]: primitive.str.html
453 /// [`Index`]: ops/trait.Index.html
455 /// This new slice goes from `begin` to `end`, including `begin` but
458 /// To get a mutable string slice instead, see the
459 /// [`slice_mut_unchecked`] method.
461 /// [`slice_mut_unchecked`]: #method.slice_mut_unchecked
465 /// Callers of this function are responsible that three preconditions are
468 /// * `begin` must come before `end`.
469 /// * `begin` and `end` must be byte positions within the string slice.
470 /// * `begin` and `end` must lie on UTF-8 sequence boundaries.
477 /// let s = "Löwe 老虎 Léopard";
480 /// assert_eq!("Löwe 老虎 Léopard", s.slice_unchecked(0, 21));
483 /// let s = "Hello, world!";
486 /// assert_eq!("world", s.slice_unchecked(7, 12));
489 #[stable(feature = "rust1", since = "1.0.0")]
491 pub unsafe fn slice_unchecked(&self, begin
: usize, end
: usize) -> &str {
492 core_str
::StrExt
::slice_unchecked(self, begin
, end
)
495 /// Creates a string slice from another string slice, bypassing safety
497 /// This is generally not recommended, use with caution! For a safe
498 /// alternative see [`str`] and [`IndexMut`].
500 /// [`str`]: primitive.str.html
501 /// [`IndexMut`]: ops/trait.IndexMut.html
503 /// This new slice goes from `begin` to `end`, including `begin` but
506 /// To get an immutable string slice instead, see the
507 /// [`slice_unchecked`] method.
509 /// [`slice_unchecked`]: #method.slice_unchecked
513 /// Callers of this function are responsible that three preconditions are
516 /// * `begin` must come before `end`.
517 /// * `begin` and `end` must be byte positions within the string slice.
518 /// * `begin` and `end` must lie on UTF-8 sequence boundaries.
519 #[stable(feature = "str_slice_mut", since = "1.5.0")]
521 pub unsafe fn slice_mut_unchecked(&mut self, begin
: usize, end
: usize) -> &mut str {
522 core_str
::StrExt
::slice_mut_unchecked(self, begin
, end
)
525 /// Divide one string slice into two at an index.
527 /// The argument, `mid`, should be a byte offset from the start of the
528 /// string. It must also be on the boundary of a UTF-8 code point.
530 /// The two slices returned go from the start of the string slice to `mid`,
531 /// and from `mid` to the end of the string slice.
533 /// To get mutable string slices instead, see the [`split_at_mut`]
536 /// [`split_at_mut`]: #method.split_at_mut
540 /// Panics if `mid` is not on a UTF-8 code point boundary, or if it is
541 /// beyond the last code point of the string slice.
548 /// let s = "Per Martin-Löf";
550 /// let (first, last) = s.split_at(3);
552 /// assert_eq!("Per", first);
553 /// assert_eq!(" Martin-Löf", last);
556 #[stable(feature = "str_split_at", since = "1.4.0")]
557 pub fn split_at(&self, mid
: usize) -> (&str, &str) {
558 core_str
::StrExt
::split_at(self, mid
)
561 /// Divide one mutable string slice into two at an index.
563 /// The argument, `mid`, should be a byte offset from the start of the
564 /// string. It must also be on the boundary of a UTF-8 code point.
566 /// The two slices returned go from the start of the string slice to `mid`,
567 /// and from `mid` to the end of the string slice.
569 /// To get immutable string slices instead, see the [`split_at`] method.
571 /// [`split_at`]: #method.split_at
575 /// Panics if `mid` is not on a UTF-8 code point boundary, or if it is
576 /// beyond the last code point of the string slice.
583 /// use std::ascii::AsciiExt;
585 /// let mut s = "Per Martin-Löf".to_string();
587 /// let (first, last) = s.split_at_mut(3);
588 /// first.make_ascii_uppercase();
589 /// assert_eq!("PER", first);
590 /// assert_eq!(" Martin-Löf", last);
592 /// assert_eq!("PER Martin-Löf", s);
595 #[stable(feature = "str_split_at", since = "1.4.0")]
596 pub fn split_at_mut(&mut self, mid
: usize) -> (&mut str, &mut str) {
597 core_str
::StrExt
::split_at_mut(self, mid
)
600 /// Returns an iterator over the [`char`]s of a string slice.
602 /// As a string slice consists of valid UTF-8, we can iterate through a
603 /// string slice by [`char`]. This method returns such an iterator.
605 /// It's important to remember that [`char`] represents a Unicode Scalar
606 /// Value, and may not match your idea of what a 'character' is. Iteration
607 /// over grapheme clusters may be what you actually want.
609 /// [`char`]: primitive.char.html
616 /// let word = "goodbye";
618 /// let count = word.chars().count();
619 /// assert_eq!(7, count);
621 /// let mut chars = word.chars();
623 /// assert_eq!(Some('g'), chars.next());
624 /// assert_eq!(Some('o'), chars.next());
625 /// assert_eq!(Some('o'), chars.next());
626 /// assert_eq!(Some('d'), chars.next());
627 /// assert_eq!(Some('b'), chars.next());
628 /// assert_eq!(Some('y'), chars.next());
629 /// assert_eq!(Some('e'), chars.next());
631 /// assert_eq!(None, chars.next());
634 /// Remember, [`char`]s may not match your human intuition about characters:
639 /// let mut chars = y.chars();
641 /// assert_eq!(Some('y'), chars.next()); // not 'y̆'
642 /// assert_eq!(Some('\u{0306}'), chars.next());
644 /// assert_eq!(None, chars.next());
646 #[stable(feature = "rust1", since = "1.0.0")]
648 pub fn chars(&self) -> Chars
{
649 core_str
::StrExt
::chars(self)
651 /// Returns an iterator over the [`char`]s of a string slice, and their
654 /// As a string slice consists of valid UTF-8, we can iterate through a
655 /// string slice by [`char`]. This method returns an iterator of both
656 /// these [`char`]s, as well as their byte positions.
658 /// The iterator yields tuples. The position is first, the [`char`] is
661 /// [`char`]: primitive.char.html
668 /// let word = "goodbye";
670 /// let count = word.char_indices().count();
671 /// assert_eq!(7, count);
673 /// let mut char_indices = word.char_indices();
675 /// assert_eq!(Some((0, 'g')), char_indices.next());
676 /// assert_eq!(Some((1, 'o')), char_indices.next());
677 /// assert_eq!(Some((2, 'o')), char_indices.next());
678 /// assert_eq!(Some((3, 'd')), char_indices.next());
679 /// assert_eq!(Some((4, 'b')), char_indices.next());
680 /// assert_eq!(Some((5, 'y')), char_indices.next());
681 /// assert_eq!(Some((6, 'e')), char_indices.next());
683 /// assert_eq!(None, char_indices.next());
686 /// Remember, [`char`]s may not match your human intuition about characters:
691 /// let mut char_indices = y.char_indices();
693 /// assert_eq!(Some((0, 'y')), char_indices.next()); // not (0, 'y̆')
694 /// assert_eq!(Some((1, '\u{0306}')), char_indices.next());
696 /// assert_eq!(None, char_indices.next());
698 #[stable(feature = "rust1", since = "1.0.0")]
700 pub fn char_indices(&self) -> CharIndices
{
701 core_str
::StrExt
::char_indices(self)
704 /// An iterator over the bytes of a string slice.
706 /// As a string slice consists of a sequence of bytes, we can iterate
707 /// through a string slice by byte. This method returns such an iterator.
714 /// let mut bytes = "bors".bytes();
716 /// assert_eq!(Some(b'b'), bytes.next());
717 /// assert_eq!(Some(b'o'), bytes.next());
718 /// assert_eq!(Some(b'r'), bytes.next());
719 /// assert_eq!(Some(b's'), bytes.next());
721 /// assert_eq!(None, bytes.next());
723 #[stable(feature = "rust1", since = "1.0.0")]
725 pub fn bytes(&self) -> Bytes
{
726 core_str
::StrExt
::bytes(self)
729 /// Split a string slice by whitespace.
731 /// The iterator returned will return string slices that are sub-slices of
732 /// the original string slice, separated by any amount of whitespace.
734 /// 'Whitespace' is defined according to the terms of the Unicode Derived
735 /// Core Property `White_Space`.
742 /// let mut iter = "A few words".split_whitespace();
744 /// assert_eq!(Some("A"), iter.next());
745 /// assert_eq!(Some("few"), iter.next());
746 /// assert_eq!(Some("words"), iter.next());
748 /// assert_eq!(None, iter.next());
751 /// All kinds of whitespace are considered:
754 /// let mut iter = " Mary had\ta\u{2009}little \n\t lamb".split_whitespace();
755 /// assert_eq!(Some("Mary"), iter.next());
756 /// assert_eq!(Some("had"), iter.next());
757 /// assert_eq!(Some("a"), iter.next());
758 /// assert_eq!(Some("little"), iter.next());
759 /// assert_eq!(Some("lamb"), iter.next());
761 /// assert_eq!(None, iter.next());
763 #[stable(feature = "split_whitespace", since = "1.1.0")]
765 pub fn split_whitespace(&self) -> SplitWhitespace
{
766 UnicodeStr
::split_whitespace(self)
769 /// An iterator over the lines of a string, as string slices.
771 /// Lines are ended with either a newline (`\n`) or a carriage return with
772 /// a line feed (`\r\n`).
774 /// The final line ending is optional.
781 /// let text = "foo\r\nbar\n\nbaz\n";
782 /// let mut lines = text.lines();
784 /// assert_eq!(Some("foo"), lines.next());
785 /// assert_eq!(Some("bar"), lines.next());
786 /// assert_eq!(Some(""), lines.next());
787 /// assert_eq!(Some("baz"), lines.next());
789 /// assert_eq!(None, lines.next());
792 /// The final line ending isn't required:
795 /// let text = "foo\nbar\n\r\nbaz";
796 /// let mut lines = text.lines();
798 /// assert_eq!(Some("foo"), lines.next());
799 /// assert_eq!(Some("bar"), lines.next());
800 /// assert_eq!(Some(""), lines.next());
801 /// assert_eq!(Some("baz"), lines.next());
803 /// assert_eq!(None, lines.next());
805 #[stable(feature = "rust1", since = "1.0.0")]
807 pub fn lines(&self) -> Lines
{
808 core_str
::StrExt
::lines(self)
811 /// An iterator over the lines of a string.
812 #[stable(feature = "rust1", since = "1.0.0")]
813 #[rustc_deprecated(since = "1.4.0", reason = "use lines() instead now")]
816 pub fn lines_any(&self) -> LinesAny
{
817 core_str
::StrExt
::lines_any(self)
820 /// Returns an iterator of `u16` over the string encoded as UTF-16.
821 #[stable(feature = "encode_utf16", since = "1.8.0")]
822 pub fn encode_utf16(&self) -> EncodeUtf16
{
823 EncodeUtf16 { encoder: Utf16Encoder::new(self[..].chars()) }
826 /// Returns `true` if the given pattern matches a sub-slice of
827 /// this string slice.
829 /// Returns `false` if it does not.
836 /// let bananas = "bananas";
838 /// assert!(bananas.contains("nana"));
839 /// assert!(!bananas.contains("apples"));
841 #[stable(feature = "rust1", since = "1.0.0")]
843 pub fn contains
<'a
, P
: Pattern
<'a
>>(&'a
self, pat
: P
) -> bool
{
844 core_str
::StrExt
::contains(self, pat
)
847 /// Returns `true` if the given pattern matches a prefix of this
850 /// Returns `false` if it does not.
857 /// let bananas = "bananas";
859 /// assert!(bananas.starts_with("bana"));
860 /// assert!(!bananas.starts_with("nana"));
862 #[stable(feature = "rust1", since = "1.0.0")]
863 pub fn starts_with
<'a
, P
: Pattern
<'a
>>(&'a
self, pat
: P
) -> bool
{
864 core_str
::StrExt
::starts_with(self, pat
)
867 /// Returns `true` if the given pattern matches a suffix of this
870 /// Returns `false` if it does not.
877 /// let bananas = "bananas";
879 /// assert!(bananas.ends_with("anas"));
880 /// assert!(!bananas.ends_with("nana"));
882 #[stable(feature = "rust1", since = "1.0.0")]
883 pub fn ends_with
<'a
, P
: Pattern
<'a
>>(&'a
self, pat
: P
) -> bool
884 where P
::Searcher
: ReverseSearcher
<'a
>
886 core_str
::StrExt
::ends_with(self, pat
)
889 /// Returns the byte index of the first character of this string slice that
890 /// matches the pattern.
892 /// Returns [`None`] if the pattern doesn't match.
894 /// The pattern can be a `&str`, [`char`], or a closure that determines if
895 /// a character matches.
897 /// [`char`]: primitive.char.html
898 /// [`None`]: option/enum.Option.html#variant.None
905 /// let s = "Löwe 老虎 Léopard";
907 /// assert_eq!(s.find('L'), Some(0));
908 /// assert_eq!(s.find('é'), Some(14));
909 /// assert_eq!(s.find("Léopard"), Some(13));
912 /// More complex patterns with closures:
915 /// let s = "Löwe 老虎 Léopard";
917 /// assert_eq!(s.find(char::is_whitespace), Some(5));
918 /// assert_eq!(s.find(char::is_lowercase), Some(1));
921 /// Not finding the pattern:
924 /// let s = "Löwe 老虎 Léopard";
925 /// let x: &[_] = &['1', '2'];
927 /// assert_eq!(s.find(x), None);
929 #[stable(feature = "rust1", since = "1.0.0")]
931 pub fn find
<'a
, P
: Pattern
<'a
>>(&'a
self, pat
: P
) -> Option
<usize> {
932 core_str
::StrExt
::find(self, pat
)
935 /// Returns the byte index of the last character of this string slice that
936 /// matches the pattern.
938 /// Returns [`None`] if the pattern doesn't match.
940 /// The pattern can be a `&str`, [`char`], or a closure that determines if
941 /// a character matches.
943 /// [`char`]: primitive.char.html
944 /// [`None`]: option/enum.Option.html#variant.None
951 /// let s = "Löwe 老虎 Léopard";
953 /// assert_eq!(s.rfind('L'), Some(13));
954 /// assert_eq!(s.rfind('é'), Some(14));
957 /// More complex patterns with closures:
960 /// let s = "Löwe 老虎 Léopard";
962 /// assert_eq!(s.rfind(char::is_whitespace), Some(12));
963 /// assert_eq!(s.rfind(char::is_lowercase), Some(20));
966 /// Not finding the pattern:
969 /// let s = "Löwe 老虎 Léopard";
970 /// let x: &[_] = &['1', '2'];
972 /// assert_eq!(s.rfind(x), None);
974 #[stable(feature = "rust1", since = "1.0.0")]
976 pub fn rfind
<'a
, P
: Pattern
<'a
>>(&'a
self, pat
: P
) -> Option
<usize>
977 where P
::Searcher
: ReverseSearcher
<'a
>
979 core_str
::StrExt
::rfind(self, pat
)
982 /// An iterator over substrings of this string slice, separated by
983 /// characters matched by a pattern.
985 /// The pattern can be a `&str`, [`char`], or a closure that determines the
988 /// # Iterator behavior
990 /// The returned iterator will be a [`DoubleEndedIterator`] if the pattern
991 /// allows a reverse search and forward/reverse search yields the same
992 /// elements. This is true for, eg, [`char`] but not for `&str`.
994 /// [`DoubleEndedIterator`]: iter/trait.DoubleEndedIterator.html
996 /// If the pattern allows a reverse search but its results might differ
997 /// from a forward search, the [`rsplit`] method can be used.
999 /// [`char`]: primitive.char.html
1000 /// [`rsplit`]: #method.rsplit
1004 /// Simple patterns:
1007 /// let v: Vec<&str> = "Mary had a little lamb".split(' ').collect();
1008 /// assert_eq!(v, ["Mary", "had", "a", "little", "lamb"]);
1010 /// let v: Vec<&str> = "".split('X').collect();
1011 /// assert_eq!(v, [""]);
1013 /// let v: Vec<&str> = "lionXXtigerXleopard".split('X').collect();
1014 /// assert_eq!(v, ["lion", "", "tiger", "leopard"]);
1016 /// let v: Vec<&str> = "lion::tiger::leopard".split("::").collect();
1017 /// assert_eq!(v, ["lion", "tiger", "leopard"]);
1019 /// let v: Vec<&str> = "abc1def2ghi".split(char::is_numeric).collect();
1020 /// assert_eq!(v, ["abc", "def", "ghi"]);
1022 /// let v: Vec<&str> = "lionXtigerXleopard".split(char::is_uppercase).collect();
1023 /// assert_eq!(v, ["lion", "tiger", "leopard"]);
1026 /// A more complex pattern, using a closure:
1029 /// let v: Vec<&str> = "abc1defXghi".split(|c| c == '1' || c == 'X').collect();
1030 /// assert_eq!(v, ["abc", "def", "ghi"]);
1033 /// If a string contains multiple contiguous separators, you will end up
1034 /// with empty strings in the output:
1037 /// let x = "||||a||b|c".to_string();
1038 /// let d: Vec<_> = x.split('|').collect();
1040 /// assert_eq!(d, &["", "", "", "", "a", "", "b", "c"]);
1043 /// Contiguous separators are separated by the empty string.
1046 /// let x = "(///)".to_string();
1047 /// let d: Vec<_> = x.split('/').collect();
1049 /// assert_eq!(d, &["(", "", "", ")"]);
1052 /// Separators at the start or end of a string are neighbored
1053 /// by empty strings.
1056 /// let d: Vec<_> = "010".split("0").collect();
1057 /// assert_eq!(d, &["", "1", ""]);
1060 /// When the empty string is used as a separator, it separates
1061 /// every character in the string, along with the beginning
1062 /// and end of the string.
1065 /// let f: Vec<_> = "rust".split("").collect();
1066 /// assert_eq!(f, &["", "r", "u", "s", "t", ""]);
1069 /// Contiguous separators can lead to possibly surprising behavior
1070 /// when whitespace is used as the separator. This code is correct:
1073 /// let x = " a b c".to_string();
1074 /// let d: Vec<_> = x.split(' ').collect();
1076 /// assert_eq!(d, &["", "", "", "", "a", "", "b", "c"]);
1079 /// It does _not_ give you:
1082 /// assert_eq!(d, &["a", "b", "c"]);
1085 /// Use [`split_whitespace`] for this behavior.
1087 /// [`split_whitespace`]: #method.split_whitespace
1088 #[stable(feature = "rust1", since = "1.0.0")]
1090 pub fn split
<'a
, P
: Pattern
<'a
>>(&'a
self, pat
: P
) -> Split
<'a
, P
> {
1091 core_str
::StrExt
::split(self, pat
)
1094 /// An iterator over substrings of the given string slice, separated by
1095 /// characters matched by a pattern and yielded in reverse order.
1097 /// The pattern can be a `&str`, [`char`], or a closure that determines the
1100 /// [`char`]: primitive.char.html
1102 /// # Iterator behavior
1104 /// The returned iterator requires that the pattern supports a reverse
1105 /// search, and it will be a [`DoubleEndedIterator`] if a forward/reverse
1106 /// search yields the same elements.
1108 /// [`DoubleEndedIterator`]: iter/trait.DoubleEndedIterator.html
1110 /// For iterating from the front, the [`split`] method can be used.
1112 /// [`split`]: #method.split
1116 /// Simple patterns:
1119 /// let v: Vec<&str> = "Mary had a little lamb".rsplit(' ').collect();
1120 /// assert_eq!(v, ["lamb", "little", "a", "had", "Mary"]);
1122 /// let v: Vec<&str> = "".rsplit('X').collect();
1123 /// assert_eq!(v, [""]);
1125 /// let v: Vec<&str> = "lionXXtigerXleopard".rsplit('X').collect();
1126 /// assert_eq!(v, ["leopard", "tiger", "", "lion"]);
1128 /// let v: Vec<&str> = "lion::tiger::leopard".rsplit("::").collect();
1129 /// assert_eq!(v, ["leopard", "tiger", "lion"]);
1132 /// A more complex pattern, using a closure:
1135 /// let v: Vec<&str> = "abc1defXghi".rsplit(|c| c == '1' || c == 'X').collect();
1136 /// assert_eq!(v, ["ghi", "def", "abc"]);
1138 #[stable(feature = "rust1", since = "1.0.0")]
1140 pub fn rsplit
<'a
, P
: Pattern
<'a
>>(&'a
self, pat
: P
) -> RSplit
<'a
, P
>
1141 where P
::Searcher
: ReverseSearcher
<'a
>
1143 core_str
::StrExt
::rsplit(self, pat
)
1146 /// An iterator over substrings of the given string slice, separated by
1147 /// characters matched by a pattern.
1149 /// The pattern can be a `&str`, [`char`], or a closure that determines the
1152 /// Equivalent to [`split`], except that the trailing substring
1153 /// is skipped if empty.
1155 /// [`split`]: #method.split
1157 /// This method can be used for string data that is _terminated_,
1158 /// rather than _separated_ by a pattern.
1160 /// # Iterator behavior
1162 /// The returned iterator will be a [`DoubleEndedIterator`] if the pattern
1163 /// allows a reverse search and forward/reverse search yields the same
1164 /// elements. This is true for, eg, [`char`] but not for `&str`.
1166 /// [`DoubleEndedIterator`]: iter/trait.DoubleEndedIterator.html
1167 /// [`char`]: primitive.char.html
1169 /// If the pattern allows a reverse search but its results might differ
1170 /// from a forward search, the [`rsplit_terminator`] method can be used.
1172 /// [`rsplit_terminator`]: #method.rsplit_terminator
1179 /// let v: Vec<&str> = "A.B.".split_terminator('.').collect();
1180 /// assert_eq!(v, ["A", "B"]);
1182 /// let v: Vec<&str> = "A..B..".split_terminator(".").collect();
1183 /// assert_eq!(v, ["A", "", "B", ""]);
1185 #[stable(feature = "rust1", since = "1.0.0")]
1187 pub fn split_terminator
<'a
, P
: Pattern
<'a
>>(&'a
self, pat
: P
) -> SplitTerminator
<'a
, P
> {
1188 core_str
::StrExt
::split_terminator(self, pat
)
1191 /// An iterator over substrings of `self`, separated by characters
1192 /// matched by a pattern and yielded in reverse order.
1194 /// The pattern can be a simple `&str`, [`char`], or a closure that
1195 /// determines the split.
1196 /// Additional libraries might provide more complex patterns like
1197 /// regular expressions.
1199 /// [`char`]: primitive.char.html
1201 /// Equivalent to [`split`], except that the trailing substring is
1202 /// skipped if empty.
1204 /// [`split`]: #method.split
1206 /// This method can be used for string data that is _terminated_,
1207 /// rather than _separated_ by a pattern.
1209 /// # Iterator behavior
1211 /// The returned iterator requires that the pattern supports a
1212 /// reverse search, and it will be double ended if a forward/reverse
1213 /// search yields the same elements.
1215 /// For iterating from the front, the [`split_terminator`] method can be
1218 /// [`split_terminator`]: #method.split_terminator
1223 /// let v: Vec<&str> = "A.B.".rsplit_terminator('.').collect();
1224 /// assert_eq!(v, ["B", "A"]);
1226 /// let v: Vec<&str> = "A..B..".rsplit_terminator(".").collect();
1227 /// assert_eq!(v, ["", "B", "", "A"]);
1229 #[stable(feature = "rust1", since = "1.0.0")]
1231 pub fn rsplit_terminator
<'a
, P
: Pattern
<'a
>>(&'a
self, pat
: P
) -> RSplitTerminator
<'a
, P
>
1232 where P
::Searcher
: ReverseSearcher
<'a
>
1234 core_str
::StrExt
::rsplit_terminator(self, pat
)
1237 /// An iterator over substrings of the given string slice, separated by a
1238 /// pattern, restricted to returning at most `n` items.
1240 /// If `n` substrings are returned, the last substring (the `n`th substring)
1241 /// will contain the remainder of the string.
1243 /// The pattern can be a `&str`, [`char`], or a closure that determines the
1246 /// [`char`]: primitive.char.html
1248 /// # Iterator behavior
1250 /// The returned iterator will not be double ended, because it is
1251 /// not efficient to support.
1253 /// If the pattern allows a reverse search, the [`rsplitn`] method can be
1256 /// [`rsplitn`]: #method.rsplitn
1260 /// Simple patterns:
1263 /// let v: Vec<&str> = "Mary had a little lambda".splitn(3, ' ').collect();
1264 /// assert_eq!(v, ["Mary", "had", "a little lambda"]);
1266 /// let v: Vec<&str> = "lionXXtigerXleopard".splitn(3, "X").collect();
1267 /// assert_eq!(v, ["lion", "", "tigerXleopard"]);
1269 /// let v: Vec<&str> = "abcXdef".splitn(1, 'X').collect();
1270 /// assert_eq!(v, ["abcXdef"]);
1272 /// let v: Vec<&str> = "".splitn(1, 'X').collect();
1273 /// assert_eq!(v, [""]);
1276 /// A more complex pattern, using a closure:
1279 /// let v: Vec<&str> = "abc1defXghi".splitn(2, |c| c == '1' || c == 'X').collect();
1280 /// assert_eq!(v, ["abc", "defXghi"]);
1282 #[stable(feature = "rust1", since = "1.0.0")]
1284 pub fn splitn
<'a
, P
: Pattern
<'a
>>(&'a
self, n
: usize, pat
: P
) -> SplitN
<'a
, P
> {
1285 core_str
::StrExt
::splitn(self, n
, pat
)
1288 /// An iterator over substrings of this string slice, separated by a
1289 /// pattern, starting from the end of the string, restricted to returning
1290 /// at most `n` items.
1292 /// If `n` substrings are returned, the last substring (the `n`th substring)
1293 /// will contain the remainder of the string.
1295 /// The pattern can be a `&str`, [`char`], or a closure that
1296 /// determines the split.
1298 /// [`char`]: primitive.char.html
1300 /// # Iterator behavior
1302 /// The returned iterator will not be double ended, because it is not
1303 /// efficient to support.
1305 /// For splitting from the front, the [`splitn`] method can be used.
1307 /// [`splitn`]: #method.splitn
1311 /// Simple patterns:
1314 /// let v: Vec<&str> = "Mary had a little lamb".rsplitn(3, ' ').collect();
1315 /// assert_eq!(v, ["lamb", "little", "Mary had a"]);
1317 /// let v: Vec<&str> = "lionXXtigerXleopard".rsplitn(3, 'X').collect();
1318 /// assert_eq!(v, ["leopard", "tiger", "lionX"]);
1320 /// let v: Vec<&str> = "lion::tiger::leopard".rsplitn(2, "::").collect();
1321 /// assert_eq!(v, ["leopard", "lion::tiger"]);
1324 /// A more complex pattern, using a closure:
1327 /// let v: Vec<&str> = "abc1defXghi".rsplitn(2, |c| c == '1' || c == 'X').collect();
1328 /// assert_eq!(v, ["ghi", "abc1def"]);
1330 #[stable(feature = "rust1", since = "1.0.0")]
1332 pub fn rsplitn
<'a
, P
: Pattern
<'a
>>(&'a
self, n
: usize, pat
: P
) -> RSplitN
<'a
, P
>
1333 where P
::Searcher
: ReverseSearcher
<'a
>
1335 core_str
::StrExt
::rsplitn(self, n
, pat
)
1338 /// An iterator over the disjoint matches of a pattern within the given string
1341 /// The pattern can be a `&str`, [`char`], or a closure that
1342 /// determines if a character matches.
1344 /// [`char`]: primitive.char.html
1346 /// # Iterator behavior
1348 /// The returned iterator will be a [`DoubleEndedIterator`] if the pattern
1349 /// allows a reverse search and forward/reverse search yields the same
1350 /// elements. This is true for, eg, [`char`] but not for `&str`.
1352 /// [`DoubleEndedIterator`]: iter/trait.DoubleEndedIterator.html
1353 /// [`char`]: primitive.char.html
1355 /// If the pattern allows a reverse search but its results might differ
1356 /// from a forward search, the [`rmatches`] method can be used.
1358 /// [`rmatches`]: #method.rmatches
1365 /// let v: Vec<&str> = "abcXXXabcYYYabc".matches("abc").collect();
1366 /// assert_eq!(v, ["abc", "abc", "abc"]);
1368 /// let v: Vec<&str> = "1abc2abc3".matches(char::is_numeric).collect();
1369 /// assert_eq!(v, ["1", "2", "3"]);
1371 #[stable(feature = "str_matches", since = "1.2.0")]
1373 pub fn matches
<'a
, P
: Pattern
<'a
>>(&'a
self, pat
: P
) -> Matches
<'a
, P
> {
1374 core_str
::StrExt
::matches(self, pat
)
1377 /// An iterator over the disjoint matches of a pattern within this string slice,
1378 /// yielded in reverse order.
1380 /// The pattern can be a `&str`, [`char`], or a closure that determines if
1381 /// a character matches.
1383 /// [`char`]: primitive.char.html
1385 /// # Iterator behavior
1387 /// The returned iterator requires that the pattern supports a reverse
1388 /// search, and it will be a [`DoubleEndedIterator`] if a forward/reverse
1389 /// search yields the same elements.
1391 /// [`DoubleEndedIterator`]: iter/trait.DoubleEndedIterator.html
1393 /// For iterating from the front, the [`matches`] method can be used.
1395 /// [`matches`]: #method.matches
1402 /// let v: Vec<&str> = "abcXXXabcYYYabc".rmatches("abc").collect();
1403 /// assert_eq!(v, ["abc", "abc", "abc"]);
1405 /// let v: Vec<&str> = "1abc2abc3".rmatches(char::is_numeric).collect();
1406 /// assert_eq!(v, ["3", "2", "1"]);
1408 #[stable(feature = "str_matches", since = "1.2.0")]
1410 pub fn rmatches
<'a
, P
: Pattern
<'a
>>(&'a
self, pat
: P
) -> RMatches
<'a
, P
>
1411 where P
::Searcher
: ReverseSearcher
<'a
>
1413 core_str
::StrExt
::rmatches(self, pat
)
1416 /// An iterator over the disjoint matches of a pattern within this string
1417 /// slice as well as the index that the match starts at.
1419 /// For matches of `pat` within `self` that overlap, only the indices
1420 /// corresponding to the first match are returned.
1422 /// The pattern can be a `&str`, [`char`], or a closure that determines
1423 /// if a character matches.
1425 /// [`char`]: primitive.char.html
1427 /// # Iterator behavior
1429 /// The returned iterator will be a [`DoubleEndedIterator`] if the pattern
1430 /// allows a reverse search and forward/reverse search yields the same
1431 /// elements. This is true for, eg, [`char`] but not for `&str`.
1433 /// [`DoubleEndedIterator`]: iter/trait.DoubleEndedIterator.html
1435 /// If the pattern allows a reverse search but its results might differ
1436 /// from a forward search, the [`rmatch_indices`] method can be used.
1438 /// [`rmatch_indices`]: #method.rmatch_indices
1445 /// let v: Vec<_> = "abcXXXabcYYYabc".match_indices("abc").collect();
1446 /// assert_eq!(v, [(0, "abc"), (6, "abc"), (12, "abc")]);
1448 /// let v: Vec<_> = "1abcabc2".match_indices("abc").collect();
1449 /// assert_eq!(v, [(1, "abc"), (4, "abc")]);
1451 /// let v: Vec<_> = "ababa".match_indices("aba").collect();
1452 /// assert_eq!(v, [(0, "aba")]); // only the first `aba`
1454 #[stable(feature = "str_match_indices", since = "1.5.0")]
1456 pub fn match_indices
<'a
, P
: Pattern
<'a
>>(&'a
self, pat
: P
) -> MatchIndices
<'a
, P
> {
1457 core_str
::StrExt
::match_indices(self, pat
)
1460 /// An iterator over the disjoint matches of a pattern within `self`,
1461 /// yielded in reverse order along with the index of the match.
1463 /// For matches of `pat` within `self` that overlap, only the indices
1464 /// corresponding to the last match are returned.
1466 /// The pattern can be a `&str`, [`char`], or a closure that determines if a
1467 /// character matches.
1469 /// [`char`]: primitive.char.html
1471 /// # Iterator behavior
1473 /// The returned iterator requires that the pattern supports a reverse
1474 /// search, and it will be a [`DoubleEndedIterator`] if a forward/reverse
1475 /// search yields the same elements.
1477 /// [`DoubleEndedIterator`]: iter/trait.DoubleEndedIterator.html
1479 /// For iterating from the front, the [`match_indices`] method can be used.
1481 /// [`match_indices`]: #method.match_indices
1488 /// let v: Vec<_> = "abcXXXabcYYYabc".rmatch_indices("abc").collect();
1489 /// assert_eq!(v, [(12, "abc"), (6, "abc"), (0, "abc")]);
1491 /// let v: Vec<_> = "1abcabc2".rmatch_indices("abc").collect();
1492 /// assert_eq!(v, [(4, "abc"), (1, "abc")]);
1494 /// let v: Vec<_> = "ababa".rmatch_indices("aba").collect();
1495 /// assert_eq!(v, [(2, "aba")]); // only the last `aba`
1497 #[stable(feature = "str_match_indices", since = "1.5.0")]
1499 pub fn rmatch_indices
<'a
, P
: Pattern
<'a
>>(&'a
self, pat
: P
) -> RMatchIndices
<'a
, P
>
1500 where P
::Searcher
: ReverseSearcher
<'a
>
1502 core_str
::StrExt
::rmatch_indices(self, pat
)
1505 /// Returns a string slice with leading and trailing whitespace removed.
1507 /// 'Whitespace' is defined according to the terms of the Unicode Derived
1508 /// Core Property `White_Space`.
1515 /// let s = " Hello\tworld\t";
1517 /// assert_eq!("Hello\tworld", s.trim());
1519 #[stable(feature = "rust1", since = "1.0.0")]
1520 pub fn trim(&self) -> &str {
1521 UnicodeStr
::trim(self)
1524 /// Returns a string slice with leading whitespace removed.
1526 /// 'Whitespace' is defined according to the terms of the Unicode Derived
1527 /// Core Property `White_Space`.
1529 /// # Text directionality
1531 /// A string is a sequence of bytes. 'Left' in this context means the first
1532 /// position of that byte string; for a language like Arabic or Hebrew
1533 /// which are 'right to left' rather than 'left to right', this will be
1534 /// the _right_ side, not the left.
1541 /// let s = " Hello\tworld\t";
1543 /// assert_eq!("Hello\tworld\t", s.trim_left());
1549 /// let s = " English";
1550 /// assert!(Some('E') == s.trim_left().chars().next());
1552 /// let s = " עברית";
1553 /// assert!(Some('ע') == s.trim_left().chars().next());
1555 #[stable(feature = "rust1", since = "1.0.0")]
1556 pub fn trim_left(&self) -> &str {
1557 UnicodeStr
::trim_left(self)
1560 /// Returns a string slice with trailing whitespace removed.
1562 /// 'Whitespace' is defined according to the terms of the Unicode Derived
1563 /// Core Property `White_Space`.
1565 /// # Text directionality
1567 /// A string is a sequence of bytes. 'Right' in this context means the last
1568 /// position of that byte string; for a language like Arabic or Hebrew
1569 /// which are 'right to left' rather than 'left to right', this will be
1570 /// the _left_ side, not the right.
1577 /// let s = " Hello\tworld\t";
1579 /// assert_eq!(" Hello\tworld", s.trim_right());
1585 /// let s = "English ";
1586 /// assert!(Some('h') == s.trim_right().chars().rev().next());
1588 /// let s = "עברית ";
1589 /// assert!(Some('ת') == s.trim_right().chars().rev().next());
1591 #[stable(feature = "rust1", since = "1.0.0")]
1592 pub fn trim_right(&self) -> &str {
1593 UnicodeStr
::trim_right(self)
1596 /// Returns a string slice with all prefixes and suffixes that match a
1597 /// pattern repeatedly removed.
1599 /// The pattern can be a [`char`] or a closure that determines if a
1600 /// character matches.
1602 /// [`char`]: primitive.char.html
1606 /// Simple patterns:
1609 /// assert_eq!("11foo1bar11".trim_matches('1'), "foo1bar");
1610 /// assert_eq!("123foo1bar123".trim_matches(char::is_numeric), "foo1bar");
1612 /// let x: &[_] = &['1', '2'];
1613 /// assert_eq!("12foo1bar12".trim_matches(x), "foo1bar");
1616 /// A more complex pattern, using a closure:
1619 /// assert_eq!("1foo1barXX".trim_matches(|c| c == '1' || c == 'X'), "foo1bar");
1621 #[stable(feature = "rust1", since = "1.0.0")]
1622 pub fn trim_matches
<'a
, P
: Pattern
<'a
>>(&'a
self, pat
: P
) -> &'a
str
1623 where P
::Searcher
: DoubleEndedSearcher
<'a
>
1625 core_str
::StrExt
::trim_matches(self, pat
)
1628 /// Returns a string slice with all prefixes that match a pattern
1629 /// repeatedly removed.
1631 /// The pattern can be a `&str`, [`char`], or a closure that determines if
1632 /// a character matches.
1634 /// [`char`]: primitive.char.html
1636 /// # Text directionality
1638 /// A string is a sequence of bytes. 'Left' in this context means the first
1639 /// position of that byte string; for a language like Arabic or Hebrew
1640 /// which are 'right to left' rather than 'left to right', this will be
1641 /// the _right_ side, not the left.
1648 /// assert_eq!("11foo1bar11".trim_left_matches('1'), "foo1bar11");
1649 /// assert_eq!("123foo1bar123".trim_left_matches(char::is_numeric), "foo1bar123");
1651 /// let x: &[_] = &['1', '2'];
1652 /// assert_eq!("12foo1bar12".trim_left_matches(x), "foo1bar12");
1654 #[stable(feature = "rust1", since = "1.0.0")]
1655 pub fn trim_left_matches
<'a
, P
: Pattern
<'a
>>(&'a
self, pat
: P
) -> &'a
str {
1656 core_str
::StrExt
::trim_left_matches(self, pat
)
1659 /// Returns a string slice with all suffixes that match a pattern
1660 /// repeatedly removed.
1662 /// The pattern can be a `&str`, [`char`], or a closure that
1663 /// determines if a character matches.
1665 /// [`char`]: primitive.char.html
1667 /// # Text directionality
1669 /// A string is a sequence of bytes. 'Right' in this context means the last
1670 /// position of that byte string; for a language like Arabic or Hebrew
1671 /// which are 'right to left' rather than 'left to right', this will be
1672 /// the _left_ side, not the right.
1676 /// Simple patterns:
1679 /// assert_eq!("11foo1bar11".trim_right_matches('1'), "11foo1bar");
1680 /// assert_eq!("123foo1bar123".trim_right_matches(char::is_numeric), "123foo1bar");
1682 /// let x: &[_] = &['1', '2'];
1683 /// assert_eq!("12foo1bar12".trim_right_matches(x), "12foo1bar");
1686 /// A more complex pattern, using a closure:
1689 /// assert_eq!("1fooX".trim_left_matches(|c| c == '1' || c == 'X'), "fooX");
1691 #[stable(feature = "rust1", since = "1.0.0")]
1692 pub fn trim_right_matches
<'a
, P
: Pattern
<'a
>>(&'a
self, pat
: P
) -> &'a
str
1693 where P
::Searcher
: ReverseSearcher
<'a
>
1695 core_str
::StrExt
::trim_right_matches(self, pat
)
1698 /// Parses this string slice into another type.
1700 /// Because `parse` is so general, it can cause problems with type
1701 /// inference. As such, `parse` is one of the few times you'll see
1702 /// the syntax affectionately known as the 'turbofish': `::<>`. This
1703 /// helps the inference algorithm understand specifically which type
1704 /// you're trying to parse into.
1706 /// `parse` can parse any type that implements the [`FromStr`] trait.
1708 /// [`FromStr`]: str/trait.FromStr.html
1712 /// Will return [`Err`] if it's not possible to parse this string slice into
1713 /// the desired type.
1715 /// [`Err`]: str/trait.FromStr.html#associatedtype.Err
1722 /// let four: u32 = "4".parse().unwrap();
1724 /// assert_eq!(4, four);
1727 /// Using the 'turbofish' instead of annotating `four`:
1730 /// let four = "4".parse::<u32>();
1732 /// assert_eq!(Ok(4), four);
1735 /// Failing to parse:
1738 /// let nope = "j".parse::<u32>();
1740 /// assert!(nope.is_err());
1743 #[stable(feature = "rust1", since = "1.0.0")]
1744 pub fn parse
<F
: FromStr
>(&self) -> Result
<F
, F
::Err
> {
1745 core_str
::StrExt
::parse(self)
1748 /// Converts a `Box<str>` into a `Box<[u8]>` without copying or allocating.
1749 #[stable(feature = "str_box_extras", since = "1.20.0")]
1750 pub fn into_boxed_bytes(self: Box
<str>) -> Box
<[u8]> {
1754 /// Replaces all matches of a pattern with another string.
1756 /// `replace` creates a new [`String`], and copies the data from this string slice into it.
1757 /// While doing so, it attempts to find matches of a pattern. If it finds any, it
1758 /// replaces them with the replacement string slice.
1760 /// [`String`]: string/struct.String.html
1767 /// let s = "this is old";
1769 /// assert_eq!("this is new", s.replace("old", "new"));
1772 /// When the pattern doesn't match:
1775 /// let s = "this is old";
1776 /// assert_eq!(s, s.replace("cookie monster", "little lamb"));
1778 #[stable(feature = "rust1", since = "1.0.0")]
1780 pub fn replace
<'a
, P
: Pattern
<'a
>>(&'a
self, from
: P
, to
: &str) -> String
{
1781 let mut result
= String
::new();
1782 let mut last_end
= 0;
1783 for (start
, part
) in self.match_indices(from
) {
1784 result
.push_str(unsafe { self.slice_unchecked(last_end, start) }
);
1785 result
.push_str(to
);
1786 last_end
= start
+ part
.len();
1788 result
.push_str(unsafe { self.slice_unchecked(last_end, self.len()) }
);
1792 /// Replaces first N matches of a pattern with another string.
1794 /// `replacen` creates a new [`String`], and copies the data from this string slice into it.
1795 /// While doing so, it attempts to find matches of a pattern. If it finds any, it
1796 /// replaces them with the replacement string slice at most `count` times.
1798 /// [`String`]: string/struct.String.html
1805 /// let s = "foo foo 123 foo";
1806 /// assert_eq!("new new 123 foo", s.replacen("foo", "new", 2));
1807 /// assert_eq!("faa fao 123 foo", s.replacen('o', "a", 3));
1808 /// assert_eq!("foo foo new23 foo", s.replacen(char::is_numeric, "new", 1));
1811 /// When the pattern doesn't match:
1814 /// let s = "this is old";
1815 /// assert_eq!(s, s.replacen("cookie monster", "little lamb", 10));
1817 #[stable(feature = "str_replacen", since = "1.16.0")]
1818 pub fn replacen
<'a
, P
: Pattern
<'a
>>(&'a
self, pat
: P
, to
: &str, count
: usize) -> String
{
1819 // Hope to reduce the times of re-allocation
1820 let mut result
= String
::with_capacity(32);
1821 let mut last_end
= 0;
1822 for (start
, part
) in self.match_indices(pat
).take(count
) {
1823 result
.push_str(unsafe { self.slice_unchecked(last_end, start) }
);
1824 result
.push_str(to
);
1825 last_end
= start
+ part
.len();
1827 result
.push_str(unsafe { self.slice_unchecked(last_end, self.len()) }
);
1831 /// Returns the lowercase equivalent of this string slice, as a new [`String`].
1833 /// 'Lowercase' is defined according to the terms of the Unicode Derived Core Property
1836 /// Since some characters can expand into multiple characters when changing
1837 /// the case, this function returns a [`String`] instead of modifying the
1838 /// parameter in-place.
1840 /// [`String`]: string/struct.String.html
1847 /// let s = "HELLO";
1849 /// assert_eq!("hello", s.to_lowercase());
1852 /// A tricky example, with sigma:
1855 /// let sigma = "Σ";
1857 /// assert_eq!("σ", sigma.to_lowercase());
1859 /// // but at the end of a word, it's ς, not σ:
1860 /// let odysseus = "ὈΔΥΣΣΕΎΣ";
1862 /// assert_eq!("ὀδυσσεύς", odysseus.to_lowercase());
1865 /// Languages without case are not changed:
1868 /// let new_year = "农历新年";
1870 /// assert_eq!(new_year, new_year.to_lowercase());
1872 #[stable(feature = "unicode_case_mapping", since = "1.2.0")]
1873 pub fn to_lowercase(&self) -> String
{
1874 let mut s
= String
::with_capacity(self.len());
1875 for (i
, c
) in self[..].char_indices() {
1877 // Σ maps to σ, except at the end of a word where it maps to ς.
1878 // This is the only conditional (contextual) but language-independent mapping
1879 // in `SpecialCasing.txt`,
1880 // so hard-code it rather than have a generic "condition" mechanism.
1881 // See https://github.com/rust-lang/rust/issues/26035
1882 map_uppercase_sigma(self, i
, &mut s
)
1884 s
.extend(c
.to_lowercase());
1889 fn map_uppercase_sigma(from
: &str, i
: usize, to
: &mut String
) {
1890 // See http://www.unicode.org/versions/Unicode7.0.0/ch03.pdf#G33992
1891 // for the definition of `Final_Sigma`.
1892 debug_assert
!('Σ'
.len_utf8() == 2);
1893 let is_word_final
= case_ignoreable_then_cased(from
[..i
].chars().rev()) &&
1894 !case_ignoreable_then_cased(from
[i
+ 2..].chars());
1895 to
.push_str(if is_word_final { "ς" }
else { "σ" }
);
1898 fn case_ignoreable_then_cased
<I
: Iterator
<Item
= char>>(iter
: I
) -> bool
{
1899 use std_unicode
::derived_property
::{Cased, Case_Ignorable}
;
1900 match iter
.skip_while(|&c
| Case_Ignorable(c
)).next() {
1901 Some(c
) => Cased(c
),
1907 /// Returns the uppercase equivalent of this string slice, as a new [`String`].
1909 /// 'Uppercase' is defined according to the terms of the Unicode Derived Core Property
1912 /// Since some characters can expand into multiple characters when changing
1913 /// the case, this function returns a [`String`] instead of modifying the
1914 /// parameter in-place.
1916 /// [`String`]: string/struct.String.html
1923 /// let s = "hello";
1925 /// assert_eq!("HELLO", s.to_uppercase());
1928 /// Scripts without case are not changed:
1931 /// let new_year = "农历新年";
1933 /// assert_eq!(new_year, new_year.to_uppercase());
1935 #[stable(feature = "unicode_case_mapping", since = "1.2.0")]
1936 pub fn to_uppercase(&self) -> String
{
1937 let mut s
= String
::with_capacity(self.len());
1938 s
.extend(self.chars().flat_map(|c
| c
.to_uppercase()));
1942 /// Escapes each char in `s` with [`char::escape_debug`].
1944 /// [`char::escape_debug`]: primitive.char.html#method.escape_debug
1945 #[unstable(feature = "str_escape",
1946 reason
= "return type may change to be an iterator",
1948 pub fn escape_debug(&self) -> String
{
1949 self.chars().flat_map(|c
| c
.escape_debug()).collect()
1952 /// Escapes each char in `s` with [`char::escape_default`].
1954 /// [`char::escape_default`]: primitive.char.html#method.escape_default
1955 #[unstable(feature = "str_escape",
1956 reason
= "return type may change to be an iterator",
1958 pub fn escape_default(&self) -> String
{
1959 self.chars().flat_map(|c
| c
.escape_default()).collect()
1962 /// Escapes each char in `s` with [`char::escape_unicode`].
1964 /// [`char::escape_unicode`]: primitive.char.html#method.escape_unicode
1965 #[unstable(feature = "str_escape",
1966 reason
= "return type may change to be an iterator",
1968 pub fn escape_unicode(&self) -> String
{
1969 self.chars().flat_map(|c
| c
.escape_unicode()).collect()
1972 /// Converts a [`Box<str>`] into a [`String`] without copying or allocating.
1974 /// [`String`]: string/struct.String.html
1975 /// [`Box<str>`]: boxed/struct.Box.html
1982 /// let string = String::from("birthday gift");
1983 /// let boxed_str = string.clone().into_boxed_str();
1985 /// assert_eq!(boxed_str.into_string(), string);
1987 #[stable(feature = "box_str", since = "1.4.0")]
1988 pub fn into_string(self: Box
<str>) -> String
{
1990 let slice
= mem
::transmute
::<Box
<str>, Box
<[u8]>>(self);
1991 String
::from_utf8_unchecked(slice
.into_vec())
1995 /// Create a [`String`] by repeating a string `n` times.
1997 /// [`String`]: string/struct.String.html
2004 /// assert_eq!("abc".repeat(4), String::from("abcabcabcabc"));
2006 #[stable(feature = "repeat_str", since = "1.16.0")]
2007 pub fn repeat(&self, n
: usize) -> String
{
2008 let mut s
= String
::with_capacity(self.len() * n
);
2009 s
.extend((0..n
).map(|_
| self));
2014 /// Converts a boxed slice of bytes to a boxed string slice without checking
2015 /// that the string contains valid UTF-8.
2016 #[stable(feature = "str_box_extras", since = "1.20.0")]
2017 pub unsafe fn from_boxed_utf8_unchecked(v
: Box
<[u8]>) -> Box
<str> {