1 // ignore-tidy-filelength
2 // ignore-tidy-undocumented-unsafe
4 //! String manipulation.
6 //! For more details, see the `std::str` module.
8 #![stable(feature = "rust1", since = "1.0.0")]
10 use self::pattern::Pattern;
11 use self::pattern::{Searcher, SearchStep, ReverseSearcher, DoubleEndedSearcher};
14 use crate::fmt::{self, Write};
15 use crate::iter::{Map, Cloned, FusedIterator, TrustedLen, TrustedRandomAccess, Filter};
16 use crate::iter::{Flatten, FlatMap, Chain};
17 use crate::slice::{self, SliceIndex, Split as SliceSplit};
24 #[unstable(feature = "str_internals", issue = "0")]
25 #[allow(missing_docs)]
28 /// Parse a value from a string
30 /// `FromStr`'s [`from_str`] method is often used implicitly, through
31 /// [`str`]'s [`parse`] method. See [`parse`]'s documentation for examples.
33 /// [`from_str`]: #tymethod.from_str
34 /// [`str`]: ../../std/primitive.str.html
35 /// [`parse`]: ../../std/primitive.str.html#method.parse
37 /// `FromStr` does not have a lifetime parameter, and so you can only parse types
38 /// that do not contain a lifetime parameter themselves. In other words, you can
39 /// parse an `i32` with `FromStr`, but not a `&i32`. You can parse a struct that
40 /// contains an `i32`, but not one that contains an `&i32`.
44 /// Basic implementation of `FromStr` on an example `Point` type:
47 /// use std::str::FromStr;
48 /// use std::num::ParseIntError;
50 /// #[derive(Debug, PartialEq)]
56 /// impl FromStr for Point {
57 /// type Err = ParseIntError;
59 /// fn from_str(s: &str) -> Result<Self, Self::Err> {
60 /// let coords: Vec<&str> = s.trim_matches(|p| p == '(' || p == ')' )
64 /// let x_fromstr = coords[0].parse::<i32>()?;
65 /// let y_fromstr = coords[1].parse::<i32>()?;
67 /// Ok(Point { x: x_fromstr, y: y_fromstr })
71 /// let p = Point::from_str("(1,2)");
72 /// assert_eq!(p.unwrap(), Point{ x: 1, y: 2} )
74 #[stable(feature = "rust1", since = "1.0.0")]
75 pub trait FromStr: Sized {
76 /// The associated error which can be returned from parsing.
77 #[stable(feature = "rust1", since = "1.0.0")]
80 /// Parses a string `s` to return a value of this type.
82 /// If parsing succeeds, return the value inside [`Ok`], otherwise
83 /// when the string is ill-formatted return an error specific to the
84 /// inside [`Err`]. The error type is specific to implementation of the trait.
86 /// [`Ok`]: ../../std/result/enum.Result.html#variant.Ok
87 /// [`Err`]: ../../std/result/enum.Result.html#variant.Err
91 /// Basic usage with [`i32`][ithirtytwo], a type that implements `FromStr`:
93 /// [ithirtytwo]: ../../std/primitive.i32.html
96 /// use std::str::FromStr;
99 /// let x = i32::from_str(s).unwrap();
101 /// assert_eq!(5, x);
103 #[stable(feature = "rust1", since = "1.0.0")]
104 fn from_str(s: &str) -> Result<Self, Self::Err>;
107 #[stable(feature = "rust1", since = "1.0.0")]
108 impl FromStr for bool {
109 type Err = ParseBoolError;
111 /// Parse a `bool` from a string.
113 /// Yields a `Result<bool, ParseBoolError>`, because `s` may or may not
114 /// actually be parseable.
119 /// use std::str::FromStr;
121 /// assert_eq!(FromStr::from_str("true"), Ok(true));
122 /// assert_eq!(FromStr::from_str("false"), Ok(false));
123 /// assert!(<bool as FromStr>::from_str("not even a boolean").is_err());
126 /// Note, in many cases, the `.parse()` method on `str` is more proper.
129 /// assert_eq!("true".parse(), Ok(true));
130 /// assert_eq!("false".parse(), Ok(false));
131 /// assert!("not even a boolean".parse::<bool>().is_err());
134 fn from_str(s: &str) -> Result<bool, ParseBoolError> {
137 "false" => Ok(false),
138 _ => Err(ParseBoolError { _priv: () }),
143 /// An error returned when parsing a `bool` using [`from_str`] fails
145 /// [`from_str`]: ../../std/primitive.bool.html#method.from_str
146 #[derive(Debug, Clone, PartialEq, Eq)]
147 #[stable(feature = "rust1", since = "1.0.0")]
148 pub struct ParseBoolError { _priv: () }
150 #[stable(feature = "rust1", since = "1.0.0")]
151 impl fmt::Display for ParseBoolError {
152 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
153 "provided string was not `true` or `false`".fmt(f)
158 Section: Creating a string
161 /// Errors which can occur when attempting to interpret a sequence of [`u8`]
164 /// [`u8`]: ../../std/primitive.u8.html
166 /// As such, the `from_utf8` family of functions and methods for both [`String`]s
167 /// and [`&str`]s make use of this error, for example.
169 /// [`String`]: ../../std/string/struct.String.html#method.from_utf8
170 /// [`&str`]: ../../std/str/fn.from_utf8.html
174 /// This error type’s methods can be used to create functionality
175 /// similar to `String::from_utf8_lossy` without allocating heap memory:
178 /// fn from_utf8_lossy<F>(mut input: &[u8], mut push: F) where F: FnMut(&str) {
180 /// match std::str::from_utf8(input) {
186 /// let (valid, after_valid) = input.split_at(error.valid_up_to());
188 /// push(std::str::from_utf8_unchecked(valid))
190 /// push("\u{FFFD}");
192 /// if let Some(invalid_sequence_length) = error.error_len() {
193 /// input = &after_valid[invalid_sequence_length..]
202 #[derive(Copy, Eq, PartialEq, Clone, Debug)]
203 #[stable(feature = "rust1", since = "1.0.0")]
204 pub struct Utf8Error {
206 error_len: Option<u8>,
210 /// Returns the index in the given string up to which valid UTF-8 was
213 /// It is the maximum index such that `from_utf8(&input[..index])`
214 /// would return `Ok(_)`.
223 /// // some invalid bytes, in a vector
224 /// let sparkle_heart = vec![0, 159, 146, 150];
226 /// // std::str::from_utf8 returns a Utf8Error
227 /// let error = str::from_utf8(&sparkle_heart).unwrap_err();
229 /// // the second byte is invalid here
230 /// assert_eq!(1, error.valid_up_to());
232 #[stable(feature = "utf8_error", since = "1.5.0")]
233 pub fn valid_up_to(&self) -> usize { self.valid_up_to }
235 /// Provides more information about the failure:
237 /// * `None`: the end of the input was reached unexpectedly.
238 /// `self.valid_up_to()` is 1 to 3 bytes from the end of the input.
239 /// If a byte stream (such as a file or a network socket) is being decoded incrementally,
240 /// this could be a valid `char` whose UTF-8 byte sequence is spanning multiple chunks.
242 /// * `Some(len)`: an unexpected byte was encountered.
243 /// The length provided is that of the invalid byte sequence
244 /// that starts at the index given by `valid_up_to()`.
245 /// Decoding should resume after that sequence
246 /// (after inserting a [`U+FFFD REPLACEMENT CHARACTER`][U+FFFD]) in case of
249 /// [U+FFFD]: ../../std/char/constant.REPLACEMENT_CHARACTER.html
250 #[stable(feature = "utf8_error_error_len", since = "1.20.0")]
251 pub fn error_len(&self) -> Option<usize> {
252 self.error_len.map(|len| len as usize)
256 /// Converts a slice of bytes to a string slice.
258 /// A string slice ([`&str`]) is made of bytes ([`u8`]), and a byte slice
259 /// ([`&[u8]`][byteslice]) is made of bytes, so this function converts between
260 /// the two. Not all byte slices are valid string slices, however: [`&str`] requires
261 /// that it is valid UTF-8. `from_utf8()` checks to ensure that the bytes are valid
262 /// UTF-8, and then does the conversion.
264 /// [`&str`]: ../../std/primitive.str.html
265 /// [`u8`]: ../../std/primitive.u8.html
266 /// [byteslice]: ../../std/primitive.slice.html
268 /// If you are sure that the byte slice is valid UTF-8, and you don't want to
269 /// incur the overhead of the validity check, there is an unsafe version of
270 /// this function, [`from_utf8_unchecked`][fromutf8u], which has the same
271 /// behavior but skips the check.
273 /// [fromutf8u]: fn.from_utf8_unchecked.html
275 /// If you need a `String` instead of a `&str`, consider
276 /// [`String::from_utf8`][string].
278 /// [string]: ../../std/string/struct.String.html#method.from_utf8
280 /// Because you can stack-allocate a `[u8; N]`, and you can take a
281 /// [`&[u8]`][byteslice] of it, this function is one way to have a
282 /// stack-allocated string. There is an example of this in the
283 /// examples section below.
285 /// [byteslice]: ../../std/primitive.slice.html
289 /// Returns `Err` if the slice is not UTF-8 with a description as to why the
290 /// provided slice is not UTF-8.
299 /// // some bytes, in a vector
300 /// let sparkle_heart = vec![240, 159, 146, 150];
302 /// // We know these bytes are valid, so just use `unwrap()`.
303 /// let sparkle_heart = str::from_utf8(&sparkle_heart).unwrap();
305 /// assert_eq!("💖", sparkle_heart);
313 /// // some invalid bytes, in a vector
314 /// let sparkle_heart = vec![0, 159, 146, 150];
316 /// assert!(str::from_utf8(&sparkle_heart).is_err());
319 /// See the docs for [`Utf8Error`][error] for more details on the kinds of
320 /// errors that can be returned.
322 /// [error]: struct.Utf8Error.html
324 /// A "stack allocated string":
329 /// // some bytes, in a stack-allocated array
330 /// let sparkle_heart = [240, 159, 146, 150];
332 /// // We know these bytes are valid, so just use `unwrap()`.
333 /// let sparkle_heart = str::from_utf8(&sparkle_heart).unwrap();
335 /// assert_eq!("💖", sparkle_heart);
337 #[stable(feature = "rust1", since = "1.0.0")]
338 pub fn from_utf8(v: &[u8]) -> Result<&str, Utf8Error> {
339 run_utf8_validation(v)?;
340 Ok(unsafe { from_utf8_unchecked(v) })
343 /// Converts a mutable slice of bytes to a mutable string slice.
352 /// // "Hello, Rust!" as a mutable vector
353 /// let mut hellorust = vec![72, 101, 108, 108, 111, 44, 32, 82, 117, 115, 116, 33];
355 /// // As we know these bytes are valid, we can use `unwrap()`
356 /// let outstr = str::from_utf8_mut(&mut hellorust).unwrap();
358 /// assert_eq!("Hello, Rust!", outstr);
366 /// // Some invalid bytes in a mutable vector
367 /// let mut invalid = vec![128, 223];
369 /// assert!(str::from_utf8_mut(&mut invalid).is_err());
371 /// See the docs for [`Utf8Error`][error] for more details on the kinds of
372 /// errors that can be returned.
374 /// [error]: struct.Utf8Error.html
375 #[stable(feature = "str_mut_extras", since = "1.20.0")]
376 pub fn from_utf8_mut(v: &mut [u8]) -> Result<&mut str, Utf8Error> {
377 run_utf8_validation(v)?;
378 Ok(unsafe { from_utf8_unchecked_mut(v) })
381 /// Converts a slice of bytes to a string slice without checking
382 /// that the string contains valid UTF-8.
384 /// See the safe version, [`from_utf8`][fromutf8], for more information.
386 /// [fromutf8]: fn.from_utf8.html
390 /// This function is unsafe because it does not check that the bytes passed to
391 /// it are valid UTF-8. If this constraint is violated, undefined behavior
392 /// results, as the rest of Rust assumes that [`&str`]s are valid UTF-8.
394 /// [`&str`]: ../../std/primitive.str.html
403 /// // some bytes, in a vector
404 /// let sparkle_heart = vec![240, 159, 146, 150];
406 /// let sparkle_heart = unsafe {
407 /// str::from_utf8_unchecked(&sparkle_heart)
410 /// assert_eq!("💖", sparkle_heart);
413 #[stable(feature = "rust1", since = "1.0.0")]
414 pub unsafe fn from_utf8_unchecked(v: &[u8]) -> &str {
415 &*(v as *const [u8] as *const str)
418 /// Converts a slice of bytes to a string slice without checking
419 /// that the string contains valid UTF-8; mutable version.
421 /// See the immutable version, [`from_utf8_unchecked()`][fromutf8], for more information.
423 /// [fromutf8]: fn.from_utf8_unchecked.html
432 /// let mut heart = vec![240, 159, 146, 150];
433 /// let heart = unsafe { str::from_utf8_unchecked_mut(&mut heart) };
435 /// assert_eq!("💖", heart);
438 #[stable(feature = "str_mut_extras", since = "1.20.0")]
439 pub unsafe fn from_utf8_unchecked_mut(v: &mut [u8]) -> &mut str {
440 &mut *(v as *mut [u8] as *mut str)
443 #[stable(feature = "rust1", since = "1.0.0")]
444 impl fmt::Display for Utf8Error {
445 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
446 if let Some(error_len) = self.error_len {
447 write!(f, "invalid utf-8 sequence of {} bytes from index {}",
448 error_len, self.valid_up_to)
450 write!(f, "incomplete utf-8 byte sequence from index {}", self.valid_up_to)
459 /// An iterator over the [`char`]s of a string slice.
461 /// [`char`]: ../../std/primitive.char.html
463 /// This struct is created by the [`chars`] method on [`str`].
464 /// See its documentation for more.
466 /// [`chars`]: ../../std/primitive.str.html#method.chars
467 /// [`str`]: ../../std/primitive.str.html
469 #[stable(feature = "rust1", since = "1.0.0")]
470 pub struct Chars<'a> {
471 iter: slice::Iter<'a, u8>
474 /// Returns the initial codepoint accumulator for the first byte.
475 /// The first byte is special, only want bottom 5 bits for width 2, 4 bits
476 /// for width 3, and 3 bits for width 4.
478 fn utf8_first_byte(byte: u8, width: u32) -> u32 { (byte & (0x7F >> width)) as u32 }
480 /// Returns the value of `ch` updated with continuation byte `byte`.
482 fn utf8_acc_cont_byte(ch: u32, byte: u8) -> u32 { (ch << 6) | (byte & CONT_MASK) as u32 }
484 /// Checks whether the byte is a UTF-8 continuation byte (i.e., starts with the
487 fn utf8_is_cont_byte(byte: u8) -> bool { (byte & !CONT_MASK) == TAG_CONT_U8 }
490 fn unwrap_or_0(opt: Option<&u8>) -> u8 {
497 /// Reads the next code point out of a byte iterator (assuming a
498 /// UTF-8-like encoding).
499 #[unstable(feature = "str_internals", issue = "0")]
501 pub fn next_code_point<'a, I: Iterator<Item = &'a u8>>(bytes: &mut I) -> Option<u32> {
503 let x = *bytes.next()?;
505 return Some(x as u32)
508 // Multibyte case follows
509 // Decode from a byte combination out of: [[[x y] z] w]
510 // NOTE: Performance is sensitive to the exact formulation here
511 let init = utf8_first_byte(x, 2);
512 let y = unwrap_or_0(bytes.next());
513 let mut ch = utf8_acc_cont_byte(init, y);
516 // 5th bit in 0xE0 .. 0xEF is always clear, so `init` is still valid
517 let z = unwrap_or_0(bytes.next());
518 let y_z = utf8_acc_cont_byte((y & CONT_MASK) as u32, z);
519 ch = init << 12 | y_z;
522 // use only the lower 3 bits of `init`
523 let w = unwrap_or_0(bytes.next());
524 ch = (init & 7) << 18 | utf8_acc_cont_byte(y_z, w);
531 /// Reads the last code point out of a byte iterator (assuming a
532 /// UTF-8-like encoding).
534 fn next_code_point_reverse<'a, I>(bytes: &mut I) -> Option<u32>
535 where I: DoubleEndedIterator<Item = &'a u8>,
538 let w = match *bytes.next_back()? {
539 next_byte if next_byte < 128 => return Some(next_byte as u32),
540 back_byte => back_byte,
543 // Multibyte case follows
544 // Decode from a byte combination out of: [x [y [z w]]]
546 let z = unwrap_or_0(bytes.next_back());
547 ch = utf8_first_byte(z, 2);
548 if utf8_is_cont_byte(z) {
549 let y = unwrap_or_0(bytes.next_back());
550 ch = utf8_first_byte(y, 3);
551 if utf8_is_cont_byte(y) {
552 let x = unwrap_or_0(bytes.next_back());
553 ch = utf8_first_byte(x, 4);
554 ch = utf8_acc_cont_byte(ch, y);
556 ch = utf8_acc_cont_byte(ch, z);
558 ch = utf8_acc_cont_byte(ch, w);
563 #[stable(feature = "rust1", since = "1.0.0")]
564 impl<'a> Iterator for Chars<'a> {
568 fn next(&mut self) -> Option<char> {
569 next_code_point(&mut self.iter).map(|ch| {
570 // str invariant says `ch` is a valid Unicode Scalar Value
572 char::from_u32_unchecked(ch)
578 fn count(self) -> usize {
579 // length in `char` is equal to the number of non-continuation bytes
580 let bytes_len = self.iter.len();
581 let mut cont_bytes = 0;
582 for &byte in self.iter {
583 cont_bytes += utf8_is_cont_byte(byte) as usize;
585 bytes_len - cont_bytes
589 fn size_hint(&self) -> (usize, Option<usize>) {
590 let len = self.iter.len();
591 // `(len + 3)` can't overflow, because we know that the `slice::Iter`
592 // belongs to a slice in memory which has a maximum length of
593 // `isize::MAX` (that's well below `usize::MAX`).
594 ((len + 3) / 4, Some(len))
598 fn last(mut self) -> Option<char> {
599 // No need to go through the entire string.
604 #[stable(feature = "chars_debug_impl", since = "1.38.0")]
605 impl fmt::Debug for Chars<'_> {
606 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
607 write!(f, "Chars(")?;
608 f.debug_list().entries(self.clone()).finish()?;
614 #[stable(feature = "rust1", since = "1.0.0")]
615 impl<'a> DoubleEndedIterator for Chars<'a> {
617 fn next_back(&mut self) -> Option<char> {
618 next_code_point_reverse(&mut self.iter).map(|ch| {
619 // str invariant says `ch` is a valid Unicode Scalar Value
621 char::from_u32_unchecked(ch)
627 #[stable(feature = "fused", since = "1.26.0")]
628 impl FusedIterator for Chars<'_> {}
631 /// Views the underlying data as a subslice of the original data.
633 /// This has the same lifetime as the original slice, and so the
634 /// iterator can continue to be used while this exists.
639 /// let mut chars = "abc".chars();
641 /// assert_eq!(chars.as_str(), "abc");
643 /// assert_eq!(chars.as_str(), "bc");
646 /// assert_eq!(chars.as_str(), "");
648 #[stable(feature = "iter_to_slice", since = "1.4.0")]
650 pub fn as_str(&self) -> &'a str {
651 unsafe { from_utf8_unchecked(self.iter.as_slice()) }
655 /// An iterator over the [`char`]s of a string slice, and their positions.
657 /// [`char`]: ../../std/primitive.char.html
659 /// This struct is created by the [`char_indices`] method on [`str`].
660 /// See its documentation for more.
662 /// [`char_indices`]: ../../std/primitive.str.html#method.char_indices
663 /// [`str`]: ../../std/primitive.str.html
664 #[derive(Clone, Debug)]
665 #[stable(feature = "rust1", since = "1.0.0")]
666 pub struct CharIndices<'a> {
671 #[stable(feature = "rust1", since = "1.0.0")]
672 impl<'a> Iterator for CharIndices<'a> {
673 type Item = (usize, char);
676 fn next(&mut self) -> Option<(usize, char)> {
677 let pre_len = self.iter.iter.len();
678 match self.iter.next() {
681 let index = self.front_offset;
682 let len = self.iter.iter.len();
683 self.front_offset += pre_len - len;
690 fn count(self) -> usize {
695 fn size_hint(&self) -> (usize, Option<usize>) {
696 self.iter.size_hint()
700 fn last(mut self) -> Option<(usize, char)> {
701 // No need to go through the entire string.
706 #[stable(feature = "rust1", since = "1.0.0")]
707 impl<'a> DoubleEndedIterator for CharIndices<'a> {
709 fn next_back(&mut self) -> Option<(usize, char)> {
710 self.iter.next_back().map(|ch| {
711 let index = self.front_offset + self.iter.iter.len();
717 #[stable(feature = "fused", since = "1.26.0")]
718 impl FusedIterator for CharIndices<'_> {}
720 impl<'a> CharIndices<'a> {
721 /// Views the underlying data as a subslice of the original data.
723 /// This has the same lifetime as the original slice, and so the
724 /// iterator can continue to be used while this exists.
725 #[stable(feature = "iter_to_slice", since = "1.4.0")]
727 pub fn as_str(&self) -> &'a str {
732 /// An iterator over the bytes of a string slice.
734 /// This struct is created by the [`bytes`] method on [`str`].
735 /// See its documentation for more.
737 /// [`bytes`]: ../../std/primitive.str.html#method.bytes
738 /// [`str`]: ../../std/primitive.str.html
739 #[stable(feature = "rust1", since = "1.0.0")]
740 #[derive(Clone, Debug)]
741 pub struct Bytes<'a>(Cloned<slice::Iter<'a, u8>>);
743 #[stable(feature = "rust1", since = "1.0.0")]
744 impl Iterator for Bytes<'_> {
748 fn next(&mut self) -> Option<u8> {
753 fn size_hint(&self) -> (usize, Option<usize>) {
758 fn count(self) -> usize {
763 fn last(self) -> Option<Self::Item> {
768 fn nth(&mut self, n: usize) -> Option<Self::Item> {
773 fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool {
778 fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool {
783 fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where
784 P: FnMut(&Self::Item) -> bool
786 self.0.find(predicate)
790 fn position<P>(&mut self, predicate: P) -> Option<usize> where
791 P: FnMut(Self::Item) -> bool
793 self.0.position(predicate)
797 fn rposition<P>(&mut self, predicate: P) -> Option<usize> where
798 P: FnMut(Self::Item) -> bool
800 self.0.rposition(predicate)
804 #[stable(feature = "rust1", since = "1.0.0")]
805 impl DoubleEndedIterator for Bytes<'_> {
807 fn next_back(&mut self) -> Option<u8> {
812 fn nth_back(&mut self, n: usize) -> Option<Self::Item> {
817 fn rfind<P>(&mut self, predicate: P) -> Option<Self::Item> where
818 P: FnMut(&Self::Item) -> bool
820 self.0.rfind(predicate)
824 #[stable(feature = "rust1", since = "1.0.0")]
825 impl ExactSizeIterator for Bytes<'_> {
827 fn len(&self) -> usize {
832 fn is_empty(&self) -> bool {
837 #[stable(feature = "fused", since = "1.26.0")]
838 impl FusedIterator for Bytes<'_> {}
840 #[unstable(feature = "trusted_len", issue = "37572")]
841 unsafe impl TrustedLen for Bytes<'_> {}
844 unsafe impl TrustedRandomAccess for Bytes<'_> {
845 unsafe fn get_unchecked(&mut self, i: usize) -> u8 {
846 self.0.get_unchecked(i)
848 fn may_have_side_effect() -> bool { false }
851 /// This macro generates a Clone impl for string pattern API
852 /// wrapper types of the form X<'a, P>
853 macro_rules! derive_pattern_clone {
854 (clone $t:ident with |$s:ident| $e:expr) => {
855 impl<'a, P> Clone for $t<'a, P>
857 P: Pattern<'a, Searcher: Clone>,
859 fn clone(&self) -> Self {
867 /// This macro generates two public iterator structs
868 /// wrapping a private internal one that makes use of the `Pattern` API.
870 /// For all patterns `P: Pattern<'a>` the following items will be
871 /// generated (generics omitted):
873 /// struct $forward_iterator($internal_iterator);
874 /// struct $reverse_iterator($internal_iterator);
876 /// impl Iterator for $forward_iterator
877 /// { /* internal ends up calling Searcher::next_match() */ }
879 /// impl DoubleEndedIterator for $forward_iterator
880 /// where P::Searcher: DoubleEndedSearcher
881 /// { /* internal ends up calling Searcher::next_match_back() */ }
883 /// impl Iterator for $reverse_iterator
884 /// where P::Searcher: ReverseSearcher
885 /// { /* internal ends up calling Searcher::next_match_back() */ }
887 /// impl DoubleEndedIterator for $reverse_iterator
888 /// where P::Searcher: DoubleEndedSearcher
889 /// { /* internal ends up calling Searcher::next_match() */ }
891 /// The internal one is defined outside the macro, and has almost the same
892 /// semantic as a DoubleEndedIterator by delegating to `pattern::Searcher` and
893 /// `pattern::ReverseSearcher` for both forward and reverse iteration.
895 /// "Almost", because a `Searcher` and a `ReverseSearcher` for a given
896 /// `Pattern` might not return the same elements, so actually implementing
897 /// `DoubleEndedIterator` for it would be incorrect.
898 /// (See the docs in `str::pattern` for more details)
900 /// However, the internal struct still represents a single ended iterator from
901 /// either end, and depending on pattern is also a valid double ended iterator,
902 /// so the two wrapper structs implement `Iterator`
903 /// and `DoubleEndedIterator` depending on the concrete pattern type, leading
904 /// to the complex impls seen above.
905 macro_rules! generate_pattern_iterators {
909 $(#[$forward_iterator_attribute:meta])*
910 struct $forward_iterator:ident;
914 $(#[$reverse_iterator_attribute:meta])*
915 struct $reverse_iterator:ident;
917 // Stability of all generated items
919 $(#[$common_stability_attribute:meta])*
921 // Internal almost-iterator that is being delegated to
923 $internal_iterator:ident yielding ($iterty:ty);
925 // Kind of delegation - either single ended or double ended
928 $(#[$forward_iterator_attribute])*
929 $(#[$common_stability_attribute])*
930 pub struct $forward_iterator<'a, P: Pattern<'a>>($internal_iterator<'a, P>);
932 $(#[$common_stability_attribute])*
933 impl<'a, P> fmt::Debug for $forward_iterator<'a, P>
935 P: Pattern<'a, Searcher: fmt::Debug>,
937 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
938 f.debug_tuple(stringify!($forward_iterator))
944 $(#[$common_stability_attribute])*
945 impl<'a, P: Pattern<'a>> Iterator for $forward_iterator<'a, P> {
949 fn next(&mut self) -> Option<$iterty> {
954 $(#[$common_stability_attribute])*
955 impl<'a, P> Clone for $forward_iterator<'a, P>
957 P: Pattern<'a, Searcher: Clone>,
959 fn clone(&self) -> Self {
960 $forward_iterator(self.0.clone())
964 $(#[$reverse_iterator_attribute])*
965 $(#[$common_stability_attribute])*
966 pub struct $reverse_iterator<'a, P: Pattern<'a>>($internal_iterator<'a, P>);
968 $(#[$common_stability_attribute])*
969 impl<'a, P> fmt::Debug for $reverse_iterator<'a, P>
971 P: Pattern<'a, Searcher: fmt::Debug>,
973 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
974 f.debug_tuple(stringify!($reverse_iterator))
980 $(#[$common_stability_attribute])*
981 impl<'a, P> Iterator for $reverse_iterator<'a, P>
983 P: Pattern<'a, Searcher: ReverseSearcher<'a>>,
988 fn next(&mut self) -> Option<$iterty> {
993 $(#[$common_stability_attribute])*
994 impl<'a, P> Clone for $reverse_iterator<'a, P>
996 P: Pattern<'a, Searcher: Clone>,
998 fn clone(&self) -> Self {
999 $reverse_iterator(self.0.clone())
1003 #[stable(feature = "fused", since = "1.26.0")]
1004 impl<'a, P: Pattern<'a>> FusedIterator for $forward_iterator<'a, P> {}
1006 #[stable(feature = "fused", since = "1.26.0")]
1007 impl<'a, P> FusedIterator for $reverse_iterator<'a, P>
1009 P: Pattern<'a, Searcher: ReverseSearcher<'a>>,
1012 generate_pattern_iterators!($($t)* with $(#[$common_stability_attribute])*,
1014 $reverse_iterator, $iterty);
1017 double ended; with $(#[$common_stability_attribute:meta])*,
1018 $forward_iterator:ident,
1019 $reverse_iterator:ident, $iterty:ty
1021 $(#[$common_stability_attribute])*
1022 impl<'a, P> DoubleEndedIterator for $forward_iterator<'a, P>
1024 P: Pattern<'a, Searcher: DoubleEndedSearcher<'a>>,
1027 fn next_back(&mut self) -> Option<$iterty> {
1032 $(#[$common_stability_attribute])*
1033 impl<'a, P> DoubleEndedIterator for $reverse_iterator<'a, P>
1035 P: Pattern<'a, Searcher: DoubleEndedSearcher<'a>>,
1038 fn next_back(&mut self) -> Option<$iterty> {
1044 single ended; with $(#[$common_stability_attribute:meta])*,
1045 $forward_iterator:ident,
1046 $reverse_iterator:ident, $iterty:ty
1050 derive_pattern_clone!{
1052 with |s| SplitInternal { matcher: s.matcher.clone(), ..*s }
1055 struct SplitInternal<'a, P: Pattern<'a>> {
1058 matcher: P::Searcher,
1059 allow_trailing_empty: bool,
1063 impl<'a, P> fmt::Debug for SplitInternal<'a, P>
1065 P: Pattern<'a, Searcher: fmt::Debug>,
1067 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1068 f.debug_struct("SplitInternal")
1069 .field("start", &self.start)
1070 .field("end", &self.end)
1071 .field("matcher", &self.matcher)
1072 .field("allow_trailing_empty", &self.allow_trailing_empty)
1073 .field("finished", &self.finished)
1078 impl<'a, P: Pattern<'a>> SplitInternal<'a, P> {
1080 fn get_end(&mut self) -> Option<&'a str> {
1081 if !self.finished && (self.allow_trailing_empty || self.end - self.start > 0) {
1082 self.finished = true;
1084 let string = self.matcher.haystack().get_unchecked(self.start..self.end);
1093 fn next(&mut self) -> Option<&'a str> {
1094 if self.finished { return None }
1096 let haystack = self.matcher.haystack();
1097 match self.matcher.next_match() {
1098 Some((a, b)) => unsafe {
1099 let elt = haystack.get_unchecked(self.start..a);
1103 None => self.get_end(),
1108 fn next_back(&mut self) -> Option<&'a str>
1109 where P::Searcher: ReverseSearcher<'a>
1111 if self.finished { return None }
1113 if !self.allow_trailing_empty {
1114 self.allow_trailing_empty = true;
1115 match self.next_back() {
1116 Some(elt) if !elt.is_empty() => return Some(elt),
1117 _ => if self.finished { return None }
1121 let haystack = self.matcher.haystack();
1122 match self.matcher.next_match_back() {
1123 Some((a, b)) => unsafe {
1124 let elt = haystack.get_unchecked(b..self.end);
1129 self.finished = true;
1130 Some(haystack.get_unchecked(self.start..self.end))
1136 generate_pattern_iterators! {
1138 /// Created with the method [`split`].
1140 /// [`split`]: ../../std/primitive.str.html#method.split
1143 /// Created with the method [`rsplit`].
1145 /// [`rsplit`]: ../../std/primitive.str.html#method.rsplit
1148 #[stable(feature = "rust1", since = "1.0.0")]
1150 SplitInternal yielding (&'a str);
1151 delegate double ended;
1154 generate_pattern_iterators! {
1156 /// Created with the method [`split_terminator`].
1158 /// [`split_terminator`]: ../../std/primitive.str.html#method.split_terminator
1159 struct SplitTerminator;
1161 /// Created with the method [`rsplit_terminator`].
1163 /// [`rsplit_terminator`]: ../../std/primitive.str.html#method.rsplit_terminator
1164 struct RSplitTerminator;
1166 #[stable(feature = "rust1", since = "1.0.0")]
1168 SplitInternal yielding (&'a str);
1169 delegate double ended;
1172 derive_pattern_clone!{
1173 clone SplitNInternal
1174 with |s| SplitNInternal { iter: s.iter.clone(), ..*s }
1177 struct SplitNInternal<'a, P: Pattern<'a>> {
1178 iter: SplitInternal<'a, P>,
1179 /// The number of splits remaining
1183 impl<'a, P> fmt::Debug for SplitNInternal<'a, P>
1185 P: Pattern<'a, Searcher: fmt::Debug>,
1187 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1188 f.debug_struct("SplitNInternal")
1189 .field("iter", &self.iter)
1190 .field("count", &self.count)
1195 impl<'a, P: Pattern<'a>> SplitNInternal<'a, P> {
1197 fn next(&mut self) -> Option<&'a str> {
1200 1 => { self.count = 0; self.iter.get_end() }
1201 _ => { self.count -= 1; self.iter.next() }
1206 fn next_back(&mut self) -> Option<&'a str>
1207 where P::Searcher: ReverseSearcher<'a>
1211 1 => { self.count = 0; self.iter.get_end() }
1212 _ => { self.count -= 1; self.iter.next_back() }
1217 generate_pattern_iterators! {
1219 /// Created with the method [`splitn`].
1221 /// [`splitn`]: ../../std/primitive.str.html#method.splitn
1224 /// Created with the method [`rsplitn`].
1226 /// [`rsplitn`]: ../../std/primitive.str.html#method.rsplitn
1229 #[stable(feature = "rust1", since = "1.0.0")]
1231 SplitNInternal yielding (&'a str);
1232 delegate single ended;
1235 derive_pattern_clone!{
1236 clone MatchIndicesInternal
1237 with |s| MatchIndicesInternal(s.0.clone())
1240 struct MatchIndicesInternal<'a, P: Pattern<'a>>(P::Searcher);
1242 impl<'a, P> fmt::Debug for MatchIndicesInternal<'a, P>
1244 P: Pattern<'a, Searcher: fmt::Debug>,
1246 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1247 f.debug_tuple("MatchIndicesInternal")
1253 impl<'a, P: Pattern<'a>> MatchIndicesInternal<'a, P> {
1255 fn next(&mut self) -> Option<(usize, &'a str)> {
1256 self.0.next_match().map(|(start, end)| unsafe {
1257 (start, self.0.haystack().get_unchecked(start..end))
1262 fn next_back(&mut self) -> Option<(usize, &'a str)>
1263 where P::Searcher: ReverseSearcher<'a>
1265 self.0.next_match_back().map(|(start, end)| unsafe {
1266 (start, self.0.haystack().get_unchecked(start..end))
1271 generate_pattern_iterators! {
1273 /// Created with the method [`match_indices`].
1275 /// [`match_indices`]: ../../std/primitive.str.html#method.match_indices
1276 struct MatchIndices;
1278 /// Created with the method [`rmatch_indices`].
1280 /// [`rmatch_indices`]: ../../std/primitive.str.html#method.rmatch_indices
1281 struct RMatchIndices;
1283 #[stable(feature = "str_match_indices", since = "1.5.0")]
1285 MatchIndicesInternal yielding ((usize, &'a str));
1286 delegate double ended;
1289 derive_pattern_clone!{
1290 clone MatchesInternal
1291 with |s| MatchesInternal(s.0.clone())
1294 struct MatchesInternal<'a, P: Pattern<'a>>(P::Searcher);
1296 impl<'a, P> fmt::Debug for MatchesInternal<'a, P>
1298 P: Pattern<'a, Searcher: fmt::Debug>,
1300 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1301 f.debug_tuple("MatchesInternal")
1307 impl<'a, P: Pattern<'a>> MatchesInternal<'a, P> {
1309 fn next(&mut self) -> Option<&'a str> {
1310 self.0.next_match().map(|(a, b)| unsafe {
1311 // Indices are known to be on utf8 boundaries
1312 self.0.haystack().get_unchecked(a..b)
1317 fn next_back(&mut self) -> Option<&'a str>
1318 where P::Searcher: ReverseSearcher<'a>
1320 self.0.next_match_back().map(|(a, b)| unsafe {
1321 // Indices are known to be on utf8 boundaries
1322 self.0.haystack().get_unchecked(a..b)
1327 generate_pattern_iterators! {
1329 /// Created with the method [`matches`].
1331 /// [`matches`]: ../../std/primitive.str.html#method.matches
1334 /// Created with the method [`rmatches`].
1336 /// [`rmatches`]: ../../std/primitive.str.html#method.rmatches
1339 #[stable(feature = "str_matches", since = "1.2.0")]
1341 MatchesInternal yielding (&'a str);
1342 delegate double ended;
1345 /// An iterator over the lines of a string, as string slices.
1347 /// This struct is created with the [`lines`] method on [`str`].
1348 /// See its documentation for more.
1350 /// [`lines`]: ../../std/primitive.str.html#method.lines
1351 /// [`str`]: ../../std/primitive.str.html
1352 #[stable(feature = "rust1", since = "1.0.0")]
1353 #[derive(Clone, Debug)]
1354 pub struct Lines<'a>(Map<SplitTerminator<'a, char>, LinesAnyMap>);
1356 #[stable(feature = "rust1", since = "1.0.0")]
1357 impl<'a> Iterator for Lines<'a> {
1358 type Item = &'a str;
1361 fn next(&mut self) -> Option<&'a str> {
1366 fn size_hint(&self) -> (usize, Option<usize>) {
1371 fn last(mut self) -> Option<&'a str> {
1376 #[stable(feature = "rust1", since = "1.0.0")]
1377 impl<'a> DoubleEndedIterator for Lines<'a> {
1379 fn next_back(&mut self) -> Option<&'a str> {
1384 #[stable(feature = "fused", since = "1.26.0")]
1385 impl FusedIterator for Lines<'_> {}
1387 /// Created with the method [`lines_any`].
1389 /// [`lines_any`]: ../../std/primitive.str.html#method.lines_any
1390 #[stable(feature = "rust1", since = "1.0.0")]
1391 #[rustc_deprecated(since = "1.4.0", reason = "use lines()/Lines instead now")]
1392 #[derive(Clone, Debug)]
1393 #[allow(deprecated)]
1394 pub struct LinesAny<'a>(Lines<'a>);
1397 /// A nameable, cloneable fn type
1399 struct LinesAnyMap impl<'a> Fn = |line: &'a str| -> &'a str {
1401 if l > 0 && line.as_bytes()[l - 1] == b'\r' { &line[0 .. l - 1] }
1406 #[stable(feature = "rust1", since = "1.0.0")]
1407 #[allow(deprecated)]
1408 impl<'a> Iterator for LinesAny<'a> {
1409 type Item = &'a str;
1412 fn next(&mut self) -> Option<&'a str> {
1417 fn size_hint(&self) -> (usize, Option<usize>) {
1422 #[stable(feature = "rust1", since = "1.0.0")]
1423 #[allow(deprecated)]
1424 impl<'a> DoubleEndedIterator for LinesAny<'a> {
1426 fn next_back(&mut self) -> Option<&'a str> {
1431 #[stable(feature = "fused", since = "1.26.0")]
1432 #[allow(deprecated)]
1433 impl FusedIterator for LinesAny<'_> {}
1436 Section: UTF-8 validation
1439 // use truncation to fit u64 into usize
1440 const NONASCII_MASK: usize = 0x80808080_80808080u64 as usize;
1442 /// Returns `true` if any byte in the word `x` is nonascii (>= 128).
1444 fn contains_nonascii(x: usize) -> bool {
1445 (x & NONASCII_MASK) != 0
1448 /// Walks through `v` checking that it's a valid UTF-8 sequence,
1449 /// returning `Ok(())` in that case, or, if it is invalid, `Err(err)`.
1451 fn run_utf8_validation(v: &[u8]) -> Result<(), Utf8Error> {
1455 let usize_bytes = mem::size_of::<usize>();
1456 let ascii_block_size = 2 * usize_bytes;
1457 let blocks_end = if len >= ascii_block_size { len - ascii_block_size + 1 } else { 0 };
1458 let align = v.as_ptr().align_offset(usize_bytes);
1461 let old_offset = index;
1463 ($error_len: expr) => {
1464 return Err(Utf8Error {
1465 valid_up_to: old_offset,
1466 error_len: $error_len,
1471 macro_rules! next { () => {{
1473 // we needed data, but there was none: error!
1480 let first = v[index];
1482 let w = UTF8_CHAR_WIDTH[first as usize];
1483 // 2-byte encoding is for codepoints \u{0080} to \u{07ff}
1484 // first C2 80 last DF BF
1485 // 3-byte encoding is for codepoints \u{0800} to \u{ffff}
1486 // first E0 A0 80 last EF BF BF
1487 // excluding surrogates codepoints \u{d800} to \u{dfff}
1488 // ED A0 80 to ED BF BF
1489 // 4-byte encoding is for codepoints \u{1000}0 to \u{10ff}ff
1490 // first F0 90 80 80 last F4 8F BF BF
1492 // Use the UTF-8 syntax from the RFC
1494 // https://tools.ietf.org/html/rfc3629
1496 // UTF8-2 = %xC2-DF UTF8-tail
1497 // UTF8-3 = %xE0 %xA0-BF UTF8-tail / %xE1-EC 2( UTF8-tail ) /
1498 // %xED %x80-9F UTF8-tail / %xEE-EF 2( UTF8-tail )
1499 // UTF8-4 = %xF0 %x90-BF 2( UTF8-tail ) / %xF1-F3 3( UTF8-tail ) /
1500 // %xF4 %x80-8F 2( UTF8-tail )
1502 2 => if next!() & !CONT_MASK != TAG_CONT_U8 {
1506 match (first, next!()) {
1507 (0xE0 , 0xA0 ..= 0xBF) |
1508 (0xE1 ..= 0xEC, 0x80 ..= 0xBF) |
1509 (0xED , 0x80 ..= 0x9F) |
1510 (0xEE ..= 0xEF, 0x80 ..= 0xBF) => {}
1513 if next!() & !CONT_MASK != TAG_CONT_U8 {
1518 match (first, next!()) {
1519 (0xF0 , 0x90 ..= 0xBF) |
1520 (0xF1 ..= 0xF3, 0x80 ..= 0xBF) |
1521 (0xF4 , 0x80 ..= 0x8F) => {}
1524 if next!() & !CONT_MASK != TAG_CONT_U8 {
1527 if next!() & !CONT_MASK != TAG_CONT_U8 {
1535 // Ascii case, try to skip forward quickly.
1536 // When the pointer is aligned, read 2 words of data per iteration
1537 // until we find a word containing a non-ascii byte.
1538 if align != usize::max_value() && align.wrapping_sub(index) % usize_bytes == 0 {
1539 let ptr = v.as_ptr();
1540 while index < blocks_end {
1542 let block = ptr.add(index) as *const usize;
1543 // break if there is a nonascii byte
1544 let zu = contains_nonascii(*block);
1545 let zv = contains_nonascii(*block.offset(1));
1550 index += ascii_block_size;
1552 // step from the point where the wordwise loop stopped
1553 while index < len && v[index] < 128 {
1565 // https://tools.ietf.org/html/rfc3629
1566 static UTF8_CHAR_WIDTH: [u8; 256] = [
1567 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
1568 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, // 0x1F
1569 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
1570 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, // 0x3F
1571 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
1572 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, // 0x5F
1573 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
1574 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, // 0x7F
1575 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
1576 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, // 0x9F
1577 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
1578 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, // 0xBF
1579 0,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,
1580 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, // 0xDF
1581 3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3, // 0xEF
1582 4,4,4,4,4,0,0,0,0,0,0,0,0,0,0,0, // 0xFF
1585 /// Given a first byte, determines how many bytes are in this UTF-8 character.
1586 #[unstable(feature = "str_internals", issue = "0")]
1588 pub fn utf8_char_width(b: u8) -> usize {
1589 UTF8_CHAR_WIDTH[b as usize] as usize
1592 /// Mask of the value bits of a continuation byte.
1593 const CONT_MASK: u8 = 0b0011_1111;
1594 /// Value of the tag bits (tag mask is !CONT_MASK) of a continuation byte.
1595 const TAG_CONT_U8: u8 = 0b1000_0000;
1598 Section: Trait implementations
1602 use crate::cmp::Ordering;
1604 use crate::slice::{self, SliceIndex};
1606 /// Implements ordering of strings.
1608 /// Strings are ordered lexicographically by their byte values. This orders Unicode code
1609 /// points based on their positions in the code charts. This is not necessarily the same as
1610 /// "alphabetical" order, which varies by language and locale. Sorting strings according to
1611 /// culturally-accepted standards requires locale-specific data that is outside the scope of
1613 #[stable(feature = "rust1", since = "1.0.0")]
1616 fn cmp(&self, other: &str) -> Ordering {
1617 self.as_bytes().cmp(other.as_bytes())
1621 #[stable(feature = "rust1", since = "1.0.0")]
1622 impl PartialEq for str {
1624 fn eq(&self, other: &str) -> bool {
1625 self.as_bytes() == other.as_bytes()
1628 fn ne(&self, other: &str) -> bool { !(*self).eq(other) }
1631 #[stable(feature = "rust1", since = "1.0.0")]
1634 /// Implements comparison operations on strings.
1636 /// Strings are compared lexicographically by their byte values. This compares Unicode code
1637 /// points based on their positions in the code charts. This is not necessarily the same as
1638 /// "alphabetical" order, which varies by language and locale. Comparing strings according to
1639 /// culturally-accepted standards requires locale-specific data that is outside the scope of
1641 #[stable(feature = "rust1", since = "1.0.0")]
1642 impl PartialOrd for str {
1644 fn partial_cmp(&self, other: &str) -> Option<Ordering> {
1645 Some(self.cmp(other))
1649 #[stable(feature = "rust1", since = "1.0.0")]
1650 impl<I> ops::Index<I> for str
1654 type Output = I::Output;
1657 fn index(&self, index: I) -> &I::Output {
1662 #[stable(feature = "rust1", since = "1.0.0")]
1663 impl<I> ops::IndexMut<I> for str
1668 fn index_mut(&mut self, index: I) -> &mut I::Output {
1669 index.index_mut(self)
1675 fn str_index_overflow_fail() -> ! {
1676 panic!("attempted to index str up to maximum usize");
1679 /// Implements substring slicing with syntax `&self[..]` or `&mut self[..]`.
1681 /// Returns a slice of the whole string, i.e., returns `&self` or `&mut
1682 /// self`. Equivalent to `&self[0 .. len]` or `&mut self[0 .. len]`. Unlike
1683 /// other indexing operations, this can never panic.
1685 /// This operation is `O(1)`.
1687 /// Prior to 1.20.0, these indexing operations were still supported by
1688 /// direct implementation of `Index` and `IndexMut`.
1690 /// Equivalent to `&self[0 .. len]` or `&mut self[0 .. len]`.
1691 #[stable(feature = "str_checked_slicing", since = "1.20.0")]
1692 impl SliceIndex<str> for ops::RangeFull {
1695 fn get(self, slice: &str) -> Option<&Self::Output> {
1699 fn get_mut(self, slice: &mut str) -> Option<&mut Self::Output> {
1703 unsafe fn get_unchecked(self, slice: &str) -> &Self::Output {
1707 unsafe fn get_unchecked_mut(self, slice: &mut str) -> &mut Self::Output {
1711 fn index(self, slice: &str) -> &Self::Output {
1715 fn index_mut(self, slice: &mut str) -> &mut Self::Output {
1720 /// Implements substring slicing with syntax `&self[begin .. end]` or `&mut
1721 /// self[begin .. end]`.
1723 /// Returns a slice of the given string from the byte range
1724 /// [`begin`, `end`).
1726 /// This operation is `O(1)`.
1728 /// Prior to 1.20.0, these indexing operations were still supported by
1729 /// direct implementation of `Index` and `IndexMut`.
1733 /// Panics if `begin` or `end` does not point to the starting byte offset of
1734 /// a character (as defined by `is_char_boundary`), if `begin > end`, or if
1740 /// let s = "Löwe 老虎 Léopard";
1741 /// assert_eq!(&s[0 .. 1], "L");
1743 /// assert_eq!(&s[1 .. 9], "öwe 老");
1745 /// // these will panic:
1746 /// // byte 2 lies within `ö`:
1749 /// // byte 8 lies within `老`
1752 /// // byte 100 is outside the string
1753 /// // &s[3 .. 100];
1755 #[stable(feature = "str_checked_slicing", since = "1.20.0")]
1756 impl SliceIndex<str> for ops::Range<usize> {
1759 fn get(self, slice: &str) -> Option<&Self::Output> {
1760 if self.start <= self.end &&
1761 slice.is_char_boundary(self.start) &&
1762 slice.is_char_boundary(self.end) {
1763 Some(unsafe { self.get_unchecked(slice) })
1769 fn get_mut(self, slice: &mut str) -> Option<&mut Self::Output> {
1770 if self.start <= self.end &&
1771 slice.is_char_boundary(self.start) &&
1772 slice.is_char_boundary(self.end) {
1773 Some(unsafe { self.get_unchecked_mut(slice) })
1779 unsafe fn get_unchecked(self, slice: &str) -> &Self::Output {
1780 let ptr = slice.as_ptr().add(self.start);
1781 let len = self.end - self.start;
1782 super::from_utf8_unchecked(slice::from_raw_parts(ptr, len))
1785 unsafe fn get_unchecked_mut(self, slice: &mut str) -> &mut Self::Output {
1786 let ptr = slice.as_mut_ptr().add(self.start);
1787 let len = self.end - self.start;
1788 super::from_utf8_unchecked_mut(slice::from_raw_parts_mut(ptr, len))
1791 fn index(self, slice: &str) -> &Self::Output {
1792 let (start, end) = (self.start, self.end);
1793 self.get(slice).unwrap_or_else(|| super::slice_error_fail(slice, start, end))
1796 fn index_mut(self, slice: &mut str) -> &mut Self::Output {
1797 // is_char_boundary checks that the index is in [0, .len()]
1798 // cannot reuse `get` as above, because of NLL trouble
1799 if self.start <= self.end &&
1800 slice.is_char_boundary(self.start) &&
1801 slice.is_char_boundary(self.end) {
1802 unsafe { self.get_unchecked_mut(slice) }
1804 super::slice_error_fail(slice, self.start, self.end)
1809 /// Implements substring slicing with syntax `&self[.. end]` or `&mut
1812 /// Returns a slice of the given string from the byte range [`0`, `end`).
1813 /// Equivalent to `&self[0 .. end]` or `&mut self[0 .. end]`.
1815 /// This operation is `O(1)`.
1817 /// Prior to 1.20.0, these indexing operations were still supported by
1818 /// direct implementation of `Index` and `IndexMut`.
1822 /// Panics if `end` does not point to the starting byte offset of a
1823 /// character (as defined by `is_char_boundary`), or if `end > len`.
1824 #[stable(feature = "str_checked_slicing", since = "1.20.0")]
1825 impl SliceIndex<str> for ops::RangeTo<usize> {
1828 fn get(self, slice: &str) -> Option<&Self::Output> {
1829 if slice.is_char_boundary(self.end) {
1830 Some(unsafe { self.get_unchecked(slice) })
1836 fn get_mut(self, slice: &mut str) -> Option<&mut Self::Output> {
1837 if slice.is_char_boundary(self.end) {
1838 Some(unsafe { self.get_unchecked_mut(slice) })
1844 unsafe fn get_unchecked(self, slice: &str) -> &Self::Output {
1845 let ptr = slice.as_ptr();
1846 super::from_utf8_unchecked(slice::from_raw_parts(ptr, self.end))
1849 unsafe fn get_unchecked_mut(self, slice: &mut str) -> &mut Self::Output {
1850 let ptr = slice.as_mut_ptr();
1851 super::from_utf8_unchecked_mut(slice::from_raw_parts_mut(ptr, self.end))
1854 fn index(self, slice: &str) -> &Self::Output {
1856 self.get(slice).unwrap_or_else(|| super::slice_error_fail(slice, 0, end))
1859 fn index_mut(self, slice: &mut str) -> &mut Self::Output {
1860 // is_char_boundary checks that the index is in [0, .len()]
1861 if slice.is_char_boundary(self.end) {
1862 unsafe { self.get_unchecked_mut(slice) }
1864 super::slice_error_fail(slice, 0, self.end)
1869 /// Implements substring slicing with syntax `&self[begin ..]` or `&mut
1870 /// self[begin ..]`.
1872 /// Returns a slice of the given string from the byte range [`begin`,
1873 /// `len`). Equivalent to `&self[begin .. len]` or `&mut self[begin ..
1876 /// This operation is `O(1)`.
1878 /// Prior to 1.20.0, these indexing operations were still supported by
1879 /// direct implementation of `Index` and `IndexMut`.
1883 /// Panics if `begin` does not point to the starting byte offset of
1884 /// a character (as defined by `is_char_boundary`), or if `begin >= len`.
1885 #[stable(feature = "str_checked_slicing", since = "1.20.0")]
1886 impl SliceIndex<str> for ops::RangeFrom<usize> {
1889 fn get(self, slice: &str) -> Option<&Self::Output> {
1890 if slice.is_char_boundary(self.start) {
1891 Some(unsafe { self.get_unchecked(slice) })
1897 fn get_mut(self, slice: &mut str) -> Option<&mut Self::Output> {
1898 if slice.is_char_boundary(self.start) {
1899 Some(unsafe { self.get_unchecked_mut(slice) })
1905 unsafe fn get_unchecked(self, slice: &str) -> &Self::Output {
1906 let ptr = slice.as_ptr().add(self.start);
1907 let len = slice.len() - self.start;
1908 super::from_utf8_unchecked(slice::from_raw_parts(ptr, len))
1911 unsafe fn get_unchecked_mut(self, slice: &mut str) -> &mut Self::Output {
1912 let ptr = slice.as_mut_ptr().add(self.start);
1913 let len = slice.len() - self.start;
1914 super::from_utf8_unchecked_mut(slice::from_raw_parts_mut(ptr, len))
1917 fn index(self, slice: &str) -> &Self::Output {
1918 let (start, end) = (self.start, slice.len());
1919 self.get(slice).unwrap_or_else(|| super::slice_error_fail(slice, start, end))
1922 fn index_mut(self, slice: &mut str) -> &mut Self::Output {
1923 // is_char_boundary checks that the index is in [0, .len()]
1924 if slice.is_char_boundary(self.start) {
1925 unsafe { self.get_unchecked_mut(slice) }
1927 super::slice_error_fail(slice, self.start, slice.len())
1932 /// Implements substring slicing with syntax `&self[begin ..= end]` or `&mut
1933 /// self[begin ..= end]`.
1935 /// Returns a slice of the given string from the byte range
1936 /// [`begin`, `end`]. Equivalent to `&self [begin .. end + 1]` or `&mut
1937 /// self[begin .. end + 1]`, except if `end` has the maximum value for
1940 /// This operation is `O(1)`.
1944 /// Panics if `begin` does not point to the starting byte offset of
1945 /// a character (as defined by `is_char_boundary`), if `end` does not point
1946 /// to the ending byte offset of a character (`end + 1` is either a starting
1947 /// byte offset or equal to `len`), if `begin > end`, or if `end >= len`.
1948 #[stable(feature = "inclusive_range", since = "1.26.0")]
1949 impl SliceIndex<str> for ops::RangeInclusive<usize> {
1952 fn get(self, slice: &str) -> Option<&Self::Output> {
1953 if *self.end() == usize::max_value() { None }
1954 else { (*self.start()..self.end()+1).get(slice) }
1957 fn get_mut(self, slice: &mut str) -> Option<&mut Self::Output> {
1958 if *self.end() == usize::max_value() { None }
1959 else { (*self.start()..self.end()+1).get_mut(slice) }
1962 unsafe fn get_unchecked(self, slice: &str) -> &Self::Output {
1963 (*self.start()..self.end()+1).get_unchecked(slice)
1966 unsafe fn get_unchecked_mut(self, slice: &mut str) -> &mut Self::Output {
1967 (*self.start()..self.end()+1).get_unchecked_mut(slice)
1970 fn index(self, slice: &str) -> &Self::Output {
1971 if *self.end() == usize::max_value() { str_index_overflow_fail(); }
1972 (*self.start()..self.end()+1).index(slice)
1975 fn index_mut(self, slice: &mut str) -> &mut Self::Output {
1976 if *self.end() == usize::max_value() { str_index_overflow_fail(); }
1977 (*self.start()..self.end()+1).index_mut(slice)
1981 /// Implements substring slicing with syntax `&self[..= end]` or `&mut
1984 /// Returns a slice of the given string from the byte range [0, `end`].
1985 /// Equivalent to `&self [0 .. end + 1]`, except if `end` has the maximum
1986 /// value for `usize`.
1988 /// This operation is `O(1)`.
1992 /// Panics if `end` does not point to the ending byte offset of a character
1993 /// (`end + 1` is either a starting byte offset as defined by
1994 /// `is_char_boundary`, or equal to `len`), or if `end >= len`.
1995 #[stable(feature = "inclusive_range", since = "1.26.0")]
1996 impl SliceIndex<str> for ops::RangeToInclusive<usize> {
1999 fn get(self, slice: &str) -> Option<&Self::Output> {
2000 if self.end == usize::max_value() { None }
2001 else { (..self.end+1).get(slice) }
2004 fn get_mut(self, slice: &mut str) -> Option<&mut Self::Output> {
2005 if self.end == usize::max_value() { None }
2006 else { (..self.end+1).get_mut(slice) }
2009 unsafe fn get_unchecked(self, slice: &str) -> &Self::Output {
2010 (..self.end+1).get_unchecked(slice)
2013 unsafe fn get_unchecked_mut(self, slice: &mut str) -> &mut Self::Output {
2014 (..self.end+1).get_unchecked_mut(slice)
2017 fn index(self, slice: &str) -> &Self::Output {
2018 if self.end == usize::max_value() { str_index_overflow_fail(); }
2019 (..self.end+1).index(slice)
2022 fn index_mut(self, slice: &mut str) -> &mut Self::Output {
2023 if self.end == usize::max_value() { str_index_overflow_fail(); }
2024 (..self.end+1).index_mut(slice)
2029 // truncate `&str` to length at most equal to `max`
2030 // return `true` if it were truncated, and the new str.
2031 fn truncate_to_char_boundary(s: &str, mut max: usize) -> (bool, &str) {
2035 while !s.is_char_boundary(max) {
2044 fn slice_error_fail(s: &str, begin: usize, end: usize) -> ! {
2045 const MAX_DISPLAY_LENGTH: usize = 256;
2046 let (truncated, s_trunc) = truncate_to_char_boundary(s, MAX_DISPLAY_LENGTH);
2047 let ellipsis = if truncated { "[...]" } else { "" };
2050 if begin > s.len() || end > s.len() {
2051 let oob_index = if begin > s.len() { begin } else { end };
2052 panic!("byte index {} is out of bounds of `{}`{}", oob_index, s_trunc, ellipsis);
2056 assert!(begin <= end, "begin <= end ({} <= {}) when slicing `{}`{}",
2057 begin, end, s_trunc, ellipsis);
2059 // 3. character boundary
2060 let index = if !s.is_char_boundary(begin) { begin } else { end };
2061 // find the character
2062 let mut char_start = index;
2063 while !s.is_char_boundary(char_start) {
2066 // `char_start` must be less than len and a char boundary
2067 let ch = s[char_start..].chars().next().unwrap();
2068 let char_range = char_start .. char_start + ch.len_utf8();
2069 panic!("byte index {} is not a char boundary; it is inside {:?} (bytes {:?}) of `{}`{}",
2070 index, ch, char_range, s_trunc, ellipsis);
2076 /// Returns the length of `self`.
2078 /// This length is in bytes, not [`char`]s or graphemes. In other words,
2079 /// it may not be what a human considers the length of the string.
2086 /// let len = "foo".len();
2087 /// assert_eq!(3, len);
2089 /// assert_eq!("ƒoo".len(), 4); // fancy f!
2090 /// assert_eq!("ƒoo".chars().count(), 3);
2092 #[stable(feature = "rust1", since = "1.0.0")]
2093 #[rustc_const_stable(feature = "const_str_len", since = "1.32.0")]
2095 pub const fn len(&self) -> usize {
2096 self.as_bytes().len()
2099 /// Returns `true` if `self` has a length of zero bytes.
2107 /// assert!(s.is_empty());
2109 /// let s = "not empty";
2110 /// assert!(!s.is_empty());
2113 #[stable(feature = "rust1", since = "1.0.0")]
2114 #[rustc_const_stable(feature = "const_str_is_empty", since = "1.32.0")]
2115 pub const fn is_empty(&self) -> bool {
2119 /// Checks that `index`-th byte lies at the start and/or end of a
2120 /// UTF-8 code point sequence.
2122 /// The start and end of the string (when `index == self.len()`) are
2123 /// considered to be
2126 /// Returns `false` if `index` is greater than `self.len()`.
2131 /// let s = "Löwe 老虎 Léopard";
2132 /// assert!(s.is_char_boundary(0));
2134 /// assert!(s.is_char_boundary(6));
2135 /// assert!(s.is_char_boundary(s.len()));
2137 /// // second byte of `ö`
2138 /// assert!(!s.is_char_boundary(2));
2140 /// // third byte of `老`
2141 /// assert!(!s.is_char_boundary(8));
2143 #[stable(feature = "is_char_boundary", since = "1.9.0")]
2145 pub fn is_char_boundary(&self, index: usize) -> bool {
2146 // 0 and len are always ok.
2147 // Test for 0 explicitly so that it can optimize out the check
2148 // easily and skip reading string data for that case.
2149 if index == 0 || index == self.len() { return true; }
2150 match self.as_bytes().get(index) {
2152 // This is bit magic equivalent to: b < 128 || b >= 192
2153 Some(&b) => (b as i8) >= -0x40,
2157 /// Converts a string slice to a byte slice. To convert the byte slice back
2158 /// into a string slice, use the [`str::from_utf8`] function.
2160 /// [`str::from_utf8`]: ./str/fn.from_utf8.html
2167 /// let bytes = "bors".as_bytes();
2168 /// assert_eq!(b"bors", bytes);
2170 #[stable(feature = "rust1", since = "1.0.0")]
2171 #[rustc_const_stable(feature = "str_as_bytes", since = "1.32.0")]
2173 // SAFETY: const sound because we transmute two types with the same layout
2174 #[allow(unused_attributes)]
2175 #[allow_internal_unstable(const_fn_union)]
2176 pub const fn as_bytes(&self) -> &[u8] {
2182 unsafe { Slices { str: self }.slice }
2185 /// Converts a mutable string slice to a mutable byte slice. To convert the
2186 /// mutable byte slice back into a mutable string slice, use the
2187 /// [`str::from_utf8_mut`] function.
2189 /// [`str::from_utf8_mut`]: ./str/fn.from_utf8_mut.html
2196 /// let mut s = String::from("Hello");
2197 /// let bytes = unsafe { s.as_bytes_mut() };
2199 /// assert_eq!(b"Hello", bytes);
2205 /// let mut s = String::from("🗻∈🌏");
2208 /// let bytes = s.as_bytes_mut();
2210 /// bytes[0] = 0xF0;
2211 /// bytes[1] = 0x9F;
2212 /// bytes[2] = 0x8D;
2213 /// bytes[3] = 0x94;
2216 /// assert_eq!("🍔∈🌏", s);
2218 #[stable(feature = "str_mut_extras", since = "1.20.0")]
2220 pub unsafe fn as_bytes_mut(&mut self) -> &mut [u8] {
2221 &mut *(self as *mut str as *mut [u8])
2224 /// Converts a string slice to a raw pointer.
2226 /// As string slices are a slice of bytes, the raw pointer points to a
2227 /// [`u8`]. This pointer will be pointing to the first byte of the string
2230 /// The caller must ensure that the returned pointer is never written to.
2231 /// If you need to mutate the contents of the string slice, use [`as_mut_ptr`].
2233 /// [`u8`]: primitive.u8.html
2234 /// [`as_mut_ptr`]: #method.as_mut_ptr
2241 /// let s = "Hello";
2242 /// let ptr = s.as_ptr();
2244 #[stable(feature = "rust1", since = "1.0.0")]
2245 #[rustc_const_stable(feature = "rustc_str_as_ptr", since = "1.32.0")]
2247 pub const fn as_ptr(&self) -> *const u8 {
2248 self as *const str as *const u8
2251 /// Converts a mutable string slice to a raw pointer.
2253 /// As string slices are a slice of bytes, the raw pointer points to a
2254 /// [`u8`]. This pointer will be pointing to the first byte of the string
2257 /// It is your responsibility to make sure that the string slice only gets
2258 /// modified in a way that it remains valid UTF-8.
2260 /// [`u8`]: primitive.u8.html
2261 #[stable(feature = "str_as_mut_ptr", since = "1.36.0")]
2263 pub fn as_mut_ptr(&mut self) -> *mut u8 {
2264 self as *mut str as *mut u8
2267 /// Returns a subslice of `str`.
2269 /// This is the non-panicking alternative to indexing the `str`. Returns
2270 /// [`None`] whenever equivalent indexing operation would panic.
2272 /// [`None`]: option/enum.Option.html#variant.None
2277 /// let v = String::from("🗻∈🌏");
2279 /// assert_eq!(Some("🗻"), v.get(0..4));
2281 /// // indices not on UTF-8 sequence boundaries
2282 /// assert!(v.get(1..).is_none());
2283 /// assert!(v.get(..8).is_none());
2285 /// // out of bounds
2286 /// assert!(v.get(..42).is_none());
2288 #[stable(feature = "str_checked_slicing", since = "1.20.0")]
2290 pub fn get<I: SliceIndex<str>>(&self, i: I) -> Option<&I::Output> {
2294 /// Returns a mutable subslice of `str`.
2296 /// This is the non-panicking alternative to indexing the `str`. Returns
2297 /// [`None`] whenever equivalent indexing operation would panic.
2299 /// [`None`]: option/enum.Option.html#variant.None
2304 /// let mut v = String::from("hello");
2305 /// // correct length
2306 /// assert!(v.get_mut(0..5).is_some());
2307 /// // out of bounds
2308 /// assert!(v.get_mut(..42).is_none());
2309 /// assert_eq!(Some("he"), v.get_mut(0..2).map(|v| &*v));
2311 /// assert_eq!("hello", v);
2313 /// let s = v.get_mut(0..2);
2314 /// let s = s.map(|s| {
2315 /// s.make_ascii_uppercase();
2318 /// assert_eq!(Some("HE"), s);
2320 /// assert_eq!("HEllo", v);
2322 #[stable(feature = "str_checked_slicing", since = "1.20.0")]
2324 pub fn get_mut<I: SliceIndex<str>>(&mut self, i: I) -> Option<&mut I::Output> {
2328 /// Returns an unchecked subslice of `str`.
2330 /// This is the unchecked alternative to indexing the `str`.
2334 /// Callers of this function are responsible that these preconditions are
2337 /// * The starting index must come before the ending index;
2338 /// * Indexes must be within bounds of the original slice;
2339 /// * Indexes must lie on UTF-8 sequence boundaries.
2341 /// Failing that, the returned string slice may reference invalid memory or
2342 /// violate the invariants communicated by the `str` type.
2349 /// assert_eq!("🗻", v.get_unchecked(0..4));
2350 /// assert_eq!("∈", v.get_unchecked(4..7));
2351 /// assert_eq!("🌏", v.get_unchecked(7..11));
2354 #[stable(feature = "str_checked_slicing", since = "1.20.0")]
2356 pub unsafe fn get_unchecked<I: SliceIndex<str>>(&self, i: I) -> &I::Output {
2357 i.get_unchecked(self)
2360 /// Returns a mutable, unchecked subslice of `str`.
2362 /// This is the unchecked alternative to indexing the `str`.
2366 /// Callers of this function are responsible that these preconditions are
2369 /// * The starting index must come before the ending index;
2370 /// * Indexes must be within bounds of the original slice;
2371 /// * Indexes must lie on UTF-8 sequence boundaries.
2373 /// Failing that, the returned string slice may reference invalid memory or
2374 /// violate the invariants communicated by the `str` type.
2379 /// let mut v = String::from("🗻∈🌏");
2381 /// assert_eq!("🗻", v.get_unchecked_mut(0..4));
2382 /// assert_eq!("∈", v.get_unchecked_mut(4..7));
2383 /// assert_eq!("🌏", v.get_unchecked_mut(7..11));
2386 #[stable(feature = "str_checked_slicing", since = "1.20.0")]
2388 pub unsafe fn get_unchecked_mut<I: SliceIndex<str>>(&mut self, i: I) -> &mut I::Output {
2389 i.get_unchecked_mut(self)
2392 /// Creates a string slice from another string slice, bypassing safety
2395 /// This is generally not recommended, use with caution! For a safe
2396 /// alternative see [`str`] and [`Index`].
2398 /// [`str`]: primitive.str.html
2399 /// [`Index`]: ops/trait.Index.html
2401 /// This new slice goes from `begin` to `end`, including `begin` but
2402 /// excluding `end`.
2404 /// To get a mutable string slice instead, see the
2405 /// [`slice_mut_unchecked`] method.
2407 /// [`slice_mut_unchecked`]: #method.slice_mut_unchecked
2411 /// Callers of this function are responsible that three preconditions are
2414 /// * `begin` must come before `end`.
2415 /// * `begin` and `end` must be byte positions within the string slice.
2416 /// * `begin` and `end` must lie on UTF-8 sequence boundaries.
2423 /// let s = "Löwe 老虎 Léopard";
2426 /// assert_eq!("Löwe 老虎 Léopard", s.slice_unchecked(0, 21));
2429 /// let s = "Hello, world!";
2432 /// assert_eq!("world", s.slice_unchecked(7, 12));
2435 #[stable(feature = "rust1", since = "1.0.0")]
2436 #[rustc_deprecated(since = "1.29.0", reason = "use `get_unchecked(begin..end)` instead")]
2438 pub unsafe fn slice_unchecked(&self, begin: usize, end: usize) -> &str {
2439 (begin..end).get_unchecked(self)
2442 /// Creates a string slice from another string slice, bypassing safety
2444 /// This is generally not recommended, use with caution! For a safe
2445 /// alternative see [`str`] and [`IndexMut`].
2447 /// [`str`]: primitive.str.html
2448 /// [`IndexMut`]: ops/trait.IndexMut.html
2450 /// This new slice goes from `begin` to `end`, including `begin` but
2451 /// excluding `end`.
2453 /// To get an immutable string slice instead, see the
2454 /// [`slice_unchecked`] method.
2456 /// [`slice_unchecked`]: #method.slice_unchecked
2460 /// Callers of this function are responsible that three preconditions are
2463 /// * `begin` must come before `end`.
2464 /// * `begin` and `end` must be byte positions within the string slice.
2465 /// * `begin` and `end` must lie on UTF-8 sequence boundaries.
2466 #[stable(feature = "str_slice_mut", since = "1.5.0")]
2467 #[rustc_deprecated(since = "1.29.0", reason = "use `get_unchecked_mut(begin..end)` instead")]
2469 pub unsafe fn slice_mut_unchecked(&mut self, begin: usize, end: usize) -> &mut str {
2470 (begin..end).get_unchecked_mut(self)
2473 /// Divide one string slice into two at an index.
2475 /// The argument, `mid`, should be a byte offset from the start of the
2476 /// string. It must also be on the boundary of a UTF-8 code point.
2478 /// The two slices returned go from the start of the string slice to `mid`,
2479 /// and from `mid` to the end of the string slice.
2481 /// To get mutable string slices instead, see the [`split_at_mut`]
2484 /// [`split_at_mut`]: #method.split_at_mut
2488 /// Panics if `mid` is not on a UTF-8 code point boundary, or if it is
2489 /// beyond the last code point of the string slice.
2496 /// let s = "Per Martin-Löf";
2498 /// let (first, last) = s.split_at(3);
2500 /// assert_eq!("Per", first);
2501 /// assert_eq!(" Martin-Löf", last);
2504 #[stable(feature = "str_split_at", since = "1.4.0")]
2505 pub fn split_at(&self, mid: usize) -> (&str, &str) {
2506 // is_char_boundary checks that the index is in [0, .len()]
2507 if self.is_char_boundary(mid) {
2509 (self.get_unchecked(0..mid),
2510 self.get_unchecked(mid..self.len()))
2513 slice_error_fail(self, 0, mid)
2517 /// Divide one mutable string slice into two at an index.
2519 /// The argument, `mid`, should be a byte offset from the start of the
2520 /// string. It must also be on the boundary of a UTF-8 code point.
2522 /// The two slices returned go from the start of the string slice to `mid`,
2523 /// and from `mid` to the end of the string slice.
2525 /// To get immutable string slices instead, see the [`split_at`] method.
2527 /// [`split_at`]: #method.split_at
2531 /// Panics if `mid` is not on a UTF-8 code point boundary, or if it is
2532 /// beyond the last code point of the string slice.
2539 /// let mut s = "Per Martin-Löf".to_string();
2541 /// let (first, last) = s.split_at_mut(3);
2542 /// first.make_ascii_uppercase();
2543 /// assert_eq!("PER", first);
2544 /// assert_eq!(" Martin-Löf", last);
2546 /// assert_eq!("PER Martin-Löf", s);
2549 #[stable(feature = "str_split_at", since = "1.4.0")]
2550 pub fn split_at_mut(&mut self, mid: usize) -> (&mut str, &mut str) {
2551 // is_char_boundary checks that the index is in [0, .len()]
2552 if self.is_char_boundary(mid) {
2553 let len = self.len();
2554 let ptr = self.as_mut_ptr();
2556 (from_utf8_unchecked_mut(slice::from_raw_parts_mut(ptr, mid)),
2557 from_utf8_unchecked_mut(slice::from_raw_parts_mut(
2563 slice_error_fail(self, 0, mid)
2567 /// Returns an iterator over the [`char`]s of a string slice.
2569 /// As a string slice consists of valid UTF-8, we can iterate through a
2570 /// string slice by [`char`]. This method returns such an iterator.
2572 /// It's important to remember that [`char`] represents a Unicode Scalar
2573 /// Value, and may not match your idea of what a 'character' is. Iteration
2574 /// over grapheme clusters may be what you actually want.
2581 /// let word = "goodbye";
2583 /// let count = word.chars().count();
2584 /// assert_eq!(7, count);
2586 /// let mut chars = word.chars();
2588 /// assert_eq!(Some('g'), chars.next());
2589 /// assert_eq!(Some('o'), chars.next());
2590 /// assert_eq!(Some('o'), chars.next());
2591 /// assert_eq!(Some('d'), chars.next());
2592 /// assert_eq!(Some('b'), chars.next());
2593 /// assert_eq!(Some('y'), chars.next());
2594 /// assert_eq!(Some('e'), chars.next());
2596 /// assert_eq!(None, chars.next());
2599 /// Remember, [`char`]s may not match your human intuition about characters:
2604 /// let mut chars = y.chars();
2606 /// assert_eq!(Some('y'), chars.next()); // not 'y̆'
2607 /// assert_eq!(Some('\u{0306}'), chars.next());
2609 /// assert_eq!(None, chars.next());
2611 #[stable(feature = "rust1", since = "1.0.0")]
2613 pub fn chars(&self) -> Chars<'_> {
2614 Chars{iter: self.as_bytes().iter()}
2617 /// Returns an iterator over the [`char`]s of a string slice, and their
2620 /// As a string slice consists of valid UTF-8, we can iterate through a
2621 /// string slice by [`char`]. This method returns an iterator of both
2622 /// these [`char`]s, as well as their byte positions.
2624 /// The iterator yields tuples. The position is first, the [`char`] is
2632 /// let word = "goodbye";
2634 /// let count = word.char_indices().count();
2635 /// assert_eq!(7, count);
2637 /// let mut char_indices = word.char_indices();
2639 /// assert_eq!(Some((0, 'g')), char_indices.next());
2640 /// assert_eq!(Some((1, 'o')), char_indices.next());
2641 /// assert_eq!(Some((2, 'o')), char_indices.next());
2642 /// assert_eq!(Some((3, 'd')), char_indices.next());
2643 /// assert_eq!(Some((4, 'b')), char_indices.next());
2644 /// assert_eq!(Some((5, 'y')), char_indices.next());
2645 /// assert_eq!(Some((6, 'e')), char_indices.next());
2647 /// assert_eq!(None, char_indices.next());
2650 /// Remember, [`char`]s may not match your human intuition about characters:
2653 /// let yes = "y̆es";
2655 /// let mut char_indices = yes.char_indices();
2657 /// assert_eq!(Some((0, 'y')), char_indices.next()); // not (0, 'y̆')
2658 /// assert_eq!(Some((1, '\u{0306}')), char_indices.next());
2660 /// // note the 3 here - the last character took up two bytes
2661 /// assert_eq!(Some((3, 'e')), char_indices.next());
2662 /// assert_eq!(Some((4, 's')), char_indices.next());
2664 /// assert_eq!(None, char_indices.next());
2666 #[stable(feature = "rust1", since = "1.0.0")]
2668 pub fn char_indices(&self) -> CharIndices<'_> {
2669 CharIndices { front_offset: 0, iter: self.chars() }
2672 /// An iterator over the bytes of a string slice.
2674 /// As a string slice consists of a sequence of bytes, we can iterate
2675 /// through a string slice by byte. This method returns such an iterator.
2682 /// let mut bytes = "bors".bytes();
2684 /// assert_eq!(Some(b'b'), bytes.next());
2685 /// assert_eq!(Some(b'o'), bytes.next());
2686 /// assert_eq!(Some(b'r'), bytes.next());
2687 /// assert_eq!(Some(b's'), bytes.next());
2689 /// assert_eq!(None, bytes.next());
2691 #[stable(feature = "rust1", since = "1.0.0")]
2693 pub fn bytes(&self) -> Bytes<'_> {
2694 Bytes(self.as_bytes().iter().cloned())
2697 /// Splits a string slice by whitespace.
2699 /// The iterator returned will return string slices that are sub-slices of
2700 /// the original string slice, separated by any amount of whitespace.
2702 /// 'Whitespace' is defined according to the terms of the Unicode Derived
2703 /// Core Property `White_Space`. If you only want to split on ASCII whitespace
2704 /// instead, use [`split_ascii_whitespace`].
2706 /// [`split_ascii_whitespace`]: #method.split_ascii_whitespace
2713 /// let mut iter = "A few words".split_whitespace();
2715 /// assert_eq!(Some("A"), iter.next());
2716 /// assert_eq!(Some("few"), iter.next());
2717 /// assert_eq!(Some("words"), iter.next());
2719 /// assert_eq!(None, iter.next());
2722 /// All kinds of whitespace are considered:
2725 /// let mut iter = " Mary had\ta\u{2009}little \n\t lamb".split_whitespace();
2726 /// assert_eq!(Some("Mary"), iter.next());
2727 /// assert_eq!(Some("had"), iter.next());
2728 /// assert_eq!(Some("a"), iter.next());
2729 /// assert_eq!(Some("little"), iter.next());
2730 /// assert_eq!(Some("lamb"), iter.next());
2732 /// assert_eq!(None, iter.next());
2734 #[stable(feature = "split_whitespace", since = "1.1.0")]
2736 pub fn split_whitespace(&self) -> SplitWhitespace<'_> {
2737 SplitWhitespace { inner: self.split(IsWhitespace).filter(IsNotEmpty) }
2740 /// Splits a string slice by ASCII whitespace.
2742 /// The iterator returned will return string slices that are sub-slices of
2743 /// the original string slice, separated by any amount of ASCII whitespace.
2745 /// To split by Unicode `Whitespace` instead, use [`split_whitespace`].
2747 /// [`split_whitespace`]: #method.split_whitespace
2754 /// let mut iter = "A few words".split_ascii_whitespace();
2756 /// assert_eq!(Some("A"), iter.next());
2757 /// assert_eq!(Some("few"), iter.next());
2758 /// assert_eq!(Some("words"), iter.next());
2760 /// assert_eq!(None, iter.next());
2763 /// All kinds of ASCII whitespace are considered:
2766 /// let mut iter = " Mary had\ta little \n\t lamb".split_ascii_whitespace();
2767 /// assert_eq!(Some("Mary"), iter.next());
2768 /// assert_eq!(Some("had"), iter.next());
2769 /// assert_eq!(Some("a"), iter.next());
2770 /// assert_eq!(Some("little"), iter.next());
2771 /// assert_eq!(Some("lamb"), iter.next());
2773 /// assert_eq!(None, iter.next());
2775 #[stable(feature = "split_ascii_whitespace", since = "1.34.0")]
2777 pub fn split_ascii_whitespace(&self) -> SplitAsciiWhitespace<'_> {
2780 .split(IsAsciiWhitespace)
2781 .filter(BytesIsNotEmpty)
2782 .map(UnsafeBytesToStr);
2783 SplitAsciiWhitespace { inner }
2786 /// An iterator over the lines of a string, as string slices.
2788 /// Lines are ended with either a newline (`\n`) or a carriage return with
2789 /// a line feed (`\r\n`).
2791 /// The final line ending is optional.
2798 /// let text = "foo\r\nbar\n\nbaz\n";
2799 /// let mut lines = text.lines();
2801 /// assert_eq!(Some("foo"), lines.next());
2802 /// assert_eq!(Some("bar"), lines.next());
2803 /// assert_eq!(Some(""), lines.next());
2804 /// assert_eq!(Some("baz"), lines.next());
2806 /// assert_eq!(None, lines.next());
2809 /// The final line ending isn't required:
2812 /// let text = "foo\nbar\n\r\nbaz";
2813 /// let mut lines = text.lines();
2815 /// assert_eq!(Some("foo"), lines.next());
2816 /// assert_eq!(Some("bar"), lines.next());
2817 /// assert_eq!(Some(""), lines.next());
2818 /// assert_eq!(Some("baz"), lines.next());
2820 /// assert_eq!(None, lines.next());
2822 #[stable(feature = "rust1", since = "1.0.0")]
2824 pub fn lines(&self) -> Lines<'_> {
2825 Lines(self.split_terminator('\n').map(LinesAnyMap))
2828 /// An iterator over the lines of a string.
2829 #[stable(feature = "rust1", since = "1.0.0")]
2830 #[rustc_deprecated(since = "1.4.0", reason = "use lines() instead now")]
2832 #[allow(deprecated)]
2833 pub fn lines_any(&self) -> LinesAny<'_> {
2834 LinesAny(self.lines())
2837 /// Returns an iterator of `u16` over the string encoded as UTF-16.
2844 /// let text = "Zażółć gęślą jaźń";
2846 /// let utf8_len = text.len();
2847 /// let utf16_len = text.encode_utf16().count();
2849 /// assert!(utf16_len <= utf8_len);
2851 #[stable(feature = "encode_utf16", since = "1.8.0")]
2852 pub fn encode_utf16(&self) -> EncodeUtf16<'_> {
2853 EncodeUtf16 { chars: self.chars(), extra: 0 }
2856 /// Returns `true` if the given pattern matches a sub-slice of
2857 /// this string slice.
2859 /// Returns `false` if it does not.
2866 /// let bananas = "bananas";
2868 /// assert!(bananas.contains("nana"));
2869 /// assert!(!bananas.contains("apples"));
2871 #[stable(feature = "rust1", since = "1.0.0")]
2873 pub fn contains<'a, P: Pattern<'a>>(&'a self, pat: P) -> bool {
2874 pat.is_contained_in(self)
2877 /// Returns `true` if the given pattern matches a prefix of this
2880 /// Returns `false` if it does not.
2887 /// let bananas = "bananas";
2889 /// assert!(bananas.starts_with("bana"));
2890 /// assert!(!bananas.starts_with("nana"));
2892 #[stable(feature = "rust1", since = "1.0.0")]
2893 pub fn starts_with<'a, P: Pattern<'a>>(&'a self, pat: P) -> bool {
2894 pat.is_prefix_of(self)
2897 /// Returns `true` if the given pattern matches a suffix of this
2900 /// Returns `false` if it does not.
2907 /// let bananas = "bananas";
2909 /// assert!(bananas.ends_with("anas"));
2910 /// assert!(!bananas.ends_with("nana"));
2912 #[stable(feature = "rust1", since = "1.0.0")]
2913 pub fn ends_with<'a, P>(&'a self, pat: P) -> bool
2915 P: Pattern<'a, Searcher: ReverseSearcher<'a>>,
2917 pat.is_suffix_of(self)
2920 /// Returns the byte index of the first character of this string slice that
2921 /// matches the pattern.
2923 /// Returns [`None`] if the pattern doesn't match.
2925 /// The pattern can be a `&str`, [`char`], or a closure that determines if
2926 /// a character matches.
2928 /// [`None`]: option/enum.Option.html#variant.None
2932 /// Simple patterns:
2935 /// let s = "Löwe 老虎 Léopard";
2937 /// assert_eq!(s.find('L'), Some(0));
2938 /// assert_eq!(s.find('é'), Some(14));
2939 /// assert_eq!(s.find("Léopard"), Some(13));
2942 /// More complex patterns using point-free style and closures:
2945 /// let s = "Löwe 老虎 Léopard";
2947 /// assert_eq!(s.find(char::is_whitespace), Some(5));
2948 /// assert_eq!(s.find(char::is_lowercase), Some(1));
2949 /// assert_eq!(s.find(|c: char| c.is_whitespace() || c.is_lowercase()), Some(1));
2950 /// assert_eq!(s.find(|c: char| (c < 'o') && (c > 'a')), Some(4));
2953 /// Not finding the pattern:
2956 /// let s = "Löwe 老虎 Léopard";
2957 /// let x: &[_] = &['1', '2'];
2959 /// assert_eq!(s.find(x), None);
2961 #[stable(feature = "rust1", since = "1.0.0")]
2963 pub fn find<'a, P: Pattern<'a>>(&'a self, pat: P) -> Option<usize> {
2964 pat.into_searcher(self).next_match().map(|(i, _)| i)
2967 /// Returns the byte index of the last character of this string slice that
2968 /// matches the pattern.
2970 /// Returns [`None`] if the pattern doesn't match.
2972 /// The pattern can be a `&str`, [`char`], or a closure that determines if
2973 /// a character matches.
2975 /// [`None`]: option/enum.Option.html#variant.None
2979 /// Simple patterns:
2982 /// let s = "Löwe 老虎 Léopard";
2984 /// assert_eq!(s.rfind('L'), Some(13));
2985 /// assert_eq!(s.rfind('é'), Some(14));
2988 /// More complex patterns with closures:
2991 /// let s = "Löwe 老虎 Léopard";
2993 /// assert_eq!(s.rfind(char::is_whitespace), Some(12));
2994 /// assert_eq!(s.rfind(char::is_lowercase), Some(20));
2997 /// Not finding the pattern:
3000 /// let s = "Löwe 老虎 Léopard";
3001 /// let x: &[_] = &['1', '2'];
3003 /// assert_eq!(s.rfind(x), None);
3005 #[stable(feature = "rust1", since = "1.0.0")]
3007 pub fn rfind<'a, P>(&'a self, pat: P) -> Option<usize>
3009 P: Pattern<'a, Searcher: ReverseSearcher<'a>>,
3011 pat.into_searcher(self).next_match_back().map(|(i, _)| i)
3014 /// An iterator over substrings of this string slice, separated by
3015 /// characters matched by a pattern.
3017 /// The pattern can be any type that implements the Pattern trait. Notable
3018 /// examples are `&str`, [`char`], and closures that determines the split.
3020 /// # Iterator behavior
3022 /// The returned iterator will be a [`DoubleEndedIterator`] if the pattern
3023 /// allows a reverse search and forward/reverse search yields the same
3024 /// elements. This is true for, e.g., [`char`], but not for `&str`.
3026 /// [`DoubleEndedIterator`]: iter/trait.DoubleEndedIterator.html
3028 /// If the pattern allows a reverse search but its results might differ
3029 /// from a forward search, the [`rsplit`] method can be used.
3031 /// [`rsplit`]: #method.rsplit
3035 /// Simple patterns:
3038 /// let v: Vec<&str> = "Mary had a little lamb".split(' ').collect();
3039 /// assert_eq!(v, ["Mary", "had", "a", "little", "lamb"]);
3041 /// let v: Vec<&str> = "".split('X').collect();
3042 /// assert_eq!(v, [""]);
3044 /// let v: Vec<&str> = "lionXXtigerXleopard".split('X').collect();
3045 /// assert_eq!(v, ["lion", "", "tiger", "leopard"]);
3047 /// let v: Vec<&str> = "lion::tiger::leopard".split("::").collect();
3048 /// assert_eq!(v, ["lion", "tiger", "leopard"]);
3050 /// let v: Vec<&str> = "abc1def2ghi".split(char::is_numeric).collect();
3051 /// assert_eq!(v, ["abc", "def", "ghi"]);
3053 /// let v: Vec<&str> = "lionXtigerXleopard".split(char::is_uppercase).collect();
3054 /// assert_eq!(v, ["lion", "tiger", "leopard"]);
3057 /// A more complex pattern, using a closure:
3060 /// let v: Vec<&str> = "abc1defXghi".split(|c| c == '1' || c == 'X').collect();
3061 /// assert_eq!(v, ["abc", "def", "ghi"]);
3064 /// If a string contains multiple contiguous separators, you will end up
3065 /// with empty strings in the output:
3068 /// let x = "||||a||b|c".to_string();
3069 /// let d: Vec<_> = x.split('|').collect();
3071 /// assert_eq!(d, &["", "", "", "", "a", "", "b", "c"]);
3074 /// Contiguous separators are separated by the empty string.
3077 /// let x = "(///)".to_string();
3078 /// let d: Vec<_> = x.split('/').collect();
3080 /// assert_eq!(d, &["(", "", "", ")"]);
3083 /// Separators at the start or end of a string are neighbored
3084 /// by empty strings.
3087 /// let d: Vec<_> = "010".split("0").collect();
3088 /// assert_eq!(d, &["", "1", ""]);
3091 /// When the empty string is used as a separator, it separates
3092 /// every character in the string, along with the beginning
3093 /// and end of the string.
3096 /// let f: Vec<_> = "rust".split("").collect();
3097 /// assert_eq!(f, &["", "r", "u", "s", "t", ""]);
3100 /// Contiguous separators can lead to possibly surprising behavior
3101 /// when whitespace is used as the separator. This code is correct:
3104 /// let x = " a b c".to_string();
3105 /// let d: Vec<_> = x.split(' ').collect();
3107 /// assert_eq!(d, &["", "", "", "", "a", "", "b", "c"]);
3110 /// It does _not_ give you:
3113 /// assert_eq!(d, &["a", "b", "c"]);
3116 /// Use [`split_whitespace`] for this behavior.
3118 /// [`split_whitespace`]: #method.split_whitespace
3119 #[stable(feature = "rust1", since = "1.0.0")]
3121 pub fn split<'a, P: Pattern<'a>>(&'a self, pat: P) -> Split<'a, P> {
3122 Split(SplitInternal {
3125 matcher: pat.into_searcher(self),
3126 allow_trailing_empty: true,
3131 /// An iterator over substrings of the given string slice, separated by
3132 /// characters matched by a pattern and yielded in reverse order.
3134 /// The pattern can be any type that implements the Pattern trait. Notable
3135 /// examples are `&str`, [`char`], and closures that determines the split.
3137 /// # Iterator behavior
3139 /// The returned iterator requires that the pattern supports a reverse
3140 /// search, and it will be a [`DoubleEndedIterator`] if a forward/reverse
3141 /// search yields the same elements.
3143 /// [`DoubleEndedIterator`]: iter/trait.DoubleEndedIterator.html
3145 /// For iterating from the front, the [`split`] method can be used.
3147 /// [`split`]: #method.split
3151 /// Simple patterns:
3154 /// let v: Vec<&str> = "Mary had a little lamb".rsplit(' ').collect();
3155 /// assert_eq!(v, ["lamb", "little", "a", "had", "Mary"]);
3157 /// let v: Vec<&str> = "".rsplit('X').collect();
3158 /// assert_eq!(v, [""]);
3160 /// let v: Vec<&str> = "lionXXtigerXleopard".rsplit('X').collect();
3161 /// assert_eq!(v, ["leopard", "tiger", "", "lion"]);
3163 /// let v: Vec<&str> = "lion::tiger::leopard".rsplit("::").collect();
3164 /// assert_eq!(v, ["leopard", "tiger", "lion"]);
3167 /// A more complex pattern, using a closure:
3170 /// let v: Vec<&str> = "abc1defXghi".rsplit(|c| c == '1' || c == 'X').collect();
3171 /// assert_eq!(v, ["ghi", "def", "abc"]);
3173 #[stable(feature = "rust1", since = "1.0.0")]
3175 pub fn rsplit<'a, P>(&'a self, pat: P) -> RSplit<'a, P>
3177 P: Pattern<'a, Searcher: ReverseSearcher<'a>>,
3179 RSplit(self.split(pat).0)
3182 /// An iterator over substrings of the given string slice, separated by
3183 /// characters matched by a pattern.
3185 /// The pattern can be any type that implements the Pattern trait. Notable
3186 /// examples are `&str`, [`char`], and closures that determines the split.
3188 /// Equivalent to [`split`], except that the trailing substring
3189 /// is skipped if empty.
3191 /// [`split`]: #method.split
3193 /// This method can be used for string data that is _terminated_,
3194 /// rather than _separated_ by a pattern.
3196 /// # Iterator behavior
3198 /// The returned iterator will be a [`DoubleEndedIterator`] if the pattern
3199 /// allows a reverse search and forward/reverse search yields the same
3200 /// elements. This is true for, e.g., [`char`], but not for `&str`.
3202 /// [`DoubleEndedIterator`]: iter/trait.DoubleEndedIterator.html
3204 /// If the pattern allows a reverse search but its results might differ
3205 /// from a forward search, the [`rsplit_terminator`] method can be used.
3207 /// [`rsplit_terminator`]: #method.rsplit_terminator
3214 /// let v: Vec<&str> = "A.B.".split_terminator('.').collect();
3215 /// assert_eq!(v, ["A", "B"]);
3217 /// let v: Vec<&str> = "A..B..".split_terminator(".").collect();
3218 /// assert_eq!(v, ["A", "", "B", ""]);
3220 #[stable(feature = "rust1", since = "1.0.0")]
3222 pub fn split_terminator<'a, P: Pattern<'a>>(&'a self, pat: P) -> SplitTerminator<'a, P> {
3223 SplitTerminator(SplitInternal {
3224 allow_trailing_empty: false,
3229 /// An iterator over substrings of `self`, separated by characters
3230 /// matched by a pattern and yielded in reverse order.
3232 /// The pattern can be any type that implements the Pattern trait. Notable
3233 /// examples are `&str`, [`char`], and closures that determines the split.
3234 /// Additional libraries might provide more complex patterns like
3235 /// regular expressions.
3237 /// Equivalent to [`split`], except that the trailing substring is
3238 /// skipped if empty.
3240 /// [`split`]: #method.split
3242 /// This method can be used for string data that is _terminated_,
3243 /// rather than _separated_ by a pattern.
3245 /// # Iterator behavior
3247 /// The returned iterator requires that the pattern supports a
3248 /// reverse search, and it will be double ended if a forward/reverse
3249 /// search yields the same elements.
3251 /// For iterating from the front, the [`split_terminator`] method can be
3254 /// [`split_terminator`]: #method.split_terminator
3259 /// let v: Vec<&str> = "A.B.".rsplit_terminator('.').collect();
3260 /// assert_eq!(v, ["B", "A"]);
3262 /// let v: Vec<&str> = "A..B..".rsplit_terminator(".").collect();
3263 /// assert_eq!(v, ["", "B", "", "A"]);
3265 #[stable(feature = "rust1", since = "1.0.0")]
3267 pub fn rsplit_terminator<'a, P>(&'a self, pat: P) -> RSplitTerminator<'a, P>
3269 P: Pattern<'a, Searcher: ReverseSearcher<'a>>,
3271 RSplitTerminator(self.split_terminator(pat).0)
3274 /// An iterator over substrings of the given string slice, separated by a
3275 /// pattern, restricted to returning at most `n` items.
3277 /// If `n` substrings are returned, the last substring (the `n`th substring)
3278 /// will contain the remainder of the string.
3280 /// The pattern can be any type that implements the Pattern trait. Notable
3281 /// examples are `&str`, [`char`], and closures that determines the split.
3283 /// # Iterator behavior
3285 /// The returned iterator will not be double ended, because it is
3286 /// not efficient to support.
3288 /// If the pattern allows a reverse search, the [`rsplitn`] method can be
3291 /// [`rsplitn`]: #method.rsplitn
3295 /// Simple patterns:
3298 /// let v: Vec<&str> = "Mary had a little lambda".splitn(3, ' ').collect();
3299 /// assert_eq!(v, ["Mary", "had", "a little lambda"]);
3301 /// let v: Vec<&str> = "lionXXtigerXleopard".splitn(3, "X").collect();
3302 /// assert_eq!(v, ["lion", "", "tigerXleopard"]);
3304 /// let v: Vec<&str> = "abcXdef".splitn(1, 'X').collect();
3305 /// assert_eq!(v, ["abcXdef"]);
3307 /// let v: Vec<&str> = "".splitn(1, 'X').collect();
3308 /// assert_eq!(v, [""]);
3311 /// A more complex pattern, using a closure:
3314 /// let v: Vec<&str> = "abc1defXghi".splitn(2, |c| c == '1' || c == 'X').collect();
3315 /// assert_eq!(v, ["abc", "defXghi"]);
3317 #[stable(feature = "rust1", since = "1.0.0")]
3319 pub fn splitn<'a, P: Pattern<'a>>(&'a self, n: usize, pat: P) -> SplitN<'a, P> {
3320 SplitN(SplitNInternal {
3321 iter: self.split(pat).0,
3326 /// An iterator over substrings of this string slice, separated by a
3327 /// pattern, starting from the end of the string, restricted to returning
3328 /// at most `n` items.
3330 /// If `n` substrings are returned, the last substring (the `n`th substring)
3331 /// will contain the remainder of the string.
3333 /// The pattern can be any type that implements the Pattern trait. Notable
3334 /// examples are `&str`, [`char`], and closures that determines the split.
3336 /// # Iterator behavior
3338 /// The returned iterator will not be double ended, because it is not
3339 /// efficient to support.
3341 /// For splitting from the front, the [`splitn`] method can be used.
3343 /// [`splitn`]: #method.splitn
3347 /// Simple patterns:
3350 /// let v: Vec<&str> = "Mary had a little lamb".rsplitn(3, ' ').collect();
3351 /// assert_eq!(v, ["lamb", "little", "Mary had a"]);
3353 /// let v: Vec<&str> = "lionXXtigerXleopard".rsplitn(3, 'X').collect();
3354 /// assert_eq!(v, ["leopard", "tiger", "lionX"]);
3356 /// let v: Vec<&str> = "lion::tiger::leopard".rsplitn(2, "::").collect();
3357 /// assert_eq!(v, ["leopard", "lion::tiger"]);
3360 /// A more complex pattern, using a closure:
3363 /// let v: Vec<&str> = "abc1defXghi".rsplitn(2, |c| c == '1' || c == 'X').collect();
3364 /// assert_eq!(v, ["ghi", "abc1def"]);
3366 #[stable(feature = "rust1", since = "1.0.0")]
3368 pub fn rsplitn<'a, P>(&'a self, n: usize, pat: P) -> RSplitN<'a, P>
3370 P: Pattern<'a, Searcher: ReverseSearcher<'a>>,
3372 RSplitN(self.splitn(n, pat).0)
3375 /// An iterator over the disjoint matches of a pattern within the given string
3378 /// The pattern can be a `&str`, [`char`], or a closure that determines if
3379 /// a character matches.
3381 /// # Iterator behavior
3383 /// The returned iterator will be a [`DoubleEndedIterator`] if the pattern
3384 /// allows a reverse search and forward/reverse search yields the same
3385 /// elements. This is true for, e.g., [`char`], but not for `&str`.
3387 /// [`DoubleEndedIterator`]: iter/trait.DoubleEndedIterator.html
3389 /// If the pattern allows a reverse search but its results might differ
3390 /// from a forward search, the [`rmatches`] method can be used.
3392 /// [`rmatches`]: #method.rmatches
3399 /// let v: Vec<&str> = "abcXXXabcYYYabc".matches("abc").collect();
3400 /// assert_eq!(v, ["abc", "abc", "abc"]);
3402 /// let v: Vec<&str> = "1abc2abc3".matches(char::is_numeric).collect();
3403 /// assert_eq!(v, ["1", "2", "3"]);
3405 #[stable(feature = "str_matches", since = "1.2.0")]
3407 pub fn matches<'a, P: Pattern<'a>>(&'a self, pat: P) -> Matches<'a, P> {
3408 Matches(MatchesInternal(pat.into_searcher(self)))
3411 /// An iterator over the disjoint matches of a pattern within this string slice,
3412 /// yielded in reverse order.
3414 /// The pattern can be a `&str`, [`char`], or a closure that determines if
3415 /// a character matches.
3417 /// # Iterator behavior
3419 /// The returned iterator requires that the pattern supports a reverse
3420 /// search, and it will be a [`DoubleEndedIterator`] if a forward/reverse
3421 /// search yields the same elements.
3423 /// [`DoubleEndedIterator`]: iter/trait.DoubleEndedIterator.html
3425 /// For iterating from the front, the [`matches`] method can be used.
3427 /// [`matches`]: #method.matches
3434 /// let v: Vec<&str> = "abcXXXabcYYYabc".rmatches("abc").collect();
3435 /// assert_eq!(v, ["abc", "abc", "abc"]);
3437 /// let v: Vec<&str> = "1abc2abc3".rmatches(char::is_numeric).collect();
3438 /// assert_eq!(v, ["3", "2", "1"]);
3440 #[stable(feature = "str_matches", since = "1.2.0")]
3442 pub fn rmatches<'a, P>(&'a self, pat: P) -> RMatches<'a, P>
3444 P: Pattern<'a, Searcher: ReverseSearcher<'a>>,
3446 RMatches(self.matches(pat).0)
3449 /// An iterator over the disjoint matches of a pattern within this string
3450 /// slice as well as the index that the match starts at.
3452 /// For matches of `pat` within `self` that overlap, only the indices
3453 /// corresponding to the first match are returned.
3455 /// The pattern can be a `&str`, [`char`], or a closure that determines
3456 /// if a character matches.
3458 /// # Iterator behavior
3460 /// The returned iterator will be a [`DoubleEndedIterator`] if the pattern
3461 /// allows a reverse search and forward/reverse search yields the same
3462 /// elements. This is true for, e.g., [`char`], but not for `&str`.
3464 /// [`DoubleEndedIterator`]: iter/trait.DoubleEndedIterator.html
3466 /// If the pattern allows a reverse search but its results might differ
3467 /// from a forward search, the [`rmatch_indices`] method can be used.
3469 /// [`rmatch_indices`]: #method.rmatch_indices
3476 /// let v: Vec<_> = "abcXXXabcYYYabc".match_indices("abc").collect();
3477 /// assert_eq!(v, [(0, "abc"), (6, "abc"), (12, "abc")]);
3479 /// let v: Vec<_> = "1abcabc2".match_indices("abc").collect();
3480 /// assert_eq!(v, [(1, "abc"), (4, "abc")]);
3482 /// let v: Vec<_> = "ababa".match_indices("aba").collect();
3483 /// assert_eq!(v, [(0, "aba")]); // only the first `aba`
3485 #[stable(feature = "str_match_indices", since = "1.5.0")]
3487 pub fn match_indices<'a, P: Pattern<'a>>(&'a self, pat: P) -> MatchIndices<'a, P> {
3488 MatchIndices(MatchIndicesInternal(pat.into_searcher(self)))
3491 /// An iterator over the disjoint matches of a pattern within `self`,
3492 /// yielded in reverse order along with the index of the match.
3494 /// For matches of `pat` within `self` that overlap, only the indices
3495 /// corresponding to the last match are returned.
3497 /// The pattern can be a `&str`, [`char`], or a closure that determines if a
3498 /// character matches.
3500 /// # Iterator behavior
3502 /// The returned iterator requires that the pattern supports a reverse
3503 /// search, and it will be a [`DoubleEndedIterator`] if a forward/reverse
3504 /// search yields the same elements.
3506 /// [`DoubleEndedIterator`]: iter/trait.DoubleEndedIterator.html
3508 /// For iterating from the front, the [`match_indices`] method can be used.
3510 /// [`match_indices`]: #method.match_indices
3517 /// let v: Vec<_> = "abcXXXabcYYYabc".rmatch_indices("abc").collect();
3518 /// assert_eq!(v, [(12, "abc"), (6, "abc"), (0, "abc")]);
3520 /// let v: Vec<_> = "1abcabc2".rmatch_indices("abc").collect();
3521 /// assert_eq!(v, [(4, "abc"), (1, "abc")]);
3523 /// let v: Vec<_> = "ababa".rmatch_indices("aba").collect();
3524 /// assert_eq!(v, [(2, "aba")]); // only the last `aba`
3526 #[stable(feature = "str_match_indices", since = "1.5.0")]
3528 pub fn rmatch_indices<'a, P>(&'a self, pat: P) -> RMatchIndices<'a, P>
3530 P: Pattern<'a, Searcher: ReverseSearcher<'a>>,
3532 RMatchIndices(self.match_indices(pat).0)
3535 /// Returns a string slice with leading and trailing whitespace removed.
3537 /// 'Whitespace' is defined according to the terms of the Unicode Derived
3538 /// Core Property `White_Space`.
3545 /// let s = " Hello\tworld\t";
3547 /// assert_eq!("Hello\tworld", s.trim());
3549 #[must_use = "this returns the trimmed string as a slice, \
3550 without modifying the original"]
3551 #[stable(feature = "rust1", since = "1.0.0")]
3552 pub fn trim(&self) -> &str {
3553 self.trim_matches(|c: char| c.is_whitespace())
3556 /// Returns a string slice with leading whitespace removed.
3558 /// 'Whitespace' is defined according to the terms of the Unicode Derived
3559 /// Core Property `White_Space`.
3561 /// # Text directionality
3563 /// A string is a sequence of bytes. `start` in this context means the first
3564 /// position of that byte string; for a left-to-right language like English or
3565 /// Russian, this will be left side, and for right-to-left languages like
3566 /// Arabic or Hebrew, this will be the right side.
3573 /// let s = " Hello\tworld\t";
3574 /// assert_eq!("Hello\tworld\t", s.trim_start());
3580 /// let s = " English ";
3581 /// assert!(Some('E') == s.trim_start().chars().next());
3583 /// let s = " עברית ";
3584 /// assert!(Some('ע') == s.trim_start().chars().next());
3586 #[must_use = "this returns the trimmed string as a new slice, \
3587 without modifying the original"]
3588 #[stable(feature = "trim_direction", since = "1.30.0")]
3589 pub fn trim_start(&self) -> &str {
3590 self.trim_start_matches(|c: char| c.is_whitespace())
3593 /// Returns a string slice with trailing whitespace removed.
3595 /// 'Whitespace' is defined according to the terms of the Unicode Derived
3596 /// Core Property `White_Space`.
3598 /// # Text directionality
3600 /// A string is a sequence of bytes. `end` in this context means the last
3601 /// position of that byte string; for a left-to-right language like English or
3602 /// Russian, this will be right side, and for right-to-left languages like
3603 /// Arabic or Hebrew, this will be the left side.
3610 /// let s = " Hello\tworld\t";
3611 /// assert_eq!(" Hello\tworld", s.trim_end());
3617 /// let s = " English ";
3618 /// assert!(Some('h') == s.trim_end().chars().rev().next());
3620 /// let s = " עברית ";
3621 /// assert!(Some('ת') == s.trim_end().chars().rev().next());
3623 #[must_use = "this returns the trimmed string as a new slice, \
3624 without modifying the original"]
3625 #[stable(feature = "trim_direction", since = "1.30.0")]
3626 pub fn trim_end(&self) -> &str {
3627 self.trim_end_matches(|c: char| c.is_whitespace())
3630 /// Returns a string slice with leading whitespace removed.
3632 /// 'Whitespace' is defined according to the terms of the Unicode Derived
3633 /// Core Property `White_Space`.
3635 /// # Text directionality
3637 /// A string is a sequence of bytes. 'Left' in this context means the first
3638 /// position of that byte string; for a language like Arabic or Hebrew
3639 /// which are 'right to left' rather than 'left to right', this will be
3640 /// the _right_ side, not the left.
3647 /// let s = " Hello\tworld\t";
3649 /// assert_eq!("Hello\tworld\t", s.trim_left());
3655 /// let s = " English";
3656 /// assert!(Some('E') == s.trim_left().chars().next());
3658 /// let s = " עברית";
3659 /// assert!(Some('ע') == s.trim_left().chars().next());
3661 #[stable(feature = "rust1", since = "1.0.0")]
3664 reason = "superseded by `trim_start`",
3665 suggestion = "trim_start",
3667 pub fn trim_left(&self) -> &str {
3671 /// Returns a string slice with trailing whitespace removed.
3673 /// 'Whitespace' is defined according to the terms of the Unicode Derived
3674 /// Core Property `White_Space`.
3676 /// # Text directionality
3678 /// A string is a sequence of bytes. 'Right' in this context means the last
3679 /// position of that byte string; for a language like Arabic or Hebrew
3680 /// which are 'right to left' rather than 'left to right', this will be
3681 /// the _left_ side, not the right.
3688 /// let s = " Hello\tworld\t";
3690 /// assert_eq!(" Hello\tworld", s.trim_right());
3696 /// let s = "English ";
3697 /// assert!(Some('h') == s.trim_right().chars().rev().next());
3699 /// let s = "עברית ";
3700 /// assert!(Some('ת') == s.trim_right().chars().rev().next());
3702 #[stable(feature = "rust1", since = "1.0.0")]
3705 reason = "superseded by `trim_end`",
3706 suggestion = "trim_end",
3708 pub fn trim_right(&self) -> &str {
3712 /// Returns a string slice with all prefixes and suffixes that match a
3713 /// pattern repeatedly removed.
3715 /// The pattern can be a [`char`] or a closure that determines if a
3716 /// character matches.
3720 /// Simple patterns:
3723 /// assert_eq!("11foo1bar11".trim_matches('1'), "foo1bar");
3724 /// assert_eq!("123foo1bar123".trim_matches(char::is_numeric), "foo1bar");
3726 /// let x: &[_] = &['1', '2'];
3727 /// assert_eq!("12foo1bar12".trim_matches(x), "foo1bar");
3730 /// A more complex pattern, using a closure:
3733 /// assert_eq!("1foo1barXX".trim_matches(|c| c == '1' || c == 'X'), "foo1bar");
3735 #[must_use = "this returns the trimmed string as a new slice, \
3736 without modifying the original"]
3737 #[stable(feature = "rust1", since = "1.0.0")]
3738 pub fn trim_matches<'a, P>(&'a self, pat: P) -> &'a str
3740 P: Pattern<'a, Searcher: DoubleEndedSearcher<'a>>,
3744 let mut matcher = pat.into_searcher(self);
3745 if let Some((a, b)) = matcher.next_reject() {
3747 j = b; // Remember earliest known match, correct it below if
3748 // last match is different
3750 if let Some((_, b)) = matcher.next_reject_back() {
3754 // Searcher is known to return valid indices
3755 self.get_unchecked(i..j)
3759 /// Returns a string slice with all prefixes that match a pattern
3760 /// repeatedly removed.
3762 /// The pattern can be a `&str`, [`char`], or a closure that determines if
3763 /// a character matches.
3765 /// # Text directionality
3767 /// A string is a sequence of bytes. `start` in this context means the first
3768 /// position of that byte string; for a left-to-right language like English or
3769 /// Russian, this will be left side, and for right-to-left languages like
3770 /// Arabic or Hebrew, this will be the right side.
3777 /// assert_eq!("11foo1bar11".trim_start_matches('1'), "foo1bar11");
3778 /// assert_eq!("123foo1bar123".trim_start_matches(char::is_numeric), "foo1bar123");
3780 /// let x: &[_] = &['1', '2'];
3781 /// assert_eq!("12foo1bar12".trim_start_matches(x), "foo1bar12");
3783 #[must_use = "this returns the trimmed string as a new slice, \
3784 without modifying the original"]
3785 #[stable(feature = "trim_direction", since = "1.30.0")]
3786 pub fn trim_start_matches<'a, P: Pattern<'a>>(&'a self, pat: P) -> &'a str {
3787 let mut i = self.len();
3788 let mut matcher = pat.into_searcher(self);
3789 if let Some((a, _)) = matcher.next_reject() {
3793 // Searcher is known to return valid indices
3794 self.get_unchecked(i..self.len())
3798 /// Returns a string slice with the prefix removed.
3800 /// If the string starts with the pattern `prefix`, `Some` is returned with the substring where
3801 /// the prefix is removed. Unlike `trim_start_matches`, this method removes the prefix exactly
3804 /// If the string does not start with `prefix`, `None` is returned.
3809 /// #![feature(str_strip)]
3811 /// assert_eq!("foobar".strip_prefix("foo"), Some("bar"));
3812 /// assert_eq!("foobar".strip_prefix("bar"), None);
3813 /// assert_eq!("foofoo".strip_prefix("foo"), Some("foo"));
3815 #[must_use = "this returns the remaining substring as a new slice, \
3816 without modifying the original"]
3817 #[unstable(feature = "str_strip", reason = "newly added", issue = "67302")]
3818 pub fn strip_prefix<'a, P: Pattern<'a>>(&'a self, prefix: P) -> Option<&'a str> {
3819 let mut matcher = prefix.into_searcher(self);
3820 if let SearchStep::Match(start, len) = matcher.next() {
3821 debug_assert_eq!(start, 0, "The first search step from Searcher \
3822 must include the first character");
3824 // Searcher is known to return valid indices.
3825 Some(self.get_unchecked(len..))
3832 /// Returns a string slice with the suffix removed.
3834 /// If the string ends with the pattern `suffix`, `Some` is returned with the substring where
3835 /// the suffix is removed. Unlike `trim_end_matches`, this method removes the suffix exactly
3838 /// If the string does not end with `suffix`, `None` is returned.
3843 /// #![feature(str_strip)]
3844 /// assert_eq!("barfoo".strip_suffix("foo"), Some("bar"));
3845 /// assert_eq!("barfoo".strip_suffix("bar"), None);
3846 /// assert_eq!("foofoo".strip_suffix("foo"), Some("foo"));
3848 #[must_use = "this returns the remaining substring as a new slice, \
3849 without modifying the original"]
3850 #[unstable(feature = "str_strip", reason = "newly added", issue = "67302")]
3851 pub fn strip_suffix<'a, P>(&'a self, suffix: P) -> Option<&'a str>
3854 <P as Pattern<'a>>::Searcher: ReverseSearcher<'a>,
3856 let mut matcher = suffix.into_searcher(self);
3857 if let SearchStep::Match(start, end) = matcher.next_back() {
3858 debug_assert_eq!(end, self.len(), "The first search step from ReverseSearcher \
3859 must include the last character");
3861 // Searcher is known to return valid indices.
3862 Some(self.get_unchecked(..start))
3869 /// Returns a string slice with all suffixes that match a pattern
3870 /// repeatedly removed.
3872 /// The pattern can be a `&str`, [`char`], or a closure that
3873 /// determines if a character matches.
3875 /// # Text directionality
3877 /// A string is a sequence of bytes. `end` in this context means the last
3878 /// position of that byte string; for a left-to-right language like English or
3879 /// Russian, this will be right side, and for right-to-left languages like
3880 /// Arabic or Hebrew, this will be the left side.
3884 /// Simple patterns:
3887 /// assert_eq!("11foo1bar11".trim_end_matches('1'), "11foo1bar");
3888 /// assert_eq!("123foo1bar123".trim_end_matches(char::is_numeric), "123foo1bar");
3890 /// let x: &[_] = &['1', '2'];
3891 /// assert_eq!("12foo1bar12".trim_end_matches(x), "12foo1bar");
3894 /// A more complex pattern, using a closure:
3897 /// assert_eq!("1fooX".trim_end_matches(|c| c == '1' || c == 'X'), "1foo");
3899 #[must_use = "this returns the trimmed string as a new slice, \
3900 without modifying the original"]
3901 #[stable(feature = "trim_direction", since = "1.30.0")]
3902 pub fn trim_end_matches<'a, P>(&'a self, pat: P) -> &'a str
3904 P: Pattern<'a, Searcher: ReverseSearcher<'a>>,
3907 let mut matcher = pat.into_searcher(self);
3908 if let Some((_, b)) = matcher.next_reject_back() {
3912 // Searcher is known to return valid indices
3913 self.get_unchecked(0..j)
3917 /// Returns a string slice with all prefixes that match a pattern
3918 /// repeatedly removed.
3920 /// The pattern can be a `&str`, [`char`], or a closure that determines if
3921 /// a character matches.
3923 /// [`char`]: primitive.char.html
3925 /// # Text directionality
3927 /// A string is a sequence of bytes. 'Left' in this context means the first
3928 /// position of that byte string; for a language like Arabic or Hebrew
3929 /// which are 'right to left' rather than 'left to right', this will be
3930 /// the _right_ side, not the left.
3937 /// assert_eq!("11foo1bar11".trim_left_matches('1'), "foo1bar11");
3938 /// assert_eq!("123foo1bar123".trim_left_matches(char::is_numeric), "foo1bar123");
3940 /// let x: &[_] = &['1', '2'];
3941 /// assert_eq!("12foo1bar12".trim_left_matches(x), "foo1bar12");
3943 #[stable(feature = "rust1", since = "1.0.0")]
3946 reason = "superseded by `trim_start_matches`",
3947 suggestion = "trim_start_matches",
3949 pub fn trim_left_matches<'a, P: Pattern<'a>>(&'a self, pat: P) -> &'a str {
3950 self.trim_start_matches(pat)
3953 /// Returns a string slice with all suffixes that match a pattern
3954 /// repeatedly removed.
3956 /// The pattern can be a `&str`, [`char`], or a closure that
3957 /// determines if a character matches.
3959 /// [`char`]: primitive.char.html
3961 /// # Text directionality
3963 /// A string is a sequence of bytes. 'Right' in this context means the last
3964 /// position of that byte string; for a language like Arabic or Hebrew
3965 /// which are 'right to left' rather than 'left to right', this will be
3966 /// the _left_ side, not the right.
3970 /// Simple patterns:
3973 /// assert_eq!("11foo1bar11".trim_right_matches('1'), "11foo1bar");
3974 /// assert_eq!("123foo1bar123".trim_right_matches(char::is_numeric), "123foo1bar");
3976 /// let x: &[_] = &['1', '2'];
3977 /// assert_eq!("12foo1bar12".trim_right_matches(x), "12foo1bar");
3980 /// A more complex pattern, using a closure:
3983 /// assert_eq!("1fooX".trim_right_matches(|c| c == '1' || c == 'X'), "1foo");
3985 #[stable(feature = "rust1", since = "1.0.0")]
3988 reason = "superseded by `trim_end_matches`",
3989 suggestion = "trim_end_matches",
3991 pub fn trim_right_matches<'a, P>(&'a self, pat: P) -> &'a str
3993 P: Pattern<'a, Searcher: ReverseSearcher<'a>>,
3995 self.trim_end_matches(pat)
3998 /// Parses this string slice into another type.
4000 /// Because `parse` is so general, it can cause problems with type
4001 /// inference. As such, `parse` is one of the few times you'll see
4002 /// the syntax affectionately known as the 'turbofish': `::<>`. This
4003 /// helps the inference algorithm understand specifically which type
4004 /// you're trying to parse into.
4006 /// `parse` can parse any type that implements the [`FromStr`] trait.
4008 /// [`FromStr`]: str/trait.FromStr.html
4012 /// Will return [`Err`] if it's not possible to parse this string slice into
4013 /// the desired type.
4015 /// [`Err`]: str/trait.FromStr.html#associatedtype.Err
4022 /// let four: u32 = "4".parse().unwrap();
4024 /// assert_eq!(4, four);
4027 /// Using the 'turbofish' instead of annotating `four`:
4030 /// let four = "4".parse::<u32>();
4032 /// assert_eq!(Ok(4), four);
4035 /// Failing to parse:
4038 /// let nope = "j".parse::<u32>();
4040 /// assert!(nope.is_err());
4043 #[stable(feature = "rust1", since = "1.0.0")]
4044 pub fn parse<F: FromStr>(&self) -> Result<F, F::Err> {
4045 FromStr::from_str(self)
4048 /// Checks if all characters in this string are within the ASCII range.
4053 /// let ascii = "hello!\n";
4054 /// let non_ascii = "Grüße, Jürgen ❤";
4056 /// assert!(ascii.is_ascii());
4057 /// assert!(!non_ascii.is_ascii());
4059 #[stable(feature = "ascii_methods_on_intrinsics", since = "1.23.0")]
4061 pub fn is_ascii(&self) -> bool {
4062 // We can treat each byte as character here: all multibyte characters
4063 // start with a byte that is not in the ascii range, so we will stop
4065 self.bytes().all(|b| b.is_ascii())
4068 /// Checks that two strings are an ASCII case-insensitive match.
4070 /// Same as `to_ascii_lowercase(a) == to_ascii_lowercase(b)`,
4071 /// but without allocating and copying temporaries.
4076 /// assert!("Ferris".eq_ignore_ascii_case("FERRIS"));
4077 /// assert!("Ferrös".eq_ignore_ascii_case("FERRöS"));
4078 /// assert!(!"Ferrös".eq_ignore_ascii_case("FERRÖS"));
4080 #[stable(feature = "ascii_methods_on_intrinsics", since = "1.23.0")]
4082 pub fn eq_ignore_ascii_case(&self, other: &str) -> bool {
4083 self.as_bytes().eq_ignore_ascii_case(other.as_bytes())
4086 /// Converts this string to its ASCII upper case equivalent in-place.
4088 /// ASCII letters 'a' to 'z' are mapped to 'A' to 'Z',
4089 /// but non-ASCII letters are unchanged.
4091 /// To return a new uppercased value without modifying the existing one, use
4092 /// [`to_ascii_uppercase`].
4094 /// [`to_ascii_uppercase`]: #method.to_ascii_uppercase
4099 /// let mut s = String::from("Grüße, Jürgen ❤");
4101 /// s.make_ascii_uppercase();
4103 /// assert_eq!("GRüßE, JüRGEN ❤", s);
4105 #[stable(feature = "ascii_methods_on_intrinsics", since = "1.23.0")]
4106 pub fn make_ascii_uppercase(&mut self) {
4107 let me = unsafe { self.as_bytes_mut() };
4108 me.make_ascii_uppercase()
4111 /// Converts this string to its ASCII lower case equivalent in-place.
4113 /// ASCII letters 'A' to 'Z' are mapped to 'a' to 'z',
4114 /// but non-ASCII letters are unchanged.
4116 /// To return a new lowercased value without modifying the existing one, use
4117 /// [`to_ascii_lowercase`].
4119 /// [`to_ascii_lowercase`]: #method.to_ascii_lowercase
4124 /// let mut s = String::from("GRÜßE, JÜRGEN ❤");
4126 /// s.make_ascii_lowercase();
4128 /// assert_eq!("grÜße, jÜrgen ❤", s);
4130 #[stable(feature = "ascii_methods_on_intrinsics", since = "1.23.0")]
4131 pub fn make_ascii_lowercase(&mut self) {
4132 let me = unsafe { self.as_bytes_mut() };
4133 me.make_ascii_lowercase()
4136 /// Return an iterator that escapes each char in `self` with [`char::escape_debug`].
4138 /// Note: only extended grapheme codepoints that begin the string will be
4141 /// [`char::escape_debug`]: ../std/primitive.char.html#method.escape_debug
4148 /// for c in "❤\n!".escape_debug() {
4149 /// print!("{}", c);
4154 /// Using `println!` directly:
4157 /// println!("{}", "❤\n!".escape_debug());
4161 /// Both are equivalent to:
4164 /// println!("❤\\n!");
4167 /// Using `to_string`:
4170 /// assert_eq!("❤\n!".escape_debug().to_string(), "❤\\n!");
4172 #[stable(feature = "str_escape", since = "1.34.0")]
4173 pub fn escape_debug(&self) -> EscapeDebug<'_> {
4174 let mut chars = self.chars();
4177 .map(|first| first.escape_debug_ext(true))
4180 .chain(chars.flat_map(CharEscapeDebugContinue))
4184 /// Return an iterator that escapes each char in `self` with [`char::escape_default`].
4186 /// [`char::escape_default`]: ../std/primitive.char.html#method.escape_default
4193 /// for c in "❤\n!".escape_default() {
4194 /// print!("{}", c);
4199 /// Using `println!` directly:
4202 /// println!("{}", "❤\n!".escape_default());
4206 /// Both are equivalent to:
4209 /// println!("\\u{{2764}}\\n!");
4212 /// Using `to_string`:
4215 /// assert_eq!("❤\n!".escape_default().to_string(), "\\u{2764}\\n!");
4217 #[stable(feature = "str_escape", since = "1.34.0")]
4218 pub fn escape_default(&self) -> EscapeDefault<'_> {
4219 EscapeDefault { inner: self.chars().flat_map(CharEscapeDefault) }
4222 /// Return an iterator that escapes each char in `self` with [`char::escape_unicode`].
4224 /// [`char::escape_unicode`]: ../std/primitive.char.html#method.escape_unicode
4231 /// for c in "❤\n!".escape_unicode() {
4232 /// print!("{}", c);
4237 /// Using `println!` directly:
4240 /// println!("{}", "❤\n!".escape_unicode());
4244 /// Both are equivalent to:
4247 /// println!("\\u{{2764}}\\u{{a}}\\u{{21}}");
4250 /// Using `to_string`:
4253 /// assert_eq!("❤\n!".escape_unicode().to_string(), "\\u{2764}\\u{a}\\u{21}");
4255 #[stable(feature = "str_escape", since = "1.34.0")]
4256 pub fn escape_unicode(&self) -> EscapeUnicode<'_> {
4257 EscapeUnicode { inner: self.chars().flat_map(CharEscapeUnicode) }
4263 struct CharEscapeDebugContinue impl Fn = |c: char| -> char::EscapeDebug {
4264 c.escape_debug_ext(false)
4268 struct CharEscapeUnicode impl Fn = |c: char| -> char::EscapeUnicode {
4272 struct CharEscapeDefault impl Fn = |c: char| -> char::EscapeDefault {
4277 #[stable(feature = "rust1", since = "1.0.0")]
4278 impl AsRef<[u8]> for str {
4280 fn as_ref(&self) -> &[u8] {
4285 #[stable(feature = "rust1", since = "1.0.0")]
4286 impl Default for &str {
4287 /// Creates an empty str
4288 fn default() -> Self { "" }
4291 #[stable(feature = "default_mut_str", since = "1.28.0")]
4292 impl Default for &mut str {
4293 /// Creates an empty mutable str
4294 fn default() -> Self { unsafe { from_utf8_unchecked_mut(&mut []) } }
4297 /// An iterator over the non-whitespace substrings of a string,
4298 /// separated by any amount of whitespace.
4300 /// This struct is created by the [`split_whitespace`] method on [`str`].
4301 /// See its documentation for more.
4303 /// [`split_whitespace`]: ../../std/primitive.str.html#method.split_whitespace
4304 /// [`str`]: ../../std/primitive.str.html
4305 #[stable(feature = "split_whitespace", since = "1.1.0")]
4306 #[derive(Clone, Debug)]
4307 pub struct SplitWhitespace<'a> {
4308 inner: Filter<Split<'a, IsWhitespace>, IsNotEmpty>,
4311 /// An iterator over the non-ASCII-whitespace substrings of a string,
4312 /// separated by any amount of ASCII whitespace.
4314 /// This struct is created by the [`split_ascii_whitespace`] method on [`str`].
4315 /// See its documentation for more.
4317 /// [`split_ascii_whitespace`]: ../../std/primitive.str.html#method.split_ascii_whitespace
4318 /// [`str`]: ../../std/primitive.str.html
4319 #[stable(feature = "split_ascii_whitespace", since = "1.34.0")]
4320 #[derive(Clone, Debug)]
4321 pub struct SplitAsciiWhitespace<'a> {
4322 inner: Map<Filter<SliceSplit<'a, u8, IsAsciiWhitespace>, BytesIsNotEmpty>, UnsafeBytesToStr>,
4327 struct IsWhitespace impl Fn = |c: char| -> bool {
4332 struct IsAsciiWhitespace impl Fn = |byte: &u8| -> bool {
4333 byte.is_ascii_whitespace()
4337 struct IsNotEmpty impl<'a, 'b> Fn = |s: &'a &'b str| -> bool {
4342 struct BytesIsNotEmpty impl<'a, 'b> Fn = |s: &'a &'b [u8]| -> bool {
4347 struct UnsafeBytesToStr impl<'a> Fn = |bytes: &'a [u8]| -> &'a str {
4348 unsafe { from_utf8_unchecked(bytes) }
4352 #[stable(feature = "split_whitespace", since = "1.1.0")]
4353 impl<'a> Iterator for SplitWhitespace<'a> {
4354 type Item = &'a str;
4357 fn next(&mut self) -> Option<&'a str> {
4362 fn size_hint(&self) -> (usize, Option<usize>) {
4363 self.inner.size_hint()
4367 fn last(mut self) -> Option<&'a str> {
4372 #[stable(feature = "split_whitespace", since = "1.1.0")]
4373 impl<'a> DoubleEndedIterator for SplitWhitespace<'a> {
4375 fn next_back(&mut self) -> Option<&'a str> {
4376 self.inner.next_back()
4380 #[stable(feature = "fused", since = "1.26.0")]
4381 impl FusedIterator for SplitWhitespace<'_> {}
4383 #[stable(feature = "split_ascii_whitespace", since = "1.34.0")]
4384 impl<'a> Iterator for SplitAsciiWhitespace<'a> {
4385 type Item = &'a str;
4388 fn next(&mut self) -> Option<&'a str> {
4393 fn size_hint(&self) -> (usize, Option<usize>) {
4394 self.inner.size_hint()
4398 fn last(mut self) -> Option<&'a str> {
4403 #[stable(feature = "split_ascii_whitespace", since = "1.34.0")]
4404 impl<'a> DoubleEndedIterator for SplitAsciiWhitespace<'a> {
4406 fn next_back(&mut self) -> Option<&'a str> {
4407 self.inner.next_back()
4411 #[stable(feature = "split_ascii_whitespace", since = "1.34.0")]
4412 impl FusedIterator for SplitAsciiWhitespace<'_> {}
4414 /// An iterator of [`u16`] over the string encoded as UTF-16.
4416 /// [`u16`]: ../../std/primitive.u16.html
4418 /// This struct is created by the [`encode_utf16`] method on [`str`].
4419 /// See its documentation for more.
4421 /// [`encode_utf16`]: ../../std/primitive.str.html#method.encode_utf16
4422 /// [`str`]: ../../std/primitive.str.html
4424 #[stable(feature = "encode_utf16", since = "1.8.0")]
4425 pub struct EncodeUtf16<'a> {
4430 #[stable(feature = "collection_debug", since = "1.17.0")]
4431 impl fmt::Debug for EncodeUtf16<'_> {
4432 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
4433 f.pad("EncodeUtf16 { .. }")
4437 #[stable(feature = "encode_utf16", since = "1.8.0")]
4438 impl<'a> Iterator for EncodeUtf16<'a> {
4442 fn next(&mut self) -> Option<u16> {
4443 if self.extra != 0 {
4444 let tmp = self.extra;
4449 let mut buf = [0; 2];
4450 self.chars.next().map(|ch| {
4451 let n = ch.encode_utf16(&mut buf).len();
4453 self.extra = buf[1];
4460 fn size_hint(&self) -> (usize, Option<usize>) {
4461 let (low, high) = self.chars.size_hint();
4462 // every char gets either one u16 or two u16,
4463 // so this iterator is between 1 or 2 times as
4464 // long as the underlying iterator.
4465 (low, high.and_then(|n| n.checked_mul(2)))
4469 #[stable(feature = "fused", since = "1.26.0")]
4470 impl FusedIterator for EncodeUtf16<'_> {}
4472 /// The return type of [`str::escape_debug`].
4474 /// [`str::escape_debug`]: ../../std/primitive.str.html#method.escape_debug
4475 #[stable(feature = "str_escape", since = "1.34.0")]
4476 #[derive(Clone, Debug)]
4477 pub struct EscapeDebug<'a> {
4479 Flatten<option::IntoIter<char::EscapeDebug>>,
4480 FlatMap<Chars<'a>, char::EscapeDebug, CharEscapeDebugContinue>
4484 /// The return type of [`str::escape_default`].
4486 /// [`str::escape_default`]: ../../std/primitive.str.html#method.escape_default
4487 #[stable(feature = "str_escape", since = "1.34.0")]
4488 #[derive(Clone, Debug)]
4489 pub struct EscapeDefault<'a> {
4490 inner: FlatMap<Chars<'a>, char::EscapeDefault, CharEscapeDefault>,
4493 /// The return type of [`str::escape_unicode`].
4495 /// [`str::escape_unicode`]: ../../std/primitive.str.html#method.escape_unicode
4496 #[stable(feature = "str_escape", since = "1.34.0")]
4497 #[derive(Clone, Debug)]
4498 pub struct EscapeUnicode<'a> {
4499 inner: FlatMap<Chars<'a>, char::EscapeUnicode, CharEscapeUnicode>,
4502 macro_rules! escape_types_impls {
4503 ($( $Name: ident ),+) => {$(
4504 #[stable(feature = "str_escape", since = "1.34.0")]
4505 impl<'a> fmt::Display for $Name<'a> {
4506 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
4507 self.clone().try_for_each(|c| f.write_char(c))
4511 #[stable(feature = "str_escape", since = "1.34.0")]
4512 impl<'a> Iterator for $Name<'a> {
4516 fn next(&mut self) -> Option<char> { self.inner.next() }
4519 fn size_hint(&self) -> (usize, Option<usize>) { self.inner.size_hint() }
4522 fn try_fold<Acc, Fold, R>(&mut self, init: Acc, fold: Fold) -> R where
4523 Self: Sized, Fold: FnMut(Acc, Self::Item) -> R, R: Try<Ok=Acc>
4525 self.inner.try_fold(init, fold)
4529 fn fold<Acc, Fold>(self, init: Acc, fold: Fold) -> Acc
4530 where Fold: FnMut(Acc, Self::Item) -> Acc,
4532 self.inner.fold(init, fold)
4536 #[stable(feature = "str_escape", since = "1.34.0")]
4537 impl<'a> FusedIterator for $Name<'a> {}
4541 escape_types_impls!(EscapeDebug, EscapeDefault, EscapeUnicode);