Trait Decodable

pub trait Decodable<D: Decoder>: Sized {
    // Required method
    fn decode(d: &mut D) -> Self;
}

Trait for types that can be deserialized

This can be implemented using the Decodable, TyDecodable and MetadataDecodable macros.

• Decodable should be used in crates that don’t depend on rustc_middle.
• MetadataDecodable is used in rustc_metadata for types that contain rustc_metadata::rmeta::Lazy.
• TyDecodable should be used for types that are only serialized in crate metadata or the incremental cache. This is most types in rustc_middle.

Required Methods

fn decode(d: &mut D) -> Self

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.

Implementations on Foreign Types

impl<'a> Decodable<MemDecoder<'a>> for Vec<u8>

fn decode(d: &mut MemDecoder<'a>) -> Self

impl<D: Decoder> Decodable<D> for Cow<'_, str>

fn decode(d: &mut D) -> Cow<'static, str>

impl<D: Decoder> Decodable<D> for bool

fn decode(d: &mut D) -> bool

impl<D: Decoder> Decodable<D> for char

fn decode(d: &mut D) -> char

impl<D: Decoder> Decodable<D> for i8

fn decode(d: &mut D) -> i8

impl<D: Decoder> Decodable<D> for i16

fn decode(d: &mut D) -> i16

impl<D: Decoder> Decodable<D> for i32

fn decode(d: &mut D) -> i32

impl<D: Decoder> Decodable<D> for i64

fn decode(d: &mut D) -> i64

impl<D: Decoder> Decodable<D> for i128

fn decode(d: &mut D) -> i128

impl<D: Decoder> Decodable<D> for isize

fn decode(d: &mut D) -> isize

impl<D: Decoder> Decodable<D> for !

fn decode(_d: &mut D) -> !

impl<D: Decoder> Decodable<D> for u8

fn decode(d: &mut D) -> u8

impl<D: Decoder> Decodable<D> for u16

fn decode(d: &mut D) -> u16

impl<D: Decoder> Decodable<D> for u32

fn decode(d: &mut D) -> u32

impl<D: Decoder> Decodable<D> for u64

fn decode(d: &mut D) -> u64

impl<D: Decoder> Decodable<D> for u128

fn decode(d: &mut D) -> u128

impl<D: Decoder> Decodable<D> for ()

fn decode(_: &mut D)

impl<D: Decoder> Decodable<D> for usize

fn decode(d: &mut D) -> usize

impl<D: Decoder> Decodable<D> for String

fn decode(d: &mut D) -> String

impl<D: Decoder> Decodable<D> for NonZero<u32>

fn decode(d: &mut D) -> Self

impl<D: Decoder> Decodable<D> for PathBuf

fn decode(d: &mut D) -> PathBuf

impl<D: Decoder, A: Array<Item: Decodable<D>>> Decodable<D> for SmallVec<A>

fn decode(d: &mut D) -> SmallVec<A>

impl<D: Decoder, K, V> Decodable<D> for BTreeMap<K, V>

where K: Decodable<D> + PartialEq + Ord, V: Decodable<D>,

fn decode(d: &mut D) -> BTreeMap<K, V>

impl<D: Decoder, K, V, S> Decodable<D> for HashMap<K, V, S>

where K: Decodable<D> + Hash + Eq, V: Decodable<D>, S: BuildHasher + Default,

fn decode(d: &mut D) -> HashMap<K, V, S>

impl<D: Decoder, K, V, S> Decodable<D> for IndexMap<K, V, S>

where K: Decodable<D> + Hash + Eq, V: Decodable<D>, S: BuildHasher + Default,

fn decode(d: &mut D) -> IndexMap<K, V, S>

impl<D: Decoder, T0: Decodable<D>, T1: Decodable<D>, T2: Decodable<D>, T3: Decodable<D>, T4: Decodable<D>, T5: Decodable<D>, T6: Decodable<D>, T7: Decodable<D>, T8: Decodable<D>, T9: Decodable<D>, T10: Decodable<D>, T11: Decodable<D>> Decodable<D> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11)

fn decode(d: &mut D) -> (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11)

impl<D: Decoder, T1: Decodable<D>, T2: Decodable<D>> Decodable<D> for Result<T1, T2>

fn decode(d: &mut D) -> Result<T1, T2>

impl<D: Decoder, T1: Decodable<D>, T2: Decodable<D>, T3: Decodable<D>, T4: Decodable<D>, T5: Decodable<D>, T6: Decodable<D>, T7: Decodable<D>, T8: Decodable<D>, T9: Decodable<D>, T10: Decodable<D>, T11: Decodable<D>> Decodable<D> for (T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11)

fn decode(d: &mut D) -> (T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11)

impl<D: Decoder, T2: Decodable<D>, T3: Decodable<D>, T4: Decodable<D>, T5: Decodable<D>, T6: Decodable<D>, T7: Decodable<D>, T8: Decodable<D>, T9: Decodable<D>, T10: Decodable<D>, T11: Decodable<D>> Decodable<D> for (T2, T3, T4, T5, T6, T7, T8, T9, T10, T11)

fn decode(d: &mut D) -> (T2, T3, T4, T5, T6, T7, T8, T9, T10, T11)

impl<D: Decoder, T3: Decodable<D>, T4: Decodable<D>, T5: Decodable<D>, T6: Decodable<D>, T7: Decodable<D>, T8: Decodable<D>, T9: Decodable<D>, T10: Decodable<D>, T11: Decodable<D>> Decodable<D> for (T3, T4, T5, T6, T7, T8, T9, T10, T11)

