Struct ModuleGraphHash 

pub struct ModuleGraphHash {
    pub bytes: [u8; 32],
}

32-byte BLAKE3 hash. Same shape as the lockfile / AST graph hashes; kept separate so the type system distinguishes which graph kind a hash refers to.

Fields

bytes: [u8; 32]

Trait Implementations

impl Archive for ModuleGraphHash

where [u8; 32]: Archive,

const COPY_OPTIMIZATION: CopyOptimization<Self>

An optimization flag that allows the bytes of this type to be copied directly to a writer instead of calling serialize.

type Archived = ArchivedModuleGraphHash

The archived representation of this type.

type Resolver = ModuleGraphHashResolver

The resolver for this type. It must contain all the additional information from serializing needed to make the archived type from the normal type.

fn resolve(&self, resolver: Self::Resolver, out: Place<Self::Archived>)

Creates the archived version of this value at the given position and writes it to the given output.

impl Clone for ModuleGraphHash

fn clone(&self) -> ModuleGraphHash

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for ModuleGraphHash

impl Debug for ModuleGraphHash

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for ModuleGraphHash

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<__D: Fallible + ?Sized> Deserialize<ModuleGraphHash, __D> for Archived<ModuleGraphHash>

where [u8; 32]: Archive, <[u8; 32] as Archive>::Archived: Deserialize<[u8; 32], __D>,

fn deserialize( &self, deserializer: &mut __D, ) -> Result<ModuleGraphHash, <__D as Fallible>::Error>

Deserializes using the given deserializer

impl Eq for ModuleGraphHash

impl Hash for ModuleGraphHash

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for ModuleGraphHash

fn eq(&self, other: &ModuleGraphHash) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl Serialize for ModuleGraphHash

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<__S: Fallible + ?Sized> Serialize<__S> for ModuleGraphHash

where [u8; 32]: Serialize<__S>,

fn serialize( &self, serializer: &mut __S, ) -> Result<<Self as Archive>::Resolver, <__S as Fallible>::Error>

Writes the dependencies for the object and returns a resolver that can create the archived type.

impl StructuralPartialEq for ModuleGraphHash

impl TataraDomain for ModuleGraphHash

const KEYWORD: &'static str = "defmodule-graph-hash"

The Lisp keyword (e.g., "defmonitor").

fn compile_from_args(args: &[Sexp]) -> Result<Self>

Parse the argument list (everything after the keyword) into Self.

fn compile_from_sexp(form: &Sexp) -> Result<Self, LispError>

Parse a complete form; validates the head symbol matches KEYWORD.