Struct RecipeRegistry 

pub struct RecipeRegistry {
    recipes: Vec<UntypedRecipeRef>,
    by_key: FxHashMap<Identifier, usize>,
    by_type: FxHashMap<Identifier, Vec<usize>>,
    allows_registering: bool,
}

Central storage for recipes of every registered concrete type.

Fields

recipes: Vec<UntypedRecipeRef>

by_key: FxHashMap<Identifier, usize>

by_type: FxHashMap<Identifier, Vec<usize>>

allows_registering: bool

Implementations

impl RecipeRegistry

pub fn new() -> Self

pub fn register<D: RecipeMatches<I> + DowncastType, I: RecipeInput>( &mut self, recipe: &'static Recipe<D, I>, )

Registers a concrete static recipe.

pub fn replace<D: RecipeMatches<I> + DowncastType, I: RecipeInput>( &mut self, recipe: &'static Recipe<D, I>, ) -> Option<UntypedRecipeRef>

Replaces an entry with the same persistent key before freeze.

pub fn freeze(&mut self, recipe_types: &RecipeTypeRegistry)

Freezes and sorts recipe lookup order by full identifier, matching Vanilla’s sorted resource loading before RecipeMap construction.

pub fn by_key(&self, key: &Identifier) -> Option<UntypedRecipeRef>

pub fn iter(&self) -> impl Iterator<Item = UntypedRecipeRef> + '_

pub fn by_type<D: RecipeMatches<I> + DowncastType, I: RecipeInput>( &self, recipe_type: &'static RecipeType<D, I>, ) -> TypedRecipeSet<'_, D, I>

pub fn matching<'registry, D: RecipeMatches<I> + DowncastType, I: RecipeInput>( &'registry self, recipe_type: &'static RecipeType<D, I>, input: &'registry I, ) -> impl Iterator<Item = TypedRecipeRef<D, I>> + 'registry

Iterates every matching recipe in deterministic key order.

pub fn find_match<D: RecipeMatches<I> + DowncastType, I: RecipeInput>( &self, recipe_type: &'static RecipeType<D, I>, input: &I, ) -> Option<TypedRecipeRef<D, I>>

Finds the first matching recipe in deterministic registry order.

pub const fn len(&self) -> usize

pub const fn is_empty(&self) -> bool

Trait Implementations

impl Default for RecipeRegistry

fn default() -> Self

Returns the “default value” for a type.