Struct ruma_common::KeyId
source · pub struct KeyId<A: KeyAlgorithm, K: KeyName + ?Sized>(/* private fields */);
Expand description
A key algorithm and key name delimited by a colon.
Implementations§
source§impl<A: KeyAlgorithm, K: KeyName + ?Sized> KeyId<A, K>
impl<A: KeyAlgorithm, K: KeyName + ?Sized> KeyId<A, K>
sourcepub fn parse(s: impl AsRef<str>) -> Result<OwnedKeyId<A, K>, IdParseError>
pub fn parse(s: impl AsRef<str>) -> Result<OwnedKeyId<A, K>, IdParseError>
Try parsing a &str
into an OwnedKeyId
.
The same can also be done using FromStr
, TryFrom
or TryInto
.
This function is simply more constrained and thus useful in generic contexts.
sourcepub fn parse_box(
s: impl AsRef<str> + Into<Box<str>>,
) -> Result<Box<Self>, IdParseError>
pub fn parse_box( s: impl AsRef<str> + Into<Box<str>>, ) -> Result<Box<Self>, IdParseError>
Try parsing a &str
into a Box<KeyId>
.
The same can also be done using FromStr
, TryFrom
or TryInto
.
This function is simply more constrained and thus useful in generic contexts.
source§impl<A: KeyAlgorithm, K: KeyName + ?Sized> KeyId<A, K>
impl<A: KeyAlgorithm, K: KeyName + ?Sized> KeyId<A, K>
sourcepub fn from_parts(algorithm: A, key_name: &K) -> OwnedKeyId<A, K>
pub fn from_parts(algorithm: A, key_name: &K) -> OwnedKeyId<A, K>
Creates a new KeyId
from an algorithm and key name.
Trait Implementations§
source§impl<A: KeyAlgorithm, K: KeyName + ?Sized> AsRef<KeyId<A, K>> for OwnedKeyId<A, K>
impl<A: KeyAlgorithm, K: KeyName + ?Sized> AsRef<KeyId<A, K>> for OwnedKeyId<A, K>
source§impl<A: KeyAlgorithm, K: KeyName + ?Sized> Borrow<KeyId<A, K>> for OwnedKeyId<A, K>
impl<A: KeyAlgorithm, K: KeyName + ?Sized> Borrow<KeyId<A, K>> for OwnedKeyId<A, K>
source§impl<'de, A: KeyAlgorithm, K: KeyName + ?Sized> Deserialize<'de> for Box<KeyId<A, K>>
impl<'de, A: KeyAlgorithm, K: KeyName + ?Sized> Deserialize<'de> for Box<KeyId<A, K>>
source§fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>where
D: Deserializer<'de>,
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>where
D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl<A: KeyAlgorithm, K: KeyName + ?Sized> From<&KeyId<A, K>> for OwnedKeyId<A, K>
impl<A: KeyAlgorithm, K: KeyName + ?Sized> From<&KeyId<A, K>> for OwnedKeyId<A, K>
source§fn from(id: &KeyId<A, K>) -> OwnedKeyId<A, K>
fn from(id: &KeyId<A, K>) -> OwnedKeyId<A, K>
Converts to this type from the input type.
source§impl<A: KeyAlgorithm, K: KeyName + ?Sized> From<OwnedKeyId<A, K>> for Box<KeyId<A, K>>
impl<A: KeyAlgorithm, K: KeyName + ?Sized> From<OwnedKeyId<A, K>> for Box<KeyId<A, K>>
source§impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<&KeyId<A, K>> for Box<KeyId<A, K>>
impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<&KeyId<A, K>> for Box<KeyId<A, K>>
source§impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<&KeyId<A, K>> for OwnedKeyId<A, K>
impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<&KeyId<A, K>> for OwnedKeyId<A, K>
source§impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<&str> for Box<KeyId<A, K>>
impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<&str> for Box<KeyId<A, K>>
source§impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<&str> for KeyId<A, K>
impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<&str> for KeyId<A, K>
source§impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<Box<KeyId<A, K>>> for &KeyId<A, K>
impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<Box<KeyId<A, K>>> for &KeyId<A, K>
source§impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<Box<KeyId<A, K>>> for KeyId<A, K>
impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<Box<KeyId<A, K>>> for KeyId<A, K>
source§impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<KeyId<A, K>> for &str
impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<KeyId<A, K>> for &str
source§impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<KeyId<A, K>> for Box<KeyId<A, K>>
impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<KeyId<A, K>> for Box<KeyId<A, K>>
source§impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<KeyId<A, K>> for OwnedKeyId<A, K>
impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<KeyId<A, K>> for OwnedKeyId<A, K>
source§impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<KeyId<A, K>> for String
impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<KeyId<A, K>> for String
source§impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<KeyId<A, K>> for str
impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<KeyId<A, K>> for str
source§impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<OwnedKeyId<A, K>> for &KeyId<A, K>
impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<OwnedKeyId<A, K>> for &KeyId<A, K>
source§fn eq(&self, other: &OwnedKeyId<A, K>) -> bool
fn eq(&self, other: &OwnedKeyId<A, K>) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.source§impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<OwnedKeyId<A, K>> for Box<KeyId<A, K>>
impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<OwnedKeyId<A, K>> for Box<KeyId<A, K>>
source§fn eq(&self, other: &OwnedKeyId<A, K>) -> bool
fn eq(&self, other: &OwnedKeyId<A, K>) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.source§impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<OwnedKeyId<A, K>> for KeyId<A, K>
impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<OwnedKeyId<A, K>> for KeyId<A, K>
source§fn eq(&self, other: &OwnedKeyId<A, K>) -> bool
fn eq(&self, other: &OwnedKeyId<A, K>) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.source§impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<String> for Box<KeyId<A, K>>
impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<String> for Box<KeyId<A, K>>
source§impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<String> for KeyId<A, K>
impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq<String> for KeyId<A, K>
source§impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq for KeyId<A, K>
impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialEq for KeyId<A, K>
source§impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialOrd for KeyId<A, K>
impl<A: KeyAlgorithm, K: KeyName + ?Sized> PartialOrd for KeyId<A, K>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moresource§impl<A: KeyAlgorithm, K: KeyName + ?Sized> ToOwned for KeyId<A, K>
impl<A: KeyAlgorithm, K: KeyName + ?Sized> ToOwned for KeyId<A, K>
§type Owned = OwnedKeyId<A, K>
type Owned = OwnedKeyId<A, K>
The resulting type after obtaining ownership.
source§fn to_owned(&self) -> Self::Owned
fn to_owned(&self) -> Self::Owned
Creates owned data from borrowed data, usually by cloning. Read more
1.63.0 · source§fn clone_into(&self, target: &mut Self::Owned)
fn clone_into(&self, target: &mut Self::Owned)
Uses borrowed data to replace owned data, usually by cloning. Read more
impl<A: KeyAlgorithm, K: KeyName + ?Sized> Eq for KeyId<A, K>
Auto Trait Implementations§
impl<A, K> Freeze for KeyId<A, K>where
K: ?Sized,
impl<A, K> RefUnwindSafe for KeyId<A, K>
impl<A, K> Send for KeyId<A, K>
impl<A, K> !Sized for KeyId<A, K>
impl<A, K> Sync for KeyId<A, K>
impl<A, K> Unpin for KeyId<A, K>
impl<A, K> UnwindSafe for KeyId<A, K>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.