pub enum ExtKeyUsage {
+ ServerAuth,
+ ClientAuth,
+ CodeSigning,
+ EmailProtection,
+ TimeStamping,
+ MsCodeInd,
+ MsCodeCom,
+ MsCtlSign,
+ MsSgc,
+ MsEfs,
+ NsSgc,
+}ServerAuth | |
ClientAuth | |
CodeSigning | |
EmailProtection | |
TimeStamping | |
MsCodeInd | |
MsCodeCom | |
MsCtlSign | |
MsSgc | |
MsEfs | |
NsSgc |
impl Copy for ExtKeyUsageimpl Clone for ExtKeyUsagefn clone(&self) -> ExtKeyUsagefn clone_from(&mut self, source: &Self)
+ Prefix searches with a type followed by a colon (e.g.
+ fn:) to restrict the search to a given type.
+
+ Accepted types are: fn, mod,
+ struct, enum,
+ trait, typedef (or
+ tdef).
+
+ Search functions by type signature (e.g.
+ vec -> usize)
+
pub enum KeyUsage {
+ DigitalSignature,
+ NonRepudiation,
+ KeyEncipherment,
+ DataEncipherment,
+ KeyAgreement,
+ KeyCertSign,
+ CRLSign,
+ EncipherOnly,
+ DecipherOnly,
+}DigitalSignature | |
NonRepudiation | |
KeyEncipherment | |
DataEncipherment | |
KeyAgreement | |
KeyCertSign | |
CRLSign | |
EncipherOnly | |
DecipherOnly |
impl Copy for KeyUsageimpl Clone for KeyUsagefn clone(&self) -> KeyUsagefn clone_from(&mut self, source: &Self)
+ Prefix searches with a type followed by a colon (e.g.
+ fn:) to restrict the search to a given type.
+
+ Accepted types are: fn, mod,
+ struct, enum,
+ trait, typedef (or
+ tdef).
+
+ Search functions by type signature (e.g.
+ vec -> usize)
+
pub enum X509FileType {
+ PEM,
+ ASN1,
+ Default,
+}PEM | |
ASN1 | |
Default |
impl Clone for X509FileTypefn clone(&self) -> X509FileTypefn clone_from(&mut self, source: &Self)impl Copy for X509FileType
+ Prefix searches with a type followed by a colon (e.g.
+ fn:) to restrict the search to a given type.
+
+ Accepted types are: fn, mod,
+ struct, enum,
+ trait, typedef (or
+ tdef).
+
+ Search functions by type signature (e.g.
+ vec -> usize)
+
pub enum X509ValidationError {
+ X509UnableToGetIssuerCert,
+ X509UnableToGetCrl,
+ X509UnableToDecryptCertSignature,
+ X509UnableToDecryptCrlSignature,
+ X509UnableToDecodeIssuerPublicKey,
+ X509CertSignatureFailure,
+ X509CrlSignatureFailure,
+ X509CertNotYetValid,
+ X509CertHasExpired,
+ X509CrlNotYetValid,
+ X509CrlHasExpired,
+ X509ErrorInCertNotBeforeField,
+ X509ErrorInCertNotAfterField,
+ X509ErrorInCrlLastUpdateField,
+ X509ErrorInCrlNextUpdateField,
+ X509OutOfMem,
+ X509DepthZeroSelfSignedCert,
+ X509SelfSignedCertInChain,
+ X509UnableToGetIssuerCertLocally,
+ X509UnableToVerifyLeafSignature,
+ X509CertChainTooLong,
+ X509CertRevoked,
+ X509InvalidCA,
+ X509PathLengthExceeded,
+ X509InvalidPurpose,
+ X509CertUntrusted,
+ X509CertRejected,
+ X509SubjectIssuerMismatch,
+ X509AkidSkidMismatch,
+ X509AkidIssuerSerialMismatch,
+ X509KeyusageNoCertsign,
+ X509UnableToGetCrlIssuer,
+ X509UnhandledCriticalExtension,
+ X509KeyusageNoCrlSign,
+ X509UnhandledCriticalCrlExtension,
+ X509InvalidNonCA,
+ X509ProxyPathLengthExceeded,
+ X509KeyusageNoDigitalSignature,
+ X509ProxyCertificatesNotAllowed,
+ X509InvalidExtension,
+ X509InavlidPolicyExtension,
+ X509NoExplicitPolicy,
+ X509DifferentCrlScope,
+ X509UnsupportedExtensionFeature,
+ X509UnnestedResource,
+ X509PermittedVolation,
+ X509ExcludedViolation,
+ X509SubtreeMinmax,
+ X509UnsupportedConstraintType,
+ X509UnsupportedConstraintSyntax,
+ X509UnsupportedNameSyntax,
+ X509CrlPathValidationError,
+ X509ApplicationVerification,
+ X509UnknownError(c_int),
+}X509UnableToGetIssuerCert | |
X509UnableToGetCrl | |
X509UnableToDecryptCertSignature | |
X509UnableToDecryptCrlSignature | |
X509UnableToDecodeIssuerPublicKey | |
X509CertSignatureFailure | |
X509CrlSignatureFailure | |
X509CertNotYetValid | |
X509CertHasExpired | |
X509CrlNotYetValid | |
X509CrlHasExpired | |
X509ErrorInCertNotBeforeField | |
X509ErrorInCertNotAfterField | |
X509ErrorInCrlLastUpdateField | |
X509ErrorInCrlNextUpdateField | |
X509OutOfMem | |
X509DepthZeroSelfSignedCert | |
X509SelfSignedCertInChain | |
X509UnableToGetIssuerCertLocally | |
X509UnableToVerifyLeafSignature | |
X509CertChainTooLong | |
X509CertRevoked | |
X509InvalidCA | |
X509PathLengthExceeded | |
X509InvalidPurpose | |
X509CertUntrusted | |
X509CertRejected | |
X509SubjectIssuerMismatch | |
X509AkidSkidMismatch | |
X509AkidIssuerSerialMismatch | |
X509KeyusageNoCertsign | |
X509UnableToGetCrlIssuer | |
X509UnhandledCriticalExtension | |
X509KeyusageNoCrlSign | |
X509UnhandledCriticalCrlExtension | |
X509InvalidNonCA | |
X509ProxyPathLengthExceeded | |
X509KeyusageNoDigitalSignature | |
X509ProxyCertificatesNotAllowed | |
X509InvalidExtension | |
X509InavlidPolicyExtension | |
X509NoExplicitPolicy | |
X509DifferentCrlScope | |
X509UnsupportedExtensionFeature | |
X509UnnestedResource | |
X509PermittedVolation | |
X509ExcludedViolation | |
X509SubtreeMinmax | |
X509UnsupportedConstraintType | |
X509UnsupportedConstraintSyntax | |
X509UnsupportedNameSyntax | |
X509CrlPathValidationError | |
X509ApplicationVerification | |
X509UnknownError |
impl Clone for X509ValidationErrorfn clone(&self) -> X509ValidationErrorfn clone_from(&mut self, source: &Self)impl Copy for X509ValidationError
+ Prefix searches with a type followed by a colon (e.g.
+ fn:) to restrict the search to a given type.
+
+ Accepted types are: fn, mod,
+ struct, enum,
+ trait, typedef (or
+ tdef).
+
+ Search functions by type signature (e.g.
+ vec -> usize)
+
| SslString | ++ + | +
| X509 | +
+ A public key certificate + + |
+
| X509Generator | +
+ Generator of private key/certificate pairs + + |
+
| X509Name | ++ + | +
| X509NameEntry | ++ + | +
| X509Req | +
+ A certificate signing request + + |
+
| X509StoreContext | ++ + | +
| ExtKeyUsage | ++ + | +
| KeyUsage | ++ + | +
| X509FileType | ++ + | +
| X509ValidationError | ++ + | +
+ Prefix searches with a type followed by a colon (e.g.
+ fn:) to restrict the search to a given type.
+
+ Accepted types are: fn, mod,
+ struct, enum,
+ trait, typedef (or
+ tdef).
+
+ Search functions by type signature (e.g.
+ vec -> usize)
+
pub struct SslString {
+ // some fields omitted
+}fn len(&self) -> usizeReturns the length of self in bytes.
+assert_eq!("foo".len(), 3); +assert_eq!("ƒoo".len(), 4); // fancy f! ++
fn is_empty(&self) -> boolfn width(&self, is_cjk: bool) -> usize: use the crates.io unicode-width library instead
Returns a string's displayed width in columns.
+ +Control characters have zero width.
+ +is_cjk determines behavior for characters in the Ambiguous category:
+if is_cjk is
+true, these are 2 columns wide; otherwise, they are 1.
+In CJK locales, is_cjk should be
+true, else it should be false.
+Unicode Standard Annex #11
+recommends that these
+characters be treated as 1 column (i.e., is_cjk = false) if the
+locale is unknown.
fn is_char_boundary(&self, index: usize) -> bool: it is unclear whether this method pulls its weight with the existence of the char_indices iterator or this method may want to be replaced with checked slicing
+Checks that index-th byte lies at the start and/or end of a
+UTF-8 code point sequence.
The start and end of the string (when index == self.len()) are
+considered to be
+boundaries.
Panics if index is greater than self.len().
+let s = "Löwe 老虎 Léopard"; +assert!(s.is_char_boundary(0)); +// start of `老` +assert!(s.is_char_boundary(6)); +assert!(s.is_char_boundary(s.len())); + +// second byte of `ö` +assert!(!s.is_char_boundary(2)); + +// third byte of `老` +assert!(!s.is_char_boundary(8)); ++
fn as_bytes(&self) -> &[u8]fn as_ptr(&self) -> *const u8Returns a raw pointer to the &str's buffer.
The caller must ensure that the string outlives this pointer, and +that it is not +reallocated (e.g. by pushing to the string).
+ ++let s = "Hello"; +let p = s.as_ptr(); ++
unsafe fn slice_unchecked(&self, begin: usize, end: usize) -> &strTakes a bytewise slice from a string.
+ +Returns the substring from [begin..end).
Caller must check both UTF-8 character boundaries and the boundaries +of the entire slice as +well.
+ ++let s = "Löwe 老虎 Léopard"; + +unsafe { + assert_eq!(s.slice_unchecked(0, 21), "Löwe 老虎 Léopard"); +} ++
fn slice_chars(&self, begin: usize, end: usize) -> &str: may have yet to prove its worth
+Returns a slice of the string from the character range [begin..end).
That is, start at the begin-th code point of the string and continue
+to the end-th code point. This does not detect or handle edge cases
+such as leaving a combining character as the first code point of the
+string.
Due to the design of UTF-8, this operation is O(end). Use slicing
+syntax if you want to use byte indices rather than codepoint indices.
Panics if begin > end or the either begin or end are beyond the
+last character of the string.
+let s = "Löwe 老虎 Léopard"; + +assert_eq!(s.slice_chars(0, 4), "Löwe"); +assert_eq!(s.slice_chars(5, 7), "老虎"); ++
fn char_range_at(&self, start: usize) -> CharRange: often replaced by char_indices, this method may be removed in favor of just char_at() or eventually removed altogether
+Given a byte position, return the next char and its index.
+ +This can be used to iterate over the Unicode characters of a string.
+ +If i is greater than or equal to the length of the string.
+If i is not the index of the beginning of a valid UTF-8 character.
This example manually iterates through the characters of a string;
+this should normally be
+done by .chars() or .char_indices().
+use std::str::CharRange; + +let s = "中华Việt Nam"; +let mut i = 0; +while i < s.len() { + let CharRange {ch, next} = s.char_range_at(i); + println!("{}: {}", i, ch); + i = next; +} ++ +
This outputs:
+ +0: 中
+3: 华
+6: V
+7: i
+8: ệ
+11: t
+12:
+13: N
+14: a
+15: m
+fn char_range_at_reverse(&self, start: usize) -> CharRange: often replaced by char_indices, this method may be removed in favor of just char_at_reverse() or eventually removed altogether
+Given a byte position, return the previous char and its position.
This function can be used to iterate over a Unicode string in reverse.
+ +Returns 0 for next index if called on start index 0.
+ +If i is greater than the length of the string.
+If i is not an index following a valid UTF-8 character.
This example manually iterates through the characters of a string;
+this should normally be
+done by .chars().rev() or .char_indices().
+use std::str::CharRange; + +let s = "中华Việt Nam"; +let mut i = s.len(); +while i > 0 { + let CharRange {ch, next} = s.char_range_at_reverse(i); + println!("{}: {}", i, ch); + i = next; +} ++ +
This outputs:
+ +16: m
+15: a
+14: N
+13:
+12: t
+11: ệ
+8: i
+7: V
+6: 华
+3: 中
+fn char_at(&self, i: usize) -> char: frequently replaced by the chars() iterator, this method may be removed or possibly renamed in the future; it is normally replaced by chars/char_indices iterators or by getting the first char from a subslice
+Given a byte position, return the char at that position.
If i is greater than or equal to the length of the string.
+If i is not the index of the beginning of a valid UTF-8 character.
+let s = "abπc"; +assert_eq!(s.char_at(1), 'b'); +assert_eq!(s.char_at(2), 'π'); ++
fn char_at_reverse(&self, i: usize) -> char: see char_at for more details, but reverse semantics are also somewhat unclear, especially with which cases generate panics
+Given a byte position, return the char at that position, counting
+from the end.
If i is greater than the length of the string.
+If i is not an index following a valid UTF-8 character.
+let s = "abπc"; +assert_eq!(s.char_at_reverse(1), 'a'); +assert_eq!(s.char_at_reverse(2), 'b'); ++
fn slice_shift_char(&self) -> Option<(char, &str)>: awaiting conventions about shifting and slices and may not be warranted with the existence of the chars and/or char_indices iterators
+Retrieves the first character from a &str and returns it.
This does not allocate a new string; instead, it returns a slice that +points one character +beyond the character that was shifted.
+ +If the slice does not contain any characters, None is returned instead.
+ ++let s = "Löwe 老虎 Léopard"; +let (c, s1) = s.slice_shift_char().unwrap(); + +assert_eq!(c, 'L'); +assert_eq!(s1, "öwe 老虎 Léopard"); + +let (c, s2) = s1.slice_shift_char().unwrap(); + +assert_eq!(c, 'ö'); +assert_eq!(s2, "we 老虎 Léopard"); ++
fn split_at(&self, mid: usize) -> (&str, &str): library is unlikely to be stabilized with the current layout and name, use std::collections instead
+Divide one string slice into two at an index.
+ +The index mid is a byte offset from the start of the string
+that must be on a character boundary.
Return slices &self[..mid] and &self[mid..].
Panics if mid is beyond the last character of the string,
+or if it is not on a character boundary.
+let s = "Löwe 老虎 Léopard"; +let first_space = s.find(' ').unwrap_or(s.len()); +let (a, b) = s.split_at(first_space); + +assert_eq!(a, "Löwe"); +assert_eq!(b, " 老虎 Léopard"); ++
fn chars(&self) -> CharsAn iterator over the codepoints of self.
+let v: Vec<char> = "abc åäö".chars().collect(); + +assert_eq!(v, ['a', 'b', 'c', ' ', 'å', 'ä', 'ö']); ++
fn char_indices(&self) -> CharIndicesAn iterator over the characters of self and their byte offsets.
+let v: Vec<(usize, char)> = "abc".char_indices().collect(); +let b = vec![(0, 'a'), (1, 'b'), (2, 'c')]; + +assert_eq!(v, b); ++
fn bytes(&self) -> BytesAn iterator over the bytes of self.
+let v: Vec<u8> = "bors".bytes().collect(); + +assert_eq!(v, b"bors".to_vec()); ++
fn split_whitespace(&self) -> SplitWhitespaceAn iterator over the non-empty substrings of self which contain no whitespace,
+and which are separated by any amount of whitespace.
+let some_words = " Mary had\ta little \n\t lamb"; +let v: Vec<&str> = some_words.split_whitespace().collect(); + +assert_eq!(v, ["Mary", "had", "a", "little", "lamb"]); ++
fn words(&self) -> SplitWhitespace: words() will be removed. Use split_whitespace() instead
+An iterator over the non-empty substrings of self which contain no whitespace,
+and which are separated by any amount of whitespace.
+let some_words = " Mary had\ta little \n\t lamb"; +let v: Vec<&str> = some_words.words().collect(); + +assert_eq!(v, ["Mary", "had", "a", "little", "lamb"]); ++
fn lines(&self) -> LinesAn iterator over the lines of a string, separated by \n.
This does not include the empty string after a trailing \n.
+let four_lines = "foo\nbar\n\nbaz"; +let v: Vec<&str> = four_lines.lines().collect(); + +assert_eq!(v, ["foo", "bar", "", "baz"]); ++ +
Leaving off the trailing character:
++let four_lines = "foo\nbar\n\nbaz\n"; +let v: Vec<&str> = four_lines.lines().collect(); + +assert_eq!(v, ["foo", "bar", "", "baz"]); ++
fn lines_any(&self) -> LinesAnyAn iterator over the lines of a string, separated by either
+\n or \r\n.
As with .lines(), this does not include an empty trailing line.
+let four_lines = "foo\r\nbar\n\r\nbaz"; +let v: Vec<&str> = four_lines.lines_any().collect(); + +assert_eq!(v, ["foo", "bar", "", "baz"]); ++ +
Leaving off the trailing character:
++let four_lines = "foo\r\nbar\n\r\nbaz\n"; +let v: Vec<&str> = four_lines.lines_any().collect(); + +assert_eq!(v, ["foo", "bar", "", "baz"]); ++
fn nfd_chars(&self) -> Decompositions: use the crates.io unicode-normalization library instead
Returns an iterator over the string in Unicode Normalization Form D +(canonical decomposition).
+fn nfkd_chars(&self) -> Decompositions: use the crates.io unicode-normalization library instead
Returns an iterator over the string in Unicode Normalization Form KD +(compatibility decomposition).
+fn nfc_chars(&self) -> Recompositions: use the crates.io unicode-normalization library instead
An Iterator over the string in Unicode Normalization Form C +(canonical decomposition followed by canonical composition).
+fn nfkc_chars(&self) -> Recompositions: use the crates.io unicode-normalization library instead
An Iterator over the string in Unicode Normalization Form KC +(compatibility decomposition followed by canonical composition).
+fn graphemes(&self, is_extended: bool) -> Graphemes: use the crates.io unicode-segmentation library instead
Returns an iterator over the grapheme clusters of self.
If is_extended is true, the iterator is over the
+extended grapheme clusters;
+otherwise, the iterator is over the legacy grapheme clusters.
+UAX#29
+recommends extended grapheme cluster boundaries for general processing.
+let gr1 = "a\u{310}e\u{301}o\u{308}\u{332}".graphemes(true).collect::<Vec<&str>>(); +let b: &[_] = &["a\u{310}", "e\u{301}", "o\u{308}\u{332}"]; + +assert_eq!(&gr1[..], b); + +let gr2 = "a\r\nb🇷🇺🇸🇹".graphemes(true).collect::<Vec<&str>>(); +let b: &[_] = &["a", "\r\n", "b", "🇷🇺🇸🇹"]; + +assert_eq!(&gr2[..], b); ++
fn grapheme_indices(&self, is_extended: bool) -> GraphemeIndices: use the crates.io unicode-segmentation library instead
Returns an iterator over the grapheme clusters of self and their
+byte offsets. See
+graphemes() for more information.
+let gr_inds = "a̐éö̲\r\n".grapheme_indices(true).collect::<Vec<(usize, &str)>>(); +let b: &[_] = &[(0, "a̐"), (3, "é"), (6, "ö̲"), (11, "\r\n")]; + +assert_eq!(&gr_inds[..], b); ++
fn utf16_units(&self) -> Utf16Units: this functionality may only be provided by libunicode
+Returns an iterator of u16 over the string encoded as UTF-16.
fn contains<'a, P>(&'a self, pat: P) -> bool where P: Pattern<'a>Returns true if self contains another &str.
+assert!("bananas".contains("nana")); + +assert!(!"bananas".contains("foobar")); ++
fn starts_with<'a, P>(&'a self, pat: P) -> bool where P: Pattern<'a>Returns true if the given &str is a prefix of the string.
+assert!("banana".starts_with("ba")); ++
fn ends_with<'a, P>(&'a self, pat: P) -> bool where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>Returns true if the given &str is a suffix of the string.
+assert!("banana".ends_with("nana")); ++
fn find<'a, P>(&'a self, pat: P) -> Option<usize> where P: Pattern<'a>Returns the byte index of the first character of self that matches
+the pattern, if it
+exists.
Returns None if it doesn't exist.
The pattern can be a simple &str, char, or a closure that
+determines the
+split.
Simple patterns:
++let s = "Löwe 老虎 Léopard"; + +assert_eq!(s.find('L'), Some(0)); +assert_eq!(s.find('é'), Some(14)); +assert_eq!(s.find("Léopard"), Some(13)); ++ +
More complex patterns with closures:
++let s = "Löwe 老虎 Léopard"; + +assert_eq!(s.find(char::is_whitespace), Some(5)); +assert_eq!(s.find(char::is_lowercase), Some(1)); ++ +
Not finding the pattern:
++let s = "Löwe 老虎 Léopard"; +let x: &[_] = &['1', '2']; + +assert_eq!(s.find(x), None); ++
fn rfind<'a, P>(&'a self, pat: P) -> Option<usize> where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>Returns the byte index of the last character of self that
+matches the pattern, if it
+exists.
Returns None if it doesn't exist.
The pattern can be a simple &str, char,
+or a closure that determines the split.
Simple patterns:
++let s = "Löwe 老虎 Léopard"; + +assert_eq!(s.rfind('L'), Some(13)); +assert_eq!(s.rfind('é'), Some(14)); ++ +
More complex patterns with closures:
++let s = "Löwe 老虎 Léopard"; + +assert_eq!(s.rfind(char::is_whitespace), Some(12)); +assert_eq!(s.rfind(char::is_lowercase), Some(20)); ++ +
Not finding the pattern:
++let s = "Löwe 老虎 Léopard"; +let x: &[_] = &['1', '2']; + +assert_eq!(s.rfind(x), None); ++
fn split<'a, P>(&'a self, pat: P) -> Split<'a, P> where P: Pattern<'a>An iterator over substrings of self, separated by characters
+matched by a pattern.
The pattern can be a simple &str, char, or a closure that
+determines the split. Additional libraries might provide more complex
+patterns like regular expressions.
The returned iterator will be double ended if the pattern allows a
+reverse search and forward/reverse search yields the same elements.
+This is true for, eg, char but not
+for &str.
If the pattern allows a reverse search but its results might differ
+from a forward search, rsplit() can be used.
Simple patterns:
++let v: Vec<&str> = "Mary had a little lamb".split(' ').collect(); +assert_eq!(v, ["Mary", "had", "a", "little", "lamb"]); + +let v: Vec<&str> = "".split('X').collect(); +assert_eq!(v, [""]); + +let v: Vec<&str> = "lionXXtigerXleopard".split('X').collect(); +assert_eq!(v, ["lion", "", "tiger", "leopard"]); + +let v: Vec<&str> = "lion::tiger::leopard".split("::").collect(); +assert_eq!(v, ["lion", "tiger", "leopard"]); + +let v: Vec<&str> = "abc1def2ghi".split(char::is_numeric).collect(); +assert_eq!(v, ["abc", "def", "ghi"]); + +let v: Vec<&str> = "lionXtigerXleopard".split(char::is_uppercase).collect(); +assert_eq!(v, ["lion", "tiger", "leopard"]); ++ +
A more complex pattern, using a closure:
++let v: Vec<&str> = "abc1defXghi".split(|c| c == '1' || c == 'X').collect(); +assert_eq!(v, ["abc", "def", "ghi"]); ++ +
If a string contains multiple contiguous separators, you will end up +with empty strings in the output:
++let x = "||||a||b|c".to_string(); +let d: Vec<_> = x.split('|').collect(); + +assert_eq!(d, &["", "", "", "", "a", "", "b", "c"]); ++ +
This can lead to possibly surprising behavior when whitespace is used +as the separator. This code is correct:
++let x = " a b c".to_string(); +let d: Vec<_> = x.split(' ').collect(); + +assert_eq!(d, &["", "", "", "", "a", "", "b", "c"]); ++ +
It does not give you:
++assert_eq!(d, &["a", "b", "c"]); ++
fn rsplit<'a, P>(&'a self, pat: P) -> RSplit<'a, P> where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>An iterator over substrings of self, separated by characters
+matched by a pattern and yielded in reverse order.
The pattern can be a simple &str, char, or a closure that
+determines the split.
+Additional libraries might provide more complex patterns like
+regular expressions.
The returned iterator requires that the pattern supports a +reverse search, +and it will be double ended if a forward/reverse search yields +the same elements.
+ +For iterating from the front, split() can be used.
Simple patterns:
++let v: Vec<&str> = "Mary had a little lamb".rsplit(' ').collect(); +assert_eq!(v, ["lamb", "little", "a", "had", "Mary"]); + +let v: Vec<&str> = "".rsplit('X').collect(); +assert_eq!(v, [""]); + +let v: Vec<&str> = "lionXXtigerXleopard".rsplit('X').collect(); +assert_eq!(v, ["leopard", "tiger", "", "lion"]); + +let v: Vec<&str> = "lion::tiger::leopard".rsplit("::").collect(); +assert_eq!(v, ["leopard", "tiger", "lion"]); ++ +
A more complex pattern, using a closure:
++let v: Vec<&str> = "abc1defXghi".rsplit(|c| c == '1' || c == 'X').collect(); +assert_eq!(v, ["ghi", "def", "abc"]); ++
fn split_terminator<'a, P>(&'a self, pat: P) -> SplitTerminator<'a, P> where P: Pattern<'a>An iterator over substrings of self, separated by characters
+matched by a pattern.
The pattern can be a simple &str, char, or a closure that
+determines the split.
+Additional libraries might provide more complex patterns
+like regular expressions.
Equivalent to split, except that the trailing substring
+is skipped if empty.
This method can be used for string data that is terminated, +rather than separated by a pattern.
+ +The returned iterator will be double ended if the pattern allows a
+reverse search
+and forward/reverse search yields the same elements. This is true
+for, eg, char but not for &str.
If the pattern allows a reverse search but its results might differ
+from a forward search, rsplit_terminator() can be used.
+let v: Vec<&str> = "A.B.".split_terminator('.').collect(); +assert_eq!(v, ["A", "B"]); + +let v: Vec<&str> = "A..B..".split_terminator(".").collect(); +assert_eq!(v, ["A", "", "B", ""]); ++
fn rsplit_terminator<'a, P>(&'a self, pat: P) -> RSplitTerminator<'a, P> where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>An iterator over substrings of self, separated by characters
+matched by a pattern and yielded in reverse order.
The pattern can be a simple &str, char, or a closure that
+determines the split.
+Additional libraries might provide more complex patterns like
+regular expressions.
Equivalent to split, except that the trailing substring is
+skipped if empty.
This method can be used for string data that is terminated, +rather than separated by a pattern.
+ +The returned iterator requires that the pattern supports a +reverse search, and it will be double ended if a forward/reverse +search yields the same elements.
+ +For iterating from the front, split_terminator() can be used.
+let v: Vec<&str> = "A.B.".rsplit_terminator('.').collect(); +assert_eq!(v, ["B", "A"]); + +let v: Vec<&str> = "A..B..".rsplit_terminator(".").collect(); +assert_eq!(v, ["", "B", "", "A"]); ++
fn splitn<'a, P>(&'a self, count: usize, pat: P) -> SplitN<'a, P> where P: Pattern<'a>An iterator over substrings of self, separated by a pattern,
+restricted to returning
+at most count items.
The last element returned, if any, will contain the remainder of the
+string.
+The pattern can be a simple &str, char, or a closure that
+determines the split.
+Additional libraries might provide more complex patterns like
+regular expressions.
The returned iterator will not be double ended, because it is +not efficient to support.
+ +If the pattern allows a reverse search, rsplitn() can be used.
Simple patterns:
++let v: Vec<&str> = "Mary had a little lambda".splitn(3, ' ').collect(); +assert_eq!(v, ["Mary", "had", "a little lambda"]); + +let v: Vec<&str> = "lionXXtigerXleopard".splitn(3, "X").collect(); +assert_eq!(v, ["lion", "", "tigerXleopard"]); + +let v: Vec<&str> = "abcXdef".splitn(1, 'X').collect(); +assert_eq!(v, ["abcXdef"]); + +let v: Vec<&str> = "".splitn(1, 'X').collect(); +assert_eq!(v, [""]); ++ +
A more complex pattern, using a closure:
++let v: Vec<&str> = "abc1defXghi".splitn(2, |c| c == '1' || c == 'X').collect(); +assert_eq!(v, ["abc", "defXghi"]); ++
fn rsplitn<'a, P>(&'a self, count: usize, pat: P) -> RSplitN<'a, P> where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>An iterator over substrings of self, separated by a pattern,
+starting from the end of the string, restricted to returning
+at most count items.
The last element returned, if any, will contain the remainder of the +string.
+ +The pattern can be a simple &str, char, or a closure that
+determines the split.
+Additional libraries might provide more complex patterns like
+regular expressions.
The returned iterator will not be double ended, because it is not +efficient to support.
+ +splitn() can be used for splitting from the front.
Simple patterns:
++let v: Vec<&str> = "Mary had a little lamb".rsplitn(3, ' ').collect(); +assert_eq!(v, ["lamb", "little", "Mary had a"]); + +let v: Vec<&str> = "lionXXtigerXleopard".rsplitn(3, 'X').collect(); +assert_eq!(v, ["leopard", "tiger", "lionX"]); + +let v: Vec<&str> = "lion::tiger::leopard".rsplitn(2, "::").collect(); +assert_eq!(v, ["leopard", "lion::tiger"]); ++ +
A more complex pattern, using a closure:
++let v: Vec<&str> = "abc1defXghi".rsplitn(2, |c| c == '1' || c == 'X').collect(); +assert_eq!(v, ["ghi", "abc1def"]); ++
fn matches<'a, P>(&'a self, pat: P) -> Matches<'a, P> where P: Pattern<'a>An iterator over the matches of a pattern within self.
The pattern can be a simple &str, char, or a closure that
+determines the split.
+Additional libraries might provide more complex patterns like
+regular expressions.
The returned iterator will be double ended if the pattern allows
+a reverse search
+and forward/reverse search yields the same elements. This is true
+for, eg, char but not
+for &str.
If the pattern allows a reverse search but its results might differ
+from a forward search, rmatches() can be used.
+let v: Vec<&str> = "abcXXXabcYYYabc".matches("abc").collect(); +assert_eq!(v, ["abc", "abc", "abc"]); + +let v: Vec<&str> = "1abc2abc3".matches(char::is_numeric).collect(); +assert_eq!(v, ["1", "2", "3"]); ++
fn rmatches<'a, P>(&'a self, pat: P) -> RMatches<'a, P> where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>An iterator over the matches of a pattern within self, yielded in
+reverse order.
The pattern can be a simple &str, char, or a closure that
+determines the split.
+Additional libraries might provide more complex patterns like
+regular expressions.
The returned iterator requires that the pattern supports a +reverse search, +and it will be double ended if a forward/reverse search yields +the same elements.
+ +For iterating from the front, matches() can be used.
+let v: Vec<&str> = "abcXXXabcYYYabc".rmatches("abc").collect(); +assert_eq!(v, ["abc", "abc", "abc"]); + +let v: Vec<&str> = "1abc2abc3".rmatches(char::is_numeric).collect(); +assert_eq!(v, ["3", "2", "1"]); ++
fn match_indices<'a, P>(&'a self, pat: P) -> MatchIndices<'a, P> where P: Pattern<'a>: might have its iterator type changed
+An iterator over the start and end indices of the disjoint matches
+of a pattern within self.
For matches of pat within self that overlap, only the indices
+corresponding to the first
+match are returned.
The pattern can be a simple &str, char, or a closure that
+determines
+the split.
+Additional libraries might provide more complex patterns like
+regular expressions.
The returned iterator will be double ended if the pattern allows a
+reverse search
+and forward/reverse search yields the same elements. This is true for,
+eg, char but not
+for &str.
If the pattern allows a reverse search but its results might differ
+from a forward search, rmatch_indices() can be used.
+let v: Vec<(usize, usize)> = "abcXXXabcYYYabc".match_indices("abc").collect(); +assert_eq!(v, [(0, 3), (6, 9), (12, 15)]); + +let v: Vec<(usize, usize)> = "1abcabc2".match_indices("abc").collect(); +assert_eq!(v, [(1, 4), (4, 7)]); + +let v: Vec<(usize, usize)> = "ababa".match_indices("aba").collect(); +assert_eq!(v, [(0, 3)]); // only the first `aba` ++
fn rmatch_indices<'a, P>(&'a self, pat: P) -> RMatchIndices<'a, P> where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>: might have its iterator type changed
+An iterator over the start and end indices of the disjoint matches of
+a pattern within
+self, yielded in reverse order.
For matches of pat within self that overlap, only the indices
+corresponding to the last
+match are returned.
The pattern can be a simple &str, char, or a closure that
+determines
+the split.
+Additional libraries might provide more complex patterns like
+regular expressions.
The returned iterator requires that the pattern supports a +reverse search, +and it will be double ended if a forward/reverse search yields +the same elements.
+ +For iterating from the front, match_indices() can be used.
+let v: Vec<(usize, usize)> = "abcXXXabcYYYabc".rmatch_indices("abc").collect(); +assert_eq!(v, [(12, 15), (6, 9), (0, 3)]); + +let v: Vec<(usize, usize)> = "1abcabc2".rmatch_indices("abc").collect(); +assert_eq!(v, [(4, 7), (1, 4)]); + +let v: Vec<(usize, usize)> = "ababa".rmatch_indices("aba").collect(); +assert_eq!(v, [(2, 5)]); // only the last `aba` ++
fn subslice_offset(&self, inner: &str) -> usize: awaiting convention about comparability of arbitrary slices
+Returns the byte offset of an inner slice relative to an enclosing +outer slice.
+ +Panics if inner is not a direct slice contained within self.
+let string = "a\nb\nc"; +let lines: Vec<&str> = string.lines().collect(); + +assert!(string.subslice_offset(lines[0]) == 0); // &"a" +assert!(string.subslice_offset(lines[1]) == 2); // &"b" +assert!(string.subslice_offset(lines[2]) == 4); // &"c" ++
fn trim(&self) -> &strReturns a &str with leading and trailing whitespace removed.
+let s = " Hello\tworld\t"; +assert_eq!(s.trim(), "Hello\tworld"); ++
fn trim_left(&self) -> &strReturns a &str with leading whitespace removed.
+let s = " Hello\tworld\t"; +assert_eq!(s.trim_left(), "Hello\tworld\t"); ++
fn trim_right(&self) -> &strReturns a &str with trailing whitespace removed.
+let s = " Hello\tworld\t"; +assert_eq!(s.trim_right(), " Hello\tworld"); ++
fn trim_matches<'a, P>(&'a self, pat: P) -> &'a str where P: Pattern<'a>, P::Searcher: DoubleEndedSearcher<'a>Returns a string with all pre- and suffixes that match a pattern +repeatedly removed.
+ +The pattern can be a simple char, or a closure that determines
+the split.
Simple patterns:
++assert_eq!("11foo1bar11".trim_matches('1'), "foo1bar"); +assert_eq!("123foo1bar123".trim_matches(char::is_numeric), "foo1bar"); + +let x: &[_] = &['1', '2']; +assert_eq!("12foo1bar12".trim_matches(x), "foo1bar"); ++ +
A more complex pattern, using a closure:
++assert_eq!("1foo1barXX".trim_matches(|c| c == '1' || c == 'X'), "foo1bar"); ++
fn trim_left_matches<'a, P>(&'a self, pat: P) -> &'a str where P: Pattern<'a>Returns a string with all prefixes that match a pattern +repeatedly removed.
+ +The pattern can be a simple &str, char, or a closure that
+determines the split.
+assert_eq!("11foo1bar11".trim_left_matches('1'), "foo1bar11"); +assert_eq!("123foo1bar123".trim_left_matches(char::is_numeric), "foo1bar123"); + +let x: &[_] = &['1', '2']; +assert_eq!("12foo1bar12".trim_left_matches(x), "foo1bar12"); ++
fn trim_right_matches<'a, P>(&'a self, pat: P) -> &'a str where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>Returns a string with all suffixes that match a pattern +repeatedly removed.
+ +The pattern can be a simple &str, char, or a closure that
+determines the split.
Simple patterns:
++assert_eq!("11foo1bar11".trim_right_matches('1'), "11foo1bar"); +assert_eq!("123foo1bar123".trim_right_matches(char::is_numeric), "123foo1bar"); + +let x: &[_] = &['1', '2']; +assert_eq!("12foo1bar12".trim_right_matches(x), "12foo1bar"); ++ +
A more complex pattern, using a closure:
++assert_eq!("1fooX".trim_left_matches(|c| c == '1' || c == 'X'), "fooX"); ++
fn parse<F>(&self) -> Result<F, F::Err> where F: FromStrParses self into the specified type.
Will return Err if it's not possible to parse self into the type.
+assert_eq!("4".parse::<u32>(), Ok(4)); ++ +
Failing:
++assert!("j".parse::<u32>().is_err()); ++
fn replace(&self, from: &str, to: &str) -> StringReplaces all occurrences of one string with another.
+ +replace takes two arguments, a sub-&str to find in self, and a
+second &str to
+replace it with. If the original &str isn't found, no change occurs.
+let s = "this is old"; + +assert_eq!(s.replace("old", "new"), "this is new"); ++ +
When a &str isn't found:
+let s = "this is old"; +assert_eq!(s.replace("cookie monster", "little lamb"), s); ++
fn to_lowercase(&self) -> StringReturns the lowercase equivalent of this string.
+ ++#![feature(str_casing)] + +let s = "HELLO"; +assert_eq!(s.to_lowercase(), "hello"); ++
fn to_uppercase(&self) -> StringReturns the uppercase equivalent of this string.
+ ++#![feature(str_casing)] + +let s = "hello"; +assert_eq!(s.to_uppercase(), "HELLO"); ++
fn escape_default(&self) -> String: return type may change to be an iterator
+Escapes each char in s with char::escape_default.
fn escape_unicode(&self) -> String: return type may change to be an iterator
+Escapes each char in s with char::escape_unicode.
impl<'s> Drop for SslStringfn drop(&mut self)impl Deref for SslStringimpl Display for SslStringimpl Debug for SslString
+ Prefix searches with a type followed by a colon (e.g.
+ fn:) to restrict the search to a given type.
+
+ Accepted types are: fn, mod,
+ struct, enum,
+ trait, typedef (or
+ tdef).
+
+ Search functions by type signature (e.g.
+ vec -> usize)
+
pub struct X509<'ctx> {
+ // some fields omitted
+}A public key certificate
+impl<'ctx> X509<'ctx>fn new(handle: *mut X509, owned: bool) -> X509<'ctx>Creates new from handle with desired ownership.
+fn new_in_ctx(handle: *mut X509, ctx: &'ctx X509StoreContext) -> X509<'ctx>Creates a new certificate from context. Doesn't take ownership +of handle.
+fn from_pem<R>(reader: &mut R) -> Result<X509<'ctx>, SslError> where R: ReadReads certificate from PEM, takes ownership of handle
+fn get_handle(&self) -> *mut X509fn subject_name<'a>(&'a self) -> X509Name<'a>fn public_key(&self) -> PKeyfn fingerprint(&self, hash_type: Type) -> Option<Vec<u8>>Returns certificate fingerprint calculated using provided hash
+fn write_pem<W>(&self, writer: &mut W) -> Result<(), SslError> where W: WriteWrites certificate as PEM
+impl<'ctx> Drop for X509<'ctx>fn drop(&mut self)
+ Prefix searches with a type followed by a colon (e.g.
+ fn:) to restrict the search to a given type.
+
+ Accepted types are: fn, mod,
+ struct, enum,
+ trait, typedef (or
+ tdef).
+
+ Search functions by type signature (e.g.
+ vec -> usize)
+
pub struct X509Generator {
+ // some fields omitted
+}Generator of private key/certificate pairs
+ ++use std::fs; +use std::fs::File; +use std::io::prelude::*; +use std::path::Path; + +use openssl::crypto::hash::Type; +use openssl::x509::{KeyUsage, X509Generator}; + +let gen = X509Generator::new() + .set_bitlength(2048) + .set_valid_period(365*2) + .set_CN("SuperMegaCorp Inc.") + .set_sign_hash(Type::SHA256) + .set_usage(&[KeyUsage::DigitalSignature]); + +let (cert, pkey) = gen.generate().unwrap(); + +let cert_path = "doc_cert.pem"; +let mut file = File::create(cert_path).unwrap(); +assert!(cert.write_pem(&mut file).is_ok()); + +let pkey_path = "doc_key.pem"; +let mut file = File::create(pkey_path).unwrap(); +assert!(pkey.write_pem(&mut file).is_ok()); ++
impl X509Generatorfn new() -> X509GeneratorCreates a new generator with the following defaults:
+ +bit length: 1024
+ +validity period: 365 days
+ +CN: "rust-openssl"
+ +hash: SHA1
+fn set_bitlength(self, bits: u32) -> X509GeneratorSets desired bit length
+fn set_valid_period(self, days: u32) -> X509GeneratorSets certificate validity period in days since today
+fn set_CN(self, CN: &str) -> X509GeneratorSets Common Name of certificate
+fn set_usage(self, purposes: &[KeyUsage]) -> X509GeneratorSets what for certificate could be used
+fn set_ext_usage(self, purposes: &[ExtKeyUsage]) -> X509GeneratorSets allowed extended usage of certificate
+fn set_sign_hash(self, hash_type: Type) -> X509Generatorfn generate<'a>(&self) -> Result<(X509<'a>, PKey), SslError>Generates a private key and a self-signed certificate and returns them
+fn sign<'a>(&self, p_key: &PKey) -> Result<X509<'a>, SslError>Sets the certificate public-key, then self-sign and return it +Note: That the bit-length of the private key is used (set_bitlength is ignored)
+fn request(&self, p_key: &PKey) -> Result<X509Req, SslError>Obtain a certificate signing request (CSR)
+
+ Prefix searches with a type followed by a colon (e.g.
+ fn:) to restrict the search to a given type.
+
+ Accepted types are: fn, mod,
+ struct, enum,
+ trait, typedef (or
+ tdef).
+
+ Search functions by type signature (e.g.
+ vec -> usize)
+
pub struct X509Name<'x> {
+ // some fields omitted
+}impl<'x> X509Name<'x>fn text_by_nid(&self, nid: Nid) -> Option<SslString>
+ Prefix searches with a type followed by a colon (e.g.
+ fn:) to restrict the search to a given type.
+
+ Accepted types are: fn, mod,
+ struct, enum,
+ trait, typedef (or
+ tdef).
+
+ Search functions by type signature (e.g.
+ vec -> usize)
+
pub struct X509NameEntry<'x> {
+ // some fields omitted
+}
+ Prefix searches with a type followed by a colon (e.g.
+ fn:) to restrict the search to a given type.
+
+ Accepted types are: fn, mod,
+ struct, enum,
+ trait, typedef (or
+ tdef).
+
+ Search functions by type signature (e.g.
+ vec -> usize)
+
pub struct X509Req {
+ // some fields omitted
+}A certificate signing request
+impl X509Reqfn new(handle: *mut X509_REQ) -> X509ReqCreates new from handle
+fn from_pem<R>(reader: &mut R) -> Result<X509Req, SslError> where R: ReadReads CSR from PEM
+fn write_pem<W>(&self, writer: &mut W) -> Result<(), SslError> where W: WriteWrites CSR as PEM
+impl Drop for X509Reqfn drop(&mut self)
+ Prefix searches with a type followed by a colon (e.g.
+ fn:) to restrict the search to a given type.
+
+ Accepted types are: fn, mod,
+ struct, enum,
+ trait, typedef (or
+ tdef).
+
+ Search functions by type signature (e.g.
+ vec -> usize)
+
pub struct X509StoreContext {
+ // some fields omitted
+}impl X509StoreContextfn new(ctx: *mut X509_STORE_CTX) -> X509StoreContextfn get_error(&self) -> Option<X509ValidationError>fn get_current_cert<'a>(&'a self) -> Option<X509<'a>>
+ Prefix searches with a type followed by a colon (e.g.
+ fn:) to restrict the search to a given type.
+
+ Accepted types are: fn, mod,
+ struct, enum,
+ trait, typedef (or
+ tdef).
+
+ Search functions by type signature (e.g.
+ vec -> usize)
+