```
#[repr(transparent)]pub struct KeyId<A, K>(_, _)
where
K: ?Sized;
```

## Expand description

A key algorithm and key name delimited by a colon.

## Implementations§

source§### impl<A, K> KeyId<A, K>where
K: ?Sized,

### impl<A, K> KeyId<A, K>where K: ?Sized,

source#### pub fn parse(s: impl AsRef<str>) -> Result<OwnedKeyId<A, K>, Error>

Available on **crate feature **`events`

only.

#### pub fn parse(s: impl AsRef<str>) -> Result<OwnedKeyId<A, K>, Error>

**crate feature**only.

`events`

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.

source#### pub fn parse_box(
s: impl AsRef<str> + Into<Box<str, Global>>
) -> Result<Box<KeyId<A, K>, Global>, Error>

Available on **crate feature **`events`

only.

#### pub fn parse_box( s: impl AsRef<str> + Into<Box<str, Global>> ) -> Result<Box<KeyId<A, K>, Global>, Error>

**crate feature**only.

`events`

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, K> KeyId<A, K>where
K: ?Sized,

### impl<A, K> KeyId<A, K>where K: ?Sized,

source#### pub fn from_parts(algorithm: A, key_name: &K) -> OwnedKeyId<A, K>where
A: AsRef<str>,
K: AsRef<str>,

Available on **crate feature **`events`

only.

#### pub fn from_parts(algorithm: A, key_name: &K) -> OwnedKeyId<A, K>where A: AsRef<str>, K: AsRef<str>,

**crate feature**only.

`events`

Creates a new `KeyId`

from an algorithm and key name.

## Trait Implementations§

source§### impl<'de, A, K> Deserialize<'de> for Box<KeyId<A, K>, Global>where
K: ?Sized,

### impl<'de, A, K> Deserialize<'de> for Box<KeyId<A, K>, Global>where K: ?Sized,

source§#### fn deserialize<D>(
deserializer: D
) -> Result<Box<KeyId<A, K>, Global>, <D as Deserializer<'de>>::Error>where
D: Deserializer<'de>,

#### fn deserialize<D>( deserializer: D ) -> Result<Box<KeyId<A, K>, Global>, <D as Deserializer<'de>>::Error>where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more

source§### impl<A, K> From<&KeyId<A, K>> for OwnedKeyId<A, K>where
K: ?Sized,

### impl<A, K> From<&KeyId<A, K>> for OwnedKeyId<A, K>where K: ?Sized,

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, K> PartialEq<&KeyId<A, K>> for OwnedKeyId<A, K>where
K: ?Sized,

### impl<A, K> PartialEq<&KeyId<A, K>> for OwnedKeyId<A, K>where K: ?Sized,

source§### impl<A, K> PartialEq<&str> for KeyId<A, K>where
K: ?Sized,

### impl<A, K> PartialEq<&str> for KeyId<A, K>where K: ?Sized,

source§### impl<A, K> PartialEq<Box<KeyId<A, K>, Global>> for &KeyId<A, K>where
K: ?Sized,

### impl<A, K> PartialEq<Box<KeyId<A, K>, Global>> for &KeyId<A, K>where K: ?Sized,

source§### impl<A, K> PartialEq<Box<KeyId<A, K>, Global>> for KeyId<A, K>where
K: ?Sized,

### impl<A, K> PartialEq<Box<KeyId<A, K>, Global>> for KeyId<A, K>where K: ?Sized,

source§### impl<A, K> PartialEq<KeyId<A, K>> for &strwhere
K: ?Sized,

### impl<A, K> PartialEq<KeyId<A, K>> for &strwhere K: ?Sized,

source§### impl<A, K> PartialEq<KeyId<A, K>> for KeyId<A, K>where
K: ?Sized,

### impl<A, K> PartialEq<KeyId<A, K>> for KeyId<A, K>where K: ?Sized,

source§### impl<A, K> PartialEq<KeyId<A, K>> for OwnedKeyId<A, K>where
K: ?Sized,

### impl<A, K> PartialEq<KeyId<A, K>> for OwnedKeyId<A, K>where K: ?Sized,

source§### impl<A, K> PartialEq<KeyId<A, K>> for strwhere
K: ?Sized,

### impl<A, K> PartialEq<KeyId<A, K>> for strwhere K: ?Sized,

source§### impl<A, K> PartialEq<OwnedKeyId<A, K>> for &KeyId<A, K>where
K: ?Sized,

### impl<A, K> PartialEq<OwnedKeyId<A, K>> for &KeyId<A, K>where K: ?Sized,

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, K> PartialEq<OwnedKeyId<A, K>> for KeyId<A, K>where
K: ?Sized,

### impl<A, K> PartialEq<OwnedKeyId<A, K>> for KeyId<A, K>where K: ?Sized,

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, K> PartialEq<String> for KeyId<A, K>where
K: ?Sized,

### impl<A, K> PartialEq<String> for KeyId<A, K>where K: ?Sized,

source§### impl<A, K> PartialOrd<KeyId<A, K>> for KeyId<A, K>where
K: ?Sized,

### impl<A, K> PartialOrd<KeyId<A, K>> for KeyId<A, K>where K: ?Sized,

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, K> Serialize for KeyId<A, K>where
K: ?Sized,

### impl<A, K> Serialize for KeyId<A, K>where K: ?Sized,

source§#### fn serialize<S>(
&self,
serializer: S
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>where
S: Serializer,

#### fn serialize<S>( &self, serializer: S ) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>where S: Serializer,

Serialize this value into the given Serde serializer. Read more

source§### impl<A, K> ToOwned for KeyId<A, K>where
K: ?Sized,

### impl<A, K> ToOwned for KeyId<A, K>where K: ?Sized,

§#### type Owned = OwnedKeyId<A, K>

#### type Owned = OwnedKeyId<A, K>

The resulting type after obtaining ownership.

source§#### fn to_owned(&self) -> <KeyId<A, K> as ToOwned>::Owned

#### fn to_owned(&self) -> <KeyId<A, K> as ToOwned>::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, K> Eq for KeyId<A, K>where K: ?Sized,

## Auto Trait Implementations§

### impl<A, K: ?Sized> RefUnwindSafe for KeyId<A, K>where A: RefUnwindSafe, K: RefUnwindSafe,

### impl<A, K: ?Sized> Send for KeyId<A, K>where A: Send, K: Send,

### impl<A, K> !Sized for KeyId<A, K>

### impl<A, K: ?Sized> Sync for KeyId<A, K>where A: Sync, K: Sync,

### impl<A, K: ?Sized> Unpin for KeyId<A, K>where A: Unpin, K: Unpin,

### impl<A, K: ?Sized> UnwindSafe for KeyId<A, K>where A: UnwindSafe, K: UnwindSafe,

## 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

§### impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,

### impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

§#### fn equivalent(&self, key: &K) -> bool

#### fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more

§### impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,

### impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

§#### fn equivalent(&self, key: &K) -> bool

#### fn equivalent(&self, key: &K) -> bool

Compare self to

`key`

and return `true`

if they are equal.source§### impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,

### impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

source§#### fn equivalent(&self, key: &K) -> bool

#### fn equivalent(&self, key: &K) -> bool

Compare self to

`key`

and return `true`

if they are equal.