pub struct TypeId { /* private fields */ }
A TypeId represents a globally unique identifier for a type.
Each TypeId is an opaque object which does not allow inspection of what’s inside but does allow basic operations such as cloning, comparison, printing, and showing.
A TypeId is currently only available for types which ascribe to 'static, but this limitation may be removed in the future.
While TypeId implements Hash, PartialOrd, and Ord, it is worth noting that the hashes and ordering will vary between Rust releases. Beware of relying on them inside of your code!
Like other Rust-representation types, TypeId’s size and layout are unstable. In particular, this means that you cannot rely on the size and layout of TypeId remaining the same between Rust releases; they are subject to change without prior notice between Rust releases.
You might think that subtyping is impossible between two static types, but this is false; there exists a static type with a static subtype. To wit, fn(&str), which is short for for<'any> fn(&'any str), and fn(&'static str), are two distinct, static types, and yet, fn(&str) is a subtype of fn(&'static str), since any value of type fn(&str) can be used where a value of type fn(&'static str) is needed.
This means that abstractions around TypeId, despite its 'static bound on arguments, still need to worry about unnecessary and improper variance: it is advisable to strive for invariance first. The usability impact will be negligible, while the reduction in the risk of unsoundness will be most welcome.
Suppose SubType is a subtype of SuperType, that is, a value of type SubType can be used wherever a value of type SuperType is expected. Suppose also that CoVar<T> is a generic type, which is covariant over T (like many other types, including PhantomData<T> and Vec<T>).
Then, by covariance, CoVar<SubType> is a subtype of CoVar<SuperType>, that is, a value of type CoVar<SubType> can be used wherever a value of type CoVar<SuperType> is expected.
Then if CoVar<SuperType> relies on TypeId::of::<SuperType>() to uphold any invariants, those invariants may be broken because a value of type CoVar<SuperType> can be created without going through any of its methods, like so:
type SubType = fn(&()); type SuperType = fn(&'static ()); type CoVar<T> = Vec<T>; // imagine something more complicated let sub: CoVar<SubType> = CoVar::new(); // we have a `CoVar<SuperType>` instance without // *ever* having called `CoVar::<SuperType>::new()`! let fake_super: CoVar<SuperType> = sub;
The following is an example program that tries to use TypeId::of to implement a generic type Unique<T> that guarantees unique instances for each Unique<T>, that is, and for each type T there can be at most one value of type Unique<T> at any time.
mod unique {
use std::any::TypeId;
use std::collections::BTreeSet;
use std::marker::PhantomData;
use std::sync::Mutex;
static ID_SET: Mutex<BTreeSet<TypeId>> = Mutex::new(BTreeSet::new());
// TypeId has only covariant uses, which makes Unique covariant over TypeAsId 🚨
#[derive(Debug, PartialEq)]
pub struct Unique<TypeAsId: 'static>(
// private field prevents creation without `new` outside this module
PhantomData<TypeAsId>,
);
impl<TypeAsId: 'static> Unique<TypeAsId> {
pub fn new() -> Option<Self> {
let mut set = ID_SET.lock().unwrap();
(set.insert(TypeId::of::<TypeAsId>())).then(|| Self(PhantomData))
}
}
impl<TypeAsId: 'static> Drop for Unique<TypeAsId> {
fn drop(&mut self) {
let mut set = ID_SET.lock().unwrap();
(!set.remove(&TypeId::of::<TypeAsId>())).then(|| panic!("duplicity detected"));
}
}
}
use unique::Unique;
// `OtherRing` is a subtype of `TheOneRing`. Both are 'static, and thus have a TypeId.
type TheOneRing = fn(&'static ());
type OtherRing = fn(&());
fn main() {
let the_one_ring: Unique<TheOneRing> = Unique::new().unwrap();
assert_eq!(Unique::<TheOneRing>::new(), None);
let other_ring: Unique<OtherRing> = Unique::new().unwrap();
// Use that `Unique<OtherRing>` is a subtype of `Unique<TheOneRing>` 🚨
let fake_one_ring: Unique<TheOneRing> = other_ring;
assert_eq!(fake_one_ring, the_one_ring);
std::mem::forget(fake_one_ring);
}impl TypeId
pub const fn of<T>() -> TypeIdwhere
T: 'static + ?Sized,Returns the TypeId of the generic type parameter.
use std::any::{Any, TypeId};
fn is_string<T: ?Sized + Any>(_s: &T) -> bool {
TypeId::of::<String>() == TypeId::of::<T>()
}
assert_eq!(is_string(&0), false);
assert_eq!(is_string(&"cookie monster".to_string()), true);impl Clone for TypeId
fn clone(&self) -> TypeId
fn clone_from(&mut self, source: &Self)
source. Read more
impl Debug for TypeId
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
impl Hash for TypeId
fn hash<H>(&self, state: &mut H)where
H: Hasher,fn hash_slice<H>(data: &[Self], state: &mut H)where
H: Hasher,
Self: Sized,impl Ord for TypeId
fn cmp(&self, other: &TypeId) -> Ordering
fn max(self, other: Self) -> Selfwhere
Self: Sized,fn min(self, other: Self) -> Selfwhere
Self: Sized,fn clamp(self, min: Self, max: Self) -> Selfwhere
Self: Sized,impl PartialEq for TypeId
fn eq(&self, other: &TypeId) -> bool
self and other values to be equal, and is used by ==.fn ne(&self, other: &Rhs) -> bool
!=. The default implementation is almost always sufficient, and should not be overridden without very good reason.impl PartialOrd for TypeId
fn partial_cmp(&self, other: &TypeId) -> Option<Ordering>
fn lt(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
fn gt(&self, other: &Rhs) -> bool
fn ge(&self, other: &Rhs) -> bool
impl Copy for TypeId
impl Eq for TypeId
impl Send for TypeId
impl Sync for TypeId
impl Freeze for TypeId
impl RefUnwindSafe for TypeId
impl Unpin for TypeId
impl UnwindSafe for TypeId
impl<T> Any for Twhere
T: 'static + ?Sized,impl<T> Borrow<T> for Twhere
T: ?Sized,impl<T> BorrowMut<T> for Twhere
T: ?Sized,impl<T> CloneToUninit for Twhere
T: Clone,unsafe fn clone_to_uninit(&self, dest: *mut u8)
clone_to_uninit #126799)
impl<T> From<T> for T
fn from(t: T) -> T
Returns the argument unchanged.
impl<T, U> Into<U> for Twhere
U: From<T>,fn into(self) -> U
Calls U::from(self).
That is, this conversion is whatever the implementation of From<T> for U chooses to do.
impl<T> ToOwned for Twhere
T: Clone,type Owned = T
fn to_owned(&self) -> T
fn clone_into(&self, target: &mut T)
impl<T, U> TryFrom<U> for Twhere
U: Into<T>,type Error = Infallible
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
impl<T, U> TryInto<U> for Twhere
U: TryFrom<T>,
© 2010 The Rust Project Developers
Licensed under the Apache License, Version 2.0 or the MIT license, at your option.
https://doc.rust-lang.org/std/any/struct.TypeId.html