fn decode(d: &mut D) -> (T3, T4, T5, T6, T7, T8, T9, T10, T11)

impl<D: Decoder, T4: Decodable<D>, T5: Decodable<D>, T6: Decodable<D>, T7: Decodable<D>, T8: Decodable<D>, T9: Decodable<D>, T10: Decodable<D>, T11: Decodable<D>> Decodable<D> for (T4, T5, T6, T7, T8, T9, T10, T11)

fn decode(d: &mut D) -> (T4, T5, T6, T7, T8, T9, T10, T11)

impl<D: Decoder, T5: Decodable<D>, T6: Decodable<D>, T7: Decodable<D>, T8: Decodable<D>, T9: Decodable<D>, T10: Decodable<D>, T11: Decodable<D>> Decodable<D> for (T5, T6, T7, T8, T9, T10, T11)

fn decode(d: &mut D) -> (T5, T6, T7, T8, T9, T10, T11)

impl<D: Decoder, T6: Decodable<D>, T7: Decodable<D>, T8: Decodable<D>, T9: Decodable<D>, T10: Decodable<D>, T11: Decodable<D>> Decodable<D> for (T6, T7, T8, T9, T10, T11)

fn decode(d: &mut D) -> (T6, T7, T8, T9, T10, T11)

impl<D: Decoder, T7: Decodable<D>, T8: Decodable<D>, T9: Decodable<D>, T10: Decodable<D>, T11: Decodable<D>> Decodable<D> for (T7, T8, T9, T10, T11)

fn decode(d: &mut D) -> (T7, T8, T9, T10, T11)

impl<D: Decoder, T8: Decodable<D>, T9: Decodable<D>, T10: Decodable<D>, T11: Decodable<D>> Decodable<D> for (T8, T9, T10, T11)

fn decode(d: &mut D) -> (T8, T9, T10, T11)

impl<D: Decoder, T9: Decodable<D>, T10: Decodable<D>, T11: Decodable<D>> Decodable<D> for (T9, T10, T11)

fn decode(d: &mut D) -> (T9, T10, T11)

impl<D: Decoder, T10: Decodable<D>, T11: Decodable<D>> Decodable<D> for (T10, T11)

fn decode(d: &mut D) -> (T10, T11)

impl<D: Decoder, T11: Decodable<D>> Decodable<D> for (T11,)

fn decode(d: &mut D) -> (T11,)

impl<D: Decoder, T> Decodable<D> for BTreeSet<T>

where T: Decodable<D> + PartialEq + Ord,

fn decode(d: &mut D) -> BTreeSet<T>

impl<D: Decoder, T> Decodable<D> for PhantomData<T>

fn decode(_: &mut D) -> PhantomData<T>

impl<D: Decoder, T, S> Decodable<D> for HashSet<T, S>

where T: Decodable<D> + Hash + Eq, S: BuildHasher + Default,

fn decode(d: &mut D) -> HashSet<T, S>

impl<D: Decoder, T, S> Decodable<D> for IndexSet<T, S>

where T: Decodable<D> + Hash + Eq, S: BuildHasher + Default,

fn decode(d: &mut D) -> IndexSet<T, S>

impl<D: Decoder, T: Decodable<D> + ToOwned> Decodable<D> for Cow<'static, [T]>

where [T]: ToOwned<Owned = Vec<T>>,

fn decode(d: &mut D) -> Cow<'static, [T]>

impl<D: Decoder, T: Decodable<D> + Copy> Decodable<D> for Cell<T>

fn decode(d: &mut D) -> Cell<T>

impl<D: Decoder, T: Decodable<D>> Decodable<D> for Option<T>

fn decode(d: &mut D) -> Option<T>

impl<D: Decoder, T: Decodable<D>> Decodable<D> for Box<[T]>

fn decode(d: &mut D) -> Box<[T]>

impl<D: Decoder, T: Decodable<D>> Decodable<D> for Box<T>

fn decode(d: &mut D) -> Box<T>

impl<D: Decoder, T: Decodable<D>> Decodable<D> for VecDeque<T>

fn decode(d: &mut D) -> VecDeque<T>

impl<D: Decoder, T: Decodable<D>> Decodable<D> for Rc<[T]>

fn decode(d: &mut D) -> Rc<[T]>

impl<D: Decoder, T: Decodable<D>> Decodable<D> for Rc<T>

fn decode(d: &mut D) -> Rc<T>

impl<D: Decoder, T: Decodable<D>> Decodable<D> for Arc<[T]>

fn decode(d: &mut D) -> Arc<[T]>

impl<D: Decoder, T: Decodable<D>> Decodable<D> for Arc<T>

fn decode(d: &mut D) -> Arc<T>

impl<D: Decoder, T: Decodable<D>> Decodable<D> for Vec<T>

default fn decode(d: &mut D) -> Vec<T>

impl<D: Decoder, T: Decodable<D>> Decodable<D> for RefCell<T>

fn decode(d: &mut D) -> RefCell<T>

impl<D: Decoder, T: Decodable<D>> Decodable<D> for ThinVec<T>

fn decode(d: &mut D) -> ThinVec<T>

impl<D: Decoder, const N: usize> Decodable<D> for [u8; N]

fn decode(d: &mut D) -> [u8; N]

Implementors

impl<'a> Decodable<MemDecoder<'a>> for IntEncodedWithFixedSize